7 research outputs found
Semi-dynamic connectivity in the plane
Motivated by a path planning problem we consider the following procedure.
Assume that we have two points and in the plane and take
. At each step we add to a compact convex
set that does not contain nor . The procedure terminates when the sets
in separate and . We show how to add one set to
in amortized time plus the time needed to find
all sets of intersecting the newly added set, where is the
cardinality of , is the number of sets in
intersecting the newly added set, and is the inverse of the
Ackermann function
The Complexity of Subdivision for Diameter-Distance Tests
We present a general framework for analyzing the complexity of
subdivision-based algorithms whose tests are based on the sizes of regions and
their distance to certain sets (often varieties) intrinsic to the problem under
study. We call such tests diameter-distance tests. We illustrate that
diameter-distance tests are common in the literature by proving that many
interval arithmetic-based tests are, in fact, diameter-distance tests. For this
class of algorithms, we provide both non-adaptive bounds for the complexity,
based on separation bounds, as well as adaptive bounds, by applying the
framework of continuous amortization.
Using this structure, we provide the first complexity analysis for the
algorithm by Plantinga and Vegeter for approximating real implicit curves and
surfaces. We present both adaptive and non-adaptive a priori worst-case bounds
on the complexity of this algorithm both in terms of the number of subregions
constructed and in terms of the bit complexity for the construction. Finally,
we construct families of hypersurfaces to prove that our bounds are tight
The Complexity of Subdivision for Diameter-Distance Tests
International audienceWe present a general framework for analyzing the complexity of subdivision-based algorithms whose tests are based on the sizes of regions and their distance to certain sets (often varieties) intrinsic to the problem under study. We call such tests diameter-distance tests. We illustrate that diameter-distance tests are common in the literature by proving that many interval arithmetic-based tests are, in fact, diameter-distance tests. For this class of algorithms, we provide both non-adaptive bounds for the complexity, based on separation bounds, as well as adaptive bounds, by applying the framework of continuous amortization. Using this structure, we provide the first complexity analysis for the algorithm by Plantinga and Vegeter for approximating real implicit curves and surfaces. We present both adaptive and non-adaptive a priori worst-case bounds on the complexity of this algorithm both in terms of the number of subregions constructed and in terms of the bit complexity for the construction. Finally, we construct families of hypersurfaces to prove that our bounds are tight
Implications of Motion Planning: Optimality and k-survivability
We study motion planning problems, finding trajectories that connect two configurations of a system, from two different perspectives: optimality and survivability. For the problem of finding optimal trajectories, we provide a model in which the existence of optimal trajectories is guaranteed, and design an algorithm to find approximately optimal trajectories for a kinematic planar robot within this model. We also design an algorithm to build data structures to represent the configuration space, supporting optimal trajectory queries for any given pair of configurations in an obstructed environment. We are also interested in planning paths for expendable robots moving in a threat environment. Since robots are expendable, our goal is to ensure a certain number of robots reaching the goal. We consider a new motion planning problem, maximum k-survivability: given two points in a stochastic threat environment, find n paths connecting two given points while maximizing the probability that at least k paths reach the goal. Intuitively, a good solution should be diverse to avoid several paths being blocked simultaneously, and paths should be short so that robots can quickly pass through dangerous areas. Finding sets of paths with maximum k-survivability is NP-hard. We design two algorithms: an algorithm that is guaranteed to find an optimal list of paths, and a set of heuristic methods that finds paths with high k-survivability