作者: Nathan R. Sturtevant , Ariel Felner , Guni Sharon
DOI:
关键词: Algorithm 、 Pruning (decision trees) 、 Speedup 、 State (computer science) 、 A priori and a posteriori 、 Mathematics
摘要: In this paper we introduce techniques for state pruning atruntime in a priori unknown domains. We describe how toidentify states that can be deleted from the state-space whenlooking both optimal and suboptimal solutions. discussgeneral graphs special cases like 8-connected grids.Experimental results show speed up of to an order ofmagnitude when applying our on real-time agentcenteredsearch problems.