Distributed continuous-time optimization with nonlinear inequality and equality constraints under disturbances

This paper presents a distributed continuous-time optimization framework designed to address the challenges posed by time-varying cost functions, nonlinear inequality constraints, and equality constraints in multi-agent systems subject to disturbances. The proposed framework integrates log-barrier and quadratic penalty functions to handle constraints and employs an integral sliding mode control for disturbance rejection, including cases with bounded disturbances and disturbances with bounded derivatives. The proposed method ensures asymptotic convergence to the optimal solution, and convergence is established through nonsmooth analysis and Lyapunov theory. The effectiveness of the proposed algorithms is validated via numerical simulations on network topologies with different connectivity levels.

Institutions

Publication Details

Journal
Journal of the Franklin Institute
Published
2025-12-18
DOI
https://doi.org/10.1016/j.jfranklin.2025.108356
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

Distributed continuous-time optimization with nonlinear inequality and equality constraints under disturbances

Journal of the Franklin Institute
Distributed Control Multi-Agent Systems
article

Distributed continuous-time optimization with nonlinear inequality and equality constraints under disturbances

article en

Abstract

This paper presents a distributed continuous-time optimization framework designed to address the challenges posed by time-varying cost functions, nonlinear inequality constraints, and equality constraints in multi-agent systems subject to disturbances. The proposed framework integrates log-barrier and quadratic penalty functions to handle constraints and employs an integral sliding mode control for disturbance rejection, including cases with bounded disturbances and disturbances with bounded derivatives. The proposed method ensures asymptotic convergence to the optimal solution, and convergence is established through nonsmooth analysis and Lyapunov theory. The effectiveness of the proposed algorithms is validated via numerical simulations on network topologies with different connectivity levels.

Journal of the Franklin InstituteVol. 363(3)
UNSW Sydney (AU)
Reduced inequalities, Peace, Justice and strong institutions
Openalex Percentile: Top 36%
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.