Shortest distance problems in graphs using history-dependent transition costs with application to kinodynamic path planning

Proceedings of the American Control Conference

Volumn , Issue , 2009, Pages 414-419

  Cowlagi, Raghvendra V ^a   Tsiotras, Panagiotis ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CURVATURE CONSTRAINTS; PATH PLANNING PROBLEMS; PATH-PLANNING; SHORTEST DISTANCE; SHORTEST PATH; TRANSITION COSTS;

EID: 70449625258     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACC.2009.5160149     Document Type: Conference Paper

References (22)

1. B. Donald, P. Xavier, J. Canny, and J. Reif, "Kinodynamic motion planning," J. Association for Computing Machinery, vol. 40, no. 5, pp. 1048-1066, November 1993.
2. S. M. LaValle and J. J. Kuffner, Jr., "Randomized kinodynamic planning," Intl. J. Robotics Research, vol. 20, no. 5, pp. 378-400, May 2001.
3. D. Hsu, R. Kindel, J.-C. Latombe, and S. Rock, "Randomized kinodynamic motion planning with moving obstacles," Intl. J. Robotics Research, vol. 21, no. 3, pp. 233-255, March 2002.
4. E. Frazzoli, M. A. Dahleh, and E. Feron, "Real-time motion planning for agile autonomous vehicles," Journal of Guidance, Control, and Dynamics, vol. 25, no. 1, pp. 116-129, 2002.
5. J.-C. Latombe, Robot Motion Planning. Kluwer Academic Publishers, 1991.
6. Y. K. Hwang and N. Ahuja, "Gross motion planning -a survey," ACM Computing Surveys, vol. 24, no. 3, pp. 219-291, September 1992.
7. S. M. LaValle, Planning Algorithms. Cambridge University Press, 2006.
8. S. Kambhampati and L. S. Davis, "Multiresolution path planning for mobile robots," IEEE J. Robotics and Automation, vol. RA-2, no. 3, pp. 135-45, September 1986.
9. H. Samet, "The quadtree and related hierarchical data structures," Computing Surveys, vol. 16, no. 2, pp. 187-260, June 1984.
10. H. Noborio, T. Naniwa, and S. Arimoto, "A quadtree-based path planning algorithm for a mobile robot," J. Robotic Systems, vol. 7, no. 4, pp. 555-74, 1990.
11. P. Tsiotras and E. Bakolas, "A hierarchical on-line path planning scheme using wavelets," in European Control Conf. , Kos, Greece, July 2-5 2007, pp. 2806-2812.
12. R. V. Cowlagi and P. Tsiotras, "Beyond quadtrees: Cell decompositions for path planning using the wavelet transform," in Proc. 46th IEEE Conf. Decision and Control, New Orleans, LA, Dec. 12-14 2007, pp. 1392-1397.
13. -, "Multiresolution path planning with wavelets: A local replanning approach," in Proc. 2008 American Control Conf. , Seattle, WA, June 11-13 2008, pp. 1220-1225.
14. B. J. H. Verwer, "A multiresolution workspace, multiresolution configuration space approach to solve the path planning problem," in Proce. 1990 IEEE Intl. Conf. Robotics & Automation, 1990, pp. 2107-12.
15. D. K. Pai and L.-M. Reissell, "Multiresolution rough terrain motion planning," IEEE Trans. Robotics & Automation, vol. 14, no. 1, pp. 19-33, February 1998.
16. S. Behnke, "Local multiresolution path planning," Lecture Notes in Artificial Intelligence, vol. 3020, pp. 332-43, 2004.
17. S. Bereg and D. Kirkpatrick, "Curvature-bounded traversals of narrow corridors," in Proc. Twenty-first Annual Symposium on Computational Geometry, Pisa, Italy, 2005, pp. 278-287.
18. E. Rippel, A. Bar-Gill, and N. Shimkin, "Fast graph-search algorithms for general aviation flight trajectory generation," J. Guidance, Control, and Dynamics, vol. 28, no. 4, pp. 801-811, July-August 2005.
19. S. Winter, "Modeling costs of turns in route planning," GeoInformatica, vol. 6, no. 4, pp. 345-361, 2002.
20. D. P. Bertsekas, Dynamic Programming and Optimal Control. Athena Scientific, Belmont, MA, 2000, vol. 1.
21. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. MIT Press, 2001.
22. E. Velenis and P. Tsiotras, "Minimum-time travel for a vehicle with acceleration limits: Theoretical analysis and receding horizon implementation," J. Optimization Theory and Applications, vol. 138, no. 2, pp. 275-296, 2008.