Feasibility of Optimal Formation Under Multiplicative Noise With Energy and Time Constraints

We investigate the problem of distributed optimal formation control in Multi-Agent Systems (MAS) affected by multiplicative noise, with energy and time constraints. We develop a globally optimal distributed formation control algorithm to achieve the expected formation while minimizing a comprehensive cost function that includes formation errors, energy consumption, and network costs. Additionally, we derive lower bounds for the achievable completion time and the required energy levels, expressed in terms of the convergence error, and the second smallest and largest eigenvalues of the Laplacian matrix. These bounds set practical criteria for formation tasks with constraints on energy and time. Finally, we provide simulation results to validate the effectiveness of the proposed approach.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automation Science and Engineering
Published
2025-01-01
DOI
https://doi.org/10.1109/tase.2025.3587726
Citations
1
Primary Topic
stochastic dynamics and bifurcation
Type
article
Field-Weighted Citation Impact
1.32

Funders

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

Feasibility of Optimal Formation Under Multiplicative Noise With Energy and Time Constraints

Chunxiang Jia, Fei Chen
1 citations
IEEE Transactions on Automation Science and Engineering
stochastic dynamics and bifurcation
1.32
article

Feasibility of Optimal Formation Under Multiplicative Noise With Energy and Time Constraints

Chunxiang Jia, Fei Chen
article en
1 citations

Abstract

We investigate the problem of distributed optimal formation control in Multi-Agent Systems (MAS) affected by multiplicative noise, with energy and time constraints. We develop a globally optimal distributed formation control algorithm to achieve the expected formation while minimizing a comprehensive cost function that includes formation errors, energy consumption, and network costs. Additionally, we derive lower bounds for the achievable completion time and the required energy levels, expressed in terms of the convergence error, and the second smallest and largest eigenvalues of the Laplacian matrix. These bounds set practical criteria for formation tasks with constraints on energy and time. Finally, we provide simulation results to validate the effectiveness of the proposed approach.

IEEE Transactions on Automation Science and EngineeringVol. 22
Nankai University (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China
Affordable and clean energy
Openalex Percentile: Top 18%
stochastic dynamics and bifurcation
1.32
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.

Feasibility of Optimal Formation Under Multiplicative Noise With Energy and Time Constraints — Chunxiang Jia, Fei Chen · IEEE Transactions on Automation Science and Engineering (2025) | TGRS Research Map | TGRS