Search

This paper presents a systematic method to analyze the stability of systems with single delay in which the coefficient polynomials of the characteristic equation depend on the delay. Such systems often arise in, for example, life science and engineering systems. A method to analyze such systems was presented by Beretta and Kuang in a 2002 paper, but with some very restrictive assumptions. This paper extends their results to the general case with the exception of some degenerate cases. It is found that a much richer behavior is possible when the restrictive assumptions are removed. The interval of interest for the delay is partitioned into subintervals so that the magnitude condition generates a fixed number of frequencies as functions of the delay within each subinterval. The crossing conditions are expressed in a general form, and a simplified derivation for the first-order derivative criterion is obtained. Illustrative examples are also presented in this paper. [ABSTRACT FROM AUTHOR]

Mean field game theory has been developed largely following two routes. One of them, called the direct approach, starts by solving a large-scale game and next derives a set of limiting equations as the population size tends to infinity. The second route is to apply mean field approximations and formalize a fixed point problem by analyzing the best response of a representative player. This paper addresses the connection and difference of the two approaches in a linear quadratic (LQ) setting. We first introduce an asymptotic solvability notion for the direct approach, which means for all sufficiently large population sizes, the corresponding game has a set of feedback Nash strategies in addition to a mild regularity requirement. We provide a necessary and sufficient condition for asymptotic solvability and show that in this case the solution converges to a mean field limit. This is accomplished by developing a re-scaling method to derive a low-dimensional ordinary differential equation (ODE) system, where a non-symmetric Riccati ODE has a central role. We next compare with the fixed point approach which determines a two-point boundary value (TPBV) problem, and show that asymptotic solvability implies feasibility of the fixed point approach, but the converse is not true. We further address non-uniqueness in the fixed point approach and examine the long time behavior of the non-symmetric Riccati ODE in the asymptotic solvability problem. [ABSTRACT FROM AUTHOR]

In this paper, we present necessary and sufficient conditions for two given functions to be the Lyapunov and the upper Bohl exponent of a certain discrete linear system with diagonal coefficients. The obtained conditions have a form of easily verifiable algebraic conditions. [ABSTRACT FROM AUTHOR]

This paper presents a discrete-time distributed and noncooperative routing algorithm, which is proved, via Lyapunov arguments, to asymptotically converge to a specific equilibrium condition among the traffic flows over the network paths, known as Wardrop equilibrium. This convergence result improves the discrete-time algorithms in the literature, which achieve approximate convergence to the Wardrop equilibrium. Numerical simulations show the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]

Aggregate load modeling is of fundamental importance for systematic analysis and design of various demand response strategies. Instead of keeping track of the trajectories of individual loads, the aggregate modeling problem focuses on characterizing the density evolution of the load population. Most existing models are only applicable to thermostatically controlled loads (TCLs) with first-order linear dynamics. This paper develops a unified aggregate modeling approach that can be used for general TCLs as well as deferrable loads. We propose a deterministic hybrid system model to describe individual load dynamics under demand response rules, and develop a general stochastic hybrid system (SHS) model to capture the population dynamics. We also derive a set of partial differential equations (PDEs) that govern the probability density evolution of the SHS. Our results cannot be obtained using the existing SHS tools in the literature as the proposed SHS model involves both random and deterministic switchings with general switching surfaces in multidimensional domains. The derived PDE model includes many existing aggregate load modeling results as special cases and can be used in many other realistic modeling scenarios that have not been studied in the literature. [ABSTRACT FROM AUTHOR]

This paper studies the linear–quadratic mean-field game (MFG) for a class of stochastic delayed systems. We consider a large-population system, where the dynamics of each agent is modeled by a stochastic differential delayed equation. The consistency condition is derived through an auxiliary system, which is an anticipated forward–backward stochastic differential equation with delay (AFBSDDE). The wellposedness of such an AFBSDDE system can be obtained using a continuation method. Thus, the MFG strategies can be defined on an arbitrary time horizon, not necessary on a small time horizon by a commonly used contraction mapping method. Moreover, the decentralized strategies are verified to satisfy the $\epsilon$ -Nash equilibrium property. For illustration, three special cases of delayed systems are further explored, for which the closed-loop and open-loop MFG strategies are derived, respectively. [ABSTRACT FROM AUTHOR]

