This paper studies the trajectory optimization problem of a single cellular-enabled
unmanned aerial vehicle (UAV), taking into account the outage performance of the entire …

Abstract Multi-Agent Path Finding (MAPF) plays an important role in many real-life
applications where autonomous agents must coordinate to reach their goals without …

We study the problem of finding shortest paths in the plane among h convex obstacles,
where the path is allowed to pass through (violate) up to k obstacles, for k ≤ hk≤ h …

In the minimum constraint removal problem, we are given a set of geometric objects as
obstacles in the plane, and we want to find the minimum number of obstacles that must be …

In the minimum constraint removal problem, we are given a set of overlapping geometric
objects as obstacles in the plane, and we want to find the minimum number of obstacles that …

We present an optimal algorithm for determining a time-minimal rectilinear path among
transient rectilinear obstacles. An obstacle is transient if it exists only for a specific time …

Suppose we are in polygonal domain in the plane with n vertices in total. The obstacles
(holes) do not have to be convex. Given two points s and t, what is the Euclidean length of …

We study the shortest k-violation path problem in a simple polygon. Let P be a simple
polygon in ℝ 2 with n vertices and let s, t be a pair of points in P. Let int (P) represent the …

In a geometric optimization problem, the goal is to optimize an objective function subject to a
set of constraints induced by a family of geometric objects. When these constraints render …

The task in MAPF problems is to find non-conflicting paths for multiple agents, each one with
a unique start and goal position, in a shared discretized environment. Different algorithms …