ANALYSIS FOR DISTRIBUTED COOPERATION BASED ON LINEAR PROGRAMMING METHOD

Toshihiro Matsui, Hiroshi Matsuo

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 a linear programming 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.

References

  1. Burger, M., Notarstefano, G., Allgower, F., and Bullo, F. (2011). A distributed simplex algorithm and the multiagent assignment problem. In American Control Conference, pages 2639-2644.
  2. Chvatal, V. (1983). Linear programming. W.H.Freeman Company.
  3. Ho, J. K. and Sundarraj, R. P. (1994). On the efficacy of distributed simplex algorithms for linear programming. Computational Optimization and Applications, 3:349-363.
  4. Mailler, R. and Lesser, V. (2004). Solving distributed constraint optimization problems using cooperative mediation. In 3rd International Joint Conference on Autonomous Agents and Multiagent Systems, pages 438- 445.
  5. Modi, P. J., Shen, W., Tambe, M., and Yokoo, M. (2005). Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 161(1-2):149-180.
  6. Petcu, A. and Faltings, B. (2005). A scalable method for multiagent constraint optimization. In 9th International Joint Conference on Artificial Intelligence, pages 266-271.
  7. Wei, E., Ozdaglar, A., and Jadbabaie, A. (2010). A distributed newton method for network utility maximization. In 49th IEEE Conference on Decision and Control, CDC 2010, pages 1816 -1821.
  8. Yarmish, G. and Van Slyke, R. (2009). A distributed, scaleable simplex method. The Journal of Supercomputing, 49:373-381.
Download


Paper Citation


in Harvard Style

Matsui T. and Matsuo H. (2012). ANALYSIS FOR DISTRIBUTED COOPERATION BASED ON LINEAR PROGRAMMING METHOD . In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-8425-96-6, pages 228-233. DOI: 10.5220/0003750702280233


in Bibtex Style

@conference{icaart12,
author={Toshihiro Matsui and Hiroshi Matsuo},
title={ANALYSIS FOR DISTRIBUTED COOPERATION BASED ON LINEAR PROGRAMMING METHOD},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2012},
pages={228-233},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003750702280233},
isbn={978-989-8425-96-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - ANALYSIS FOR DISTRIBUTED COOPERATION BASED ON LINEAR PROGRAMMING METHOD
SN - 978-989-8425-96-6
AU - Matsui T.
AU - Matsuo H.
PY - 2012
SP - 228
EP - 233
DO - 10.5220/0003750702280233