A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
From MaRDI portal
Publication:1937523
DOI10.1016/j.automatica.2012.06.040zbMath1257.93033OpenAlexW2045294654WikidataQ59048629 ScholiaQ59048629MaRDI QIDQ1937523
Mathias Bürger, Giuseppe Notarstefano, Frank Allgöwer, Bullo, Francesco
Publication date: 1 March 2013
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2012.06.040
Related Items
Modal consensus, synchronization and formation control with distributed endogenous internal models ⋮ Distributed Linear Programming with Event-Triggered Communication ⋮ Optimal role and position assignment in multi-robot freely reachable formations ⋮ Distributed proximal‐gradient algorithms for nonsmooth convex optimization of second‐order multiagent systems ⋮ Networked Systems Theory: Distributed Algorithms for Optimal Cooperation of Dynamical Systems ⋮ Multi-agent coordination over local indexes via clique-based distributed assignment
Uses Software
Cites Work
- Unnamed Item
- Selected topics on assignment problems
- ASYNPLEX, an asynchronous parallel revised simplex algorithm
- The auction algorithm: A distributed relaxation method for the assignment problem
- Lexicographic perturbation for multiparametric linear programming with applications to control
- An approach to nonlinear programming
- The Decomposition Algorithm for Linear Programs
- The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP
- Linear programming — Randomization and abstract frameworks
- Monotonic Target Assignment for Robotic Networks
- Constrained Consensus and Optimization in Multi-Agent Networks
- Distributed Task Assignment for Mobile Agents
- Distributed Abstract Optimization via Constraints Consensus: Theory and Applications
- On Distributed Convex Optimization Under Inequality and Equality Constraints
