Action-Dependent Policies for Multi-Agent Linear Quadratic Regulation

The linear quadratic regulation (LQR) problem over a multi-agent system usually requires a distributed feedback gain that is structurally constrained by the network topology, incurring an inevitable suboptimality gap. Existing studies either identify conditions on the system and topology that enable convex relaxation or seek a stationary point via policy gradient algorithms. In this paper, we reduce the suboptimality gap by adopting action-dependent policies (ADPs), where the control input of each agent depends on not only states of neighbor agents, but also control inputs of some other agents. We show that although exhibiting a distributed structure, ADP can enlarge the feasible set of feedback gains and even represent centralized optimal policies under suitable conditions. However, this comes at the price of losing coercivity of the cost function and possible failure of convergence for the projected gradient flow (PGF). To overcome this difficulty, we propose a partially regularized formulation, which guarantees convergence of PGFs, and forges a connection between standard multi-agent LQR and its action-dependent counterpart. Sufficient conditions for local convergence to globally optimal policies under PGFs regardless of regularization are also established. Finally, numerical examples are presented to validate the performance of ADP.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24056
Primary Topic
Distributed Control Multi-Agent Systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Action-Dependent Policies for Multi-Agent Linear Quadratic Regulation

Gangshan Jing, Long Wang, Yongjie Liu
arXiv (Cornell University)
Distributed Control Multi-Agent Systems
preprint

Action-Dependent Policies for Multi-Agent Linear Quadratic Regulation

Gangshan Jing, Long Wang, Yongjie Liu
preprint en

Abstract

The linear quadratic regulation (LQR) problem over a multi-agent system usually requires a distributed feedback gain that is structurally constrained by the network topology, incurring an inevitable suboptimality gap. Existing studies either identify conditions on the system and topology that enable convex relaxation or seek a stationary point via policy gradient algorithms. In this paper, we reduce the suboptimality gap by adopting action-dependent policies (ADPs), where the control input of each agent depends on not only states of neighbor agents, but also control inputs of some other agents. We show that although exhibiting a distributed structure, ADP can enlarge the feasible set of feedback gains and even represent centralized optimal policies under suitable conditions. However, this comes at the price of losing coercivity of the cost function and possible failure of convergence for the projected gradient flow (PGF). To overcome this difficulty, we propose a partially regularized formulation, which guarantees convergence of PGFs, and forges a connection between standard multi-agent LQR and its action-dependent counterpart. Sufficient conditions for local convergence to globally optimal policies under PGFs regardless of regularization are also established. Finally, numerical examples are presented to validate the performance of ADP.

arXiv (Cornell University)
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.

Laika access coming soon