In this article, we consider a perimeter defense problem in a planar conical environment in
which identical vehicles, each having a finite capture radius, seek to defend a concentric …

We consider a new type of asymmetric rendezvous search problem in which player II needs
to give player I a 'gift'which can be in the form of information or material. The gift can either …

Multi-agent systems have become increasingly significant in various application areas such
as search-and-rescue, exploration, surveillance, and assembly. In this study, we focus on …

We consider perimeter defense problem in a planar conical environment with two
cooperative heterogeneous defenders, ie, a turret and a mobile vehicle, that seek to defend …

In the rendezvous search problem, two or more robots at unknown locations should meet
somewhere in the environment as quickly as possible. We study the symmetric rendezvous …

We study the problem of asynchronous rendezvous search with multiple mobile agents
(robots) in the plane. The goal of the robots is to meet at a location in the environment which …

We study the Symmetric Rendezvous Search Problem for a multi-robot system. There are
robots arbitrarily located on a line. Their goal is to meet somewhere on the line as quickly as …

In this column, we will discuss some papers in online algorithms that appeared in 2022. As
usual, we make no claim at complete coverage here, and have instead made a selection. If …

Rendezvous aims at gathering all robots at a specific location, which is an important
collaborative behavior for multirobot systems. However, in an unknown environment, it is …

The Rendezvous search problem asks how two noncomunnicating players, who move at
unit‐speed after a random placement in the search region (in this article, the line), can …