ROApr 10, 2021

Efficient Path Planning in Narrow Passages for Robots with Ellipsoidal Components

arXiv:2104.04658v246 citations
Originality Incremental advance
AI Analysis

This addresses a bottleneck in robotics for applications requiring navigation through tight spaces, such as humanoid robots in cluttered environments, though it is incremental as it builds on existing sampling-based methods.

The paper tackles the problem of computationally expensive path planning for robots in narrow passages by developing a new paradigm using ellipsoidal components and convex environmental features, resulting in benchmark improvements in computational time and success rate for both single-body and higher-dimensional robots.

Path planning has long been one of the major research areas in robotics, with PRM and RRT being two of the most effective classes of planners. Though generally very efficient, these sampling-based planners can become computationally expensive in the important case of "narrow passages". This paper develops a path planning paradigm specifically formulated for narrow passage problems. The core is based on planning for rigid-body robots encapsulated by unions of ellipsoids. Each environmental feature is represented geometrically using a strictly convex body with a $\mathcal{C}^1$ boundary (e.g., superquadric). The main benefit of doing this is that configuration-space obstacles can be parameterized explicitly in closed form, thereby allowing prior knowledge to be used to avoid sampling infeasible configurations. Then, by characterizing a tight volume bound for multiple ellipsoids, robot transitions involving rotations are guaranteed to be collision-free without needing to perform traditional collision detection. Furthermore, by combining with a stochastic sampling strategy, the proposed planning framework can be extended to solving higher dimensional problems in which the robot has a moving base and articulated appendages. Benchmark results show that the proposed framework often outperforms the sampling-based planners in terms of computational time and success rate in finding a path through narrow corridors for both single-body robots and those with higher dimensional configuration spaces. Physical experiments using the proposed framework are further demonstrated on a humanoid robot that walks in several cluttered environments with narrow passages.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes