Skip to main content

Performance Evaluation of Repeated Auctions for Robust Task Execution

  • Conference paper
Simulation, Modeling, and Programming for Autonomous Robots (SIMPAR 2008)

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

Abstract

We present empirical results of an auction-based algorithm for dynamic allocation of tasks to robots. The results have been obtained both in simulation and using real robots. A distinctive feature of our algorithm is its robustness to uncertainties and to robot malfunctions that happen during task execution, when unexpected obstacles, loss of communication, and other delays may prevent a robot from completing its allocated tasks. Therefore tasks not yet achieved are resubmitted for bids every time a task has been completed. This provides an opportunity to improve the allocation of the remaining tasks, enabling the robots to recover from failures and reducing the overall time for task completion.

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. Agassounon, W., Martinoli, A.: Efficiency and robustness of threshold-based distributed allocation algorithms in multi-agent systems. In: Proc. of the 1st Int’l Conf. on Autonomous Agents and Multi-Agent Systems, pp. 1090–1097 (July 2002)

    Google Scholar 

  2. Berhault, M., Huang, H., Keskinocak, P., Koenig, S., Elmaghraby, W., Griffin, P., Kleywegt, A.: Robot exploration with combinatorial auctions. In: Proc. IEEE/RSJ Int’l Conf. on Intelligent Robots and Systems (2003)

    Google Scholar 

  3. Chien, S., Barrett, A., Estlin, T., Rabideau, G.: A comparison of coordinated planning methods for cooperating rovers. In: Proc. of the Int’l Conf. on Autonomous Agents, pp. 100–101. ACM Press, New York (2000)

    Google Scholar 

  4. Dias, M.B., Stentz, A.: A free market architecture for distributed control of a multirobot system. In: Proc. of the Int’l Conf. on Intelligent Autonomous Systems, Venice, Italy, pp. 115–122 (July 2000)

    Google Scholar 

  5. Dias, M.B., Zinck, M.B., Zlot, R.M., Stentz, A.T.: Robust multirobot coordination in dynamic environments. In: Proc. Int’l Conf. on Robotics and Automation (April 2004)

    Google Scholar 

  6. Dias, B., Zlot, R.M., Kalra, N., Stentz, A.T.: Market-based multirobot coordination: A survey and analysis. Technical Report CMU-RI-TR-05-13, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA (April 2005)

    Google Scholar 

  7. Engelmore, R.S., Morgan, A. (eds.): Blackboard Systems. Addison-Wesley, Reading (1988)

    Google Scholar 

  8. Gerkey, B.P., Matarić, M.J.: Sold!: Auction methods for multi-robot coordination. IEEE Trans. on Robotics and Automation 18(5) (October 2002)

    Google Scholar 

  9. Gerkey, B.P., Matarić, M.J.: Multi-robot task allocation: Analyzing the complexity and optimality of key architectures. In: Proc. Int’l Conf. on Robotics and Automation (September 2003)

    Google Scholar 

  10. Gerkey, B.P., Vaughan, R.T., Howard, A.: The Player/Stage project: Tools for multi-robot and distributed sensor systems. In: Proc Int’l Conf on Advanced Robotics, pp. 317–323 (June 2003)

    Google Scholar 

  11. Kalra, N., Ferguson, D., Stentz, A.: Hoplites: A market-based framework for planned tight coordination in multirobot teams. In: Proc. Int’l Conf. on Robotics and Automation (2005)

    Google Scholar 

  12. 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. of the National Conf. on Artificial Intelligence, pp. 1625–1629 (2006)

    Google Scholar 

  13. Kuffner, J.J., LaValle, S.M.: RRT-connect: An efficient approach to single-query path planning. In: Proc. Int’l Conf. on Robotics and Automation, pp. 995–1001 (2000)

    Google Scholar 

  14. Lagoudakis, M.G., Markakis, E., Kempe, D., Keskinocak, P., Kleywegt, A., Koenig, S., Tovey, C., Meyerson, A., Jain, S.: Auction-based multi-robot routing. In: Robotics: Science and Systems, Cambridge, USA (June 2005)

    Google Scholar 

  15. Nanjanath, M., Gini, M.: Auctions for task allocation to robots. In: Proc. of the Int’l Conf. on Intelligent Autonomous Systems, Tokyo, Japan, pp. 550–557 (March 2006)

    Google Scholar 

  16. Nanjanath, M., Gini, M.: Dynamic task allocation in robots via auctions. In: Proc. Int’l Conf. on Robotics and Automation (2006)

    Google Scholar 

  17. Tovey, C., Lagoudakis, M., Jain, S., Koenig, S.: The generation of bidding rules for auction-based robot coordination. In: Multi-Robot Systems Workshop (March 2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nanjanath, M., Gini, M. (2008). Performance Evaluation of Repeated Auctions for Robust Task Execution. In: Carpin, S., Noda, I., Pagello, E., Reggiani, M., von Stryk, O. (eds) Simulation, Modeling, and Programming for Autonomous Robots. SIMPAR 2008. Lecture Notes in Computer Science(), vol 5325. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89076-8_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89076-8_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89075-1

  • Online ISBN: 978-3-540-89076-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics