Optimal and competitive runtime bounds for continuous, local gathering of mobile robots.
Barbara KempkesPeter KlingFriedhelm Meyer auf der HeidePublished in: SPAA (2012)
Keyphrases
- mobile robot
- worst case
- lower bound
- competitive ratio
- upper bound
- optimal solution
- dynamic programming
- data sets
- tight bounds
- asymptotically optimal
- initially unknown
- optimal cost
- search algorithm
- average case
- upper and lower bounds
- path planning
- piecewise linear
- minimum cost
- approximation algorithms
- dynamic environments
- learning algorithm
- neural network