Multi-Robot Auctions for Allocation of Tasks with Temporal Constraints

We propose an auction algorithm to allocate tasks that have temporal constraints to cooperative robots. Temporal constraints are expressed as time windows, within which a task must be executed. There are no restrictions on the time windows, which are allowed to overlap. Robots model their temporal constraints using a simple temporal network, enabling them to maintain consistent schedules. When bidding on a task, a robot takes into account its own current commitments and an optimization objective, which is to minimize the time of completion of the last task alone or in combination with minimizing the distance traveled. The algorithm works both when all the tasks are known upfront and when tasks arrive dynamically. We show the performance of the algorithm in simulation with different numbers of tasks and robots, and compare it with a baseline greedy algorithm and a state-of-the-art auction algorithm. Our algorithm is computationally frugal and consistently allocates more tasks than the competing algorithms.

[1]  Julie A. Shah,et al.  Fast Scheduling of Multi-Robot Teams with Temporospatial Constraints , 2013, Robotics: Science and Systems.

[2]  Sven Koenig,et al.  Multi-robot routing with rewards and disjoint time windows , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[3]  Han-Lim Choi,et al.  Decentralized planning for complex missions with dynamic communication constraints , 2010, Proceedings of the 2010 American Control Conference.

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

[5]  Agostino Poggi,et al.  Jade - a fipa-compliant agent framework , 1999 .

[6]  Jonathan P. How,et al.  Coordination and control of multiple UAVs with timing constraints and loitering , 2003, Proceedings of the 2003 American Control Conference, 2003..

[7]  Han-Lim Choi,et al.  Consensus-Based Decentralized Auctions for Robust Task Allocation , 2009, IEEE Transactions on Robotics.

[8]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[9]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[10]  Maria L. Gini,et al.  Repeated auctions for robust task execution by a robot team , 2010, Robotics Auton. Syst..

[11]  Sven Koenig,et al.  On the Traveling Salesman Problem with Simple Temporal Constraints , 2013, SARA.

[12]  Sven Koenig,et al.  Progress on Agent Coordination with Cooperative Auctions , 2010, AAAI.

[13]  Ernesto Nunes,et al.  Auctioning robotic tasks with overlapping time windows , 2012, AAMAS.

[14]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[15]  Evangelos Markakis,et al.  Auction-Based Multi-Robot Routing , 2005, Robotics: Science and Systems.

[16]  Evangelos Markakis,et al.  The Power of Sequential Single-Item Auctions for Agent Coordination , 2006, AAAI.

[17]  Hrvoje Gold,et al.  Vehicle Routing Problem , 2008, Encyclopedia of GIS.