On discretization methods for approximating optimal paths in regions with direction-dependent costs

Information Processing Letters

Volumn 97, Issue 4, 2006, Pages 146-152

  Sun, Zheng ^a   Bu, Tian Ming ^b  

^a GOOGLE INC   (United States)

^b FUDAN UNIVERSITY   (China)

Author keywords

Approximation algorithms; Computational geometry; Optimization; Robotic path planning

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; COSTS; MOTION PLANNING; NUMBER THEORY; OPTIMIZATION; PARAMETER ESTIMATION; ROBOTICS;

APPROXIMATION ALGORITHMS; DISCRETIZATION; GEOMETRIC PARAMETERS; ROBOTIC PATH PLANNING;

APPROXIMATION THEORY;

EID: 29344448868     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.10.007     Document Type: Article

References (11)

1. L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.-R. Sack An ε-approximation algorithm for weighted shortest paths on polyhedral surfaces Proc. 6th Scandinavian Workshop on Algorithm Theory Lecture Notes in Comput. Sci. vol. 1432 1998 Springer Berlin 11 22
2. L. Aleksandrov, A. Maheshwari, and J.-R. Sack An improved approximation algorithm for computing geometric shortest paths Proc. 14th Internat. Symp. on Fundamentals of Computation Theory Lecture Notes in Comput. Sci. vol. 2751 2003 Springer Berlin 246 257
3. L. Aleksandrov, A. Maheshwari, and J.-R. Sack Determining approximate shortest paths on weighted polyhedral surfaces J. ACM 52 1 2005 25 53
4. M. Lanthier, A. Maheshwari, and J.-R. Sack Shortest anisotropic paths on terrains Proc. 26th Internat. Colloquium on Automata, Languages and Programming Lecture Notes in Comput. Sci. vol. 1644 1999 Springer Berlin 524 533
5. M. Lanthier, A. Maheshwari, and J.-R. Sack Approximating weighted shortest paths on polyhedral surfaces Algorithmica 30 4 2001 527 562
6. J.S.B. Mitchell Geometric shortest paths and network optimization J.-R. Sack J. Urrutia Handbook of Computational Geometry 2000 Elsevier Science Publishers B.V. Amsterdam 633 701
7. 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
8. J.H. Reif, and Z. Sun Movement planning in the presence of flows Algorithmica 39 2 2004 127 153
9. N.C. Rowe, and R.S. Ross Optimal grid-free path planning across arbitrarily contoured terrain with anisotropic friction and gravity effects IEEE Trans. Robotics Automation 6 5 1990 540 553
10. Z. Sun, and J.H. Reif On finding approximate optimal paths in weighted regions J. of Algorithms 58 1 2006
11. Z. Sun, and J.H. Reif On finding energy-minimizing paths on terrains IEEE Trans. on Robotics 21 1 2005 10 114