Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/6064
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Xiong, W | - |
dc.contributor.author | Ho, DWC | - |
dc.contributor.author | Wang, Z | - |
dc.date.accessioned | 2011-12-12T09:35:18Z | - |
dc.date.available | 2011-12-12T09:35:18Z | - |
dc.date.issued | 2011 | - |
dc.identifier.citation | IEEE Transactions on Neural Networks, 22(8): 1231 - 1240, Aug 2011 | en_US |
dc.identifier.issn | 1045-9227 | - |
dc.identifier.uri | http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5936740&tag=1 | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/6064 | - |
dc.description | This is the post-print version of of the Article - Copyright @ 2011 IEEE | en_US |
dc.description.abstract | In this paper, the consensus problem of multiagent nonlinear directed networks (MNDNs) is discussed in the case that a MNDN does not have a spanning tree to reach the consensus of all nodes. By using the Lie algebra theory, a linear node-and-node pinning method is proposed to achieve a consensus of a MNDN for all nonlinear functions satisfying a given set of conditions. Based on some optimal algorithms, large-size networks are aggregated to small-size ones. Then, by applying the principle minor theory to the small-size networks, a sufficient condition is given to reduce the number of controlled nodes. Finally, simulation results are given to illustrate the effectiveness of the developed criteria. | en_US |
dc.description.sponsorship | This work was jointly supported by CityU under a research grant (7002355) and GRF funding (CityU 101109). | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | Absolute consensus | en_US |
dc.subject | Lie algebra | en_US |
dc.subject | Directed networks | en_US |
dc.subject | Graph Laplacian | en_US |
dc.subject | Node-and-node pinning method | en_US |
dc.subject | Pinning consensus | en_US |
dc.title | Consensus analysis of multiagent networks via aggregated and pinning approaches | en_US |
dc.type | Article | en_US |
dc.identifier.doi | http://dx.doi.org/10.1109/TNN.2011.2157938 | - |
pubs.organisational-data | /Brunel | - |
pubs.organisational-data | /Brunel/Brunel (Active) | - |
pubs.organisational-data | /Brunel/Brunel (Active)/School of Info. Systems, Comp & Maths | - |
pubs.organisational-data | /Brunel/Brunel Active Staff | - |
pubs.organisational-data | /Brunel/Brunel Active Staff/School of Information Systems, Computing and Mathematics | - |
pubs.organisational-data | /Brunel/Brunel Active Staff/School of Information Systems, Computing and Mathematics/IS and Computing | - |
pubs.organisational-data | /Brunel/Research Centres (RG) | - |
pubs.organisational-data | /Brunel/Research Centres (RG)/CIKM | - |
pubs.organisational-data | /Brunel/School of Information Systems, Computing and Mathematics (RG) | - |
pubs.organisational-data | /Brunel/School of Information Systems, Computing and Mathematics (RG)/CIKM | - |
Appears in Collections: | Publications Computer Science Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 358.43 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.