Scheduling trajectories on a planar surface with moving obstacles

Informatica

Volumn 17, Issue 1, 2006, Pages 95-110

  Stefanakis, Emmanuel ^a,b  

^a FRAUNHOFER IAIS   (Germany)

^b HAROKOPIO UNIVERSITY   (Greece)

Author keywords

Graphs; Moving objects; Optimum paths; Spatio temporal modeling; Trajectory schedule

Indexed keywords

EID: 33645684762     PISSN: 08684952     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. Church, R.L., S.R. Loban and K. Lombard (1992). An interface for exploring spatial alternatives for a corridor location problems. Computers and Geosciences, 18, 1095-1105.
2. Douglas, D.H. (1994a). Least-cost path in GIS using an accumulated cost surface and slopelines. Cartographica, 31(3), 37-51.
3. Douglas, D.H. ( 1994b). The parsimonious path based on the implicit geometry in gridded data and on a proper slope line generated from it. In Proceedings of the 6th International Symposium on Spatial Data Handling. Edinburgh, Scotland, pp. 1133-1140.
4. Ford, L.R., and D.R. Fulkerson (1962). Flows in Networks. Princeton Univ. Press.
5. Gibbons, A. (1985). Algorithmic Graph Theory. Cambridge University Press.
6. Goodchild, M.F. (1977). An evaluation of lattice solutions to the problem of corridor location. Environment and Planning A, 9, 727-738.
7. Johnson, D.B. (1977). Efficient algorithms for shortest paths in sparse networks. Journal of the Association of Computing Machinery, 24, 1-13.
8. Laurini, R., and D. Thompson (1992). Fundamentals of Spatial Information Systems. Academic Press Ltd.
9. Lindgren, E.S. (1967). Proposed solution for the minimum path problem. Harvard Papers in Theoretical Geography, Geography and the Properties of Surfaces Series, 4.
10. Mitchell, J.S.B., and C.H. Papadimitriou (1991). The weighted region problem: finding shortest paths through a weighted planar subdivision. Journal of the Association for Computing Machinery, 38, 18-73.
11. Rich, E., and K. Knight (1991). Artificial Intelligence. McGraw-Hill.
12. Russell, S.J., and P. Norvig (1995). Artificial Intelligence: A Modern Approach. Prentice Hall.
13. Sedgewick, R. (1990). Algorithms. Addison-Wesley.
14. Stefanakis, E., and M. Kavouras (1995). On the determination of the optimum path in space. In A. Frank and W. Kuhn (Eds.), Spatial Information Theory: A Theoretical Basis for GIS (COSIT 95). Springer-Verlag. pp. 241-257.
15. Stefanakis, E., and M. Kavouras (2002). Navigating in space under constraints. International Journal of Pure and Applied Mathematics (IJPAM), 1(1), 71-93.
16. Styliadis, A.D., P.G. Patias and N.C. Zestas (2003). 3-D Computer modeling with intra-component, geometric, quality and topological constraints. Informatica, 14(3), 375-392.
17. Van Bemmelen, J., W. Quak, M. Van Hekken and P. van Oosterom (1993). Vector vs. raster-based algorithms for cross country movement planning. In Proceedings of the AutoCarto 11. Minneapolis, pp. 304-317.
18. Warntz, W. (1961). Transatlantic flights and pressure patterns. The Geographical Review, 51, 187-212.
19. Worboys, M.F. (1995). GIS: A Computing Perspective. Taylor & Francis.