DocumentCode :
3561590
Title :
Spider Search: An Efficient and Non-Frontier-Based Real-Time Search Algorithm
Author :
Chu, Chao Lin ; Abbott, Russell J. ; Shuger, Debora K.
Author_Institution :
Dept. of Comput. Sci., California State Univ., Los Angeles, Los Angeles, CA
Volume :
2
fYear :
2008
Firstpage :
487
Lastpage :
492
Abstract :
Real-time search algorithms are limited to constant-bounded search at each time step. We do not see much difference between standard search algorithms and good real-time search algorithms when problem sizes are small. However, having a good real-time search algorithm becomes important when problem sizes are large. In this paper we introduce a simple yet efficient algorithm, Spider search, which uses very low constant time and space to solve problems when agents need deep (but not exhaustive) path analysis at each step. We expect that Spider search is the first in a new class of tree-based rather than frontier-based search algorithms.
Keywords :
query formulation; real-time systems; trees (mathematics); Spider search; real-time search algorithm; tree-based search algorithms; Algorithm design and analysis; Application software; Boats; Chaos; Computer science; Drives; Intelligent structures; Intelligent systems; Real time systems; Turning; AI; efficient; real time; search; spider;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Systems Design and Applications, 2008. ISDA '08. Eighth International Conference on
Print_ISBN :
978-0-7695-3382-7
Type :
conf
DOI :
10.1109/ISDA.2008.125
Filename :
4696381
Link To Document :
بازگشت