File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Synchronization seeking in multi-agent dynamic systems with communication uncertainties

TitleSynchronization seeking in multi-agent dynamic systems with communication uncertainties
Authors
KeywordsEigenvalues
First-order
Laplacian matrices
Linear matrix inequality problems
Lyapunov stability theory
Issue Date2011
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000119
Citation
The 2011 IEEE International Symposium on Computer-Aided Control System Design (CACSD), Denver, CO., 28-30 September 2011. In IEEE CACSD International Symposium Proceedings, 2011, p. 656-661 How to Cite?
AbstractThis paper addresses robust consensus problems among multiple agents with uncertain parameters constrained in a given set. Specifically, the network coefficients are supposed polynomial functions of an uncertain vector constrained in a set described by polynomial inequalities. First, the paper provides a necessary and sufficient condition for robust first-order consensus based on the eigenvalues of the uncertain Laplacian matrix. Based on this condition, a sufficient condition for robust first-order consensus is derived by solving a linear matrix inequality (LMI) problem built by exploiting sum-of-squares (SOS) polynomials. Then, the paper provides a necessary and sufficient condition for robust second-order consensus through the uncertain expanded Laplacian matrix and Lyapunov stability theory. Based on this condition, a sufficient condition for robust second-order consensus is derived by solving an LMI problem built by exploiting SOS matrix polynomials. Some numerical examples illustrate the proposed results. © 2011 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/153077
ISBN
References

 

DC FieldValueLanguage
dc.contributor.authorHan, Den_US
dc.contributor.authorChesi, Gen_US
dc.contributor.authorHung, YSen_US
dc.date.accessioned2012-07-16T09:55:45Z-
dc.date.available2012-07-16T09:55:45Z-
dc.date.issued2011en_US
dc.identifier.citationThe 2011 IEEE International Symposium on Computer-Aided Control System Design (CACSD), Denver, CO., 28-30 September 2011. In IEEE CACSD International Symposium Proceedings, 2011, p. 656-661en_US
dc.identifier.isbn978-1-4577-1067-4-
dc.identifier.urihttp://hdl.handle.net/10722/153077-
dc.description.abstractThis paper addresses robust consensus problems among multiple agents with uncertain parameters constrained in a given set. Specifically, the network coefficients are supposed polynomial functions of an uncertain vector constrained in a set described by polynomial inequalities. First, the paper provides a necessary and sufficient condition for robust first-order consensus based on the eigenvalues of the uncertain Laplacian matrix. Based on this condition, a sufficient condition for robust first-order consensus is derived by solving a linear matrix inequality (LMI) problem built by exploiting sum-of-squares (SOS) polynomials. Then, the paper provides a necessary and sufficient condition for robust second-order consensus through the uncertain expanded Laplacian matrix and Lyapunov stability theory. Based on this condition, a sufficient condition for robust second-order consensus is derived by solving an LMI problem built by exploiting SOS matrix polynomials. Some numerical examples illustrate the proposed results. © 2011 IEEE.-
dc.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000119-
dc.relation.ispartofIEEE International Symposium on Computer-Aided Control System Design Proceedingsen_US
dc.rightsIEEE International Symposium on Computer-Aided Control System Design Proceedings. Copyright © IEEE.-
dc.rights©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectEigenvalues-
dc.subjectFirst-order-
dc.subjectLaplacian matrices-
dc.subjectLinear matrix inequality problems-
dc.subjectLyapunov stability theory-
dc.titleSynchronization seeking in multi-agent dynamic systems with communication uncertaintiesen_US
dc.typeConference_Paperen_US
dc.identifier.emailHan, D: dongkhan@hku.hken_US
dc.identifier.emailChesi, G: chesi@eee.hku.hken_US
dc.identifier.emailHung, YS: yshung@eee.hku.hk-
dc.identifier.authorityChesi, G=rp00100en_US
dc.identifier.authorityHung, YS=rp00220en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/CACSD.2011.6044567-
dc.identifier.scopuseid_2-s2.0-80755171484-
dc.identifier.hkuros201443en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-80755171484&selection=ref&src=s&origin=recordpage-
dc.identifier.spage656-
dc.identifier.epage661-
dc.publisher.placeUnited States-
dc.description.otherThe 2011 IEEE International Symposium on Computer-Aided Control System Design (CACSD), Denver, CO., 28-30 September 2011. In IEEE CACSD International Symposium Proceedings, 2011, p. 656-661-
dc.identifier.scopusauthoridHan, D=54383251000-
dc.identifier.scopusauthoridChesi, G=7006328614-
dc.identifier.scopusauthoridHung, YS=8091656200-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats