An Approximate Path Finding Algorithm for Bridging Special Obstacles
This paper presents an algorithm, which is used to find the shortest path between two given nodes in a grid with sparse polygon obstacles. Among these obstacles some of them may be bridged. The algorithm executes the search using a “don't change direction” heuristic along the line towards the t...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2009-09-01
|
| Series: | Journal of Algorithms & Computational Technology |
| Online Access: | https://doi.org/10.1260/174830108788251809 |