Skip to main content

Sequential Single-Cluster Auctions

  • Conference paper
  • 1318 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8076))

Abstract

My thesis is concerned with task allocation in multi-robot teams operating in dynamic environments. The key contribution of this work is the development of a distributed multi-robot task allocation auction that allocates clusters of tasks to robots over multiple bidding rounds. Empirical evaluation has shown this auction routine performs well in handling online task insertion and task reallocation upon robot failure.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Article  Google Scholar 

  2. Heap, B., Pagnucco, M.: Sequential single-cluster auctions for robot task allocation. In: Wang, D., Reynolds, M. (eds.) AI 2011. LNCS, vol. 7106, pp. 412–421. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Heap, B., Pagnucco, M.: Analysis of cluster formation techniques for multi-robot task allocation using sequential single-cluster auctions. In: Thielscher, M., Zhang, D. (eds.) AI 2012. LNCS, vol. 7691, pp. 839–850. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Heap, B., Pagnucco, M.: Repeated sequential auctions with dynamic task clusters. In: AAAI (2012)

    Google Scholar 

  5. Heap, B., Pagnucco, M.: Repeated sequential single-cluster auctions with dynamic tasks for multi-robot task allocation with pickup and delivery. In: Klusch, M., Thimm, M., Paprzycki, M. (eds.) MATES 2013. LNCS (LNAI), vol. 8076, pp. 87–100. Springer, Heidelberg (2013)

    Google Scholar 

  6. Koenig, S., Keskinocak, P., Tovey, C.A.: Progress on agent coordination with cooperative auctions. In: AAAI (2010)

    Google Scholar 

  7. Lagoudakis, M.G., Markakis, E., Kempe, D., et al.: Auction-based multi-robot routing. In: RSS. pp. 343–350 (2005)

    Google Scholar 

  8. Sandholm, T.: Contract types for satisficing task allocation: I theoretical results. In: Proceedings of the AAAI Spring Symposium: Satisficing Models, pp. 68–75 (1998)

    Google Scholar 

  9. Sariel, S., Balch, T.R.: Efficient bids on task allocation for multi-robot exploration. In: FLAIRS Conference, pp. 116–121 (2006)

    Google Scholar 

  10. Zlot, R., Stentz, A.: Complex task allocation for multiple robots. In: ICRA, pp. 1515–1522 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heap, B. (2013). Sequential Single-Cluster Auctions. In: Klusch, M., Thimm, M., Paprzycki, M. (eds) Multiagent System Technologies. MATES 2013. Lecture Notes in Computer Science(), vol 8076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40776-5_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40776-5_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40775-8

  • Online ISBN: 978-3-642-40776-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics