A Collision-free And Deadlock-free Path-planning Algorithm For Multiple Mobile Robots Without Mutual Communication
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 479-486
- https://doi.org/10.1109/iros.1992.587378
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Several Path-Planning Algorithms Mobile Robot for an Uncertain Workspace and their EvaluationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Time-minimal paths among moving obstaclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shapeAlgorithmica, 1987
- Multiresolution path planning for mobile robotsIEEE Journal on Robotics and Automation, 1986
- Real-Time Obstacle Avoidance for Manipulators and Mobile RobotsThe International Journal of Robotics Research, 1986
- Solving the find-path problem by good representation of free spaceIEEE Transactions on Systems, Man, and Cybernetics, 1983
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979