Connectivity Maintenance of Nonlinear Multi-Agent Robotic System Subject to Minimizing Channel Path Attenuation

In this paper, we propose the problem of connectivity maintenance for a group of robots that are connected with wireless communication. The communication between the agents is modeled by a fading channel, and the exchange of information is possible at permissible distances. The distributed controller is designed to maintain the global connectivity of the network communication graph. On the other hand, obtaining the best communication quality between agents is the definition of good network connectivity. Therefore, the Laplacian matrix is defined as a weighted graph according to the communication parameters. Initially, the controller uses the supergradation algorithm to remake the network Laplacian matrix for having a bigger second eigenvalue. While each agent in the network only has access to the neighbor's information. The control algorithm uses a multi-agent estimator to find the eigenvector corresponding to the second small eigenvalue. The formation problem has been considered in the second step after the reference topology has been obtained. Because of the nonlinear dynamics of the agents, the sliding mode controller has been used for this purpose. This robust controller could be a suitable choice due to the modeling uncertainty and sensor measurement uncertainty. Finally, an example of multi-agent robots is provided to evaluate the algorithm.

Institutions

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2024-12-01
DOI
https://doi.org/10.22111/ieco.2024.47922.1539
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

Connectivity Maintenance of Nonlinear Multi-Agent Robotic System Subject to Minimizing Channel Path Attenuation

SHILAP Revista de lepidopterología
Distributed Control Multi-Agent Systems
article

Connectivity Maintenance of Nonlinear Multi-Agent Robotic System Subject to Minimizing Channel Path Attenuation

article en

Abstract

In this paper, we propose the problem of connectivity maintenance for a group of robots that are connected with wireless communication. The communication between the agents is modeled by a fading channel, and the exchange of information is possible at permissible distances. The distributed controller is designed to maintain the global connectivity of the network communication graph. On the other hand, obtaining the best communication quality between agents is the definition of good network connectivity. Therefore, the Laplacian matrix is defined as a weighted graph according to the communication parameters. Initially, the controller uses the supergradation algorithm to remake the network Laplacian matrix for having a bigger second eigenvalue. While each agent in the network only has access to the neighbor's information. The control algorithm uses a multi-agent estimator to find the eigenvector corresponding to the second small eigenvalue. The formation problem has been considered in the second step after the reference topology has been obtained. Because of the nonlinear dynamics of the agents, the sliding mode controller has been used for this purpose. This robust controller could be a suitable choice due to the modeling uncertainty and sensor measurement uncertainty. Finally, an example of multi-agent robots is provided to evaluate the algorithm.

SHILAP Revista de lepidopterología
Ferdowsi University of Mashhad (IR)
Openalex Percentile: Top 55%
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.