Let us work together-task planning of multiple mobile robots
Tamio Arai, Jun Ota
Abstract
Tamio Arai, Jun Ota
Abstract
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.
OpenAlex reports 26 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Task (project management), Computer science, Mobile robot, Robot, Categorization, Task analysis, Point (geometry), Human–computer interaction