Real-Time Heuristic Search


We apply the two-pluyer game assumprio~ls of 1i111ited search horizon and cornn~itnrent to nroves i constant time, to .single-agent heuristic search problems. We present a varicrtion of nrinimcr lookuhead search, and an analog to ulphu-betu pruning rlrot signijicantly improves the efficiency c. the algorithm. Paradoxically. the search horizon reachuble with… (More)
DOI: 10.1016/0004-3702(90)90054-4


4 Figures and Tables


Citations per Year

912 Citations

Semantic Scholar estimates that this publication has 912 citations based on the available data.

See our FAQ for additional information.