Task allocation for multi-robot cooperative hunting behavior based on improved auction algorithm

Within the frameworks of the well-known contract net protocol, a task allocation method for multi-robot cooperative hunting behavior is proposed based on an improved auction algorithm. Previous allocation methods using ordinary auction algorithms might turn out to be unsuitable when targets keep moving. Furthermore, the ordinary auctions might lead to unfavorable releases of the captured targets, because the hunters which were formerly assigned to relative tasks might be designated to some other tasks in a new round of bidding. In this paper an improved auction algorithm is proposed which may establish an ordered task list and holds biddings for each task in the list repeatedly. Therefore the allocation methods can be modified which allow dealing with a considerable volume of tasks in a dynamic environments. In addition, this approach holds no biddings for the accomplished tasks, and the relative hunters will keep guarding on their previously assigned target. The improvements also save the computational cost. Simulations demonstrate the flexibility and the efficiency of the method and the hunting task can be achieved in nearly half the time of the original methods.

[1]  Luis Montano,et al.  Comparative experiments on optimization criteria and algorithms for auction based multi-robot task allocation , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[2]  Nidhi Kalra,et al.  Market-Based Multirobot Coordination: A Survey and Analysis , 2006, Proceedings of the IEEE.

[3]  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..

[4]  Xin Ma,et al.  Multi-agent-based Auctions for Multi-robot Exploration , 2006, 2006 6th World Congress on Intelligent Control and Automation.

[5]  Sven Koenig,et al.  Robot exploration with combinatorial auctions , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[6]  Lynne E. Parker,et al.  A Complete Methodology for Generating Multi-Robot Task Solutions using ASyMTRe-D and Market-Based Task Allocation , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

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

[8]  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).

[9]  Lovekesh Vig,et al.  Multi-robot coalition formation , 2006, IEEE Transactions on Robotics.

[10]  Nidhi Kalra,et al.  Hoplites: A Market-Based Framework for Planned Tight Coordination in Multirobot Teams , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[11]  Michail G. Lagoudakis,et al.  Simple auctions with performance guarantees for multi-robot task allocation , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

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

[13]  Aníbal Ollero,et al.  SET: An algorithm for distributed multirobot task allocation with dynamic negotiation based on task subsets , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

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

[15]  Wolfram Burgard,et al.  Coordination for Multi-Robot Exploration and Mapping , 2000, AAAI/IAAI.