DeepAI AI Chat
Log In Sign Up

eLIAN: Enhanced Algorithm for Angle-constrained Path Finding

by   Anton Andreychuk, et al.
Institute for Systems Analysis of Russian Academy of Sciences
Higher School of Economics

Problem of finding 2D paths of special shape, e.g. paths comprised of line segments having the property that the angle between any two consecutive segments does not exceed the predefined threshold, is considered in the paper. This problem is harder to solve than the one when shortest paths of any shape are sought, since the planer's search space is substantially bigger as multiple search nodes corresponding to the same location need to be considered. One way to reduce the search effort is to fix the length of the path's segment and to prune the nodes that violate the imposed constraint. This leads to incompleteness and to the sensitivity of the 's performance to chosen parameter value. In this work we introduce a novel technique that reduces this sensitivity by automatically adjusting the length of the path's segment on-the-fly, e.g. during the search. Embedding this technique into the known grid-based angle-constrained path finding algorithm - LIAN, leads to notable increase of the planner's effectiveness, e.g. success rate, while keeping efficiency, e.g. runtime, overhead at reasonable level. Experimental evaluation shows that LIAN with the suggested enhancements, dubbed eLIAN, solves up to 20% of tasks more compared to the predecessor. Meanwhile, the solution quality of eLIAN is nearly the same as the one of LIAN.


page 5

page 6


Grid-based angle-constrained path planning

Square grids are commonly used in robotics and game development as spati...

A Note on Approximating Weighted Independence on Intersection Graphs of Paths on a Grid

A graph G is called B_k-VPG, for some constant k≥ 0, if it has a string ...

Bounded Dijkstra (BD): Search Space Reduction for Expediting Shortest Path Subroutines

The shortest path (SP) and shortest paths tree (SPT) problems arise both...

Finding k-Dissimilar Paths with Minimum Collective Length

Shortest path computation is a fundamental problem in road networks. How...

Theta*: Any-Angle Path Planning on Grids

Grids with blocked and unblocked cells are often used to represent terra...

Towards Time-Optimal Any-Angle Path Planning With Dynamic Obstacles

Path finding is a well-studied problem in AI, which is often framed as g...

GreedyNASv2: Greedier Search with a Greedy Path Filter

Training a good supernet in one-shot NAS methods is difficult since the ...