Language:
EN
| Published:
30-09-2008
|
Abstract
| pp. 69-82
The Euclidean shortest path between two points s and t in the plane with the cellular decomposition in the presence of obstacles is considered. The A* algorithm for a visibility graph (VG) is used to avoid widened obstacles. Computational experiments show that the proposed algorithm is often faster and it analyzes fewer nodes than the classical Dijkstra algorithm.
2008-09-30
1 - 1 of 1 items
This website uses cookies for proper operation, in order to use the portal fully you must accept cookies.
English