CaltechTHESIS
  A Caltech Library Service

Coordinated control for networked multi-agent systems

Citation

Jin, Zhipu (2007) Coordinated control for networked multi-agent systems. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechETD:etd-09182006-162259

Abstract

Coordination in networked multi-agent systems attracts significant interest in the realm of engineering. Typical examples include formations of unmanned aerial vehicles, automated highway systems, and sensor networks. One common feature for these systems is that coordinated behaviors are exhibited by interactions among agents where information exchange and manipulation are necessary. In this work, three relevant issues are investigated in detail: uniform strategy for multi-agent formation control, fast-converging consensus protocols, and packet-based state estimation over communication networks.

Formation control of multi-agent systems involves harmony among local controller design, interaction topology analysis, and objective agreement among networked agents. We propose a novel control strategy so that each agent responds to neighbors' behaviors as well as acts towards the global goal. Thus, information flows for local interactions and global objective synchronization are studied separately. Using the tools from signal flow graphs and algebraic graph theory, we show that this new strategy eases the design of local controllers by relaxing stabilizing conditions. Robustness against the link failure and scalable disturbance resistance are also discussed based on small-gain theory. Experimental results on the Caltech multi-vehicle wireless testbed are provided to verify the feasibility and efficiency of this control strategy.

Consensus protocols over communication networks are used to achieve agreement among agents. One important issue is the convergence speed. We propose multi-hop relay protocols for fast consensus seeking. Without physically changing the topology of the communication network, this type of distributed protocol increases the algebraic connectivity by employing multi-hop paths in the network. We also investigate the convergence behaviors of consensus protocols with communication delays. It is interesting that, the faster the protocol converges, the more sensitive it is to the delay. This tradeoff is identified when we investigate delay margins of multi-hop relay protocols using the frequency sweep method.

Efficiently estimating the states of other agents over communication links is also discussed in this work. When information flows in the network, packet-based data is normally not retransmitted in order to satisfy real-time requirements. Thus, packet drops and random delays are inevitable. In this context, observation data that the estimator can receive is intermittent. In order to decrease the chance of losing packets and efficiently using the limited bandwidth, we introduce multiple description source codes to manipulate the data before transmission. Using modified algebraic Riccati equations, we show that multiple description codes improve the performance of Kalman filters over a large set of packet-dropping scenarios. This problem is also generalized to the case where observation data has an independent and identical static distribution over a finite set of observation noise. Moreover, Kalman filtering with bursty packet drops is also discussed based on the two-state Markov chain model.

Item Type:Thesis (Dissertation (Ph.D.))
Subject Keywords:consensus protocol; coordinated control; formation control; Kalman filter; multiple description coding; networked multi-agent system; packet-based state estimation
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Electrical Engineering
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Murray, Richard M.
Thesis Committee:
  • Murray, Richard M. (chair)
  • Hassibi, Babak
  • Burdick, Joel Wakeman
  • Doyle, John Comstock
  • Ho, Tracey C.
Defense Date:1 September 2006
Author Email:jzp (AT) caltech.edu
Record Number:CaltechETD:etd-09182006-162259
Persistent URL:http://resolver.caltech.edu/CaltechETD:etd-09182006-162259
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:3625
Collection:CaltechTHESIS
Deposited By: Imported from ETD-db
Deposited On:21 Sep 2006
Last Modified:26 Dec 2012 03:01

Thesis Files

[img]
Preview
PDF (Thesis_ZJ_Caltech_07.pdf) - Final Version
See Usage Policy.

1104Kb

Repository Staff Only: item control page