Skip to main content

Evaluating Sequential Single-Item Auctions for Dynamic Task Allocation

  • Conference paper
AI 2010: Advances in Artificial Intelligence (AI 2010)

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

Included in the following conference series:

Abstract

Sequential single-item (SSI) auctions have proven a very effective technique for tackling static task allocation problems in multi-robot settings and are only recently being applied to dynamic task allocation problems. We complement existing work by evaluating the effects of using different auctioning and winner determination schemes when dealing with dynamically appearing tasks. To this end we investigate the use of plan modification versus re-planning and minimum cost and regret clearing for winner determination in the auction.

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

Access this chapter

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

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. Proc. IEEE 94(7), 1257–1270 (2006)

    Article  Google Scholar 

  2. Parker, L.: Distributed intelligence: Overview of the field and its application in multi-robot systems. J. Physical Agents 2(1), 5–14 (2008)

    Google Scholar 

  3. Lagoudakis, M., Markakis, E., Kempe, D., Keskinocak, P., Kleywegt, A., Koenig, S., Tovey, C., Meyerson, A., Jain, S.: Auction-based multi-robot routing. In: Proc. Int. Conf. on Robotics: Science and Systems, pp. 343–350 (2005)

    Google Scholar 

  4. Koenig, S., Tovey, C., Lagoudakis, M., Markakis, V., Kempe, D., Keskinocak, P., Kleywegt, A., Meyerson, A., Jain, S.: The power of sequential single-item auctions for agent coordination. In: Proc. AAAI 2006, pp. 1625–1629 (2006)

    Google Scholar 

  5. Zheng, X., Koenig, S., Tovey, C.: Improving sequential single-item auctions. In: Proc. IROS 2006, pp. 2238–2244 (2006)

    Google Scholar 

  6. Koenig, S., Zheng, X., Tovey, C., Borie, R., Kilby, P., Markakis, V., Keskinocak, P.: Agent coordination with regret clearing. In: Proc. AAAI 2008 (2008)

    Google Scholar 

  7. Nanjanath, M., Gini, M.: Auctions for task allocation to robots. In: Proc. Int. Conf. on Intelligent Autonomous Systems (January 2006)

    Google Scholar 

  8. Nanjanath, M., Gini, M.: Performance evaluation of repeated auctions for robust task execution. In: Carpin, S., Noda, I., Pagello, E., Reggiani, M., von Stryk, O. (eds.) SIMPAR 2008. LNCS (LNAI), vol. 5325, pp. 317–327. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Nebel, B., Koehler, J.: Plan modification versus plan generation: A complexity-theoretic perspective. In: IJCAI 1993, pp. 1436–1441 (1993)

    Google Scholar 

  10. Gerkey, B., Vaughan, R., Howard, A.: The player/stage project: Tools for multi-robot and distributed sensor systems. In: Proc. ICRA 2003 (January 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schoenig, A., Pagnucco, M. (2010). Evaluating Sequential Single-Item Auctions for Dynamic Task Allocation. In: Li, J. (eds) AI 2010: Advances in Artificial Intelligence. AI 2010. Lecture Notes in Computer Science(), vol 6464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17432-2_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17432-2_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17431-5

  • Online ISBN: 978-3-642-17432-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics