Connectivity-preserving flocking of multi-agent systems with application to wheeled mobile robots

Yutian Mao*, Lihua Dou, Hao Fang, Huagang Liu, Hu Cao

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

This paper investigates distributed flocking of multiple autonomous agents under graph connectivity constraint. Hybrid artificial potential functions which could cope with the problems of connectivity preserving as well as collision avoidance are devised for all the agents. Combined with the linear velocity consensus protocol, a set of provable decentralized control laws is presented to enable the group to asymptotically exhibit the stable flocking motion while preserving the network connectivity for all time provided that the initial communication topology is connected. Furthermore, the proposed coordinated controllers are applied to the flocking control of a team of wheeled mobile robots. Finally, nontrivial simulations and experiments are demonstrated to verify the theoretic results.

Original languageEnglish
Title of host publicationProceedings of the 29th Chinese Control Conference, CCC'10
Pages4494-4500
Number of pages7
Publication statusPublished - 2010
Event29th Chinese Control Conference, CCC'10 - Beijing, China
Duration: 29 Jul 201031 Jul 2010

Publication series

NameProceedings of the 29th Chinese Control Conference, CCC'10

Conference

Conference29th Chinese Control Conference, CCC'10
Country/TerritoryChina
CityBeijing
Period29/07/1031/07/10

Keywords

  • Artificial potential functions
  • Connectivity-preserving
  • Multi-agent flocking
  • Wheeled mobile robots

Fingerprint

Dive into the research topics of 'Connectivity-preserving flocking of multi-agent systems with application to wheeled mobile robots'. Together they form a unique fingerprint.

Cite this