Related papers: Reaching a Target in the Plane with no Information
A team of anonymous mobile agents represented by points freely moving in the plane have to gather at a single point and stop. Agents start at different points of the plane and at possibly different times chosen by the adversary. They are…
Motivated by the increasing appeal of robots in information-gathering missions, we study multi-agent path planning problems in which the agents must remain interconnected. We model an area by a topological graph specifying the movement and…
Using the 20 questions estimation framework with query-dependent noise, we study non-adaptive search strategies for a moving target over the unit cube with unknown initial location and velocities under a piecewise constant velocity model.…
In principal-agent models, a principal offers a contract to an agent to perform a certain task. The agent exerts a level of effort that maximizes her utility. The principal is oblivious to the agent's chosen level of effort, and conditions…
In the standard setting of approachability there are two players and a target set. The players play repeatedly a known vector-valued game where the first player wants to have the average vector-valued payoff converge to the target set which…
In a rendezvous task, some mobile agents dispersed in a network have to gather at an arbitrary common site. We consider the rendezvous problem on the infinite labeled line, with $2$ agents, without communication, and a synchronous notion of…
Our goal is to design distributed coordination strategies that enable agents to achieve global performance guarantees while minimizing the energy cost of their actions with an emphasis on feasibility for real-time implementation. As a…
Multi-agent reinforcement learning was performed in this study for indoor path planning of two unmanned aerial vehicles (UAVs). Each UAV performed the task of moving as fast as possible from a randomly paired initial position to a goal…
Learning a diverse set of skills by interacting with an environment without any external supervision is an important challenge. In particular, obtaining a goal-conditioned agent that can reach any given state is useful in many applications.…
We consider a game played between a hider, who hides a static object in one of several possible positions in a bounded planar region, and a searcher, who wishes to reach the object by querying sensors placed in the plane. The searcher is a…
We consider the online planning problem for a team of agents to discover and track an unknown and time-varying number of moving objects from onboard sensor measurements with uncertain measurement-object origins. Since the onboard sensors…
This paper investigates the problem of computing a two-dimensional optimal curvature straight line (CS) shortest path for an unmanned aerial vehicle (UAV) to intercept a moving target, with both the UAV (pursuer) and target travelling at…
This paper considers the problem of localization and circumnavigation of an unknown stationary target by a group of autonomous agents using only local bearing measurements. We assume that no direct communication or exchange of information…
This paper considers a two-dimensional persistent monitoring problem by controlling movements of second-order agents to minimize some uncertainty metric associated with targets in a dynamic environment. In contrast to common sensing models…
We present a novel model for capturing the behavior of an agent exhibiting sunk-cost bias in a stochastic environment. Agents exhibiting sunk-cost bias take into account the effort they have already spent on an endeavor when they evaluate…
The task of rendezvous (also called {\em gathering}) calls for a meeting of two or more mobile entities, starting from different positions in some environment. Those entities are called mobile agents or robots, and the environment can be a…
In this paper, we study the treasure hunt problem in a graph by a mobile agent. The nodes in the graph $G=(V,E)$ are anonymous and the edges incident to a vertex $v\in V$ whose degree is $deg(v)$ are labeled arbitrarily as $0,1,\ldots,…
The main objective of this paper is to provide an optimized solution and algorithm for the execution of a workflow process by ensuring the data consistency, correctness, completeness among various tasks involved. The solution proposed…
In multi-agent navigation, agents need to move towards their goal locations while avoiding collisions with other agents and static obstacles, often without communication with each other. Existing methods compute motions that are optimal…
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…