Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Efficient memory-bounded search methods
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Artificial Intelligence
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
BIDA: an improved perimeter search algorithm
Artificial Intelligence
Experimental Evaluation of a New Shortest Path Algorithm
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Bidirectional heuristic search reconsidered
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
A* algorithm, a kind of informed search, is widely used for finding an optimal car route, because the location of starting and ending point are known beforehand. Unidirectional A* algorithm guarantees an optimal route but requires considerable search time. On the other hand, bidirectional A* algorithm, usually known faster than unidirectional A*, does not guarantee the route found to be optimal, if the search ends when the forward and backward search meet in the middle. It may even take longer than unidirectional search to find an optimal route. In this paper, a new modified bidirectional A* algorithm which takes less search time and guarantees an optimal route is proposed. To evaluate the efficiency of the proposed algorithm, several experiments are conducted in real urban road environment and the results show that the algorithm is very effective in terms of finding an optimal route and search time.