A Monte-Carlo algorithm for path planning with many degrees of freedom
Authors:
- J. BarraquandJBJ. Barraquand
- J.-C. LatombeJLJ.-C. Latombe
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1712-1717
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On nonholonomic mobile robots and optimal maneuvering2003
- The construction of analytic diffeomorphisms for exact robot navigation on star worlds2003
- Numerical Potential Field Techniques for Robot Path Planning.1989
- Robot Motion Planning: A Distributed Representation Approach1989
- Toward Efficient Trajectory Planning: The Path-Velocity DecompositionThe International Journal of Robotics Research, 1986
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
- Motion Planning with Six Degrees of Freedom. Revision1984
- Optimization by Simulated AnnealingScience, 1983
- Small Random perturbation of dynamical systems with reflecting boundaryNagoya Mathematical Journal, 1976