Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots.
Taisuke IzumiTomoko IzumiSayaka KameiFukuhito OoshitaPublished in: IEEE Trans. Parallel Distributed Syst. (2013)
Keyphrases
- mobile robot
- path planning
- autonomous robots
- dynamic environments
- indoor environments
- motion control
- special case
- obstacle avoidance
- randomized algorithm
- mobile robotics
- worst case
- multi robot
- approximation algorithms
- outdoor environments
- path planner
- multiple robots
- map building
- randomized algorithms
- unstructured environments
- collision avoidance
- motion planning
- robotic systems
- computational complexity
- autonomous navigation
- upper bound
- case study
- decision trees