暂无分享,去创建一个
[1] Jussi Rintanen,et al. Expressive Equivalence of Formalisms for Planning with Sensing , 2003, ICAPS.
[2] Blai Bonet,et al. Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.
[3] Fabio Somenzi,et al. CUDD: CU Decision Diagram Package Release 2.2.0 , 1998 .
[4] Daniel S. Weld,et al. Probabilistic Planning with Information Gathering and Contingent Execution , 1994, AIPS.
[5] M. Fox,et al. The 3rd International Planning Competition: Results and Analysis , 2003, J. Artif. Intell. Res..
[6] Bernhard Nebel,et al. Extending Planning Graphs to an ADL Subset , 1997, ECP.
[7] R. Bryant. Graph-Based Algorithms for Boolean Function Manipulation12 , 1986 .
[8] Piergiorgio Bertoli,et al. Heuristic Search + Symbolic Model Checking = Efficient Conformant Planning , 2001, IJCAI.
[9] P. Pandurang Nayak,et al. Fragment-based Conformant Planning , 2002, AIPS.
[10] Nicholas Kushmerick,et al. An Algorithm for Probabilistic Least-Commitment Planning , 1994, AAAI.
[11] Illah R. Nourbakhsh,et al. Time-Saving Tips for Problem Solving with Incomplete Information , 1993, AAAI.
[12] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[13] David E. Smith,et al. Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.
[14] Marco Pistore,et al. Nusmv version 2: an opensource tool for symbolic model checking , 2002, CAV 2002.
[15] Drew McDermott,et al. A critique of pure reason 1 , 1987, The Philosophy of Artificial Intelligence.
[16] Piergiorgio Bertoli,et al. Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking , 2001, IJCAI.
[17] Daniel Bryce,et al. State Agnostic Planning Graphs and the Application to Belief-Space Planning , 2005, AAAI.
[18] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[19] Jussi Rintanen,et al. Distance Estimates for Planning in the Discrete Belief Space , 2004, AAAI.
[20] Daniel Bryce,et al. Cost Sensitive Reachability Heuristics for Handling State Uncertainty , 2005, UAI.
[21] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.
[22] Johan de Kleer,et al. An Assumption-Based TMS , 1987, Artif. Intell..
[23] Edwin P. D. Pednault,et al. Synthesizing plans that contain actions with context‐dependent effects 1 , 1988, Comput. Intell..
[24] Ronen I. Brafman,et al. Conformant planning via heuristic forward search: A new approach , 2004, Artif. Intell..
[25] Marco Roveri,et al. Conformant Planning via Symbolic Model Checking , 2000, J. Artif. Intell. Res..
[26] Nils J. Nilsson,et al. Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[27] Hector J. Levesque,et al. What Is Planning in the Presence of Sensing? , 1996, AAAI/IAAI, Vol. 2.
[28] Jana Koehler. Handling of Conditional Effects and Negative Goals in IPP , 1999 .
[29] Daniel Bryce,et al. Heuristic Guidance Measures for Conformant Planning , 2004, ICAPS.
[30] Piergiorgio Bertoli,et al. Improving Heuristics for Planning as Search in Belief Space , 2002, AIPS.
[31] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[32] Subbarao Kambhampati,et al. A Candidate Set Based Analysis of Subgoal Interactions in Conjunctive Goal Planning , 1996, AIPS.
[33] Shlomo Zilberstein,et al. LAO*: A heuristic search algorithm that finds solutions with loops , 2001, Artif. Intell..
[34] David E. Smith,et al. Conformant Graphplan , 1998, AAAI/IAAI.
[35] Subbarao Kambhampati,et al. Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search , 2002, Artif. Intell..
[36] Blai Bonet,et al. Planning as Heuristic Search: New Results , 1999, ECP.
[37] Albert-Ludwigs-Universiẗat. Product Representation of Belief Spaces in Planning under Partial Observability , 2003 .
[38] Fahiem Bacchus,et al. A Knowledge-Based Approach to Planning with Incomplete Information and Sensing , 2002, AIPS.