Within the realm of smart buildings and smart cities, dynamic response management is playing an ever-increasing role, thus attracting the attention of scientists from different disciplines. Dynamic demand response management involves a set of operations aiming at decentralizing the control of loads in large and complex power networks. Each single appliance is fully responsive and readjusts its energy demand to the overall network load. A main issue is related to mains frequency oscillations resulting from an unbalance between supply and demand. In a nutshell, this paper contributes to the topic by equipping each consumer with strategic insight. In particular, we highlight three main contributions and a few other minor contributions. First, we design a mean-field game for a population of thermostatically controlled loads, study the mean-field equilibrium for the deterministic mean-field game, and investigate on asymptotic stability for the microscopic dynamics. Second, we extend the analysis and design to uncertain models, which involve both stochastic or deterministic disturbances. This leads to robust mean-field equilibrium strategies guaranteeing stochastic and worst-case stability, respectively. Minor contributions involve the use of stochastic control strategies rather than deterministic and some numerical studies illustrating the efficacy of the proposed strategies. [ABSTRACT FROM PUBLISHER]

Huang (2010) and Nguyen and Huang (2012) solved the linear quadratic mean field systems and control problem in the case where there is a major agent (i.e. non-asymptotically vanishing as the population size goes to infinity) together with a population of minor agents (i.e. individually asymptotically negligible). The new feature in this case is that the mean field becomes stochastic and then, by minor agent state extension, the existence of $\epsilon$-Nash equilibria together with the individual agents' control laws that yield the equilibria may be established. This paper presents results initially announced by Caines and Kizilkale (2013, 2014) where it is shown that if the major agent's state is partially observed by the minor agents, and if the major agent completely observes its own state, all agents can recursively generate estimates (in general individually distinct) of the major agent's state and the mean field, and thence generate feedback controls yielding $\epsilon$ -Nash equilibria. [ABSTRACT FROM PUBLISHER]

This paper considers two classes of large population stochastic differential games connected to optimal and robust decentralized control of large-scale multiagent systems. The first problem (P1) is one where each agent minimizes an exponentiated cost function, capturing risk-sensitive behavior, whereas in the second problem (P2 ) each agent minimizes a worst-case risk-neutral cost function, where the “worst case” stems from the presence of an adversary entering each agent’s dynamics characterized by a stochastic differential equation. In both problems, the individual agents are coupled through the mean field term included in each agent’s cost function, which captures the average or mass behavior of the agents. We solve both P1 and P2 via mean field game theory. Specifically, we first solve a generic risk-sensitive optimal control problem and a generic stochastic zero-sum differential game, where the corresponding optimal controllers are applied by each agent to construct the mean field systems of P1 and P2. We then characterize an approximated mass behavior effect on an individual agent via a fixed-point analysis of the mean field system. For each problem, P1 and P2, we show that the approximated mass behavior is in fact the best estimate of the actual mass behavior in various senses as the population size, $N$, goes to infinity. Moreover, we show that for finite $N$, there exist $\epsilon$- Nash equilibria for both P1 and P2, where the corresponding individual Nash strategies are decentralized in terms of local state information and the approximated mass behavior. We also show that $\epsilon$ can be taken to be arbitrarily small when $N$ is sufficiently large. We show that the $\epsilon$- Nash equilibria of P1 and P2 are partially equivalent in the sense that the individual Nash strategies share identical control laws, but the approximated mass behaviors for P1 and P2 are different, since in P2, the mass behavior is also affected by the associated worst-case disturbance. Finally, we prove that the Nash equilibria for P1 and P2 both feature robustness, and as the parameter characterizing this robustness becomes infinite, the two Nash equilibria become identical and equivalent to that of the risk-neutral case, as in the one-agent risk-sensitive and robust control theory. [ABSTRACT FROM AUTHOR]

