Distributed Nash Equilibrium Seeking Strategies Under Quantized Communication

This paper is concerned with distributed Nash equi librium seeking strategies under quantized communication. In the proposed seeking strategy, a projection operator is synthesized with a gradient search method to achieve the optimization o players' objective functions while restricting their actions within required non-empty, convex and compact domains. In addition, a leader-following consensus protocol, in which quantized informa tion flows are utilized, is employed for information sharing among players. More specifically, logarithmic quantizers and uniform quantizers are investigated under both undirected and connected communication graphs and strongly connected digraphs, respec tively. Through Lyapunov stability analysis, it is shown that play ers' actions can be steered to a neighborhood of the Nash equilib rium with logarithmic and uniform quantizers, and the quanti fied convergence error depends on the parameter of the quan tizer for both undirected and directed cases. A numerical exam ple is given to verify the theoretical results.

Fully Distributed Nash Equilibrium Seeking for High-Order Players With Actuator Limitations

This paper explores the problem of distributed Nash equilibrium seeking in games, where players have limited knowledge on other players' actions. In particular, the involved players are considered to be high-order integrators with their control inputs constrained within a pre-specified region. A linear transformation for players' dynamics is firstly utilized to facilitate the design of bounded control inputs incorporating multiple saturation functions. By introducing consensus protocols with adaptive and time-varying gains, the unknown actions for players are distributively estimated. Then, a fully distributed Nash equilibrium seeking strategy is exploited, showcasing its remarkable properties: (1) ensuring the boundedness of control inputs;(2) avoiding any global information/parameters;and (3) allowing the graph to be directed. Based on Lyapunov stability analysis, it is theoretically proved that the proposed distributed control strategy can lead all the players' actions to the Nash equilibrium. Finally, an illustrative example is given to validate effectiveness of the proposed method.

Robust reliable H-infinity control for nonlinear uncertain stochastic time-delay systems with Markovian jumping parameters

This paper deals with the problems of robust reliable exponential stabilization and robust stochastic stabilization with H-infinity performance for a class of nonlinear uncertain time-delay stochastic systems with Markovian jumping parameters. The time delays are assumed to be dependent on the system modes. Delay-dependent conditions for the solvability of these problems are obtained via parameter-dependent Lyapunov functionals. Furthermore, it is shown that the desired state feedback controller can be designed by solving a set of linear matrix inequalities. Finally, the simulation is provided to demonstrate the effectiveness of the proposed methods.

Fixed-Time Lyapunov Criteria and State-Feedback Controller Design for Stochastic Nonlinear Systems

This paper investigates the fixed-time stability theorem and state-feedback controller design for stochastic nonlinear systems.We propose an improved fixed-time Lyapunov theorem with a more rigorous and reasonable proof procedure.In particular,an important corollary is obtained,which can give a less conservative upper-bound estimate of the settling time.Based on the backstepping technique and the addition of a power integrator method,a state-feedback controller is skillfully designed for a class of stochastic nonlinear systems.It is proved that the proposed controller can render the closed-loop system fixed-time stable in probability with the help of the proposed fixed-time stability criteria.Finally,the effectiveness of the proposed controller is demonstrated by simulation examples and comparisons.

A Semi-Looped-Functional for Stability Analysis of Sampled-Data Systems

Dear Editor, In recent decades, owing to the significance of sampled-data control way on reducing the burden of communication transmission and improving the control capability of networked control systems, the research of sampled-data systems has become increasingly important(see [1]–[5]).

Distributed regularized online optimization using forward-backward splitting

This paper considers the problem of distributed online regularized optimization over a network that consists of multiple interacting nodes.Each node is endowed with a sequence of loss functions that are time-varying and a regularization function that is fixed over time.A distributed forward-backward splitting algorithm is proposed for solving this problem and both fixed and adaptive learning rates are adopted.For both cases,we show that the regret upper bounds scale as O(VT),where T is the time horizon.In particular,those rates match the centralized counterpart.Finally,we show the effectiveness of the proposed algorithms over an online distributed regularized linear regression problem.