Related papers: Reachability for multiagent control systems via Ly…
We propose control and communication strategies for nonlinear networked control systems subject to state and input constraints. The objective is to steer the state of the system towards a prescribed target set in finite time…
This paper is concerned with the consensus problem for multi-agent systems subject to communication delays between the neighboring agents. We consider a scenario where each agent is characterized by a general high-order linear system and…
We address density control problems for large-scale multi-agent systems in leader-follower settings, where a group of controllable leaders must steer a population of followers toward a desired spatial distribution. Unlike prior work, we…
Stability, reachability, and safety are crucial properties of dynamical systems. While verification and control synthesis of reach-avoid-stay objectives can be effectively handled by abstraction-based formal methods, such approaches can be…
Multi-stack pushdown systems are a well-studied model of concurrent computation using threads with first-order procedure calls. While, in general, reachability is undecidable, there are numerous restrictions on stack behaviour that lead to…
We solve the reachability problem for a coupled wave-wave system with an integro-differential term. The control functions act on one side of the boundary. The estimates on the time is given in terms of the parameters of the problem and they…
We consider control strategies for large-scale interacting agent systems under uncertainty. The particular focus is on the design of robust controls that allow to bound the variance of the controlled system over time. To this end we…
In this note, we consider the problem of choosing which nodes of a linear dynamical system should be actuated so that the state transfer from the system's initial condition to a given final state is possible. Assuming a standard complexity…
In this paper, we are interested in the synthesis of schedulers in double-weighted Markov decision processes, which satisfy both a percentile constraint over a weighted reachability condition, and a quantitative constraint on the expected…
In this work, we perform safety analysis of linear dynamical systems with uncertainties. Instead of computing a conservative overapproximation of the reachable set, our approach involves computing a statistical approximate reachable set. As…
We consider the problem of approximating the reachability probabilities in Markov decision processes (MDP) with uncountable (continuous) state and action spaces. While there are algorithms that, for special classes of such MDP, provide a…
We aim at characterizing viability, invariance and some reachability properties of controlled piecewise deterministic Markov processes (PDMPs). Using analytical methods from the theory of viscosity solutions, we establish criteria for…
We consider the safety evaluation of discrete time, stochastic systems over a finite horizon. Therefore, we discuss and link probabilistic invariance with reachability as well as reach-avoid problems. We show how to efficiently compute…
This paper investigates the problem of consensus tracking control of discrete time multi-agent systems under binary-valued communication. Different from most existing studies on consensus tracking, the transmitted information between agents…
This work in progress considers reachability-based safety analysis in the domain of autonomous driving in multi-agent systems. We formulate the safety problem for a car following scenario as a differential game and study how different…
We design the controls of physical systems that are faced by uncertainties. The system dynamics are described by random hyperbolic balance laws. The control aims to steer the system to a desired state under uncertainties. We propose a…
When designing optimal controllers for any system, it is often the case that the true state of the system is unknown to the controller, for example due to noisy measurements or partially observable states. Incomplete state information must…
This paper addresses the leader-following consensus problem for discrete-time positive multi-agent systems over time-varying graphs. We assume that the followers may have mutually different positive dynamics which can also be different from…
In real world applications, uncertain parameters are the rule rather than the exception. We present a reachability algorithm for linear systems with uncertain parameters and inputs using set propagation of polynomial zonotopes. In contrast…
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. Alur, Wojtczak, and…