When Perfect Is Not Good Enough: On the Search Behaviour of Symbolic Heuristic Search
暂无分享,去创建一个
[1] Hermann Kaindl,et al. Bidirectional Heuristic Search Reconsidered , 1997, J. Artif. Intell. Res..
[2] Zhengzhu Feng,et al. Symbolic Heuristic Search Using Decision Diagrams , 2002, SARA.
[3] Florian Geißer,et al. Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams , 2018, ICAPS.
[4] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[5] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[6] Nathan R. Sturtevant,et al. Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions , 2017, IJCAI.
[7] Frank Reffel,et al. OBDDs in Heuristic Search , 1998, KI.
[8] Stefan Edelkamp,et al. Transition Trees for Cost-Optimal Symbolic Planning , 2013, ICAPS.
[9] Stefan Edelkamp,et al. Symbolic Pattern Databases in Heuristic Search Planning , 2002, AIPS.
[10] Álvaro Torralba,et al. A Reminder about the Importance of Computing and Exploiting Invariants in Planning , 2015, ICAPS.
[11] Manuela M. Veloso,et al. State-set branching: Leveraging BDDs for heuristic search , 2008, Artif. Intell..
[12] Stefan Edelkamp,et al. On the Complexity of BDDs for State Space Search: A Case Study in Connect Four , 2011, AAAI.
[13] Álvaro Torralba Arias de Reyna. Symbolic search and abstraction heuristics for cost-optimal planning in automated planning , 2015 .
[14] Sérgio Vale Aguiar Campos,et al. Symbolic Model Checking , 1993, CAV.
[15] Stefan Edelkamp,et al. Simplifying Automated Pattern Selection for Planning with Symbolic Pattern Databases , 2019, KI.
[16] Álvaro Torralba,et al. Symbolic Planning with Axioms , 2019, ICAPS.
[17] Malte Helmert,et al. How Good is Almost Perfect? , 2008, AAAI.
[18] Jendrik Seipp,et al. From Non-Negative to General Operator Cost Partitioning , 2015, AAAI.
[19] Stefan Edelkamp,et al. Efficient symbolic search for cost-optimal planning , 2017, Artif. Intell..
[20] Stefan Edelkamp,et al. Improving Cost-Optimal Domain-Independent Symbolic Planning , 2011, AAAI.
[21] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[22] Álvaro Torralba,et al. On Creating Complementary Pattern Databases , 2017, IJCAI.
[23] Richard E. Korf,et al. Limitations of Front-To-End Bidirectional Heuristic Search , 2015, AAAI.
[24] Bernhard Nebel,et al. Symbolic Top-k Planning , 2020, AAAI.
[25] Nathan R. Sturtevant,et al. Bidirectional Search That Is Guaranteed to Meet in the Middle , 2016, AAAI.
[26] Peter Kissmann,et al. Symbolic Search in Planning and General Game Playing (Symbolische Suche in der Handlungsplanung und im Allgemeinen Spiel) , 2012 .
[27] Jörg Hoffmann,et al. BDD Ordering Heuristics for Classical Planning , 2014, J. Artif. Intell. Res..
[28] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[29] Florian Geißer,et al. SYMPLE : Symbolic Planning based on EVMDDs , 2018 .
[30] Álvaro Torralba,et al. Abstraction Heuristics for Symbolic Bidirectional Search , 2016, IJCAI.
[31] Jendrik Seipp,et al. Saturated Cost Partitioning for Optimal Classical Planning , 2020, J. Artif. Intell. Res..
[32] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.