Let us work together-task planning of multiple mobile robots

摘要

This paper surveys former studies on task planning of multiple mobile robots. Task planning algorithms are categorized into four from two issues: dimensions of tasks demands (point-reaching tasks and region-sweeping tasks), and the number of iteration of the task (one-time tasks and iterative tasks). Individual studies are surveyed based on the above categorization.