Related papers: Cooperative Evasion by Translating Targets with Va…
The 'Cheating Robot' version of Cops and Robbers is played on a finite, simple, connected graph. The players move in the same time period. However, before moving, the robot observes to which vertices the cops are moving and it is fast…
Developing efficient MCMC algorithms is indispensable in Bayesian inference. In parallel tempering, multiple interacting MCMC chains run to more efficiently explore the state space and improve performance. The multiple chains advance…
We consider a group of agents on a graph who repeatedly play the prisoner's dilemma game against their neighbors. The players adapt their actions to the past behavior of their opponents by applying the win-stay lose-shift strategy. On a…
In this article an $n$-pursuer versus $m$-evader reach-avoid differential game in 3D space is studied. A team of evaders aim to reach a stationary target while avoiding capture by a team of pursuers. The multiplayer scenario is formulated…
Surveillance-Evasion (SE) games form an important class of adversarial trajectory-planning problems. We consider time-dependent SE games, in which an Evader is trying to reach its target while minimizing the cumulative exposure to a moving…
Motion prediction for intelligent vehicles typically focuses on estimating the most probable future evolutions of a traffic scenario. Estimating the gap acceptance, i.e., whether a vehicle merges or crosses before another vehicle with the…
Robust and flexible leader-following is a critical capability for robots to integrate into human society. While existing methods struggle to generalize to leaders of arbitrary form and often fail when the leader temporarily leaves the…
In this paper, two cooperative guidance laws based on the area around the target of multiattackers are designed to deal with the problem of cooperative encirclement or simultaneous attack in the case of known target acceleration and unknown…
Cooperative Greedy Pursuit Strategies are considered for approximating a signal partition subjected to a global constraint on sparsity. The approach aims at producing a high quality sparse approximation of the whole signal, using highly…
In this paper, we address a pursuit-evasion game involving multiple players by utilizing tools and techniques from reinforcement learning and matrix game theory. In particular, we consider the problem of steering an evader to a goal…
Wireless relays can effectively extend the transmission range of information. However, if relay technology is utilized unlawfully, it can amplify potential harm. Effectively surveilling illegitimate relay links poses a challenging problem.…
This paper considers a reach-avoid differential game in three-dimensional space with four equal-speed players. A plane divides the game space into a play subspace and a goal subspace. The evader aims at entering the goal subspace while…
The maximum surveillance of a target which is holding course is considered, wherein an observer vehicle aims to maximize the time that a faster target remains within a fixed-range of the observer. This entails two coupled phases: an…
This paper studies a cooperative multi-agent multi-armed stochastic bandit problem where agents operate asynchronously -- agent pull times and rates are unknown, irregular, and heterogeneous -- and face the same instance of a K-armed bandit…
We propose a dynamical trapping system composed of multiple chasers subject to target-tracking forces utilizing the velocity and position information of a single escaping target. To successfully capture the target, dividing chasers into…
In this paper, a cooperative decision-making is presented, which is suitable for intention-aware automated vehicle functions. With an increasing number of highly automated and autonomous vehicles on public roads, trust is a very important…
This paper examines resilient dynamic leader-follower consensus within multi-agent systems, where agents share first-order or second-order dynamics. The aim is to develop distributed protocols enabling nonfaulty/normal followers to…
For robots to be a part of our daily life, they need to be able to navigate among crowds not only safely but also in a socially compliant fashion. This is a challenging problem because humans tend to navigate by implicitly cooperating with…
We consider the Robber Locating Game, where an invisible moving robber tries to evade the pursuit of one or more helicopter cops, who send distance probes from anywhere on the graph. In this paper, we attempt to propose two useful…
Multi-Agent Combinatorial Path Finding (MCPF) seeks collision-free paths for multiple agents from their initial locations to destinations, visiting a set of intermediate target locations in the middle of the paths, while minimizing the sum…