SearcharxivSearch

arXiv subjects

Xiaoming Hu

Publications and source records attributed to Xiaoming Hu.

At least 19 recordsLinked to original sources

On Dimension-Varying Control Systems: A Universal State Space Approach

This paper develops a unified framework for the analysis and design of dimension-varying control systems by constructing an intrinsic quotient state space, $Ω$. A significant challenge in non-fixed-dimensional systems is the lack of a common metric space that enables comparison of states across dimensions without relying on arbitrary external embeddings. To address this, we propose a cross-dimensional pseudo-metric $d_{\mathcal{V}}$ on $\mathbb{R}^{\infty}$ and derive $Ω$ by identifying zero-distance representatives. We demonstrate that $Ω$ preserves the essential topological and metric geometry of Euclidean space, providing the necessary foundation to extend fundamental control notions to the dimension-varying case. Specifically, we establish conditions for controllability, observability and stabilizability, and we address the complexities of Lipschitz switching and disturbance decoupling within this common space. The framework is further extended to hierarchical dimension-varying networks. The practical utility of the results is illustrated through a generator-removal-and-reconnection scenario in a three-machine power system. This case study demonstrates the use of translated representatives and projection/lift benchmarks, quantifies event-wise $d_{\mathcal{V}}$-gaps, and provides a finite-schedule dwell-time consistency check to validate the system's structural transitions.

math.OC

An emergence-oriented approach to circular formation

In this paper, we study the emergence of circular formation for agents in cyclic pursuit. Each agent is a unicycle traveling at a fixed common forward speed. We first establish a necessary and sufficient condition for the existence of circular formation in cyclic pursuit. Building on this theoretical foundation, we propose a control law that enables the spontaneous formation of circular formations through only local measurements. Notably, key geometric features -- the radius and agent spacing -- are not imposed externally but emerge naturally from the initial conditions of the group. This occurs because the closed-loop system possesses infinitely many non-isolated equilibria, each corresponding to a particular circular formation, and none are asymptotically stable. Consequently, analyzing individual equilibria is no longer informative, and attention is instead directed to the full invariant set (the set of all equilibria). Globally, it is disconnected. Locally, however, each equilibrium together with its neighboring equilibria forms a connected invariant set. This motivates a local stability analysis formulated at the level of invariant sets that are maximally connected. An accompanying stability criterion is then derived and applied to analyze small agent groups ($n \leq 3$), providing insights into the convergence mechanism. Finally, the proposed control law is extended to distance-dependent neighborhoods. Under this setting, the group converges into several clusters, most exhibiting a complete-graph topology. A preliminary stability analysis is then conducted for the case of a complete graph with $n=3$.

math.OC

Social Optimization in Noncooperative Games under Central Regulation

Motivated by the increasing attention to overall social benefits in networked multi-agent systems, this paper investigates an optimization problem building on noncooperative games under high-level regulation, which can be formulated in a bilevel structure. Specifically, the low level consists of a noncooperative game, where each player competes to minimize its own cost function that depends not only on the strategies of all players, but also on an intervention decision of a regulator located at the high level. Under the intervention of the high-level regulator, the low-level players aim to seek a Nash equilibrium (NE), which indeed is related to the regulator's decision. Meanwhile, the regulator in the high level attempts to achieve the social optimum, that is, to minimize the sum of all players' costs obtained at the NE. This bilevel social optimization problem is proven to be nonconvex and nonsmooth, leading to challenges for solving it effectively, as the exact gradient of cost sum functions may not be available. To address this intricate problem, an inexact zeroth-order algorithm is developed by virtue of the smoothing techniques, allowing for approximating the NE of the low-level game and thus estimating the required gradients. It is rigorously shown that the devised algorithm achieves a sublinear convergence rate for computing an approximate stationary point of the studied problem. Moreover, the sublinear convergence rate in the scenario where the exact equilibrium of the low-level game is available is established. Finally, numerical simulations are conducted to demonstrate the efficiency of theoretical findings.

math.OC

Inverse Continuous-Time Linear Quadratic Regulator: From Control Cost Matrix to Entire Cost Reconstruction

