Consensus analysis of high-order linear swarm systems over random topologies

Author

Wang Zhong ; Xi Jianxiang ; Liu Guangbin ; Sun Yijie

Author_Institution

Dept. of Control Eng., Second Artillery Eng. Univ., Xi´an, China

fYear

2013

Firstpage

6964

Lastpage

6969

Abstract

Consensus problems of discrete-time high-order linear swarm systems over random topologies are considered. Based on the relative information of neighboring agents, distributed dynamic consensus protocols are proposed. The state space decomposition method is applied to discrete-time high-order linear swarm systems, a necessary and sufficient condition for consensus over random topologies with probability 1 is given and the explicit expression of the consensus function is presented. Numerical simulations are shown to demonstrate theoretical results.

Keywords

decentralised control; discrete time systems; linear systems; numerical analysis; probability; random processes; state-space methods; topology; consensus function; discrete-time high-order linear swarm systems; distributed dynamic consensus protocols; explicit expression; high-order linear swarm system consensus analysis; necessary and sufficient condition; numerical simulations; probability; random topologies; relative neighboring agent information; state space decomposition method; Electronic mail; Multi-agent systems; Network topology; Protocols; Switches; Topology; Consensus Analysis; Discrete-Time System; Random Topologies; Swarm System;

fLanguage

English

Publisher

ieee

Conference_Titel

Control Conference (CCC), 2013 32nd Chinese

Conference_Location

Xi´an

Type

conf

Filename

6640662