DeepAI AI Chat
Log In Sign Up

Euclidean Distance-Optimal Post-Processing of Grid-Based Paths

Paths planned over grids can often be suboptimal in an Euclidean space and contain a large number of unnecessary turns. Consequently, researchers have looked into post-processing techniques to improve the paths after they are planned. In this paper, we propose a novel post-processing technique, called Homotopic Visibility Graph Planning (HVG) which differentiates itself from existing post-processing methods in that it is guaranteed to shorten the path such that it is at least as short as the provably shortest path that lies within the same topological class as the initially computed path. We propose the algorithm, provide proofs and compare it experimentally against other post-processing methods and any-angle planning algorithms.


page 3

page 4

page 5

page 6

page 7


Theta*: Any-Angle Path Planning on Grids

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

The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks

It is challenging to design large and low-cost communication networks. I...

DeeprETA: An ETA Post-processing System at Scale

Estimated Time of Arrival (ETA) plays an important role in delivery and ...

Bias and Variance of Post-processing in Differential Privacy

Post-processing immunity is a fundamental property of differential priva...

Post-processing for Individual Fairness

Post-processing in algorithmic fairness is a versatile approach for corr...