University of Notre Dame
Browse

File(s) under permanent embargo

Distributed coordination of multi-agent systems based on estimation over ad-hoc communication networks

thesis
posted on 2007-07-18, 00:00 authored by Yashan Sun
A common feature of distributed coordinated multiple agent systems is that multi-agent cooperation is accomplished through interactions between agents wherein information is exchanged across a wireless communication network. Distributed coordinated control of multi-agent system poses several meaningful theoretical and practical challenges.

In this work, we consider three important and related issues:communication logics, swarm cohesion under consensus and the convergence rate of consensus filter under network throughput limitations.

Optimal communication logics are investigated for scheduling the information exchange required to minimize the total energy consumed in the system. We study two different communication logics. An optimal open-loop logic is that each agent periodically transmits information to its neighbors. For comparison, a closed-loop logic is studied to schedule transmissions when the local state estimation error is above a preset threshold. We theoretically analyze the optimal deterministic threshold-based logic performance and compare it with the proposed periodic logic.

Cohesion of multi-agent swarms moving under the control of a consensus filter is studied. The main result shows that swarming under consensus is cohesive. We establish specific bounds on the degree of cohesion and consensus level. We prove that if the communication graph is regular, then the introduction of integral action into the consensus filter achieves perfect consensus regardless of the number of members.

The convergence rate of consensus filters under throughput limitations is examined. We present two consensus filter schemes, synchronous and asynchronous. Synchronous consensus obeys the principle wherein individual agents regulate their states only after receiving all neighbors' messages. While, in asynchronous consensus, each agent updates its state when it receives any message from any neighbor. We exhibit a theoretical approach to analyzing the impact throughput limitations have on the convergence rate of the two consensus schemes.

We demonstrate the specific advantages of these schemes. In order to test these coordinated control algorithms in a real multi-robot system, we developed a software multi-robot simulator and real robot testbeds. Our developed simulator and testbeds are introduced.

History

Date Modified

2017-06-02

Defense Date

2007-07-09

Research Director(s)

X. Sharon Hu

Committee Members

Bill Goodwine Michael Lemmon Peter Bauer X. Sharon Hu

Degree

  • Doctor of Philosophy

Degree Level

  • Doctoral Dissertation

Language

  • English

Alternate Identifier

etd-07182007-170420

Publisher

University of Notre Dame

Program Name

  • Electrical Engineering

Usage metrics

    Dissertations

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC