Reachability for multiagent control systems via Lyapunov functions

Abstract

This paper concerns the problem of reachability of a given state for a multiagent control system in Rd. In such a system, at every time each agent can choose his/her velocity which depends both on his/her position and on the position of the whole crowd of agents (modeled by a probability measure on Rd). The main contribution of the paper is to study the above reachability problem with a given rate of attainability through a Lyapunov method adapted to the Wasserstein space of probability measures. As a byproduct we obtain a new comparison result for viscosity solutions of Hamilton Jacobi equations in the Wasserstein space.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…