On finding energy-minimizing paths on terrains

IEEE Transactions on Robotics

Volumn 21, Issue 1, 2005, Pages 102-114

  Sun, Zheng ^a   Reif, John H ^b  

^a HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

^b Duke University   (United States)

Author keywords

Computational geometry; Mobile robot motion planning; Optimization; Road vehicles

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; CONSTRAINT THEORY; GROUND VEHICLES; MATHEMATICAL MODELS; MOTION PLANNING; OPTIMIZATION;

MOBILE ROBOT MOTION PLANNING; ROAD VEHICLES;

MOBILE ROBOTS;

EID: 14044259291     PISSN: 15523098     EISSN: None     Source Type: Journal    
DOI: 10.1109/TRO.2004.837232     Document Type: Article

References (22)

1. 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, pp. 540-553, Oct. 1990.
2. R. Alexander and N. Rowe, "Path planning by optimal-path-map construction for homogeneous-cost two-dimensional regions," in Proc. IEEE Int. Conf. Robot. Autom., 1990, pp. 1924-1929.
3. 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," Int. J. Robot. Res., vol. 9, no. 6, pp. 48-66, Dec. 1990.
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. Computat. Geom., 1997, pp. 264-273.
6. M. Lanthier et al., "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 Scand. Workshop Algorithm Theory, vol. 1432, 1998, pp. 11-22.
8. J. H. Reif and Z. Sun, "An efficient approximation algorithm for weighted region shortest path problem," in Proc. 4th Workshop Algorithmic Found. Robot., 2000, pp. 191-203.
9. 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.
10. L. Aleksandrov, A. Maheshwari, and J.-R. Sack, "An improved approximation algorithm for computing geometric shortest paths," in Proc. 14th Int. Symp. Fundam. Computat. Theory, vol. 2751, 2003, pp. 246-257.
11. Z. Sun and J. H. Reif, "Adaptive and compact discretization for weighted region optimal path finding," in Proc. 4th Int. Symp. Fundam. Computat. Theory, vol. 2751, 2003, pp. 258-270.
12. 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.
13. J. P. Laumond, Ed., Robot Motion Planning and Control. ser. Lecture Notes in Control and Information Science. New York: Springer, 1998.
14. 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.
15. N. C. Rowe, "Obtaining optimal mobile-robot paths with nonsmooth anisotropic cost functions using qualitative-state reasoning," Int. J. Robot. Res., vol. 16, no. 3, pp. 375-399, Jun. 1997.
16. M. Lanthier, A. Maheshwari, and J.-R. Sack, "Shortest anisotropic paths on terrains," in Proc. 26th Int. Colloq. Automata, Lang., Program. vol. 1644, 1999, pp. 524-533.
17. J. H. Reif and Z. Sun, "Movement planning in the presence of flows," Algorithmica, vol. 39, no. 2, pp. 127-153, 2004.
18. D. Gaw and A. Meystel, "Minimum-time navigation of an unmanned mobile robot in a 2-1/2D world with obstacles," in Proc. IEEE Int. Conf. Robot. Autom., 1986, pp. 1670-1677.
19. A. M. Parodi, "Multi-goal real-time global path planning for an autonomous land vehicle using a high-speed graph search processor," in Proc. IEEE Int. Conf. Robot. Autom., 1985, pp. 161-167.
20. Z. Sun and J. H. Reif, "BUSHWHACK: An approximation algorithm for minimal paths through pseudo-Euclidean spaces," in Proc. 12th Annu. Int. Symp. Algorithms, Computat., vol. 2223, 2001, pp. 160-171.
21. A. A. Rula and C. C. Nuttall, "An analysis of ground mobility models," U.S. Army Eng. Waterways Exp. Station, Tech. Rep. M-71-4, 1971.
22. Z. Sun and J. H. Reif, "On energy-minimizing paths on terrains for a mobile robot," in Proc. IEEE Int. Conf. Robot. Autom., 2003, pp. 3782-3788.