Related papers: Linear Search for an Escaping Target with Unknown …
Real-time heuristic search algorithms are suitable for situated agents that need to make their decisions in constant time. Since the original work by Korf nearly two decades ago, numerous extensions have been suggested. One of the most…
Adversarial search of a network for an immobile Hider (or target) was introduced and solved for rooted trees by Gal (1979). In this zero-sum game, a Hider picks a point to hide on the tree and a Searcher picks a unit speed trajectory…
Searching in the Internet for some object characterised by its attributes in the form of data, such as a hotel in a certain city whose price is less than something, is one of our most common activities when we access the Web. We discuss…
This paper studies a leader-follower formation tracking problem where the leaders are moving at the same unknown bounded velocity. A distance-based control law is proposed for follower agents to maintain the desired distances in the…
We propose to use a supervised machine learning technique to track the location of a mobile agent in real time. Hidden Markov Models are used to build artificial intelligence that estimates the unknown position of a mobile target moving in…
This paper is concerned with finding an optimal path for an observer, or sensor, moving at a constant speed, which is to estimate the position of a stationary target, using only bearing angle measurements. The generated path is optimal in…
Suppose in a given planar region, there are smart mobile evaders and we want to detect them using sweeping agents. We assume that the agents have line sensors of equal length. We propose procedures for designing cooperative sweeping…
We consider the problem of a decision-maker searching for information on multiple alternatives when information is learned on all alternatives simultaneously. The decision-maker has a running cost of searching for information, and has to…
Suppose we are sending out $k$ robots from $0$ to search the real line at constant speed (with turns) to find a target at an unknown location; $f$ of the robots are faulty, meaning that they fail to report the target although visiting its…
Driving on the limits of vehicle dynamics requires predictive planning of future vehicle states. In this work, a search-based motion planning is used to generate suitable reference trajectories of dynamic vehicle states with the goal to…
We study the Symmetric Rendezvous Search Problem for a multi-robot system. There are $n>2$ robots arbitrarily located on a line. Their goal is to meet somewhere on the line as quickly as possible. The robots do not know the initial location…
We define and study the problem of predicting the solution to a linear program (LP) given only partial information about its objective and constraints. This generalizes the problem of learning to predict the purchasing behavior of a…
Semidiscrete optimal transport is a challenging generalization of the classical transportation problem in linear programming. The goal is to design a joint distribution for two random variables (one continuous, one discrete) with fixed…
The chase procedure is a fundamental algorithmic tool in databases that allows us to reason with constraints, such as existential rules, with a plethora of applications. It takes as input a database and a set of constraints, and iteratively…
We study the problem of searching for a hidden target in an environment that is modeled by an edge-weighted graph. A sequence of edges is chosen starting from a given root vertex such that each edge is adjacent to a previously chosen edge.…
This review examines intermittent target search strategies, which combine phases of slow motion, allowing the searcher to detect the target, and phases of fast motion during which targets cannot be detected. We first show that intermittent…
In the chasing convex bodies problem, an online player receives a request sequence of $N$ convex sets $K_1,\dots, K_N$ contained in a normed space $\mathbb R^d$. The player starts at $x_0\in \mathbb R^d$, and after observing each $K_n$…
In this paper, we consider the problem of exploring unknown environments with autonomous agents. We model the environment as a graph with edge weights and analyze the task of visiting all vertices of the graph at least once. The hardness of…
We consider the problem of evacuating $k \geq 2$ mobile agents from a unit-sided equilateral triangle through an exit located at an unknown location on the perimeter of the triangle. The agents are initially located at the centroid of the…
We introduce and study a new problem concerning the exploration of a geometric domain by mobile robots. Consider a line segment $[0,I]$ and a set of $n$ mobile robots $r_1,r_2,..., r_n$ placed at one of its endpoints. Each robot has a {\em…