R2: Heuristic Bug-Based Any-angle Path-Planning using Lazy Searches

06/28/2022
by   Yan Kai Lai, et al.
0

R2 is a novel online any-angle path planner that uses heuristic bug-based or ray casting approaches to find optimal paths in 2D maps with non-convex, polygonal obstacles. R2 is competitive to traditional free-space planners, finding paths quickly if queries have direct line-of-sight. On large sparse maps with few obstacle contours, which are likely to occur in practice, R2 outperforms free-space planners, and can be much faster than state-of-the-art free-space expansion planner Anya. On maps with many contours, Anya performs faster than R2. R2 is built on RayScan, introducing lazy-searches and a source-pledge counter to find successors optimistically on contiguous contours. The novel approach bypasses most successors on jagged contours to reduce expensive line-of-sight checks, therefore requiring no pre-processing to be a competitive online any-angle planner.

READ FULL TEXT

page 12

page 13

research
05/08/2023

Reducing Onboard Processing Time for Path Planning in Dynamically Evolving Polygonal Maps

Autonomous agents face the challenge of coordinating multiple tasks (per...
research
06/07/2021

Multi-goal path planning using multiple random trees

In this paper, we propose a novel sampling-based planner for multi-goal ...
research
05/27/2022

Is it Worth to Reason about Uncertainty in Occupancy Grid Maps during Path Planning?

This paper investigates the usefulness of reasoning about the uncertain ...
research
09/10/2021

Optimizing Space Utilization for More Effective Multi-Robot Path Planning

We perform a systematic exploration of the principle of Space Utilizatio...
research
07/15/2021

Collision Avoidance Using Spherical Harmonics

In this paper, we propose a novel optimization-based trajectory planner ...
research
11/02/2018

eLIAN: Enhanced Algorithm for Angle-constrained Path Finding

Problem of finding 2D paths of special shape, e.g. paths comprised of li...
research
09/12/2022

Learning Obstacle-Avoiding Lattice Paths using Swarm Heuristics: Exploring the Bijection to Ordered Trees

Lattice paths are functional entities that model efficient navigation in...

Please sign up or login with your details

Forgot password? Click here to reset