Publication

Auction algorithm sensitivity for multi-robot task allocation

Tony Alan Wood
2023
Journal Articles

Abstract

We consider the problem of finding a low-cost allocation and ordering of tasks between a team of robots in a d-dimensional, uncertain, landscape, and the sensitivity of this solution to changes in the cost function.Various algorithms have been shown to give a 2-approximation to the MINSUM allocation problem. By analysing such an auction algorithm, we obtain intervals on each cost, such that any fluctuation of the costs within these intervals will result in the auction algorithm outputting the same solution.

Official source

https://infoscience.epfl.ch/entities/publication/cf0c13af-025d-4178-9d25-4aa0834caf2e

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Auction algorithm sensitivity for multi-robot task allocation

Chat with Graph Search

Slack-variable Approach for Variational Quantum Semidefinite Programming

Carbonized wood impregnated with bimetallic nanoparticles as a monolithic continuous-flow microreactor for the reduction of 4-nitrophenol

Finding Nash equilibrium based on reinforcement learning for bidding strategy and distributed algorithm for ISO in imperfect electricity market