Exploiting Obstacle Geometry to Reduce Search Time in Grid-Based Pathfinding
Pathfinding is the problem of finding the shortest path between a pair of nodes in a graph. In the context of uniform-cost undirected grid maps, heuristic search algorithms, such as <inline-formula> <math display="inline"> <semantics> <msup> <mi>A</mi> &...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-07-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/12/7/1186 |