Cluster formation tracking of networked perturbed robotic systems via hierarchical fixed-time neural adaptive approach

This paper investigates the fixed-time cluster formation tracking (CFT) problem for networked perturbed robotic systems (NPRSs) under directed graph information interaction, considering parametric uncertainties, external perturbations, and actuator input deadzone. To address this complex problem, a novel hierarchical fixed-time neural adaptive control algorithm is proposed based on a hierarchical fixed-time framework and a neural adaptive control strategy. The objective of this study is to achieve accurate CFT of NPRSs within a fixed time. Specifically, we design a distributed observer algorithm to estimate the states of the virtual leader within a fixed time accurately. By using these observers, a neural adaptive fixed-time controller is developed in the local control layer to ensure rapid and reliable system performance. Through the use of the Lyapunov argument, we derive sufficient conditions on the control parameters to guarantee the fixed-time stability of NPRSs. The theoretical results are eventually validated through numerical simulations, demonstrating the effectiveness and robustness of the proposed approach.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2024-10-26
DOI
https://doi.org/10.1038/s41598-024-75618-4
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cluster formation tracking of networked perturbed robotic systems via hierarchical fixed-time neural adaptive approach

Ming‐Feng Ge, Kai‐Lun Huang, Chang‐Duo Liang, Xionghua Liu et al.
Scientific Reports
Distributed Control Multi-Agent Systems
article

Cluster formation tracking of networked perturbed robotic systems via hierarchical fixed-time neural adaptive approach

Ming‐Feng Ge, Kai‐Lun Huang, Chang‐Duo Liang, Xionghua Liu, Jing‐Zhe Xu, Qian Chen
article en

Abstract

This paper investigates the fixed-time cluster formation tracking (CFT) problem for networked perturbed robotic systems (NPRSs) under directed graph information interaction, considering parametric uncertainties, external perturbations, and actuator input deadzone. To address this complex problem, a novel hierarchical fixed-time neural adaptive control algorithm is proposed based on a hierarchical fixed-time framework and a neural adaptive control strategy. The objective of this study is to achieve accurate CFT of NPRSs within a fixed time. Specifically, we design a distributed observer algorithm to estimate the states of the virtual leader within a fixed time accurately. By using these observers, a neural adaptive fixed-time controller is developed in the local control layer to ensure rapid and reliable system performance. Through the use of the Lyapunov argument, we derive sufficient conditions on the control parameters to guarantee the fixed-time stability of NPRSs. The theoretical results are eventually validated through numerical simulations, demonstrating the effectiveness and robustness of the proposed approach.

Scientific ReportsVol. 14(1)
Wuhan University of Technology (CN), China University of Geosciences (CN), Wuhan Technology and Business University (CN), Hubei Normal University (CN), Wuhan University of Science and Technology (CN), Huazhong University of Science and Technology (CN)
Hubei Provincial Department of Education, National Natural Science Foundation of China
Climate action
Openalex Percentile: Top 79%
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.