DeepAI AI Chat
Log In Sign Up

The Provable Virtue of Laziness in Motion Planning

by   Nika Haghtalab, et al.

The Lazy Shortest Path (LazySP) class consists of motion-planning algorithms that only evaluate edges along shortest paths between the source and target. These algorithms were designed to minimize the number of edge evaluations in settings where edge evaluation dominates the running time of the algorithm; but how close to optimal are LazySP algorithms in terms of this objective? Our main result is an analytical upper bound, in a probabilistic model, on the number of edge evaluations required by LazySP algorithms; a matching lower bound shows that these algorithms are asymptotically optimal in the worst case.


page 1

page 2

page 3

page 4


Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges

Motion-planning problems, such as manipulation in cluttered environments...

Posterior Sampling for Anytime Motion Planning on Graphs with Expensive-to-Evaluate Edges

Collision checking is a computational bottleneck in motion planning, req...

Agility and Target Distribution in the Dynamic Stochastic Traveling Salesman Problem

An important variant of the classic Traveling Salesman Problem (TSP) is ...

Leveraging Experience in Lazy Search

Lazy graph search algorithms are efficient at solving motion planning pr...

An Efficient Algorithm for Finding Sets of Optimal Routes

In several important routing contexts it is required to identify a set o...

Wireless coverage prediction via parametric shortest paths

When deciding where to place access points in a wireless network, it is ...