Extended Breadth-First Search Algorithm

作者: Tamás Kádek , János Pánovics

DOI:

关键词:

摘要: The task of artificial intelligence is to provide representation techniques for describing problems, as well search algorithms that can be used answer our questions. A widespread and elaborated model state-space representation, which, however, has some shortcomings. Classical are not applicable in practice when the state space contains even only a few tens thousands states. We give remedy this problem by defining kind heuristic knowledge. In case classical must defined so it qualifies an arbitrary based on its “goodness,” which obviously trivial. paper, we introduce algorithm gives us ability handle huge spaces use concept easier embed into algorithms.

参考文章(3)
Zhe Chen, Emery Brown, State space model Scholarpedia. ,vol. 8, pp. 30868- ,(2013) , 10.4249/SCHOLARPEDIA.30868
Krste Asanovic, Scott Beamer, David Patterson, Direction-optimizing breadth-first search ieee international conference on high performance computing data and analytics. ,vol. 21, pp. 1- 10 ,(2012) , 10.5555/2388996.2389013
Sebastian Thrun, Joelle Pineau, Geoffrey Gordon, Tractable planning under uncertainty: exploiting structure Tractable planning under uncertainty: exploiting structure. pp. 138- 138 ,(2004)