Modern sampling-based motion planning algorithms typically take between hundreds of
milliseconds to dozens of seconds to find collision-free motions for high degree-of-freedom …

Parallel search algorithms harness the multithreading capability of modern processors to
achieve faster planning. One such algorithm is PA* SE (Parallel A* for Slow Expansions) …

This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts
the user from data-distribution and parallelism details and allows them to concentrate on …

Rapidly-exploring Random Tree (RRT), like other sampling-based motion planning
methods, has been very successful in solving motion planning problems. Even so, sampling …

Lazy search algorithms have been developed to efficiently solve planning problems in
domains where the computational effort is dominated by the cost of edge evaluation. The …

Trajectory optimization is a widely used technique in robot motion planning for letting the
dynamics and constraints on the system shape and synthesize complex behaviors. Several …

Probabilistic Roadmap Methods (PRMs) are widely used motion planning methods that
sample robot configurations (nodes) and connect them to form a graph (roadmap) …

Parallel search algorithms have been shown to improve planning speed by harnessing the
multithreading capability of modern processors. One such algorithm PA* SE achieves this by …

We present a rapidly exploring-random-tree-based parallel motion planning algorithm that
uses the maximal Poisson-disk sampling scheme. Our approach exploits the free-disk …

We present a parallel Cartesian planning algorithm for redundant robot arms and
manipulators. We pre-compute a roadmap, that takes into account static obstacles in the …