Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ISDA.2008.125 | ISDA (2) |
Keywords | Field | DocType |
problem size,real-time search algorithm,frontier-based search algorithm,non-frontier-based real-time search algorithm,standard search algorithm,constant-bounded search,spider search,time step,low constant time,efficient algorithm,good real-time search algorithm,algorithm design and analysis,real time systems,pediatrics,real time,ai,search algorithm,path analysis | Incremental heuristic search,Search algorithm,Computer science,Beam stack search,Beam search,Algorithm,Theoretical computer science,Dichotomic search,Combinatorial search,Best-first search,Iterative deepening depth-first search | Conference |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chao Lin Chu | 1 | 0 | 0.34 |
| Russell J. Abbott | 2 | 197 | 28.06 |
| Debora K. Shuger | 3 | 0 | 0.34 |