This paper studies the inverse optimal control problem for continuous-time linear quadratic regulators over finite-time horizon, aiming to reconstruct the control, state, and terminal cost matrices in the objective function from observed optimal inputs. Previous studies have mainly explored the recovery of state cost matrices under the assumptions that the system is controllable and the control cost matrix is given. Motivated by various applications in which the control cost matrix is unknown and needs to be identified, we present two reconstruction methods. The first exploits the full trajectory of the feedback matrix and establishes the necessary and sufficient condition for unique recovery. To further reduce the computational complexity, the second method utilizes the feedback matrix at some time points, where sufficient conditions for uniqueness are provided. Moreover, we study the recovery of the state and terminal cost matrices in a more general manner. Unlike prior works that assume controllability, we analyse its impact on well-posedness, and derive analytical expressions for unknown matrices for both controllable and uncontrollable cases. Finally, we characterize the structural relation between the inverse problems with the control cost matrix either to be reconstructed or given as a prior.

math.OC

Optimal Honeypot Ratio and Convergent Fictitious-Play Learning in Signaling Games for CPS Defense

Cyber-Physical Systems (CPSs) are facing a fast-growing wave of attacks. To achieve effective proactive defense, this paper models honeypot deployment as a gamma-fixed signaling game in which node liveness serves as the only signal and normal-node signal gamma is exogenously fixed. We define the gamma-perfect Bayesian-Nash equilibrium (gamma-PBNE). Analytical expressions are obtained for all gamma-PBNEs, revealing three distinct equilibrium regimes that depend on the priori honeypot ratio. Furthermore, the optimal honeypot ratio and signaling strategy that jointly maximize the network average utility are obtained. To capture strategic interaction over time, we develop a discrete-time fictitious-play algorithm that couples Bayesian belief updates with empirical best responses. We prove that, as long as the honeypot ratio is perturbed within a non-degenerate neighbourhood of the optimum, every fictitious-play path converges to the defender-optimal gamma-PBNE. Numerical results confirm the effectiveness of the proposed method and demonstrate its applicability to CPS defense.

eess.SY

Contest for system observability as an infinitely repeated game

This paper studies a system security problem in the context of observability based on a two-person noncooperative infinitely repeated game. Both the attacker and the defender have means to modify the dimension of the unobservable subspace, which is set as the value function. Utilizing tools from geometric control, we construct the best response sets considering one-step and two-step optimality respectively to maximize or minimize the value function. We establish a unified necessary-and-sufficient condition for Nash equilibrium that holds for both one-step and two-step optimizations. Our analysis further uncovers two evolutionary patterns, lock and loop modes, and shows an asymmetry between defense and attack. The defender can lock the game into equilibrium, whereas the attacker can disrupt it by sacrificing short-term utility for longer-term advantage. Six representative numerical examples corroborate the theoretical results and highlight the complexity of possible game outcomes.

math.OC

Pattern formation using an intrinsic optimal control approach

This paper investigates a pattern formation control problem for a multi-agent system modeled with given interaction topology, in which $m$ of the $n$ agents are chosen as leaders and consequently a control signal is added to each of the leaders. These agents interact with each other by Laplacian dynamics on a graph. The pattern formation control problem is formulated as an intrinsic infinite time-horizon linear quadratic optimal control problem, namely, no error information is incorporated in the objective function. Under mild conditions, we show the existence of the optimal control strategy and the convergence to the desired pattern formation. Based on the optimal control strategy, we propose a distributed control strategy to achieve the given pattern. Finally, numerical simulation is given to illustrate theoretical results.

eess.SY

Optimal intrinsic formation using exogenous systems

This paper investigates the intrinsic formation problem of a multi-agent system using an exogenous system. The problem is formulated as an intrinsic infinite time-horizon linear quadratic optimal control problem, namely, no formation error information is incorporated in the performance index. Convergence to the formation is achieved by utilizing an exogenous system, thus expanding the steady-state formation space of the system. For the forward problem, we provide the existence condition for a nonzero steady state and characterize the steady-state space. For the inverse problem, we design both the input matrix and the exogenous system so that the desired formation can be achieved. Finally, numerical simulations are provided to illustrate the effectiveness of the proposed results.

math.OC

A differential game approach to intrinsic encirclement control

This paper investigates the encirclement control problem involving two groups using a non-cooperative differential game approach. The active group seeks to chase and encircle the passive group, while the passive group responds by fleeing cooperatively and simultaneously encircling the active group. Instead of prescribing an expected radius or a predefined path for encirclement, we focus on the whole formation manifold of the desired relative configuration, two concentric circles, by allowing permutation, rotation, and translation of players. The desired relative configurations arise as the steady state resulting from Nash equilibrium strategies and are achieved in an intrinsic way by designing the interaction graphs and weight function of each edge. Furthermore, the asymptotic convergence to the desired manifold is guaranteed. Finally, numerical simulations demonstrate encirclement and counter-encirclement scenarios, verifying the effectiveness of our strategies.

math.OC

