期刊名称：International Journal of Computer Information Systems and Industrial Management Applications
印刷版ISSN：2150-7988
电子版ISSN：2150-7988
出版年度：2010
卷号：2
页码：234-242
出版社：Machine Intelligence Research Labs (MIR Labs)
摘要：Real-time search algorithms are limited to constantboundedsearch at each time step. We do not see much differencebetween standard search algorithms and good realtimesearch algorithms when problem sizes are small. However,having a good real-time search algorithm becomesimportant when problem sizes are large. In this paper weintroduce a simple yet efficient algorithm, Spider Search,which uses very low constant time and space to solve problemswhen agents need deep (but not exhaustive) path analysisat each step. Moreover, we did some experimental teststo compare Spider search with other searches. We expectthat Spider search is the first in a new class of tree-basedrather than frontier-based search algorithms.
