arXiv subjects

Guang-Hong Yang

Publications and source records attributed to Guang-Hong Yang.

5 recordsLinked to original sources

arXiv2026

Distributed Observer Design for Discrete-Time LTI Systems via Jordan Canonical Form

This paper addresses the problem of distributed state estimation for discrete-time linear time-invariant systems. Building on the framework proposed in Gao & Yang (2025), we exploit the Jordan canonical form of the system matrix to develop two distributed estimation schemes that ensure asymptotic convergence of local estimates to the true system state. In both approaches, each node reconstructs the components of the state that are locally detectable for it via a Luenberger observer, while employing a consensus-based mechanism to estimate the components that are not directly detectable. The first scheme relies on local observers whose dimension matches that of the original state vector; however, its applicability requires the satisfaction of a large set of inequalities. The second scheme, in contrast, can be implemented under less restrictive conditions, but results in observers of increased (augmented) order. For both methods, we derive necessary and sufficient conditions - expressed in terms of the eigenvalues of the system matrix and certain submatrices of the communication network Laplacian - that guarantee the existence of a distributed observer achieving asymptotically accurate estimation. Compared to Gao & Yang (2025), the proposed approaches offer greater flexibility in the selection of coupling gains and impose less stringent solvability conditions.

eess.SY↗

arXiv2026

Distributed State Estimation of Discrete-Time LTI Systems via Jordan Canonical Representation

In this paper, we address the problem of distributed state estimation for a discrete-time, linear time-invariant system. Building on the framework proposed in [2], we exploit the Jordan canonical form of the system matrix to develop a distributed estimation scheme that ensures the asymptotic convergence of the local state estimates to the true system state. The proposed approach relies on the idea that each node reconstructs the components of the system state that are detectable for it through a local Luenberger observer, while employing a consensus-based strategy to estimate the undetectable components. Necessary and sufficient conditions for the existence of a distributed observer that guarantees asymptotic estimation accuracy are derived. Compared with the previous work [2], the proposed design offers greater flexibility in the selection of the coupling gains and leads to a less restrictive set of conditions for solvability.

eess.SY↗

arXiv2020

Fast state estimation under sensor attacks: a senor categorization approach

In a sensor network, some sensors usually provide the same or equivalent measurement information, which is not taken into account by the existing secure state estimation methods against sparse sensor attacks such that the computational efficiency of these methods needs to be further improved. In this paper, by considering the observation equivalence of sensor measurement, a concept of analytic sensor types is introduced based on the equivalent class to develop a fast state estimation algorithm. By testing the measurement data of a sensor type, the attack location information can be extracted to exclude some mismatching search candidates, without loss of estimation correctness. This confirms high speed performance of the proposed algorithm, since the number of sensor types is usually far less than the number of sensors.

eess.SY↗

arXiv2020

Secure distributed adaptive optimal coordination of nonlinear cyber-physical systems with attack diagnosis

This paper studies the problem of distributed optimal coordination (DOC) for a class of nonlinear large-scale cyber-physical systems (CPSs) in the presence of cyber attacks. A secure DOC architecture with attack diagnosis is proposed that guarantees the attack-free subsystems to achieve the output consensus which minimizes the sum of their objective functions, while the attacked subsystems converge to preset secure states. A two-layer DOC structure is established with emphasis on the interactions between cyber and physical layers, where a command-driven control law is designed that generates provable optimal output consensus. Differing from the existing fault diagnosis methods which are generally applicable to given failure types, the focus of the attack diagnosis is to achieve detection and isolation for arbitrary malicious behaviors. To this end, double coupling residuals are generated by a carefully-designed distributed filter. The adaptive thresholds with prescribed performance are designed to enhance the detectability and isolability. It is theoretically guaranteed that any attack signal cannot bypass the designed attack diagnosis methodology to destroy the convergence of the DOC algorithm, and the locally-occurring detectable attack can be isolated from the propagating attacks from neighboring subsystems. Simulation results for the motion coordination of multiple remotely operated underwater vehicles illustrate the effectiveness of the proposed architecture.

eess.SY↗

arXiv2017

Leader-Based Optimal Coordination Control for the Consensus Problem of Multiagent Differential Games via Fuzzy Adaptive Dynamic Programming

In this paper, a new on-line scheme is presented to design the optimal coordination control for the consensus problem of multi-agent differential games by fuzzy adaptive dynamic programming (FADP), which brings together game theory, generalized fuzzy hyperbolic model (GFHM) and adaptive dynamic programming. In general, the optimal coordination control for multi-agent differential games is the solution of the coupled Hamilton-Jacobi (HJ) equations. Here, for the first time, GFHMs are used to approximate the solution (value functions) of the coupled HJ equations, based on policy iteration (PI) algorithm. Namely, for each agent, GFHM is used to capture the mapping between the local consensus error and local value function. Since our scheme uses the single-network rchitecture for each agent (which eliminates the action network model compared with dual-network architecture), it is a more reasonable architecture for multi-agent systems. Furthermore, the approximation solution is utilized to obtain the optimal coordination controls. Finally, we give the stability analysis for our scheme, and prove the weight estimation error and the local consensus error are uniformly ultimately bounded. Further, the control node trajectory is proven to be cooperative uniformly ultimately bounded.

math.OC↗