A Sampling-Based Algorithm for Planning Smooth Nonholonomic Paths.
Carolina BerettaCecilia BrizzolariDavide TateoAlessandro RivaFrancesco AmigoniPublished in: ECMR (2019)
Keyphrases
- matching algorithm
- high accuracy
- dynamic programming
- preprocessing
- optimal solution
- improved algorithm
- cost function
- experimental evaluation
- learning algorithm
- path finding
- motion planning
- times faster
- path planning
- objective function
- simulated annealing
- optimal path
- probabilistic model
- monte carlo
- theoretical analysis
- particle swarm optimization
- worst case
- np hard
- significant improvement
- search space
- computational cost
- mobile robot
- detection algorithm
- shortest path
- clustering method
- k means
- evolutionary algorithm
- multi robot
- computational complexity
- search algorithm
- similarity measure