A distributed algorithm for gathering many fat mobile robots in the plane.
Chrysovalandis AgathangelouChryssis GeorgiouMarios MavronicolasPublished in: PODC (2013)
Keyphrases
- path planning
- mobile robot
- computational complexity
- improved algorithm
- k means
- dynamic programming
- times faster
- detection algorithm
- optimization algorithm
- cost function
- experimental evaluation
- significant improvement
- search space
- multi robot
- np hard
- computational cost
- worst case
- input data
- theoretical analysis
- segmentation algorithm
- objective function
- similarity measure
- convergence rate
- data sets
- obstacle avoidance
- tree structure
- expectation maximization
- simulated annealing
- learning algorithm