On finding approximate optimal paths in weighted regions

Journal of Algorithms

Volumn 58, Issue 1, 2006, Pages 1-32

  Sun, Zheng ^a   Reif, John H ^b  

^a HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

^b Duke University   (United States)

Author keywords

Approximation algorithms; Computational geometry; Optimal paths; Robotics

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; PROBLEM SOLVING; ROBOTICS;

APPROXIMATION ALGORITHMS; DISCRETIZATION; OPTIMAL PATHS; WEIGHTED REGIONS;

ALGORITHMS;

EID: 28444473064     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.07.004     Document Type: Article

References (20)

1. M. Lanthier, A. Maheshwari, and J.-R. Sack Approximating weighted shortest paths on polyhedral surfaces Proceedings of the 13th Annual ACM Symposium on Computational Geometry 1997 274 283
2. L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.-R. Sack An ε-approximation algorithm for weighted shortest paths on polyhedral surfaces Proceedings of the 6th Scandinavian Workshop on Algorithm Theory Lecture Notes in Comput. Sci. vol. 1432 1998 11 22
3. L. Aleksandrov, A. Maheshwari, and J.-R. Sack Approximation algorithms for geometric shortest path problems Proceedings of the 32nd Annual ACM Symposium on Theory of Computing 2000 286 295
4. J.H. Reif, and Z. Sun An efficient approximation algorithm for weighted region shortest path problem Proceedings of the 4th Workshop on Algorithmic Foundations of Robotics 2000 191 203
5. J.S.B. Mitchell Geometric shortest paths and network optimization J.-R. Sack J. Urrutia Handbook of Computational Geometry 2000 Elsevier/North-Holland Amsterdam 633 701
6. J.S.B. Mitchell, and C.H. Papadimitriou The weighted region problem: Finding shortest paths through a weighted planar subdivision J. ACM 38 1 1991 18 73
7. C. Mata, and J.S.B. Mitchell A new algorithm for computing shortest paths in weighted planar subdivisions Proceedings of the 13th Annual ACM Symposium on Computational Geometry 1997 264 273
8. T.R. Smith, G. Peng, and P. Gahinet Asynchronous, iterative, and parallel procedures for solving the weighted-region least cost path problem Geographical Analysis 21 2 1989 147 166
9. R. Alexander, Construction of optimal-path maps for homogeneous-cost- region path-planning problems, PhD thesis, Computer Science, US Naval Postgraduate School, Monterey, CA, 1989
10. R. Alexander, N. Rowe, Geometrical principles for path planning by optimal-path-map construction for linear and polygonal homogeneous-region terrain, Technical Report, Computer Science, US Naval Postgraduate School, Monterey, CA, 1989
11. R. Alexander, and N. Rowe Path planning by optimal-path-map construction for homogeneous-cost two-dimensional regions Proceedings of the 1990 IEEE International Conference on Robotics and Automation 1990 1924 1929
12. M. Kindl, M. Shing, N. Rowe, A stochastic approach to the weighted-region problem, II: Performance enhancement techniques and experimental results, Technical Report, Computer Science, US Naval Postgraduate School, Monterey, CA, 1991
13. N. Papadakis, and A. Perakis Minimal time vessel routing in a time-dependent environment Transportation Science 23 4 1989 266 276
14. N. Papadakis, and A. Perakis Deterministic minimal time vessel routing Oper. Res. 38 3 1990 426 438
15. N.C. Rowe Roads, rivers, and obstacles: optimal two-dimensional route planning around linear features for a mobile agent Internat. J. Robotics Res. 9 6 1990 67 74
16. N.C. Rowe, and R.F. Richbourg An efficient Snell's Law method for optimal-path planning across multiple two-dimensional, irregular, homogeneous-cost regions Internat. J. Robotics Res. 9 6 1990 48 66
17. Z. Sun, and J.H. Reif BUSHWHACK: An approximation algorithm for minimal paths through pseudo-Euclidean spaces Proceedings of the 12th Annual International Symposium on Algorithms and Computation Lecture Notes in Comput. Sci. vol. 2223 2001 160 171
18. L. Aleksandrov, A. Maheshwari, and J.-R. Sack An improved approximation algorithm for computing geometric shortest paths Proceedings of the 14th International Symposium on Fundamentals of Computation Theory Lecture Notes in Comput. Sci. vol. 2751 2003 246 257
19. M. Lanthier, A. Maheshwari, and J.-R. Sack Shortest anisotropic paths on terrains Proceedings of the 26th International Colloquium on Automata, Languages and Programming Lecture Notes in Comput. Sci. vol. 1644 1999 524 533
20. J.H. Reif, and Z. Sun Movement planning in the presence of flows Algorithmica 39 2 2004 127 153