A Monte-Carlo algorithm for path planning with many degrees of freedom.
Jérôme BarraquandJean-Claude LatombePublished in: ICRA (1990)
Keyphrases
- path planning
- monte carlo
- degrees of freedom
- configuration space
- path finding
- motion planning
- path planning algorithm
- multi robot
- optimal path
- mobile robot
- dynamic environments
- markov chain
- collision avoidance
- obstacle avoidance
- learning algorithm
- importance sampling
- monte carlo simulation
- objective function
- particle filter
- dynamic programming
- optimal solution
- dynamic and uncertain environments
- three dimensional
- computer vision
- variance reduction
- multiple robots
- machine learning