This paper concerns state estimation problems in a mean field control setting. In a finite population model, the goal is to estimate the joint distribution of the population state and the state of a typical individual. The observation equations are a noisy measurement of the population. The general results are applied to demand dispatch for regulation of the power grid, based on randomized local control algorithms. In prior work by the authors it is shown that local control can be designed so that the aggregate of loads behaves as a controllable resource, with accuracy matching or exceeding traditional sources of frequency regulation. The operational cost is nearly zero in many cases. The information exchange between grid and load is minimal, but it is assumed in the overall control architecture that the aggregate power consumption of loads is available to the grid operator. It is shown that the Kalman filter can be constructed to reduce these communication requirements, and to provide the grid operator with accurate estimates of the mean and variance of quality of service (QoS) for an individual load. [ABSTRACT FROM AUTHOR]

Natural systems are inextricably affected by noise. Within recent decades, the manner in which noise affects the collective behavior of self-organized systems, specifically, has garnered considerable interest from researchers and developers in various fields. To describe the collective motion of multiple interacting particles, Vicsek et al. proposed a well-known self-propelled particle (SPP) system, which exhibits a second-order phase transition from disordered to ordered motion in simulation; due to its non-equilibrium, randomness, and strong coupling nonlinear dynamics, however, there has been no rigorous analysis of such a system to date. To decouple systems consisting of deterministic laws and randomness, we propose a general method which transfers the analysis of these systems to the design of cooperative control algorithms. In this study, we rigorously analyzed the original Vicsek model under both open and periodic boundary conditions for the first time, and developed extensions to heterogeneous SPP systems (including leader-follower models) using the proposed method. Theoretical results show that SPP systems switch an infinite number of times between ordered and disordered states for any noise intensity and population density, which implies that the phase transition indeed takes a nontraditional form. We also investigated the robust consensus and connectivity of these systems. Moreover, the findings presented in this paper suggest that our method can be used to predict possible configurations during the evolution of complex systems, including turn, vortex, bifurcation, and flock merger phenomena as they appear in SPP systems. [ABSTRACT FROM PUBLISHER]

This paper introduces the backward mean-field (MF) linear-quadratic-Gaussian (LQG) games (for short, BMFLQG) of weakly coupled stochastic large-population system. In contrast to the well-studied forward mean-field LQG games, the individual state in our large-population system follows the backward stochastic differential equation (BSDE) whose terminal instead initial condition should be prescribed. Two classes of BMFLQG games are discussed here and their decentralized strategies are derived through the consistency condition. In the first class, the individual agents of large-population system are weakly coupled in their state dynamics and the full information can be accessible to all agents. In the second class, the coupling structure lies in the cost functional with only partial information structure. In both classes, the asymptotic near-optimality property (namely, $\epsilon$- Nash equilibrium) of decentralized strategies are verified. To this end, some estimates to BSDE, are presented in the large-population setting. [ABSTRACT FROM AUTHOR]

This paper considers decentralized control and optimization methodologies for large populations of systems, consisting of several agents with different individual behaviors, constraints and interests, and influenced by the aggregate behavior of the overall population. For such large-scale systems, the theory of aggregative and mean field games has been established and successfully applied in various scientific disciplines. While the existing literature addresses the case of unconstrained agents, we formulate deterministic mean field control problems in the presence of heterogeneous convex constraints for the individual agents, for instance arising from agents with linear dynamics subject to convex state and control constraints. We propose several model-free feedback iterations to compute in a decentralized fashion a mean field Nash equilibrium in the limit of infinite population size. We apply our methods to the constrained linear quadratic deterministic mean field control problem. [ABSTRACT FROM PUBLISHER]