TY - GEN
T1 - Incremental multi-robot task selection for resource constrained and interrelated tasks
AU - Sariel, Sanem
AU - Balch, Tucker
AU - Erdogan, Nadia
PY - 2007
Y1 - 2007
N2 - When the tasks of a mission are interrelated and subject to several resource constraints, more efforts are needed to coordinate robots towards achieving the mission than independent tasks. In this work, we formulate the Coordinated Task Selection Problem (CTSP) to form the basis of an efficient dynamic task selection scheme for allocation of interrelated tasks of a complex mission to the members of a multi-robot team. Since processing times of tasks are not exactly known in advance, the incremental task selection scheme for the eligible tasks prevents redundant efforts as, instead of scheduling all of the tasks, they are allocated to robots as needed. This approach results in globally efficient solutions through mechanisms that form priority based rough schedules and select the most suitable tasks from these schedules. Since our method is targeted at real world task execution, communication requirements are kept limited. Empirical evaluations of the proposed approach are performed on the Webots simulator and the real robots. The results validate that the proposed approach is scalable, efficient and suitable to the real world safe mission achievement.
AB - When the tasks of a mission are interrelated and subject to several resource constraints, more efforts are needed to coordinate robots towards achieving the mission than independent tasks. In this work, we formulate the Coordinated Task Selection Problem (CTSP) to form the basis of an efficient dynamic task selection scheme for allocation of interrelated tasks of a complex mission to the members of a multi-robot team. Since processing times of tasks are not exactly known in advance, the incremental task selection scheme for the eligible tasks prevents redundant efforts as, instead of scheduling all of the tasks, they are allocated to robots as needed. This approach results in globally efficient solutions through mechanisms that form priority based rough schedules and select the most suitable tasks from these schedules. Since our method is targeted at real world task execution, communication requirements are kept limited. Empirical evaluations of the proposed approach are performed on the Webots simulator and the real robots. The results validate that the proposed approach is scalable, efficient and suitable to the real world safe mission achievement.
UR - http://www.scopus.com/inward/record.url?scp=51349113342&partnerID=8YFLogxK
U2 - 10.1109/IROS.2007.4399519
DO - 10.1109/IROS.2007.4399519
M3 - Conference contribution
AN - SCOPUS:51349113342
SN - 1424409128
SN - 9781424409129
T3 - IEEE International Conference on Intelligent Robots and Systems
SP - 2314
EP - 2319
BT - Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2007
T2 - 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2007
Y2 - 29 October 2007 through 2 November 2007
ER -