期刊
AUTOMATICA
卷 48, 期 9, 页码 2298-2304出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2012.06.040
关键词
Distributed simplex; Distributed linear programming; Asynchronous algorithm; Multi-agent task assignment
资金
- German Research Foundation within the Cluster of Excellence in Simulation Technology [EXC 310/1, SPP 1305]
- European Community [224428 (CHAT)]
- NSF [CPS-1035917]
- ARO [W911NF-11-1-0092]
- Division Of Computer and Network Systems
- Direct For Computer & Info Scie & Enginr [1035917] Funding Source: National Science Foundation
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. (C) 2012 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据