Data-Driven Adaptive PID Control for Unknown Nonlinear MAS with Input Constraint

This paper addresses the consensus tracking problem for a class of unknown nonlinear multi-agent systems (MAS) subject to input constraints. We present a new data-driven adaptive PID control method. This approach allows for decentralized coordination without needing clear system dynamics. Based on the dynamic linearization technique, a linear data model that transforming over time is first constructed for the nonlinear system. Subsequently, by integrating the PID control framework, a data-driven control algorithm was developed that relies solely on the saturated input data and output data of the follower agents and their neighboring nodes. Additionally, the contraction mapping principle and mathematical induction method are used to formally show the proposed algorithm’s convergence under two scenarios. Lastly, simulations are used to confirm the suggested algorithm’s viability and efficacy.

Institutions

Publication Details

Published
2025-05-17
DOI
https://doi.org/10.1109/yac66630.2025.11150273
Primary Topic
Education, Psychology, and Social Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Data-Driven Adaptive PID Control for Unknown Nonlinear MAS with Input Constraint

Education, Psychology, and Social Research
article

Data-Driven Adaptive PID Control for Unknown Nonlinear MAS with Input Constraint

article en

Abstract

This paper addresses the consensus tracking problem for a class of unknown nonlinear multi-agent systems (MAS) subject to input constraints. We present a new data-driven adaptive PID control method. This approach allows for decentralized coordination without needing clear system dynamics. Based on the dynamic linearization technique, a linear data model that transforming over time is first constructed for the nonlinear system. Subsequently, by integrating the PID control framework, a data-driven control algorithm was developed that relies solely on the saturated input data and output data of the follower agents and their neighboring nodes. Additionally, the contraction mapping principle and mathematical induction method are used to formally show the proposed algorithm’s convergence under two scenarios. Lastly, simulations are used to confirm the suggested algorithm’s viability and efficacy.

Beijing Information Science & Technology University (CN)
Openalex Percentile: Top 36%
Education, Psychology, and Social Research
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.