Abstract Multirobot coordination, if made efficient and robust, promises high impact on automation. Thechallenge is to enable robots to work together in an intelligent manner to execute a global task. The marketapproach has had considerable success in the multirobot coordination domain. However the implementationof this approach to date restricts the negotiations to two-party, single-task deals which often forces the taskallocation solution into a local minimum. This report investigates the effects of introducing multi-party andmulti-task negotiations to enhance the market-based approach to multirobot coordination. Multi-partynegotiations are enabled by implementing a combinatorial exchange mechanism, while multi-tasknegotiations are accomplished via clustering of tasks in cost space. Presented results show that global costscan be considerably reduced (on average to within 10% of the optimal solution for the tested scenarios),and hence task allocation can be considerably improved, by enhancing the negotiation capabilities of therobots.This report also investigates the effects of introducing opportunistic optimization with leaders to enhancemarket-based multirobot coordination. Leaders are able to optimize within subgroups of robots bycollecting information about their tasks and status, and re-allocating the tasks within the subgroup in a moreprofitable manner. The presented work also considers the effects of introducing pockets of centralizedoptimization into an otherwise distributed system. The implementations were tested on a variation of thetraveling salesman problem. Presented results show that global costs can be reduced, and hence, taskallocation can be improved, utilizing leaders. Note the presented work only addresses scenarios whereleaders run exchanges to optimize task allocation within a group of robots. Some leaders are also capableof clustering tasks and hence can conduct combinatorial exchanges. But these are not the only opportunitiesfor leaders to optimize within the market. It is also possible to have combinatorial exchanges and leadersas distinct entities within the economy. Leaders could also use other approaches to generate plans for asubgroup of robots. Finally, a leader could simply act as a means of enabling trade between subgroups ofrobots who are otherwise unable to communicate, thus enriching the set of possible trades. Thus, leaderscan enhance the market-based approach by several means including optimizing task-allocation, generatingplans, optimizing plans, and enabling better trade opportunities between groups of traders.
[1]
Anthony Stentz,et al.
A Market Approach to Multirobot Coordination
,
2001
.
[2]
Anthony Stentz,et al.
Multi-robot exploration controlled by a market economy
,
2002,
Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).
[3]
Subhash Suri,et al.
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
,
2000,
AAAI/IAAI.
[4]
Matteo Golfarelli.
Spatio-Temporal Clustering of Tasks for Swap-Based Negotiation Protocols in Multi-Agent Systems
,
2000
.
[5]
Maja J. Matarić,et al.
Sold!: Market methods for multi-robot control
,
2001
.
[6]
Michael P. Wellman.
Market-aware agents for a multiagent world
,
1997,
Robotics Auton. Syst..
[7]
Barry Brumitt,et al.
Dynamic mission planning for multiple mobile robots
,
1996,
Proceedings of IEEE International Conference on Robotics and Automation.
[8]
Tara A. Estlin,et al.
A comparison of coordinated planning methods for cooperating rovers
,
1999,
AGENTS '00.
[9]
Tucker R. Balch,et al.
AuRA: principles and practice in review
,
1997,
J. Exp. Theor. Artif. Intell..
[10]
Anthony Stentz,et al.
A Free Market Architecture for Distributed Control of a Multirobot System
,
2000
.
[11]
Martial Hebert,et al.
Distributed robotic mapping of extreme environments
,
2001,
SPIE Optics East.
[12]
Anthony Stentz,et al.
A Free Market Architecture for Coordinating Multiple Robots
,
1999
.
[13]
Kenneth Steiglitz,et al.
Combinatorial Optimization: Algorithms and Complexity
,
1981
.
[14]
Tuomas Sandholm,et al.
Algorithm for optimal winner determination in combinatorial auctions
,
2002,
Artif. Intell..
[15]
Reid G. Smith,et al.
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
,
1980,
IEEE Transactions on Computers.
[16]
M. Golfarelli,et al.
A Task-Swap Negotiation Protocol Based on the Contract Net Paradigm
,
2000
.