Learning Opportunity Costs in Multi-Robot Market Based Planners

Jeff Schneider, David Apfelbaum, J. Andrew (Drew) Bagnell and Reid Simmons
Conference Paper, April, 2005

View Publication

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


Direct human control of multi-robot systems is limited by the cognitive ability of humans to coordinate nu- merous interacting components. In remote environments, such as those encountered during planetary or ocean exploration, a further limit is imposed by communication bandwidth and delay. Market based planning can give humans a higher-level interface to multi-robot systems in these scenarios. Operators provide high level tasks and attach a reward to the achieve- ment of each task. The robots then trade these tasks through a market based mechanism. The challenge for the system designer is to create bidding algorithms for the robots that yield high overall system performance. Opportunity cost provides a nice basis for such bidding algorithms since it encapsulates all the costs and benefits we are interested in. Unfortunately, computing it can be difficult. We propose a method of learning opportunity costs in market based planners. We provide analytic results in simplified scenarios and empirical results on our FIRE simulator, which focuses on exploration of Mars by multiple, heterogeneous rovers. Index Terms— Market-based planning, learning, opportu- nity cost, multi-robot systems.

author = {Jeff Schneider and David Apfelbaum and J. Andrew (Drew) Bagnell and Reid Simmons},
title = {Learning Opportunity Costs in Multi-Robot Market Based Planners},
year = {2005},
month = {April},
} 2017-09-13T10:43:28-04:00