A distributed simplex algorithm for degenerate linear programs and multi-agent assignments

In this paper we propose a novel distributed algorithm to solve degenerate linear programs on asynchronous peer-to-peer networks with distributed information structures. We propose a distributed version of the well-known simplex algorithm for general degenerate linear programs. A network of agents,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Automatica (Oxford) Ročník 48; číslo 9; s. 2298 - 2304
Hlavní autoři: Bürger, Mathias, Notarstefano, Giuseppe, Bullo, Francesco, Allgöwer, Frank
Médium: Journal Article
Jazyk:angličtina
Vydáno: Kidlington Elsevier Ltd 01.09.2012
Elsevier
Témata:
Algorithms
Applied sciences
Artificial intelligence
Asynchronous algorithm
Completion time
Computer science; control theory; systems
Computer simulation
Computer systems and distributed systems. User interface
Distributed linear programming
Distributed simplex
Exact sciences and technology
Graphs
Multi-agent task assignment
Multiagent systems
Networks
Optimization
Running
Software
Distributed linear programming
Asynchronous algorithm
Multi-agent task assignment
Distributed simplex
Network structure
Peer to peer
Degenerate system
Task scheduling
Linear programming
Distributed system
Intelligent agent
Multiagent system
Information network
Simplex method
Optimal solution
Distributed algorithm
Communication graph
Information structure
Artificial intelligence
Diameter
Infeasibility
Execution time
Asynchronous transmission
ISSN:0005-1098, 1873-2836
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper we propose a novel distributed algorithm to solve degenerate linear programs on asynchronous peer-to-peer networks with distributed information structures. We propose a distributed version of the well-known simplex algorithm for general degenerate linear programs. A network of agents, running our algorithm, will agree on a common optimal solution, even if the optimal solution is not unique, or will determine infeasibility or unboundedness of the problem. We establish how the multi-agent assignment problem can be efficiently solved by means of our distributed simplex algorithm. We provide simulations supporting the conjecture that the completion time scales linearly with the diameter of the communication graph.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2012.06.040