Search arXiv⌕ Search

arXiv · 2610.02589

Static Output Feedback Control for Multi-Agent Systems Using Nash Equilibrium

Abstract

This work proposes a semidefinite programming (SDP) model that synthesizes static output control feedback for networked linear time-invariant multi-agent systems (MAS). We theoretically prove that the output feedback control of MAS can be constructed using the Nash equilibrium previously derived for state-feedback control. The Nash equilibrium considers that agents seek to minimize their individual cost functions subject to the system dynamics of the MAS. The resulting control from the pro- posed SDP model ensures the stability of the closed-loop system and dissipativity when a disturbance is present in the MAS. A set of four case studies is implemented. The first three numerical cases serve to validate and compare cost effectiveness and time-domain performance of the proposed control framework with other state-of-the-art frameworks. The fourth case designs a frequency regulation scheme for a modified IEEE 24-bus power grid. Using the proposed framework, distributed controllers are synthesized for the inverters which are considered agents in the grid. Each inverter uses partial state information of the neighboring inverters. The resulting control scheme is implemented in a high-fidelity non-linear model of 261 states that describes the electromagnetic transient dynamics of the power grid. Hence, compared to prior studies that usually validate their frameworks in small-scale numerical models, this fourth case demonstrates a virtue of our pro- posed SDP: its scalability and practical utility in real-world networked MAS. We implement the proposed framework in an open-access toolbox in Python and MATLAB, enabling practitioners and researchers to readily implement it in their applications.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul Serna-Torre, Patricia Hidalgo-Gonzalez. 2026-10-01. Static Output Feedback Control for Multi-Agent Systems Using Nash Equilibrium. https://arxiv.org/abs/2610.02589

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Diagonally forced systems and the spectral signature of matrix cycles

Given any square matrix, $\mathbf{M}$, whose diagonal elements are negative, and which are multiplied by a variable, $σ$, we wish to find the minimal $σ$ such that the eigenvalue of $\mathbf{M}_σ$ is exactly zero. By Gershgorin, we know that $\mathbf{M}_σ$ can be made stable by making $σ$ large enough. We prove a relation which analytically determines when and how we are able to find the value of $σ$ such that the maximal eigenvalue is exactly zero. In so doing, we prove the equivalence of the roots of the characteristic polynomial of $\mathbf{M}_σ$ and the eigenvalues that arise from a scaling operation on $\mathbf{M}$. Further, through the characteristic polynomial, we are able to isolate the dominant feedback cycles comprising the elements of the matrix which, under the action of $σ$, ensures the stability of the system. We then explore, using the stabilising and destabilising cycles within the coefficients of the characteristic polynomial, an intrinsic spectral signature associated with any square matrix based on the sign (or zero) of its respective elements.

math.OC↗

Nonlinear Control Allocation: A Polynomial Approach

Control allocation maps the virtual control inputs requested by a high-level control law onto the physical actuators of a system. When the actuator authority is strongly nonlinear, existing methods rely on local linearization, on incremental updates, or on general nonlinear programming, and may be inaccurate, slow, or trapped in local optima. This paper introduces Polynomial Control Allocation, in which the cost and constraints of the allocation problem are polynomial or rational functions of the states and inputs; radical, trigonometric and tabulated nonlinearities are accommodated by lifting. The first order optimality conditions then form a parametric system of polynomial equations. Its Gr{ö}bner basis and the associated multiplication matrices are computed once, offline. Online, the matrices are evaluated at the current state and all solutions are recovered from the eigenvectors of a random linear combination of them, so that the globally optimal allocation is selected at a predictable computational cost. The framework is illustrated on thrust control of a variable-pitch propeller and on multicopter force allocation, and its computational cost is quantified in terms of polynomial evaluation and eigenvector computation. The method is validated experimentally on a Quanser helicopter model at a 500 Hz control rate, where a two-layer allocation scheme combined with linear model predictive control decouples travel and elevation over multiple full rotations. Monte Carlo comparisons with nonlinear programming and incremental nonlinear control allocation show that Polynomial Control Allocation achieves the lowest allocation error together with the shortest computation time.

math.OC↗

Notes on the discretization of TV-NORM regularized inverse potential problems

We describe a method to discretize optimization problems arising in the regularization of linear inverse problem having compact forward operator defined on 3-D valued measures, compactly supported on a fixed set. The criterion is a quadratic residual attached to the data, with an additive penalization of the total variation of the measure.

math.OC↗