Auction algorithm sensitivity for multi-robot task allocation

DOI10.1016/j.automatica.2023.111239zbMath1530.93315arXiv2306.16032MaRDI QIDQ6066800

Katie Clinch, Tony A. Wood, Chris Manzie

Publication date: 16 November 2023

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2306.16032

zbMATH Keywords

robustnesssensitivity analysisapproximation algorithmtravelling salesman problemminimum spanning treeauction algorithmtask assignment

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites Work

• Unnamed Item
• Approaches to sensitivity analysis in linear programming
• Assignment problems: a golden anniversary survey
• The Vehicle Routing Problem
• Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
• SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
• Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
• An improved approximation algorithm for ATSP
• A (slightly) improved approximation algorithm for metric TSP

This page was built for publication: Auction algorithm sensitivity for multi-robot task allocation