Containment control for networked Lagrangian systems under a directed graph and communication constraints

Abdelkader Abdessameud, Ilia G. Polushin, Abdelhamid Tayebi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

In this paper, we study the containment control problem of networked uncertain Lagrangian systems with intermittent communication in the presence of communication delays and possible information loss. Specifically, we present an adaptive distributed control algorithm such that a team of followers asymptotically converge to the convex hull spanned by multiple non-stationary leaders. The interconnection between the systems is represented by a directed graph. Sufficient conditions are presented such that the control objective is reached while communication between agents is allowed only at some discrete instants of time in the presence of irregular communication delays and packet dropout. Simulation results are given to show the effectiveness of the proposed control scheme.

Original languageEnglish (US)
Title of host publication53rd IEEE Conference on Decision and Control,CDC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2938-2943
Number of pages6
EditionFebruary
ISBN (Electronic)9781479977468
DOIs
StatePublished - 2014
Event2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014 - Los Angeles, United States
Duration: Dec 15 2014Dec 17 2014

Publication series

NameProceedings of the IEEE Conference on Decision and Control
NumberFebruary
Volume2015-February
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Other

Other2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014
Country/TerritoryUnited States
CityLos Angeles
Period12/15/1412/17/14

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Containment control for networked Lagrangian systems under a directed graph and communication constraints'. Together they form a unique fingerprint.

Cite this