Adaptive and compact discretization for weighted region optimal path finding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2751, Issue , 2003, Pages 258-270

  Sun, Zheng ^a   Reif, John H ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISCRETE EVENT SIMULATION; GRAPH THEORY; LEARNING ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING;

ADAPTIVE DISCRETIZATION METHODS; DESTINATION POINTS; DISCRETIZATION SCHEME; EMPIRICAL METHOD; OPTIMAL PATH FINDINGS; PERFORMANCE AND SCALABILITIES; SEARCH ALGORITHMS; WEIGHTED REGIONS;

APPROXIMATION ALGORITHMS;

EID: 35248871553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45077-1_24     Document Type: Article

References (13)

1. Mitchell, J.S.B.: Geometric shortest paths and network optimization. In Sack, J.R., Urrutia, J., eds.: Handbook of Computational Geometry. Elsevier Science Publishers B.V. North-Holland, Amsterdam (2000) 633-701
2. Mitchell, J.S.B., Papadimitriou, C.H.: The weighted region problem: Finding shortest paths through a weighted planar subdivision. Journal of the ACM 38 (1991) 18-73
3. Mata, C., Mitchell, J.: A new algorithm for computing shortest paths in weighted planar subdivisions. In: Proceedings of the 13th Annual ACM Symposium on Computational Geometry. (1997) 264-273
4. Aleksandrov, L., Lanthier, M., Maheshwari, A., Sack, J.R.: An ε-approximation algorithm for weighted shortest paths on polyhedral surfaces. In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory. Volume 1432 of Lecture Notes in Computer Science. (1998) 11-22
5. Reif, J.H., Sun, Z.: An efficient approximation algorithm for weighted region shortest path problem. In: Proceedings of the 4th Workshop on Algorithmic Foundations of Robotics. (2000) 191-203
6. Aleksandrov, L., Maheshwari, A., Sack, J.R.: Approximation algorithms for geometric shortest path problems. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. (2000) 286-295
7. Sun, Z., Reif, J.H.: BUSHWHACK: An approximation algorithm for minimal paths through pseudo-Euclidean spaces. In: Proceedings of the 12th Annual International Symposium on Algorithms and Computation. Volume 2223 of Lecture Notes in Computer Science. (2001) 160-171
8. Helgason, R.V., Kennington, J., Stewart, B.: The one-to-one shortest-path problem: An empirical analysis with the two-tree dijkstra algorithm. Computational Optimization and Applications 1 (1993) 47-75
9. Reif, J.H., Sun, Z.: Movement planning in the presence of flows. In: Proceedings of the 7th International Workshop on Algorithms and Data Structures. Volume 2125 of Lecture Notes in Computer Science. (2001) 450-461
10. Lanthier, M., Maheshwari, A., Sack, J.R.: Shortest anisotropic paths on terrains. In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming. Volume 1644 of Lecture Notes in Computer Science. (1999) 524-533
11. Sun, Z., Reif, J.H.: On energy-minimizing paths on terrains for a mobile robot. In: Proceedings of the 2003 IEEE International Conference on Robotics and Automation. (2003) To appear.
12. Papadimitriou, C.H.: An algorithm for shortest-path motion in three dimensions. Information Processing Letters 20 (1985) 259-263
13. Choi, J., Sellen, J., Yap, C.K.: Approximate Euclidean shortest path in 3-space. In: Proceedings of the 10th Annual ACM Symposium on Computational Geometry. (1994) 41-48