A matrix inequality based design method for consensus problems in multi-agent systems
Shohei Okuno; Joe Imae; Tomoaki Kobayashi
International Journal of Applied Mathematics and Computer Science (2009)
- Volume: 19, Issue: 4, page 639-646
- ISSN: 1641-876X
Access Full Article
topAbstract
topHow to cite
topShohei Okuno, Joe Imae, and Tomoaki Kobayashi. "A matrix inequality based design method for consensus problems in multi-agent systems." International Journal of Applied Mathematics and Computer Science 19.4 (2009): 639-646. <http://eudml.org/doc/207962>.
@article{ShoheiOkuno2009,
abstract = {In this paper, we study a consensus problem in multi-agent systems, where the entire system is decentralized in the sense that each agent can only obtain information (states or outputs) from its neighbor agents. The existing design methods found in the literature are mostly based on a graph Laplacian of the graph which describes the interconnection structure among the agents, and such methods cannot deal with complicated control specification. For this purpose, we propose to reduce the consensus problem at hand to the solving of a strict matrix inequality with respect to a Lyapunov matrix and a controller gain matrix, and we propose two algorithms for solving the matrix inequality. It turns out that this method includes the existing Laplacian based method as a special case and can deal with various additional control requirements such as the convergence rate and actuator constraints.},
author = {Shohei Okuno, Joe Imae, Tomoaki Kobayashi},
journal = {International Journal of Applied Mathematics and Computer Science},
keywords = {multi-agent systems; consensus; decentralized control; graph Laplacian; matrix inequality; LMI},
language = {eng},
number = {4},
pages = {639-646},
title = {A matrix inequality based design method for consensus problems in multi-agent systems},
url = {http://eudml.org/doc/207962},
volume = {19},
year = {2009},
}
TY - JOUR
AU - Shohei Okuno
AU - Joe Imae
AU - Tomoaki Kobayashi
TI - A matrix inequality based design method for consensus problems in multi-agent systems
JO - International Journal of Applied Mathematics and Computer Science
PY - 2009
VL - 19
IS - 4
SP - 639
EP - 646
AB - In this paper, we study a consensus problem in multi-agent systems, where the entire system is decentralized in the sense that each agent can only obtain information (states or outputs) from its neighbor agents. The existing design methods found in the literature are mostly based on a graph Laplacian of the graph which describes the interconnection structure among the agents, and such methods cannot deal with complicated control specification. For this purpose, we propose to reduce the consensus problem at hand to the solving of a strict matrix inequality with respect to a Lyapunov matrix and a controller gain matrix, and we propose two algorithms for solving the matrix inequality. It turns out that this method includes the existing Laplacian based method as a special case and can deal with various additional control requirements such as the convergence rate and actuator constraints.
LA - eng
KW - multi-agent systems; consensus; decentralized control; graph Laplacian; matrix inequality; LMI
UR - http://eudml.org/doc/207962
ER -
References
top- Boyd, S., El Ghaoui, L., Feron, E. and Balakrishnan, V. (1994). Linear Matrix Inequalities in System and Control Theory, SIAM, Philadelphia, PA. Zbl0816.93004
- Fax, J. A. (2001). Optimal and Cooperative Control of Vehicle Formations, Ph.D. dissertation, Control Dynamical Systems, California Institute of Technology, Pasadena, CA.
- Fax, J. A. and Murray, R. M. (2004). Information flow and cooperative control of vehicle formations, IEEE Transactions on Automatic Control 49(9): 1465-1476.
- Gahinet, P., Nemirovskii, A., Laub, A. and Chilali, M. (1994). The LMI control toolbox, Proceedings of the 33rd IEEE Conference on Decision and Control, Orlando, FL, USA, pp. 2038-2041.
- Godsil, C. and Royle, G. (2001). Algebraic Graph Theory, Springer-Verlag, Berlin. Zbl0968.05002
- Khalil, H. K. (2002). Nonlinear Systems, 2nd Edn., Prentice Hall, Upper Saddle River, NJ. Zbl1003.34002
- Lancaster, P. and Tismenetsky, M. (1985). The Theory of Matrices with Applications, 2nd Edn., Academic Press, Orlando, FL. Zbl0558.15001
- Olfati-Saber, R., Fax, J. A. and Murray, R. M. (2007). Consensus and cooperation in networked multi-agent systems, Proceedings of the IEEE 95(1): 215-233.
- Olfati-Saber, R. and Murray, R. M. (2003). Consensus protocols for networks of dynamic agents, Proceedings of the 2003 American Control Conference, Denver, CO, USA, pp. 951-956.
- Olfati-Saber, R. and Murray, R. M. (2004). Consensus problems in networks of agents with switching topology and time-delays, IEEE Transactions on Automatic Control 49(9): 1520-1533.
- Mohar, B. (1991). The Laplacian spectrum of graphs, in Y. Alavi, G. Chartrand, O. Ollermann and A. Schwenk (Eds.), Graph Theory, Combinatorics, and Applications, Wiley, New York, NY, pp. 871-898. Zbl0840.05059
- Pogromsky, A., Santoboni, G. and Nijmeijer, H. (2002). Partial synchronization: From symmetry towards stability, Physica D 172(1): 65-87. Zbl1008.37012
- Wang, J., Cheng, D. and Hu, X. (2008). Consensus of multiagent linear dynamic systems, Asian Journal of Control 10(2): 144-155.
- Zhai, G., Ikeda, M. and Fujisaki, Y. (2001). Decentralized controller design: A matrix inequality approach using a homotopy method, Automatica 37(4): 565-572. Zbl0982.93035
Citations in EuDML Documents
topNotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.