Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance

TL;DR

This paper demonstrates that deterministic low-dispersion sampling sequences can achieve asymptotic optimality and superior practical performance in motion planning, matching or exceeding probabilistic methods like PRM and RRT.

Contribution

It proves deterministic asymptotic optimality for PRM with low-dispersion sequences, characterizes convergence rates, and shows near-linear complexity, offering a deterministic alternative to probabilistic planners.

Findings

Deterministic low-dispersion sequences can achieve asymptotic optimality.

PRM with deterministic sequences has near-linear complexity.

Deterministic planning outperforms probabilistic methods in experiments.

Abstract

Probabilistic sampling-based algorithms, such as the probabilistic roadmap (PRM) and the rapidly-exploring random tree (RRT) algorithms, represent one of the most successful approaches to robotic motion planning, due to their strong theoretical properties (in terms of probabilistic completeness or even asymptotic optimality) and remarkable practical performance. Such algorithms are probabilistic in that they compute a path by connecting independently and identically distributed random points in the configuration space. Their randomization aspect, however, makes several tasks challenging, including certification for safety-critical applications and use of offline computation to improve real-time execution. Hence, an important open question is whether similar (or better) theoretical guarantees and practical performance could be obtained by considering deterministic, as opposed to random sampling sequences. The objective of this paper is to provide a rigorous answer to this question. Specifically, we first show that PRM, for a certain selection of tuning parameters and deterministic low-dispersion sampling sequences, is deterministically asymptotically optimal. Second, we characterize the convergence rate, and we find that the factor of sub-optimality can be very explicitly upper-bounded in terms of the l2-dispersion of the sampling sequence and the connection radius of PRM. Third, we show that an asymptotically optimal version of PRM exists with computational and space complexity arbitrarily close to O(n) (the theoretical lower bound), where n is the number of points in the sequence. This is in stark contrast to the O(n logn) complexity results for existing asymptotically-optimal probabilistic planners. Finally, through numerical experiments, we show that planning with deterministic low-dispersion sampling generally provides superior performance in terms of path cost and success rate.