SET: An algorithm for distributed multirobot task allocation with dynamic negotiation based on task subsets

The multi-robot task allocation (MRTA) problem has become a key research topic in the field of distributed multirobot coordination in recent years. In this paper, two algorithms for the distributed solution of the MRTA problem are presented. In our market-based approach, robots consider their local plans when bidding and multiple tasks can be allocated to a single robot during the negotiation process. The second algorithm described in the paper is based on the negotiation of subset of tasks and can be considered as a generalization of the first one, which only negotiates single tasks. Both algorithms have been tested in a multirobot simulator with multiple missions consisting in visiting waypoints with promising results.

[1]  Tuomas Sandholm,et al.  An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations , 1993, AAAI.

[2]  Barry Brumitt,et al.  GRAMMPS: a generalized mission planner for multiple mobile robots in unstructured environments , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[3]  Lynne E. Parker,et al.  ALLIANCE: an architecture for fault tolerant multirobot cooperation , 1998, IEEE Trans. Robotics Autom..

[4]  Maja J. Mataric,et al.  Broadcast of Local Elibility for Multi-Target Observation , 2000, DARS.

[5]  Anthony Stentz,et al.  Opportunistic optimization for market-based multirobot control , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[6]  Rachid Alami,et al.  Multi-robot cooperation through the common use of "mechanisms" , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[7]  Brett Browning,et al.  Dynamically formed heterogeneous robot teams performing tightly-coordinated tasks , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[8]  Mark Yim,et al.  Indoor automation with many mobile robots , 1990, EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications.

[9]  Anthony Stentz,et al.  Traderbots: a new paradigm for robust and efficient multirobot coordination in dynamic environments , 2004 .

[10]  Nidhi Kalra,et al.  Hoplites: A Market Framework for Complex Tight Coordination in Multi-Agent Teams , 2004 .

[11]  Rachid Alami,et al.  M+: a scheme for multi-robot cooperation through negotiated task allocation and achievement , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[12]  Kurt Konolige,et al.  A practical, decision-theoretic approach to multi-robot mapping and exploration , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[13]  Maja J. Mataric,et al.  Murdoch: publish/subscribe task allocation for heterogeneous agents , 2000, AGENTS '00.

[14]  Maja J. Mataric,et al.  Sold!: auction methods for multirobot coordination , 2002, IEEE Trans. Robotics Autom..

[15]  Maja J. Mataric,et al.  Pusher-watcher: an approach to fault-tolerant tightly-coupled robot coordination , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[16]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[17]  Anthony Stentz,et al.  Robust multirobot coordination in dynamic environments , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.