Search-based path planning with homotopy class constraints

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2010, Pages 1230-1237

  Bhattacharya, Subhrajit ^a   Kumar, Vijay ^a   Likhachev, Maxim ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; OPTIMIZATION; ROBOT PROGRAMMING;

CAUCHY INTEGRAL THEOREMS; COMPLEX PLANES; DYNAMIC CONSTRAINTS; HOMOTOPY CLASS; ITS EFFICIENCIES; LEAST COST PATH; MOBILE ROBOTIC; OPTIMAL PATH PLANNING;

MOTION PLANNING;

EID: 77958549004     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Abichandani, P.; Benson, H. Y.; and Kam, M. 2009. Multi-vehicle path coordination in support of communication. In ICRA'09: Proceedings of the 2009 IEEE international conference on Robotics and Automation, 3839-3846. Institute of Electrical and Electronics Engineers Inc., The.
2. Bourgault, F.; Makarenko, A. A.; Williams, S. B.; Grochol-sky, B.; and Durrant-Whyte, H. F. 2002. Information based adaptive robotic exploration. In in Proceedings IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS, 540-545.
3. Demyen, D., and Buro, M. 2006. Efficient triangulation-based pathfinding. In AAA/'06: Proceedings of the 21st national conference on Artificial intelligence, 942-947. AAAI Press.
4. Gamelin, T. W. 2001. Complex analysis. Springer Science.
5. Grigoriev, D., and Slissenko, A. 1998. Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane. In ISSAC '98: Proceedings of the 1998 international symposium on Symbolic and algebraic computation, 17-24. New York, NY, USA: ACM.
6. Hansen, E. A., and Zhou, R. 2007. Anytime heuristic search. Journal of Artificial Intelligence Research (JAIR) 28:267-297.
7. Hershberger, J., and Snoeyink, J. 1991. Computing minimum length paths of a given homotopy class. Comput. Geom. Theory Appl 4:331-342.
8. Kallmann, M. 2005. Path planning in triangulations. In Proceedings of the IJCAI Workshop on Reasoning, Representation, and Learning in Computer Games.
9. Karabakal, N., and Bean, J. C. 1995. A multiplier adjustment method for multiple shortest path problem. Technical report, The University of Michigan.
10. LaValle, S. M. 2006. Planning Algorithms. Cambridge, U.K.: Cambridge University Press. Available at http://planning.cs.uiuc.edu/.
11. Likhachev, M., and Ferguson, D. 2008. Planning long dynamically-feasible maneuvers for autonomous vehicles. In Proceedings of Robotics: Science and Systems (RSS).
12. Schmitzberger, E.; Bouchet, J.; Dufaut, M.; Wolf, D.; and Husson, R. 2002. Capture of homotopy classes with probabilistic road map. In International Conference on Intelligent Robots and Systems, volume 3, 2317-2322.
13. Zhang, H.; Kumar, V.; and Ostrowski, J. 1998. Motion planning under uncertainty. In IEEE International Conference on Robotics and Automation. Leuven, Belgium: IEEE.