Does a robot path have clearance c?

07/24/2018
by   Ovidiu Daescu, et al.
0

Most path planning problems among polygonal obstacles ask to find a path that avoids the obstacles and is optimal with respect to some measure or a combination of measures, for example an u-to-v shortest path of clearance at least c, where u and v are points in the free space and c is a positive constant. In practical applications, such as emergency interventions/evacuations and medical treatment planning, a number of u-to-v paths are suggested by experts and the question is whether such paths satisfy specific requirements, such as a given clearance from the obstacles. We address the following path query problem: Given a set S of m disjoint simple polygons in the plane, with a total of n vertices, preprocess them so that for a query consisting of a positive constant c and a simple polygonal path π with k vertices, from a point u to a point v in free space, where k is much smaller than n, one can quickly decide whether π has clearance at least c (that is, there is no polygonal obstacle within distance c of π). To do so, we show how to solve the following related problem: Given a set S of m simple polygons in ^2, preprocess S into a data structure so that the polygon in S closest to a query line segment s can be reported quickly. We present an O(t n) time, O(t) space preprocessing, O((n / √(t)) ^7/2 n) query time solution for this problem, for any n ^1 + ϵ≤ t ≤ n^2. For a path with k segments, this results in O((n k / √(t)) ^7/2 n) query time, which is a significant improvement over algorithms that can be derived from existing computational geometry methods when k is small.

READ FULL TEXT
research
10/18/2020

Shortest Paths Among Obstacles in the Plane Revisited

Given a set of pairwise disjoint polygonal obstacles in the plane, findi...
research
06/09/2017

An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles

We study a path-planning problem amid a set O of obstacles in R^2, in wh...
research
11/23/2020

Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment

An articulated probe is modeled in the plane as two line segments, ab an...
research
09/24/2018

Rectilinear Shortest Paths Among Transient Obstacles

This paper presents an optimal Θ(n n) algorithm for determining time-mi...
research
11/23/2020

Computing Feasible Trajectories for an Articulated Probe in Three Dimensions

Consider an input consisting of a set of n disjoint triangular obstacles...
research
05/11/2020

Inferring Obstacles and Path Validity from Visibility-Constrained Demonstrations

Many methods in learning from demonstration assume that the demonstrator...
research
07/16/2022

Envyfree Trip Planning in Group Trip Planning Query Problem

In recent times, Group Trip Planning Query (henceforth referred to as GT...

Please sign up or login with your details

Forgot password? Click here to reset