Abstract | ||
---|---|---|
Distributed cooperative systems have optimization problems in their tasks. Supporting the collaborations of users, or sharing communications/observations/energy resources, are formalized as optimization problems. Therefore, distributed optimization methods are important as the basis of distributed cooperation. In particular, to handle problems whose variables have continuous domains, solvers based on numerical calculation techniques are important. In a related work, a linear programming method, in which each agent locally performs the simplex method and exchanges the sets of bases. has been proposed. On the other hand, there is another interest in the cooperative algorithm based on El linear program method whose steps of processing are more distributed among agents. In this work, we study the framework of distributed cooperation based on a distributed linear programming method. |
Year | DOI | Venue |
---|---|---|
2012 | 10.5220/0003750702280233 | ICAART: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL. 2 |
Keywords | Field | DocType |
Multi-agent,Distributed cooperative problem solving,Linear programming,Optimization | Computer science,Theoretical computer science,Linear programming | Conference |
Citations | PageRank | References |
1 | 0.39 | 0 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Toshihiro Matsui | 1 | 380 | 62.51 |
Hiroshi Matsuo | 2 | 47 | 10.97 |