Change search
ReferencesLink to record
Permanent link

Direct link
Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139, United States.ORCID iD: 0000-0001-7309-8086
(School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332, United States)
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS.ORCID iD: 0000-0003-0177-1993
2010 (English)In: Automatica, ISSN 0005-1098, Vol. 46, no 1, 133-139 p.Article in journal (Refereed) Published
Abstract [en]

In this paper we derive a set of constraints that are sufficient to guarantee maintained connectivity in a leader-follower multi-agent network with proximity based communication topology. In the scenario we consider, only the leaders are aware of the global mission, which is to converge to a known destination point. Thus, the followers need to stay in contact with the group of leaders in order to reach the goal. In the paper we show that we can maintain the initial network structure, and thereby connectivity, by setting up bounds on the ratio of leaders-to-followers and on the magnitude of the goal attraction force experienced by the leaders. The results are first established for an initially complete communication graph and then extended to an incomplete graph. The results are illustrated by computer simulations.

Place, publisher, year, edition, pages
2010. Vol. 46, no 1, 133-139 p.
Keyword [en]
Connectivity graphs, Multi-agent networks, Consensus
National Category
Computational Mathematics
URN: urn:nbn:se:kth:diva-10909DOI: 10.1016/j.automatica.2009.10.014ISI: 000274405900016ScopusID: 2-s2.0-73049096074OAI: diva2:231586

QC 20150727

Available from: 2009-08-14 Created: 2009-08-14 Last updated: 2015-07-27Bibliographically approved
In thesis
1. Control and coordination of mobile multi-agent systems
Open this publication in new window or tab >>Control and coordination of mobile multi-agent systems
2009 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

In this thesis, various control problems originating from the field of mobile robotics are considered. In particular, the thesis deals with problems that are related to the interaction and coordination of multiple mobile units. The scientific contributions are presented in five papers that together constitute the main part of the thesis. The papers are preceded by a longer introductory part, in which some important results from control theory, data processing and robotics are reviewed.

In the first of the appended papers, two stabilizing tracking controls are proposed for a non-holonomic robot platform of unicycle type. Tolerance to errors and other properties of the controllers are discussed and a reactive obstacle avoidance control, that can easily be incorporated with the proposed tracking controls, is suggested. In Paper B, the results from Paper~A are extended to multi-agent systems. It is demonstrated how the tracking controls from Paper A can be used as building blocks when putting together formations of robots, in which each robot maintains a fixed position relative its neighbors during translation. In addition, switching between the different control functions is shown to be robust, implying that it is possible to change the shape of a formation on-line.

In the first two papers, the tracking problem is facilitated by the assumption that the approximate velocity of the target/leader is known to the tracking robot. Paper C treats the the case where the target velocity is neither directly measurable with the available sensor setup, nor possible to obtain through communication with neighboring agents. Straight-forward computation of the target velocity from available sensor data unfortunately tend to enhance measurement errors and give unreliable estimates. To overcome the difficulties, an alternative approach to velocity estimation is proposed, motivated by the local observability of the given control system.

Paper D deals with another problematic aspect of data acquisition. When using range sensors, one often obtains a mixed data set with measurements originating from many different sources. This problem would, for instance, be encountered by a robot moving in a formation, where it was surrounded by other agents. There exist established techniques for sorting mixed data sets off-line, but for time-depending systems where data need to be sorted on-line and only small time delays can be tolerated, established methods fail. The solution presented in the paper is a prediction-correction type algorithm, referred to as CCIA (Classification Correction and Identification algorithm).

Finally, in Paper E, we consider the problem of maintaining connectivity in a multi-agent system. Often inter-agent communication abilities are associated with some proximity constraints, so when the robots move in relation to each other, communication links both break and form. In the paper we present a framework for analysis that makes it possible to compute a set of general constraints which, if satisfied, are sufficient to guarantee maintained communication for a given multi-agent system. Constraints are computed for two sorts of consensus-based systems and the results are verified in simulations.

Place, publisher, year, edition, pages
Stockholm: KTH, 2009. x, 60 p.
Trita-MAT. OS, ISSN 1401-2294 ; 09:05
Mobile robotics, tracking, obstacle avoidance, formation control, nonlinear observers, multi-agent coordination, connectivity graphs.
National Category
Computational Mathematics
urn:nbn:se:kth:diva-10910 (URN)978-91-7415-396-5 (ISBN)
Public defence
2009-09-05, F3, Lindstedtsvägen 26, KTH, Stockholm, 10:00 (English)
QC 20100715Available from: 2009-08-26 Created: 2009-08-14 Last updated: 2010-07-15Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Gustavi, ToveDimarogonas, Dimos V.Egerstedt, MagnusHu, Xiaoming
By organisation
Optimization and Systems TheoryACCESS Linnaeus CentreCentre for Autonomous Systems, CAS
In the same journal
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 131 hits
ReferencesLink to record
Permanent link

Direct link