On robotic optimal path planning in polygonal regions with pseudo-Euclidean metrics

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 37, Issue 4, 2007, Pages 925-936

  Sun, Zheng ^a   Reif, John H ^b  

^a GOOGLE INC   (United States)

^b Duke University   (United States)

Author keywords

Computational geometry; Mobile robots; Motion planning; Optimization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; MOBILE ROBOTS; MOTION PLANNING; OPTIMIZATION; PROBLEM SOLVING;

POLYGONAL REGIONS; PSEUDO-EUCLIDEAN METRICS; ROBOTIC OPTIMAL PATH PLANNING;

ROBOTICS;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER SIMULATION; DECISION SUPPORT SYSTEM; METHODOLOGY; MOTION; ROBOTICS; THEORETICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; DECISION SUPPORT TECHNIQUES; MODELS, THEORETICAL; MOTION; PATTERN RECOGNITION, AUTOMATED; ROBOTICS;

EID: 34547113327     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2007.896021     Document Type: Article

References (23)

1. Z. Sun and J. H. Reif, "BUSHWHACK: An approximation algorithm for minimal paths through pseudo-Euclidean spaces," in Proc. 12th Annu. Int. Symp. Algorithms and Comput., 2001, vol. 2223, pp. 160-171.
2. Z. Sun and J. H. Reif, "Adaptive and compact discretization for weighted region optimal path finding," in Proc. 14th Int. Symp. Fundam. Comput. Theory, 2003, vol. 2751, pp. 258-270.
3. J. S. B. Mitchell, "Geometric shortest paths and network optimization," in Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, Eds. Amsterdam, The Netherlands: Elsevier, 2000, pp. 633-701.
4. J. S. B. Mitchell and C. H. Papadimitriou, "The weighted region problem: Finding shortest paths through a weighted planar subdivision," J. ACM, vol. 38, no. 1, pp. 18-73, Jan. 1991.
5. C. Mata and J. S. B. Mitchell, "A new algorithm for computing shortest paths in weighted planar subdivisions," in Proc. 13th Annu. ACM Symp. Comput. Geom., 1997, pp. 264-273.
6. M. Lanthier, A. Maheshwari, and J.-R. Sack, "Approximating weighted shortest paths on polyhedral surfaces," Algorithmica, vol. 30, no. 4, pp. 527-562, 2001.
7. L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.-R. Sack, "An ε-approximation algorithm for weighted shortest paths on polyhedral surfaces," in Proc. 6th Scandinavian Workshop Algorithm Theory, 1998, vol. 1432, pp. 11-22.
8. L. Aleksandrov, A. Maheshwari, and J.-R. Sack, "Approximation algorithms for geometric shortest path problems," in Proc. 32nd Annu. ACM Symp. Theory Comput., 2000, pp. 286-295.
9. Z. Sun and J. H. Reif, "On finding approximate optimal paths in weighted regions," J. Algorithms, vol. 58, no. 1, pp. 1-32, 2006.
10. L. Aleksandrov, A. Maheshwari, and J.-R. Sack, "Determining approximate shortest paths on weighted polyhedral surfaces," J. ACM, vol. 52, no. 1, pp. 25-53, Jan. 2005.
11. J. H. Reif and Z. Sun, "Movement planning in the presence of flows," Algorithmica, vol. 39, no. 2, pp. 127-153, 2004.
12. N. C. Rowe and R. S. Ross, "Optimal grid-free path planning across arbitrarily contoured terrain with anisotropic friction and gravity effects," IEEE Trans. Robot. Autom., vol. 6, no. 5, pp. 540-553, Oct. 1990.
13. N. C. Rowe and Y. Kanayama, "Near-minimum-energy paths on a vertical-axis cone with anisotropic friction and gravity effects," Int. J. Robot. Res., vol. 13, no. 5, pp. 408-433, Oct. 1994.
14. N. C. Rowe, "Obtaining optimal mobile-robot paths with non-smooth anisotropic cost functions using qualitative-state reasoning," Int. J. Robot. Res., vol. 16, no. 3, pp. 375-399, Jun. 1997.
15. M. Lanthier, A. Maheshwari, and J.-R. Sack, "Shortest anisotropic paths on terrains," in Proc. 26th Int. Colloq. Automata, Languages and Program., 1999, vol. 1644, pp. 524-533.
16. Z. Sun and J. H. Reif, "On finding energy-minimizing paths on terrains," IEEE Trans. Robot., vol. 21, no. 1, pp. 102-114, Feb. 2005.
17. J. Hershberger and S. Suri, "An optimal algorithm for Euclidean shortest paths in the plane," SIAM J. Comput., vol. 28, no. 6, pp. 2215-2256, 1999.
18. Z. Sun and T.-M. Bu, "On discretization methods for approximating optimal paths in regions with direction-dependent costs," Inf. Process. Lett., vol. 97, no. 4, pp. 146-152, 2006.
19. C. H. Papadimitriou, "An algorithm for shortest-path motion in three dimensions," Inf. Process. Lett., vol. 20, no. 5, pp. 259-263, 1985.
20. J. Choi, J. Sellen, and C. K. Yap, "Approximate Euclidean shortest path in 3-space," in Proc. 10th Annu. ACM Symp. Comput. Geom., 1994, pp. 41-48.
21. G. B. Dantzig, "On the shortest route through a network," Manage. Sci., vol. 6, no. 2, pp. 187-190, Jan. 1960.
22. T. A. J. Nicholson, "Finding the shortest route between two points in a network," Comput. J., vol. 9, no. 3, pp. 275-280, Nov. 1966.
23. R. V. Helgason, J. Kennington, and B. Stewart, "The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm," Comput. Optim. Appl., vol. 2, no. 1, pp. 47-75, Jun. 1993.