Optimal Any-Angle Pathfinding on a Sphere

04/24/2020
by   Volodymyr Rospotniuk, et al.
0

Pathfinding in Euclidean space is a common problem faced in robotics and computer games. For long-distance navigation on the surface of the earth or in outer space however, approximating the geometry as Euclidean can be insufficient for real-world applications such as the navigation of spacecraft, aeroplanes, drones and ships. This article describes an any-angle pathfinding algorithm for calculating the shortest path between point pairs over the surface of a sphere. Introducing several novel adaptations, it is shown that Anya as described by (Harabor Grastien, 2013) for Euclidean space can be extended to Spherical geometry. There, where the shortest-distance line between coordinates is defined instead by a great-circle path, the optimal solution is typically a curved line in Euclidean space. In addition the turning points for optimal paths in Spherical geometry are not necessarily corner points as they are in Euclidean space, as will be shown, making further substantial adaptations to Anya necessary. Spherical Anya returns the optimal path on the sphere, given these different properties of world maps defined in Spherical geometry. It preserves all primary benefits of Anya in Euclidean geometry, namely the Spherical Anya algorithm always returns an optimal path on a sphere and does so entirely on-line, without any preprocessing or large memory overheads. Performance benchmarks are provided for several game maps including Starcraft and Warcraft III as well as for sea navigation on Earth using the NOAA bathymetric dataset. Always returning the shorter path compared with the Euclidean approximation yielded by Anya, Spherical Anya is additionally shown to be faster than Anya for the majority of routes, due to the wider field of vision provided by cone projections in Spherical geometry.

READ FULL TEXT

page 7

page 10

page 11

page 15

page 18

page 19

page 22

page 28

research
04/15/2020

Generalized Shortest Path-based Superpixels for Accurate Segmentation of Spherical Images

Most of existing superpixel methods are designed to segment standard pla...
research
02/22/2022

GAN'SDA Wrap: Geographic And Network Structured Data on surfaces that Wrap around

There are many methods for projecting spherical maps onto the plane. Int...
research
03/22/2002

Conformal Geometry, Euclidean Space and Geometric Algebra

Projective geometry provides the preferred framework for most implementa...
research
11/24/2021

Interpolating Rotations with Non-abelian Kuramoto Model on the 3-Sphere

The paper presents a novel method for interpolating rotations based on t...
research
01/25/2022

Sphere2Vec: Multi-Scale Representation Learning over a Spherical Surface for Geospatial Predictions

Generating learning-friendly representations for points in a 2D space is...
research
06/30/2023

Sphere2Vec: A General-Purpose Location Representation Learning over a Spherical Surface for Large-Scale Geospatial Predictions

Generating learning-friendly representations for points in space is a fu...
research
07/23/2020

Sifting Convolution on the Sphere

A novel spherical convolution is defined through the sifting property of...

Please sign up or login with your details

Forgot password? Click here to reset