SEAR: A Polynomial- Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee.
Shuai D. HanEdgar J. RodriguezJingjin YuPublished in: IROS (2018)
Keyphrases
- multi robot
- path planning algorithm
- path planning
- constant factor
- approximation algorithms
- multiple robots
- approximation guarantees
- worst case
- mobile robot
- lower bound
- multi robot systems
- motion planning
- upper bound
- collision avoidance
- constant factor approximation algorithm
- np hard
- multi robot exploration
- dynamic environments
- special case
- indoor environments
- optimal path
- optimal solution
- sample complexity
- path finding
- robot teams
- computational complexity
- degrees of freedom
- autonomous navigation
- image sequences
- autonomous robots
- robotic systems
- real time