The focus of this paper is directed towards optimal control of multi-agent systems consisting of one leader and a number of followers in the presence of noise. The dynamics of every agent is assumed to be linear, and the performance index is a quadratic function of the states and actions of the leader and followers. The leader and followers are coupled in both dynamics and cost. The state of the leader and the average of the states of all followers (called mean-field) are common information and known to all agents; however, the local state of the followers are private information and unknown to other agents. It is shown that the optimal distributed control strategy is linear time-varying, and its computational complexity is independent of the number of followers. This strategy can be computed in a distributed manner, where the leader needs to solve one Riccati equation to determine its optimal strategy while each follower needs to solve two Riccati equations to obtain its optimal strategy.
This result is subsequently extended to the case of the infinite horizon discounted and undiscounted cost functions, where the optimal distributed strategy is shown to be stationary. A numerical example with $100$ followers is provided to demonstrate the efficacy of the results.
This paper deals with data-driven output synchronization for heterogeneous leader-follower linear multi-agent systems. Given a multi-agent system that consists of one autonomous leader and a number of heterogeneous followers with external disturbances, we provide necessary and sufficient data-based conditions for output synchronization. We also provide a design method for obtaining such output synchronizing protocols directly from data. The results are then extended to the special case that the followers are disturbance-free. Finally, a simulation example is provided to illustrate our results.
In this letter, we study the leader-synchronization problem for a class of partial differential equations with boundary control and in-domain coupling. We describe the problem in an abstract formulation and we specialize it to a network of parabolic partial differential equations. We consider a setting in which a subset of the followers is connected to the leader through a boundary control, while interconnections among the followers are enforced by distributed in-domain couplings. Sufficient conditions in the form of matrix inequalities for the selection of the control parameters enforcing exp…
In this paper, we consider the problem of containment control of multi-agent systems with multiple stationary leaders, interacting over a directed network. While, containment control refers to just ensuring that the follower agents reach the convex hull of the leaders states, we focus on the problem where the followers achieve a consensus to the average values of the leaders states. We propose an algorithm that can be implemented in a distributed manner to achieve the above consensus among followers. Next we optimize the convergence rate of the followers to the average consensus by proper choi…
We consider leader-follower multi-agent systems in which the leader executes the desired trajectory and the followers implement the consensus algorithm subject to stochastic disturbances. The performance of the leader-follower systems is quantified by using the steady-state variance of the deviation of the followers from the leader. We study the asymptotic scaling of the variance in directed lattices in one, two, and three dimensions. We show that in 1D and 2D the variance of the followers' deviation increases to infinity as one moves away from the leader, while in 3D it remains bounded. We pr…
This paper investigates a linear quadratic mean field leader-follower team problem, where the model involves one leader and a large number of weakly-coupled interactive followers. The leader and the followers cooperate to optimize the social cost. Specifically, for any strategy provided first by the leader, the followers would like to choose a strategy to minimize social cost functional. Using variational analysis and person-by-person optimality, we construct two auxiliary control problems. By solving sequentially the auxiliary control problems with consistent mean field approximations, we can…
We derive Nash equilibria for a class of quadratic multi-leader-follower games using the nonsmooth best response function. To overcome the challenge of nonsmoothness, we pursue a smoothing approach resulting in a reformulation as a smooth Nash equilibrium problem. The existence and uniqueness of solutions are proven for all smoothing parameters. Accumulation points of Nash equilibria exist for a decreasing sequence of these smoothing parameters and we show that these candidates fulfill the conditions of s-stationarity and are Nash equilibria to the multi-leader-follower game. Finally, we propo…
In this paper, a decentralized stochastic control system consisting of one leader and many homogeneous followers is studied. The leader and followers are coupled in both dynamics and cost, where the dynamics are linear and the cost function is quadratic in the states and actions of the leader and followers. The objective of the leader and followers is to reach consensus while minimizing their communication and energy costs. The leader knows its local state and each follower knows its local state and the state of the leader. The number of required links to implement this decentralized informati…
In this paper, we consider a discrete-time Stackelberg mean field game with a leader and an infinite number of followers. The leader and the followers each observe types privately that evolve as conditionally independent controlled Markov processes. The leader commits to a dynamic policy and the followers best respond to that policy and each other. Knowing that the followers would play a mean field game based on her policy, the leader chooses a policy that maximizes her reward. We refer to the resulting outcome as a Stackelberg mean field equilibrium (SMFE). In this paper, we provide a master …
Motivated by electricity markets, this paper studies the impact of forward contracting in situations where firms have capacity constraints and heterogeneous production lead times. We consider a model with two types of firms - leaders and followers - that choose production at two different times. Followers choose productions in the second stage but can sell forward contracts in the first stage. Our main result is an explicit characterization of the equilibrium outcomes. Classic results on forward contracting suggest that it can mitigate market power in simple settings; however the results in th…
This paper is concerned with a leader-follower stochastic differential game with asymmetric information, where the information available to the follower is based on some sub-$σ$-algebra of that available to the leader. Such kind of game problem has wide applications in finance, economics and management engineering such as newsvendor problems, cooperative advertising and pricing problems. Stochastic maximum principles and verification theorems with partial information are obtained, to represent the Stackelberg equilibrium. As applications, a linear-quadratic leader-follower stochastic different…
In this paper, we consider a linear quadratic (LQ) leader-follower stochastic differential game for regime switching diffusions with mean-field interactions. One of the salient features of this paper is that conditional mean-field terms are included in the state equation and cost functionals. Based on stochastic maximum principles (SMPs), the follower's problem and the leader's problem are solved sequentially and an open-loop Stackelberg equilibrium is obtained. Further, with the help of the so-called four-step scheme, the corresponding Hamiltonian systems for the two players are decoupled and…
The optimization problem of the minimum set of leaders for the controllability of undirected graphs are addressed. It is difficult to find not only its optimal solution but also its approximate algorithm. We propose a new concept, namely minimal perfect critical set (MPCS), to obtain an optimal solution. Some properties are presented, and on the basis of these theorems, the problem of the minimum set of leaders of two typical self-similar bipartite networks, namely deterministic scale-free networks (DSFN) and Cayley trees, is solved completely.
In this paper, we extend the results from Jiao et al. (2019) on distributed linear quadratic control for leaderless multi-agent systems to the case of distributed linear quadratic tracking control for leader-follower multi-agent systems. Given one autonomous leader and a number of homogeneous followers, we introduce an associated global quadratic cost functional. We assume that the leader shares its state information with at least one of the followers and the communication between the followers is represented by a connected simple undirected graph. Our objective is to design distributed contro…
This paper investigates a soft-constrained MinMax control problem of a leader-follower network. The network consists of one leader and an arbitrary number of followers that wish to reach consensus with minimum energy consumption in the presence of external disturbances. The leader and followers are coupled in the dynamics and cost function. Two non-classical information structures are considered: mean-field sharing and intermittent mean-field sharing, where the mean-field refers to the aggregate state of the followers. In mean-field sharing, every follower observes its local state, the state o…
We consider the distributed leader-follower consensus problem with event-triggered communications. The system under consideration is a non-linear input-affine multi agent system. The agents are assumed to have identical dynamics structure with uncertain parameters and satisfying an incremental stabilisability condition. A distributed control law is proposed which achieves consensus based on two novel Communication Triggering Conditions (CTCs): the first one to achieve an asymptotic consensus but without any guarantees on Zeno behaviour and the second one to exclude Zeno behaviour but with prac…
We consider leader-follower multi-agent systems that have many leaders, defined on any connected weighted undirected graphs, and address the leader selection and demotion problems. The leader selection problem is formulated as a minimization problem for the $H^2$ norm of the difference between the transfer functions of the original and new agent systems, under the assumption that the leader agents to be demoted are fixed. The leader demotion problem is that of finding optimal leader agents to be demoted, and is formulated using the global optimal solution to the leader selection problem. We pr…
We present a graph-theoretic approach to analyzing the robustness of leader-follower consensus dynamics to disturbances and time delays. Robustness to disturbances is captured via the system $\mathcal{H}_2$ and $\mathcal{H}_{\infty}$ norms and robustness to time delay is defined as the maximum allowable delay for the system to remain asymptotically stable. Our analysis is built on understanding certain spectral properties of the grounded Laplacian matrix that play a key role in such dynamics. Specifically, we give graph-theoretic bounds on the extreme eigenvalues of the grounded Laplacian matr…
In this paper, a leader-follower stochastic differential game is studied for a linear stochastic differential equation with a quadratic cost functional. The coefficients in the state equation and the weighting matrices in the cost functionals are all deterministic. Closed-loop strategies are introduced, which require to be independent of initial states; and such a nature makes it very useful and convenient in applications. The follower first solves a stochastic linear quadratic optimal control problem, and his optimal closed-loop strategy is characterized by a Riccati equation, together with a…
Partially observable stochastic games provide a rich mathematical paradigm for modeling multi-agent dynamic decision making under uncertainty and partial information. However, they generally do not admit closed-form solutions and are notoriously difficult to solve. Also, in reality, each agent often does not have complete knowledge of the other agent. This paper studies a leader-follower partially observable stochastic game where the leader has little knowledge of the adversarial follower's reward structure, level of rationality, and process for gathering and transmitting data relevant for dec…
A distributed pose localization framework based on direction measurements is proposed for a type of \textit{leader-follower} multi-agent systems in $\mathbb{R}^3$. The novelty of the proposed localization method lies in the elimination of the need for using distance measurements and relative orientation measurements for the network pose localization problem. In particular, a network localization scheme is developed based directly on the measured direction constraints between an agent and its neighboring agents in the network. The proposed position and orientation localization algorithms are im…
A Regularized Nikaido-Isoda Function Approach to Multi-Leader-Follower Games
Graduate School of Engineering, Nagoya Institute of Technology(名古屋工业大学大学院工学研究科);Faculty of Science and Technology, Seikei University(圣德大学理工学部);Graduate School of Informatics, Kyoto University(京都大学大学院情报学研究科)
There has been significant recent interest in leader-follower security games, where the leader dominates the decision process with the Stackelberg equilibrium (SE) strategy. However, such a leader-follower scheme may become invalid in practice due to subjective or objective factors, and then the Nash equilibrium (NE) strategy may be an alternative option. In this case, the leader may face a dilemma of choosing an SE strategy or an NE strategy. In this paper, we focus on a unified three-player leader-follower security game and study the coincidence between SE and NE. We first explore a necessar…
This paper revisits a well studied leader-following consensus problem of linear multi-agent systems, while aiming at follower nodes' transient performance. Conventionally, when not all follower nodes have access to the leader's state information, distributed observers are designed to estimate the leader's state, and the observers are coupled via communication network. Then each follower node only needs to track its observer's state independently, without interacting with its neighbors. This paper deliberately introduces certain coupling effect among follower nodes, such that the follower nodes…
The paper considers the problem of a leader that seeks to optimally influence the opinions of agents in a directed network through connecting with a limited number of the agents ("direct followers"), possibly in the presence of a fixed competing leader. The settings involving a single leader and two competing leaders are unified into a general combinatoric optimization problem, for which two heuristic approaches are developed. The first approach is based on a convex relaxation scheme, possibly in combination with the $\ell_1$-norm regularization technique, and the second is based on a greedy s…
Multi-leader multi-follower games are a class of hierarchical games in which a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. The resulting equilibrium problem with equilibrium constraints is complicated by nonconvex agent problems and therefore providing tractable conditions for existence of global or even local equilibria for it has proved challenging. Consequently, much of the extant research on this topic is either model specific or relies on weaker notions of equilibria. We consider a modified formulation …
Stackelberg games have been widely used to model interactive decision-making problems in a variety of domains such as energy systems, transportation, cybersecurity, and human-robot interaction. However, existing algorithms for solving Stackelberg games often require knowledge of the follower's cost function or learning dynamics and may also require the follower to provide an exact best response, which can be difficult to obtain in practice. To circumvent this difficulty, we develop an algorithm that does not require knowledge of the follower's cost function or an exact best response, making it…
This paper addresses the leader-following attitude consensus problem for a group of spacecraft when at least one follower can access the leader's attitude and velocity relative to the inertial space. A nonlinear distributed observer is designed to estimate the leader's states for each follower. The observer possesses one important and novel feature of keeping attitude and angular velocity estimation errors on second-order sliding modes, and thus provides finite-time convergent estimates for each follower. Further, quaternion-based hybrid homogeneous controllers recently developed for single sp…