Related papers: Reachability for multiagent control systems via Ly…
This paper addresses the coverage control problem of multi-agent systems in the uncertain environment. With the aid of Voronoi partition, a distributed coverage control formulation of multi-agent system is proposed to complete the workload…
One often wishes for the ability to formally analyze large-scale systems---typically, however, one can either formally analyze a rather small system or informally analyze a large-scale system. This work tries to further close this…
In this paper, we consider a robust consensus tracking problem of heterogeneous multi-agent systems with time-varying interconnection topologies. Based on common Lyapunov function and internal model techniques, both state and output…
Reachability in pushdown vector addition systems with states (PVASS) is among the longest standing open problems in Theoretical Computer Science. We show that the problem is decidable in full generality. Our decision procedure is similar in…
Gradual advancement of control technology gives rise to the studies of the stability of linear systems. The stability of the linear multiagent system is motivated by increasing utilization of agent dynamics together with the number of…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by…
Stability and analysis of multi-agent network systems with state-dependent switching typologies have been a fundamental and longstanding challenge in control, social sciences, and many other related fields. These already complex systems…
Multi-agent differential games are important and useful tools for analyzing many practical problems. With the recent surge of interest in using UAVs for civil purposes, the importance and urgency of developing tractable multi-agent analysis…
Probabilistic guarantees of safety and performance are important in constrained dynamical systems with stochastic uncertainty. We consider the stochastic reachability problem, which maximizes the probability that the state remains within…
Determining the reachable set for a given nonlinear system is critically important for autonomous trajectory planning for reach-avoid applications and safety critical scenarios. Providing the reachable set is generally impossible when the…
Reachability analysis of hybrid systems has been used as a safety verification tool to assess offline whether the state of a system is capable of remaining within a designated safe region for a given time horizon. Although it has been…
A multi-agent model for individuals endowed with strategies and subject to diffusive effects is proposed. The microscopic state of each agent is described by a spatial position and a probability measure, interpreted as a mixed strategy,…
The probabilistic reachability problems of nondeterministic systems are studied. Based on the existing studies, the definition of probabilistic reachable sets is generalized by taking into account time-varying target set and obstacle. A…
We study the problem of motion feasibility for multiagent control systems on Lie groups with collision avoidance constraints. We first consider the problem for kinematic left invariant control systems and next, for dynamical control systems…
This paper introduces a novel reachability problem for the scenario involving two agents, where one agent follows another agent using a feedback strategy. The geometry of the reachable set for an agent, termed \emph{dependent reachable…
A constant-rate multi-mode system is a hybrid system that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables with mode-dependent constant rates. We introduce and study…
In this paper, finite-time state consensus problems for continuous-time multi-agent systems are discussed, and two distributive protocols, which ensure that the states of agents reach an agreement in a finite time, are presented. By…
Reachability problems in infinite-state systems are often subject to extremely high complexity. This motivates the investigation of efficient overapproximations, where we add transitions to obtain a system in which reachability can be…
We consider the multi-task coordination problem for multi-agent systems under the following objectives: 1. collision avoidance; 2. connectivity maintenance; 3. convergence to desired destinations. The paper focuses on the safety guaranteed…