Abstract
The task allocation problem with pickup and delivery is an extension of the widely studied multi-robot task allocation (MRTA) problem which, in general, considers each task as a single location to visit. Within the robotics domain distributed auctions are a popular method for task allocation [4]. In this work, we consider a team of autonomous mobile robots making deliveries in an office-like environment. Each robot has a set of tasks to complete, and each task is composed of a pickup location and a delivery location. The robots seek to complete their assigned tasks either minimising distance travelled or time taken according to a global team objective. During execution, individual robots may fail due to malfunctioning equipment or running low on battery power.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berhault, M., Huang, H., Keskinocak, P., Koenig, S., Elmaghraby, W., Griffin, P.M., Kleywegt, A.J.: Robot exploration with combinatorial auctions. In: IROS, pp. 1957–1962 (2003)
Botelho, S., Alami, R.: M+: A scheme for multi-robot cooperation through negotiated task allocation and achievement. In: ICRA, pp. 1234–1239 (1999)
Dias, M.B., Zinck, M., Zlot, R., Stentz, A.: Robust multirobot coordination in dynamic environments. In: ICRA, pp. 3435–3442 (2004)
Dias, M.B., Zlot, R., Kalra, N., Stentz, A.: Market-based multirobot coordination: A survey and analysis. Proceedings of the IEEE 94(7), 1257–1270 (2006)
Fischer, K.: Cooperative transportation scheduling: An application domain for dai. Applied Artificial Intelligence 10(1), 1–34 (1996)
Gerkey, B.P., Matarić, M.J.: Sold!: auction methods for multirobot coordination. IEEE Transactions on Robotics 18(5), 758–768 (2002)
Koenig, S., Keskinocak, P., Tovey, C.A.: Progress on agent coordination with cooperative auctions. In: AAAI (2010)
Koenig, S., Tovey, C.A., Lagoudakis, M.G., Markakis, E., Kempe, D., Keskinocak, P., Kleywegt, A.J., Meyerson, A., Jain, S.: The power of sequential single-item auctions for agent coordination. In: AAAI, pp. 1625–1629 (2006)
Koenig, S., Tovey, C.A., Zheng, X., Sungur, I.: Sequential bundle-bid single-sale auction algorithms for decentralized control. In: IJCAI, pp. 1359–1365 (2007)
Kohout, R.C., Erol, K.: In-time agent-based vehicle routing with a stochastic improvement heuristic. In: AAAI, pp. 864–869 (1999)
Lagoudakis, M.G., Markakis, E., Kempe, D., Keskinocak, P., Kleywegt, A.J., Koenig, S., Tovey, C.A., Meyerson, A., Jain, S.: Auction-based multi-robot routing. In: Robotics: Science and Systems, pp. 343–350 (2005)
Nanjanath, M., Gini, M.L.: Repeated auctions for robust task execution by a robot team. Robotics and Autonomous Systems 58(7), 900–909 (2010)
Schoenig, A., Pagnucco, M.: Evaluating sequential single-item auctions for dynamic task allocation. In: Australasian Conference on Artificial Intelligence, pp. 506–515 (2010)
Smith, R.G.: The contract net protocol: High-level communication and control in a distributed problem solver. IEEE Trans. Computers 29(12), 1104–1113 (1980)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations research 35(2), 254–265 (1987)
Van Duin, J., Tavasszy, L., Taniguchi, E.: Real time simulation of auctioning and re-scheduling processes in hybrid freight markets. Transportation Research Part B: Methodological 41(9), 1050–1066 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heap, B., Pagnucco, M. (2013). Repeated Auctions for Reallocation of Tasks with Pickup and Delivery upon Robot Failure. In: Boella, G., Elkind, E., Savarimuthu, B.T.R., Dignum, F., Purvis, M.K. (eds) PRIMA 2013: Principles and Practice of Multi-Agent Systems. PRIMA 2013. Lecture Notes in Computer Science(), vol 8291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-44927-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-44927-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-44926-0
Online ISBN: 978-3-642-44927-7
eBook Packages: Computer ScienceComputer Science (R0)