Alternative Paths Planner (APP) for Provably Fixed-time Manipulation Planning in Semi-structured Environments
Fahad Islam, Chris Paxton, Clemens Eppner, Bryan Peele, Maxim, Likhachev, Dieter Fox

TL;DR
The paper introduces APP, a novel offline preprocessing method that guarantees fixed-time collision-free path planning in semi-structured environments with movable obstacles, significantly improving speed over existing planners.
Contribution
APP is a new preprocessing-based approach that precomputes multiple paths to ensure rapid online retrieval in environments with dynamic obstacles.
Findings
APP achieves fixed-time planning guarantees.
APP is several orders of magnitude faster than existing methods.
APP performs well in real-time experiments with a 7 DoF robot arm.
Abstract
In many applications, including logistics and manufacturing, robot manipulators operate in semi-structured environments alongside humans or other robots. These environments are largely static, but they may contain some movable obstacles that the robot must avoid. Manipulation tasks in these applications are often highly repetitive, but require fast and reliable motion planning capabilities, often under strict time constraints. Existing preprocessing-based approaches are beneficial when the environments are highly-structured, but their performance degrades in the presence of movable obstacles, since these are not modelled a priori. We propose a novel preprocessing-based method called Alternative Paths Planner (APP) that provides provably fixed-time planning guarantees in semi-structured environments. APP plans a set of alternative paths offline such that, for any configuration of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
