Hierarchical path planning on probabilistically labeled polygons

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 4_1998, Issue , 1998, Pages 3147-3152

  Piat, Emmanuel ^a   Lacroix, Simon ^b  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

^b LAAS CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTICS; COMPUTATIONAL GEOMETRY; MATHEMATICAL MODELS; MOTION PLANNING; PROBABILISTIC LOGICS;

3D DATA; POLYGONAL STRUCTURES; SHORTEST PATH SEARCHES; TRAVERSABILITY;

MOTION PLANNING; MOBILE ROBOTS;

HIERARCHICAL PATH PLANNING; PROBABILISTIC LABELED POLYGONS;

EID: 0031642868     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.1998.680909     Document Type: Conference Paper

References (11)

1. R. A. Brooks. Solving the find-path problem by good representation of free space. IEEE Transactions on Systems, Man, and Cybernetics, 13(3): 190-197, 1983.
2. R. Chatila. Mobile robot navigation : Space modeling and decisional processes. ISRR, 3, 1985.
3. R. Chatila, M. Devy, S. Lacroix, and M. Herrb. Perception system and functions for autonomous navigation in a natural environment. In Proceedings of the AIAA/NASA Conference on Intelligent Robots for Field, Factory, Service and Space, Houston, Texas (USA), March 1994.
4. R. Chatila and S. Lacroix. Adaptive navigation for autonomous mobile robot. In International Symposium on Robotics Research, Munich (Germany), October 1995.
5. M. Hebert. Pixel-based range processing for autonomous driving. In IEEE International Conference on Robotics and Automation, San Diego, California, 1994.
6. K. Kant and S.W. Zucker. Toward efficient trajectory planning: Path velocity decomposition. International Journal of Robotics Research, 5:72 - 89, 1986.
7. T. Lozano-Perez. Spatial planning : A configuration space approach. IEEE Transactions on Systems, Man, and Cybernetics, 2(10):681-698, 1983.
8. J.S.B. Mitchell and C.H. Papadimitriou. The weighted region problem : Finding shortest paths through a weighted planar subdivision. Journal of the Association for Computing Machinery, 38(1), 1991.
9. E. Piat and D. Meizel. Proposal of a probabilistic believes fusion framework - Application to range data fusion. In Proc. of the IROS '97 International Conference on Intelligent Robots and Systems, pages 1415 - 1422, Grenoble, France, Sept. 1997.
10. R.F. Richbourg. Solving a two dimensional path planning problem using topographical knowledge of the environment and capability constraints. In IEEE International Conference on Robotics and Automation, San Francisco (USA), 1986.
11. D. Zhu and J. C. Latombe. New heuristic algorithms for efficient hierarchical path planning. Technical report, Robotics Laboratory, Computer Science Departement, Stanford University USA, 1989. Research Report STAN-CS-89-1279.