• Home
  • Search
  • Auctions for multi-robot task allocation in communication limited environments
  • Cite Icon156
  • https://doi.org/10.1007/s10514-019-09828-5Copy DOI Icon

Auctions for multi-robot task allocation in communication limited environments

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We consider the problem of multi-robot task allocation using auctions, and study how lossy communication between the auctioneer and bidders affects solution quality. We demonstrate both analytically and experimentally that even though many auction algorithms have similar performance when communication is perfect, different auctions degrade in different ways as communication quality decreases from perfect to nonexistent. Thus, if a multi-robot system is expected to encounter lossy communication, then the auction algorithm that it uses for task allocation must be chosen carefully. We compare six auction algorithms including: standard implementations of the Sequential Auction, Parallel Auction, Combinatorial Auction; a generalization of the Prim Allocation Auction called G-Prim; and two multi-round variants of a Repeated Parallel Auction. Variants of these auctions are also considered in which award information from previous rounds is rebroadcast by the auctioneer during later rounds. We consider a variety of valuation functions used by the bidders, including: the total and maximum distance traveled (for distance based cost functions), the expected profit or cost to a robot (assuming robots’ task values are drawn from a random distribution). Different auctioneer objectives are also evaluated, and include: maximizing profit (max sum), minimizing cost (min sum), and minimizing the maximum distance traveled by any particular robot (min max). In addition to the cost value functions that are used, we are also interested in fleet performance statistics such as the expected robot utilization rate, and the expected number of items won by each robot. Experiments are performed both in simulation and on real AscTec Pelican quad-rotor aircraft. In simulation, each algorithm is considered across communication qualities ranging from perfect to nonexistent. For the case of the distance-based cost functions, the performance of the auctions is compared using two different communication models: (1) a Bernoulli model and (2) the Gilbert–Elliot model. The particular auction that performs the best changes based on the the reliability of the communication between the bidders and the auctioneer. We find that G-Prim and its repeated variant perform relatively well when communication is poor, and that re-sending winner data in later rounds is an easy way improve the performance of multi-round auctions, in general.

Similar Papers
  • Research Article
  • Citations623

A comprehensive taxonomy for multi-robot task allocation

  • Oct 01, 2013
  • The International Journal of Robotics Research
  • G Ayorkor Korsah +2
  • PDF
  • Research Article
  • Citations16

Research on Multirobot Pursuit Task Allocation Algorithm Based on Emotional Cooperation Factor

  • Jan 01, 2014
  • The Scientific World Journal
  • Baofu Fang +4
  • Conference Article
  • Citations11

Multi-robot terrain coverage and task allocation for autonomous detection of landmines

  • May 01, 2012
  • Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE
  • Prithviraj Dasgupta +2
  • PDF
  • Research Article
  • Citations38

Multirobot task allocation based on an improved particle swarm optimization approach

  • May 01, 2017
  • International Journal of Advanced Robotic Systems
  • Zhanxia Zhu +2
  • Conference Article
  • Citations3

An Optimized Multirobot Task Allocation

  • Jan 01, 2008
  • Bibhuti Bhusan Choudhury +1
  • Conference Article

Optimized Multi-Robot Task Allocation for Efficient Raw Material Supply in Smart Factories

  • Jun 06, 2025
  • Chenxi Lyu +7
  • Conference Article
  • Citations2

Multi-robot task allocation for airport runway inspection

  • Aug 15, 2022
  • Andong Shi +3
  • Research Article
  • Citations64

Dynamic task allocation for multi-robot search and retrieval tasks

  • Mar 10, 2016
  • Applied Intelligence
  • Changyun Wei +2
  • Research Article
  • Citations9

Development of a task-oriented, auction-based task allocation framework for a heterogeneous multirobot system

  • May 09, 2020
  • Sādhanā
  • Tan Eijyne +2
  • Research Article
  • Citations10

ACD3GPSO: automatic clustering-based algorithm for multi-robot task allocation using dynamic distributed double-guided particle swarm optimization

  • Sep 26, 2019
  • Assembly Automation
  • Asma Ayari +1
  • Conference Article
  • Citations2

Together We Rise: Optimizing Real-Time Multi-Robot Task Allocation using Coordinated Heterogeneous Plays

  • May 28, 2025
  • Aritra Pal +2
  • Conference Article
  • Citations4

Consensus-Based Artificial Potential Field Approach for Swarm

  • Dec 14, 2021
  • Manao Machida +1
  • Research Article
  • Citations44

Assignment Algorithms for Modeling Resource Contention in Multirobot Task Allocation

  • Jul 01, 2015
  • IEEE Transactions on Automation Science and Engineering
  • Changjoo Nam +1
  • Conference Article
  • Citations56

SET: An algorithm for distributed multirobot task allocation with dynamic negotiation based on task subsets

  • Apr 01, 2007
  • Proceedings - IEEE International Conference on Robotics and Automation/Proceedings
  • Antidio Viguria +2
  • Research Article
  • Citations1

A Study on Multi-Robot Task Allocation in Railway Scenarios Based on the Improved NSGA-II Algorithm.

  • Feb 07, 2025
  • Sensors (Basel, Switzerland)
  • Yanni Shen +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.