TY - GEN
T1 - Robust multi-robot cooperation through dynamic task allocation and precaution routines
AU - Sariel, Sanem
AU - Balch, Tucker
AU - Erdogan, Nadia
PY - 2006
Y1 - 2006
N2 - In this paper, we present the design and implementation of a multi-robot cooperation framework to collectively execute inter-dependent tasks of an overall complex mission requiring diverse capabilities. Given a heterogeneous team of robots and task dependencies, the proposed framework provides a distributed mechanism for assigning tasks to robots in an order that efficiently completes the mission. The approach is robust to unreliable communication and robot failures. It is a distributed auction-based approach, and therefore scalable. In order to obtain optimal allocations, effective bid evaluations are needed. Additionally to maintain optimality in noisy environments, dynamic re-allocations of tasks are needed as implemented in dynamic task selection and coalition maintenance scheme that we propose. Real-time contingencies are handled by recovery routines, called Plan B precautions in our framework. Here, in this paper, we present performance results of our framework for robustness in simulations that include variable message loss rates and robot failures. Experiments illustrate robustness of our approach against several contingencies.
AB - In this paper, we present the design and implementation of a multi-robot cooperation framework to collectively execute inter-dependent tasks of an overall complex mission requiring diverse capabilities. Given a heterogeneous team of robots and task dependencies, the proposed framework provides a distributed mechanism for assigning tasks to robots in an order that efficiently completes the mission. The approach is robust to unreliable communication and robot failures. It is a distributed auction-based approach, and therefore scalable. In order to obtain optimal allocations, effective bid evaluations are needed. Additionally to maintain optimality in noisy environments, dynamic re-allocations of tasks are needed as implemented in dynamic task selection and coalition maintenance scheme that we propose. Real-time contingencies are handled by recovery routines, called Plan B precautions in our framework. Here, in this paper, we present performance results of our framework for robustness in simulations that include variable message loss rates and robot failures. Experiments illustrate robustness of our approach against several contingencies.
KW - Distributed AI
KW - Multi-agent systems
KW - Robotics
UR - http://www.scopus.com/inward/record.url?scp=77954070126&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:77954070126
SN - 9728865600
SN - 9789728865603
T3 - ICINCO 2006 - 3rd International Conference on Informatics in Control, Automation and Robotics, Proceedings
SP - 196
EP - 201
BT - ICINCO 2006 - 3rd International Conference on Informatics in Control, Automation and Robotics, Proceedings
T2 - 3rd International Conference on Informatics in Control, Automation and Robotics, ICINCO 2006
Y2 - 1 August 2006 through 5 August 2006
ER -