Abstract
In this paper, we describe a heuristic search algorithm that finds a provably optimal solution subject to a specified time interval. While this algorithm is amenable to previous works on an approximate A * search with a bounded error (∈), it allows us to therminate the search to retain the specified time interval by changing the value of ∈ during the search. Our basic search strategy is that node expansion around the starting node is pessimistic (exact search), and we accomplish the approximate exploration of nodes around the goal by increasing ∈. This strategy is suitable for real-time route finding in automobile navigation systems. We conducted our experiments to clarify the practical features of the algorithm, using a digital map of a commercial automobile navigation system. The resulting advantage is that the estimation of the finishing time of the search is quite accurate, and optimal solutions are produced by making full use of the permissible search time.
Preview
Unable to display preview. Download preview PDF.
References
Thomas Dean and Mark Boddy, “An Analysis of Time-Dependent Planning,” Proceedings Seventh National Conference on Artificial Intelligence (AAAI-88), pp.49–54, 1988.
Matthew L. Ginsberg and William D. Harvey “Iterative Broadening,” Proceedings Eighth National Conference on Artificial Intelligence (AAAI-90), pp.216–220, 1988.
Richard E. Korf, “Real-Time Heuristic Search,” Artificial Intelligence 42, (1990) 189–211.
Andreas L. Köll, Hermann Kaindl, “Bidirectional Best-First Search with Bounded Error: Summary of Results,” Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), pp.217–223, 1993.
Judea Pearl, “Studies in Semi-Admissible Heuristics,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-4, No. 4, 1982.
Pohl, I., “The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving,” Third International Joint Conference on Artificial Intelligence (IJCAI-73), pp.20–23, 1973.
Stuart J. Russell and Devika Subramanian, “Provably Bounded-Optimal Agents,” Journal of Artificial Intelligence Research, Vol. 2, pp.575–609, 1995.
Stuart J. Russell and Peter Norvig, “Artificial Intelligence: A Modern Approach,” Prntice Hall
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hiraishi, H., Ohwada, H., Mizoguchi, F. (1998). Time-constrained heuristic search for practical route finding. In: Lee, HY., Motoda, H. (eds) PRICAI’98: Topics in Artificial Intelligence. PRICAI 1998. Lecture Notes in Computer Science, vol 1531. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095286
Download citation
DOI: https://doi.org/10.1007/BFb0095286
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65271-7
Online ISBN: 978-3-540-49461-4
eBook Packages: Springer Book Archive