A distributed control strategy for groups of robots with application in flocking

This paper presents a distributed control strategy, named Triangle Formation (TF) algorithm, for a group of robots. The algorithm is based on a geometric approach and enables three neighboring robots to form an Equilateral Triangular Configuration (ETC). The TF algorithm is scalable since it is developed for a large group of robots by using a neighbor selection technique. To achieve obstacle avoidance by group, the algorithm is enhanced further by introducing an artificial physics model. A series of simulation studies have been conducted to observe the performance and the effectiveness of the TF algorithm. These empirical results show that group flocking with multi-ETC network in an unknown environment can be realized with the TF algorithm successfully.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2024-12-30
DOI
https://doi.org/10.1038/s41598-024-83703-x
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A distributed control strategy for groups of robots with application in flocking

Chunyan Li, Xiang Li, Chuanchuan Wang
Scientific Reports
Distributed Control Multi-Agent Systems
article

A distributed control strategy for groups of robots with application in flocking

Chunyan Li, Xiang Li, Chuanchuan Wang
article en

Abstract

This paper presents a distributed control strategy, named Triangle Formation (TF) algorithm, for a group of robots. The algorithm is based on a geometric approach and enables three neighboring robots to form an Equilateral Triangular Configuration (ETC). The TF algorithm is scalable since it is developed for a large group of robots by using a neighbor selection technique. To achieve obstacle avoidance by group, the algorithm is enhanced further by introducing an artificial physics model. A series of simulation studies have been conducted to observe the performance and the effectiveness of the TF algorithm. These empirical results show that group flocking with multi-ETC network in an unknown environment can be realized with the TF algorithm successfully.

Scientific ReportsVol. 14(1)
Yulin Normal University (CN), Guangzhou Vocational College of Science and Technology (CN)
Openalex Percentile: Top 72%
Distributed Control Multi-Agent Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.