2,312 publications from this institution
Without assuming that the mobile agents can communicate with their neighbors all the time, the consensus problem of multi-agent systems with general linear node dynamics and a fixed directed topology is investigated. To achieve consensus, a new class of distributed protocols designed based only on the intermittent relative information are presented. By using tools from matrix analysis and switching systems theory, it is theoretically shown that the consensus in multi-agent systems with a periodic intermittent communication and directed topology containing a spanning tree can be cast into the stability of a set of low-dimensional switching systems. It is proved that there exists a protocol guaranteeing consensus if each agent is stabilizable and the communication rate is larger than a threshold value. Furthermore, a multi-step intermittent consensus protocol design procedure is provided. The consensus algorithm is then extended to solve the formation control problem of linear multi-agent systems with intermittent communication constraints as well as the consensus tracking problem with switching directed topologies. Finally, some numerical simulations are provided to verify the effectiveness of the theoretical results. Copyright © 2013 John Wiley & Sons, Ltd.
Dynamics of chaotic maps in an infinite-precision domain have been established complete mathematical framework. The case in finite-precision computer remains to be further explored. The related previous works treated a digital chaotic map as a black box and gave different explanations according to the test results of the output. Using the Logistic and Tent maps as typical examples, we disclose some dynamical properties of chaotic maps in fixed-point arithmetic by studying its corresponding state-mapping network (SMN), where every possible value is considered as a node and the mapping relation existing between any pair of nodes works as a directed edge. The scale-free properties of SMN are quantitatively proven. The obtained results can be extended to the scenario of floating-point arithmetic and to other chaotic maps. Understanding the real network structure of SMN of a chaotic map in the digital computer can facilitate counteracting dynamics degeneration of digital chaotic maps, which also help evaluate and improve the randomness of pseudo-random number sequences generated by iterating chaotic maps.