State-set branching: Leveraging BDDs for heuristic search
暂无分享,去创建一个
[1] Manuela M. Veloso,et al. OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains , 2000, J. Artif. Intell. Res..
[2] Rolf Drechsler,et al. Exact channel routing using symbolic representation , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).
[3] David L. Dill,et al. Validation with guided search of the state space , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).
[4] Daniel Sawitzki. A Symbolic Approach to the All-Pairs Shortest-Paths Problem , 2004, WG.
[5] Jørn Lind-Nielsen,et al. BuDDy : A binary decision diagram package. , 1999 .
[6] R. I. Bahar,et al. Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).
[7] Patrik Haslum,et al. Admissible Heuristics for Optimal Planning , 2000, AIPS.
[8] Kenneth L. McMillan,et al. Symbolic model checking , 1992 .
[9] Lenhart K. Schubert,et al. Inferring State Constraints for Domain-Independent Planning , 1998, AAAI/IAAI.
[10] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[11] Frank Reffel,et al. OBDDs in Heuristic Search , 1998, KI.
[12] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[13] Kavita Ravi,et al. Symbolic guided search for CTL model checking , 2000, Proceedings 37th Design Automation Conference.
[14] Blai Bonet,et al. The AIPS-98 Planning Competition , 2000, AI Mag..
[15] Zhengzhu Feng,et al. Symbolic Heuristic Search Using Decision Diagrams , 2002, SARA.
[16] Maria Fox,et al. PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..
[17] Wolfgang Kunz,et al. An exact algorithm for solving difficult detailed routing problems , 2001, ISPD '01.
[18] Marco Pistore,et al. Weak, strong, and strong cyclic planning via symbolic model checking , 2003, Artif. Intell..
[19] Fahiem Bacchus,et al. AIPS 2000 Planning Competition: The Fifth International Conference on Artificial Intelligence Planning and Scheduling Systems , 2001 .
[20] Marco Pistore,et al. A Hierarchical Task-Network Planner based on Symbolic Model Checking , 2005, ICAPS.
[21] M. Fourman. Propositional Planning , 2000 .
[22] Daniel Sawitzki,et al. Experimental Studies of Symbolic Shortest-Path Algorithms , 2004, WEA.
[23] Edmund M. Clarke,et al. Symbolic Model Checking with Partitioned Transistion Relations , 1991, VLSI.
[24] Stephan Merz,et al. Model Checking , 2000 .
[25] Anthony Barrett,et al. Partial-Order Planning: Evaluating Possible Efficiency Gains , 1994, Artificial Intelligence.
[26] Manuela M. Veloso,et al. SetA*: an efficient BDD-based heuristic search algorithm , 2002, AAAI/IAAI.
[27] Blai Bonet,et al. Planning as Heuristic Search: New Results , 1999, ECP.
[28] Stefan Edelkamp,et al. External Symbolic Heuristic Search with Pattern Databases , 2005, ICAPS.
[29] Simon Richards,et al. Memory-Efficient Symbolic Heuristic Search , 2006, ICAPS.
[30] Malte Helmert,et al. Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length , 1999, ECP.
[31] Sheldon B. Akers,et al. Binary Decision Diagrams , 1978, IEEE Transactions on Computers.
[32] Ingo Wegener,et al. Branching Programs and Binary Decision Diagrams , 1987 .
[33] Manuela M. Veloso,et al. Fault Tolerant Planning: Toward Probabilistic Uncertainty Models in Symbolic Non-Deterministic Planning , 2004, ICAPS.
[34] Stefan Edelkamp,et al. Symbolic Pattern Databases in Heuristic Search Planning , 2002, AIPS.
[35] Marco Roveri,et al. Conformant Planning via Symbolic Model Checking , 2000, J. Artif. Intell. Res..
[36] Jesfis Peral,et al. Heuristics -- intelligent search strategies for computer problem solving , 1984 .
[37] Fausto Giunchiglia,et al. Planning via Model Checking: A Decision Procedure for AR , 1997, ECP.
[38] Albert Nymeyer,et al. Guided Invariant Model Checking Based on Abstraction and Symbolic Pattern Databases , 2004, TACAS.
[39] Frank Reffel,et al. Error Detection with Directed Symbolic Model Checking , 1999, World Congress on Formal Methods.
[40] S. Edelkamp. Symbolic Exploration in Two-Player Games: Preliminary Results , 2002 .
[41] Stefan Edelkamp,et al. Directed Symbolic Exploration in AI-Planning , 2001 .
[42] Daniel Bryce,et al. Planning Graph Heuristics for Belief Space Search , 2006, J. Artif. Intell. Res..
[43] Albert Nymeyer,et al. Heuristic Search Algorithms Based on Symbolic Data Structures , 2003, Australian Conference on Artificial Intelligence.
[44] Jian Shen,et al. On Combining Formal and Informal Verification , 1997, CAV.
[45] Prof. Dr. Christoph Meinel,et al. Algorithms and Data Structures in VLSI Design , 1998, Springer Berlin Heidelberg.
[46] Hans-Peter Störr. Planning in the Fluent Calculus Using Binary Decision Diagrams , 2001, AI Mag..
[47] S. Edelkamp,et al. The Deterministic Part of IPC-4: An Overview , 2005, J. Artif. Intell. Res..
[48] Craig A. Knoblock,et al. PDDL-the planning domain definition language , 1998 .
[49] PlanningFrameworkRune M. Jensen,et al. OBDD-based Deterministic Planning using the UMOP , 2000 .
[50] Christoph Meinel,et al. A new partitioning scheme for improvement of image computation , 2001, Proceedings of the ASP-DAC 2001. Asia and South Pacific Design Automation Conference 2001 (Cat. No.01EX455).
[51] M. Veloso,et al. OBDD-Based Optimistic and Strong Cyclic Adversarial Planning , 2014 .
[52] Piergiorgio Bertoli,et al. Planning with Extended Goals and Partial Observability , 2004, ICAPS.