Nature-inspired dynamic control for pursuit-evasion of robots

The pursuit-evasion problem is widespread in nature, engineering, and societal applications. It is commonly observed in nature that predators often exhibit faster speeds than their prey but have less agile maneuverability. Over millions of years of evolution, animals have developed effective and efficient strategies for both pursuit and evasion. In this paper, we provide a dynamic framework for the pursuit-evasion problem of unicycle systems, drawing inspiration from nature. First, we address the scenario involving one pursuer and one evader by proposing an Alert-Turn control strategy, which consists of two efficient ingredients: a sudden turning maneuver and an alert condition for starting and maintaining the maneuver. We present and analyze the escape and capture results at two levels: a lower level of a single run and a higher level with respect to parameters' changes. In addition, we provide a theorem with sufficient conditions for capture. The Alert-Turn strategy is then extended to more complex scenarios involving multiple pursuers and evaders by integrating aggregation control laws and a target-changing mechanism. By adjusting a 'selfish parameter', the aggregation control commands produce various escape patterns of evaders: cooperative mode, selfish mode, as well as their combinations. The influence of the selfish parameter is quantified, and the effects of the number of pursuers and the target-changing mechanism are explored from a statistical perspective. Our findings align closely with observations in nature. Finally, the proposed control strategies are validated through numerical simulations that replicate some chasing behaviors of animals in nature.

eess.SY

Controllability of networked multiagent systems based on linearized Turing's model

Turing's model has been widely used to explain how simple, uniform structures can give rise to complex, patterned structures during the development of organisms. However, it is very hard to establish rigorous theoretical results for the dynamic evolution behavior of Turing's model since it is described by nonlinear partial differential equations. We focus on controllability of Turing's model by linearization and spatial discretization. This linearized model is a networked system whose agents are second order linear systems and these agents interact with each other by Laplacian dynamics on a graph. A control signal can be added to agents of choice. Under mild conditions on the parameters of the linearized Turing's model, we prove the equivalence between controllability of the linearized Turing's model and controllability of a Laplace dynamic system with agents of first order dynamics. When the graph is a grid graph or a cylinder grid graph, we then give precisely the minimal number of control nodes and a corresponding control node set such that the Laplace dynamic systems on these graphs with agents of first order dynamics are controllable.

eess.SY

Fixed-time safe tracking control of uncertain high-order nonlinear pure-feedback systems via unified transformation functions

In this paper, a fixed-time safe control problem is investigated for an uncertain high-order nonlinear pure-feedback system with state constraints. A new nonlinear transformation function is firstly proposed to handle both the constrained and unconstrained cases in a unified way. Further, a radial basis function neural network is constructed to approximate the unknown dynamics in the system and a fixed-time dynamic surface control (FDSC) technique is developed to facilitate the fixed-time control design for the uncertain high-order pure-feedback system. Combined with the proposed unified transformation function and the FDSC technique, an adaptive fixed-time control strategy is proposed to guarantee the fixed-time tracking. The proposed fixed-time control strategy can guarantee uniform control structure when addressing both constrained and unconstrained situations. Numerical examples are presented to demonstrate the proposed fixed-time tracking control strategy.

eess.SY

Steady state behavior of the free recall dynamics of working memory

This paper studies a dynamical system that models the free recall dynamics of working memory. This model is a modular neural network with n modules, named hypercolumns, and each module consists of m minicolumns. Under mild conditions on the connection weights between minicolumns, we investigate the long-term evolution behavior of the model, namely the existence and stability of equilibriums and limit cycles. We also give a critical value in which Hopf bifurcation happens. Finally, we give a sufficient condition under which this model has a globally asymptotically stable equilibrium with synchronized minicolumn states in each hypercolumn, which implies that in this case recalling is impossible. Numerical simulations are provided to illustrate our theoretical results. A numerical example we give suggests that patterns can be stored in not only equilibriums and limit cycles, but also strange attractors (or chaos).

eess.SY

Exploring High-quality Target Domain Information for Unsupervised Domain Adaptive Semantic Segmentation

