Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

Repeated auctions for robust task execution by a robot team

Published: 01 July 2010 Publication History

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.

References

[1]
M. Nanjanath, M. Gini, Auctions for task allocation to robots, in: Proc. of the Int'l Conf. on Intelligent Autonomous Systems, Tokyo, Japan, Mar. 2006, pp. 550-557.
[2]
M.G. Lagoudakis, E. Markakis, D. Kempe, P. Keskinocak, A. Kleywegt, S. Koenig, C. Tovey, A. Meyerson, S. Jain, Auction-based multi-robot routing, in: Robotics: Science and Systems, Cambridge, USA, June 2005, pp. 343-350.
[3]
S. Koenig, C. Tovey, M. Lagoudakis, V. Markakis, D. Kempe, P. Keskinocak, A. Kleywegt, A. Meyerson, S. Jain, The power of sequential single-item auctions for agent coordination, in: Proc. of the National Conf. on Artificial Intelligence, 2006, pp. 1625-1629.
[4]
M.B. Dias, TraderBots: a market-based approach for resource, role, and task allocation in multirobot coordination. Ph.D. Thesis, Carnegie-Mellon University, 2004.
[5]
C. Tovey, M. Lagoudakis, S. Jain, S. Koenig, The generation of bidding rules for auction-based robot coordination in: Multi-Robot Systems Workshop, Mar. 2005, pp. 3-14.
[6]
Dias, M.B., Zlot, R.M., Kalra, N. and Stentz, A., Market-based multirobot coordination: a survey and analysis. Proceedings of the IEEE. v94 i7. 1257-1270.
[7]
N. Kalra, D. Ferguson, A. Stentz, Hoplites: a market-based framework for planned tight coordination in multirobot teams, in: Proc. Int'l Conf. on Robotics and Automation, 2005, pp. 1170-1177.
[8]
Gerkey, B.P. and Matarić, M.J., Sold!: auction methods for multi-robot coordination. IEEE Transactions on Robotics and Automation. v18 i5. 758-768.
[9]
B.P. Gerkey, M.J. Matarić, Multi-robot task allocation: analyzing the complexity and optimality of key architectures, in: Proc. Int'l Conf. on Robotics and Automation, Sept. 2003, pp. 3862-3867.
[10]
Chien, S., Barrett, A., Estlin, T. and Rabideau, G., A comparison of coordinated planning methods for cooperating rovers. In: Proc. of the Int'l Conf. on Autonomous Agents, ACM Press. pp. 100-101.
[11]
. In: Engelmore, R.S., Morgan, A. (Eds.), Blackboard Systems, Addison-Wesley.
[12]
Agassounon, W. and 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, ACM Press. pp. 1090-1097.
[13]
M. Berhault, H. Huang, P. Keskinocak, S. Koenig, W. Elmaghraby, P. Griffin, A. Kleywegt, Robot exploration with combinatorial auctions, in: Proc. IEEE/RSJ Int'l Conf. on Intelligent Robots and Systems, 2003, pp. 1957-1962.
[14]
M.B. Dias, M.B. Zinck, R.M. Zlot, A. Stentz, Robust multirobot coordination in dynamic environments, in: Proc. Int'l Conf. on Robotics and Automation, April 2004, pp. 3435-3442.
[15]
J.J. Kuffner, S.M. LaValle, RRT-connect: an efficient approach to single-query path planning, in: Proc. Int'l Conf. on Robotics and Automation, 2000, pp. 995-1001.
[16]
M. Nanjanath, M. Gini, Dynamic task allocation in robots via auctions, in: Proc. Int'l Conf. on Robotics and Automation, Orlando, FL, May 2006, pp. 2781-2786.
[17]
Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C., Introduction to Algorithms. 2001. second ed.
[18]
B.P. Gerkey, R.T. Vaughan, A. Howard, The player/stage project: tools for multi-robot and distributed sensor systems, in: Proc Int'l Conf on Advanced Robotics, June 2003, pp. 317-323.
[19]
Collins, J. and Gini, M., Magnet: a multi-agent system using auctions with temporal and precedence constraints. In: Chaib-draa, B., Müller, J. (Eds.), Multiagent based Supply Chain Management, vol. 28. Springer. pp. 273-314.

Cited By

View all
  • (2024)On-line task allocation for multi-robot teams under dynamic scenariosIntelligent Decision Technologies10.3233/IDT-23069318:2(1053-1076)Online publication date: 1-Jan-2024
  • (2024)Distributed Matching-By-Clone Hungarian-Based Algorithm for Task Allocation of Multiagent SystemsIEEE Transactions on Robotics10.1109/TRO.2023.333565640(851-863)Online publication date: 1-Jan-2024
  • (2023)Ask and You Shall be Served: Representing & Solving Multi-agentOptimization Problems with Service Requesters and ProvidersProceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems10.5555/3545946.3598622(77-85)Online publication date: 30-May-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Robotics and Autonomous Systems
Robotics and Autonomous Systems  Volume 58, Issue 7
July, 2010
102 pages

Publisher

North-Holland Publishing Co.

Netherlands

Publication History

Published: 01 July 2010

Author Tags

  1. Auctions
  2. Multi-robot teams
  3. Task allocation

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)On-line task allocation for multi-robot teams under dynamic scenariosIntelligent Decision Technologies10.3233/IDT-23069318:2(1053-1076)Online publication date: 1-Jan-2024
  • (2024)Distributed Matching-By-Clone Hungarian-Based Algorithm for Task Allocation of Multiagent SystemsIEEE Transactions on Robotics10.1109/TRO.2023.333565640(851-863)Online publication date: 1-Jan-2024
  • (2023)Ask and You Shall be Served: Representing & Solving Multi-agentOptimization Problems with Service Requesters and ProvidersProceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems10.5555/3545946.3598622(77-85)Online publication date: 30-May-2023
  • (2023)Auction-Based Task Allocation and Motion Planning for Multi-Robot Systems with Human SupervisionJournal of Intelligent and Robotic Systems10.1007/s10846-023-01935-x109:2Online publication date: 16-Sep-2023
  • (2023)Market Approaches to the Multi-Robot Task Allocation Problem: a SurveyJournal of Intelligent and Robotic Systems10.1007/s10846-022-01803-0107:2Online publication date: 14-Feb-2023
  • (2022)A Flexible Framework for Diverse Multi-Robot Task Allocation Scenarios Including Multi-TaskingACM Transactions on Autonomous and Adaptive Systems10.1145/350220016:1(1-23)Online publication date: 23-Jan-2022
  • (2021)Fuzzy coordination through measure information sharing of multi-robot systemJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology10.3233/JIFS-18968241:3(4203-4210)Online publication date: 1-Jan-2021
  • (2021)Coordinating Human-Robot Teams with Dynamic and Stochastic Task ProficienciesACM Transactions on Human-Robot Interaction10.1145/347739111:1(1-42)Online publication date: 18-Oct-2021
  • (2021)Towards addressing dynamic multi-agent task allocation in law enforcementAutonomous Agents and Multi-Agent Systems10.1007/s10458-021-09494-x35:1Online publication date: 1-Apr-2021
  • (2020)Market Clearing–based Dynamic Multi-agent Task AllocationACM Transactions on Intelligent Systems and Technology10.1145/335646711:1(1-25)Online publication date: 21-Jan-2020
  • Show More Cited By

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media