Abstract:
Presents a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static envir...Show MoreMetadata
Abstract:
Presents a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment. The approach is probabilistically complete. That is, any solvable problem is guaranteed to be solved within a finite amount of time. The method, which is an extension of previous work on probabilistic single-robot planners, is very flexible in the sense that it can easily be applied to different robot types. In this paper the authors apply it to non-holonomic car-like robots, and present experimental results which show that the method is powerful and fast.
Date of Conference: 21-27 May 1995
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-7803-1965-6
Print ISSN: 1050-4729
References is not available for this document.
Select All
1.
J. Barraquand, B. Langlois and J.-C. Latombe, "Numerical potential field techniques for robot path planning", IEEE Trans. Syst. Man Cybern., vol. 22, pp. 224-241, 1992.
2.
J. Barraquand and J.-C. Latombe, "Robot motion planning: A distributed representation approach", Internat. J. Robot. Res., vol. 10, pp. 628-649, 1991.
4.
L. Kavraki, P. Svestka, J.-C. Latombe and M. Overmars, Probabilistic roadmaps for path planning in high dimensional configuration spaces, August 1994.
5.
J.-C. Latombe, Robot Motion Planning, USA, Boston:Kluwer Academic Publishers, 1991.
6.
M. Overmars and P. Svestka, "A probabilistic learning approach to motion planning" in The Algorithmic Foundations of Robotics, MA, Boston, 1995.
7.
J. H. Reif and H. Wang, "Social potential fields: A distributed behavioral control for automonous robots", Proc. The First Workshop on the Algorithmic Foundations of Robotics, 1994.
8.
P. Švestka and M. Overmars, Motion planning for car-like robots using a probabilistic learning approach, August 1994.