In unsupervised domain adaptive (UDA) semantic segmentation, the distillation based methods are currently dominant in performance. However, the distillation technique requires complicate multi-stage process and many training tricks. In this paper, we propose a simple yet effective method that can achieve competitive performance to the advanced distillation methods. Our core idea is to fully explore the target-domain information from the views of boundaries and features. First, we propose a novel mix-up strategy to generate high-quality target-domain boundaries with ground-truth labels. Different from the source-domain boundaries in previous works, we select the high-confidence target-domain areas and then paste them to the source-domain images. Such a strategy can generate the object boundaries in target domain (edge of target-domain object areas) with the correct labels. Consequently, the boundary information of target domain can be effectively captured by learning on the mixed-up samples. Second, we design a multi-level contrastive loss to improve the representation of target-domain data, including pixel-level and prototype-level contrastive learning. By combining two proposed methods, more discriminative features can be extracted and hard object boundaries can be better addressed for the target domain. The experimental results on two commonly adopted benchmarks (\textit{i.e.}, GTA5 $\rightarrow$ Cityscapes and SYNTHIA $\rightarrow$ Cityscapes) show that our method achieves competitive performance to complicated distillation methods. Notably, for the SYNTHIA$\rightarrow$ Cityscapes scenario, our method achieves the state-of-the-art performance with $57.8\%$ mIoU and $64.6\%$ mIoU on 16 classes and 13 classes. Code is available at https://github.com/ljjcoder/EHTDI.

cs.CV

Statistically Consistent Inverse Optimal Control for Linear-Quadratic Tracking with Random Time Horizon

The goal of Inverse Optimal Control (IOC) is to identify the underlying objective function based on observed optimal trajectories. It provides a powerful framework to model expert's behavior, and a data-driven way to design an objective function so that the induced optimal control is adapted to a contextual environment. In this paper, we design an IOC algorithm for linear-quadratic tracking problems with random time horizon, and prove the statistical consistency of the algorithm. More specifically, the proposed estimator is the solution to a convex optimization problem, which means that the estimator does not suffer from local minima. This enables the proven statistical consistency to actually be achieved in practice. The algorithm is also verified on simulated data as well as data from a real world experiment, both in the setting of identifying the objective function of human tracking locomotion. The statistical consistency is illustrated on the synthetic data set, and the experimental results on the real data shows that we can get a good prediction on human tracking locomotion based on estimating the objective function. It shows that the theory and the model have a good performance in real practice. Moreover, the identified model can be used as a control target in personalized rehabilitation robot controller design, since the identified objective function describes personal habit and preferences.

math.OC

Modeling collective behaviors: A moment-based approach

In this work we introduce an approach for modeling and analyzing collective behavior of a group of agents using moments. We represent the group of agents via their distribution and derive a method to estimate the dynamics of the moments. We use this to predict the evolution of the distribution of agents by first computing the moment trajectories and then use this to reconstruct the distribution of the agents. In the latter an inverse problem is solved in order to reconstruct a nominal distribution and to recover the macro-scale properties of the group of agents. The proposed method is applicable for several types of multi-agent systems, e.g., leader-follower systems. We derive error bounds for the moment trajectories and describe how to take these error bounds into account for computing the moment dynamics. The convergence of the moment dynamics is also analyzed for cases with monomial moments. To illustrate the theory, two numerical examples are given. In the first we consider a multi-agent system with interactions and compare the proposed methods for several types of moments. In the second example we apply the framework to a leader-follower problem for modeling pedestrian crowd dynamics.

math.OC

Credit Scoring by Incorporating Dynamic Networked Information

In this paper, the credit scoring problem is studied by incorporating networked information, where the advantages of such incorporation are investigated theoretically in two scenarios. Firstly, a Bayesian optimal filter is proposed to provide risk prediction for lenders assuming that published credit scores are estimated merely from structured financial data. Such prediction can then be used as a monitoring indicator for the risk management in lenders' future decisions. Secondly, a recursive Bayes estimator is further proposed to improve the precision of credit scoring by incorporating the dynamic interaction topology of clients. It is shown that under the proposed evolution framework, the designed estimator has a higher precision than any efficient estimator, and the mean square errors are strictly smaller than the Cramér-Rao lower bound for clients within a certain range of scores. Finally, simulation results for a special case illustrate the feasibility and effectiveness of the proposed algorithms.

econ.TH

Continuous-Time Inverse Quadratic Optimal Control Problem

In this paper, the problem of finite horizon inverse optimal control (IOC) is investigated, where the quadratic cost function of a dynamic process is required to be recovered based on the observation of optimal control sequences. We propose the first complete result of the necessary and sufficient condition for the existence of corresponding LQ cost functions. Under feasible cases, the analytic expression of the whole solution space is derived and the equivalence of weighting matrices in LQ problems is discussed. For infeasible problems, an infinite dimensional convex problem is formulated to obtain a best-fit approximate solution with minimal control residual. And the optimality condition is solved under a static quadratic programming framework to facilitate the computation. Finally, numerical simulations are used to demonstrate the effectiveness and feasibility of the proposed methods.

math.OC