Login / Signup
SEAR: A Polynomial-Time Expected Constant-Factor Optimal Algorithmic Framework for Multi-Robot Path Planning.
Shuai D. Han
Edgar J. Rodriguez
Jingjin Yu
Published in:
CoRR (2017)
Keyphrases
</>
constant factor
robot path planning
approximation algorithms
worst case
lower bound
special case
dynamic programming
upper bound
machine learning
computational complexity
np hard
approximation guarantees