Related papers: Apollonius Allocation Algorithm for Heterogeneous …

Here we present a decomposition technique for a class of differential games. The technique consists in a decomposition of the target set which produces, for geometrical reasons, a decomposition in the dimensionality of the problem. Using…

We address a problem of area protection in graph-based scenarios with multiple agents. The problem consists of two adversarial teams of agents that move in an undirected graph shared by both teams. Agents are placed in vertices of the…

We consider the following generalization of the classical pursuit-evasion problem, which we call k-capture. A group of n pursuers (hyenas) wish to capture an evader (lion) who is free to move in an m-dimensional Euclidean space, the…

We consider a pursuit-evasion scenario involving a group of pursuers and a single evader in a two-dimensional unbounded environment. The pursuers aim to capture the evader in finite time while ensuring the evader remains enclosed within the…

This paper studies a planar multiplayer Homicidal Chauffeur reach-avoid differential game, where each pursuer is a Dubins car and each evader has simple motion. The pursuers aim to protect a goal region cooperatively from the evaders. Due…

We study a pursuit-evasion differential game with finite number of pursuers and one evader in Hilbert space with geometric constraints on the control functions of players. We solve the game by presenting explicit strategies for pursuers…

In this paper, we present an approach for solving the problem of moving $N$ homogeneous agents into $M \geq N$ goal locations along energy-minimizing trajectories. We propose a decentralized framework that only requires knowledge of the…

Recent advances in robotics have enabled the widespread deployment of autonomous robotic systems in complex operational environments, presenting both unprecedented opportunities and significant security problems. Traditional shepherding…

In a pursuit-evasion game, a team of pursuers attempt to capture an evader. The players alternate turns, move with equal speed, and have full information about the state of the game. We consider the most restictive capture condition: a…

We propose a method for analyzing the distributed random coordinate descent algorithm for solving separable resource allocation problems in the context of an open multiagent system, where agents can be replaced during the process. In…

We consider a pursuit-evasion differential game with a Hybrid system of dynamics in Hilbert space with integral constraints on the control functions of players. We show that the pursuer has a winning strategy.

The pursuit-evasion problem is widespread in nature, engineering, and societal applications. It is commonly observed in nature that predators often exhibit faster speeds than their prey but have less agile maneuverability. Over millions of…

In this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search…

This paper presents a novel control strategy to herd groups of non-cooperative evaders by means of a team of robotic herders. In herding problems, the motion of the evaders is typically determined by strongly nonlinear and heterogeneous…

For a team of heterogeneous robots executing multiple tasks, we propose a novel algorithm to optimally allocate tasks to robots while accounting for their different capabilities. Motivated by the need that robot teams have in many…

In this paper, we consider the problem of path finding for a set of homogeneous and autonomous agents navigating a previously unknown stochastic environment. In our problem setting, each agent attempts to maximize a given utility function…

We consider the general problem of geometric task allocation, wherein a large, decentralised swarm of simple mobile agents must detect the locations of tasks in the plane and position themselves nearby. The tasks are represented by an a…

The multi-agent patrol problem refers to repeatedly visiting different locations in an environment using multiple autonomous agents. For over two decades, researchers have studied this problem in various settings. While providing valuable…

In this paper, we propose an approach for solving an energy-optimal goal assignment problem to generate the desired formation in multi-agent systems. Each agent solves a decentralized optimization problem with only local information about…

This paper tackles a multi-agent bandit setting where $M$ agents cooperate together to solve the same instance of a $K$-armed stochastic bandit problem. The agents are \textit{heterogeneous}: each agent has limited access to a local subset…