title: Guaranteed cost control of mobile sensor networks with Markov switching topologies.
abstract: This paper investigates the consensus seeking problem of mobile sensor networks (MSNs) with random switching topologies. The network communication topologies are composed of a set of directed graphs (or digraph) with a spanning tree. The switching of topologies is governed by a Markov chain. The consensus seeking problem is addressed by introducing a global topology-aware linear quadratic (LQ) cost as the performance measure. By state transformation, the consensus problem is transformed to the stabilization of a Markovian jump system with guaranteed cost. A sufficient condition for global mean-square consensus is derived in the context of stochastic stability analysis of Markovian jump systems. A computational algorithm is given to synchronously calculate both the sub-optimal consensus controller gains and the sub-minimum upper bound of the cost. The effectiveness of the proposed design method is illustrated by three numerical examples.
authors.affiliation: School of Information Sciences and Technology, Dalian Maritime University, Linghai Road 1#, Dalian 116026, China.
authors.forename: Yuan
authors.initials: Y
authors.lastname: Zhao
authors.affiliation: School of Information Sciences and Technology, Dalian Maritime University, Linghai Road 1#, Dalian 116026, China. Electronic address: geguo@yeah.net.
authors.forename: Ge
authors.initials: G
authors.lastname: Guo
authors.affiliation: School of Information Sciences and Technology, Dalian Maritime University, Linghai Road 1#, Dalian 116026, China.
authors.forename: Lei
authors.initials: L
authors.lastname: Ding
keywords: Consensus; Guaranteed cost control; Markov switching topologies; Mean-square stability; Mobile sensor networks