Conformant planning via heuristic forward search: A new approach

Bonet, 2000, Planning with incomplete information as heuristic search in belief space, 52 Cimatti, 2000, Conformant planning via symbolic model checking, JAIR, 13, 305, 10.1613/jair.774 P. Bertoli, A. Cimatti, Improving heuristics for planning as search in belief space, in: [30], pp. 143–152 Davis, 1960, A computing procedure for quantification theory, J. ACM, 7, 201, 10.1145/321033.321034 Davis, 1962, A machine program for theorem proving, Comm. ACM, 5, 394, 10.1145/368273.368557 Hoffmann, 2001, The FF planning system: Fast plan generation through heuristic search, J. Artificial Intelligence Res., 14, 253, 10.1613/jair.855 D. Bryce, S. Kambhampati, D.E. Smith, Planning in belief space with a labelled uncertainty graph, in: Proc. AAAI-04 Workshop on Learning and Planning in Markov Decision Processes, 2004 Ferraris, 2000, Planning as satisfiability in nondeterministic domains, 748 Giunchiglia, 2000, Planning as satisfiability with expressive action languages: Concurrency, constraints, and nondeterminism McCarthy, 1969, Some philosophical problems from the standpoint of artificial intelligence, 463 Bylander, 1994, The computational complexity of propositional STRIPS planning, Artificial Intelligence, 69, 165, 10.1016/0004-3702(94)90081-7 Turner, 2002, Polynomial-length planning spans the polynomial hierarchy, 111 Bonet, 2001, Planning as heuristic search, Artificial Intelligence, 129, 5, 10.1016/S0004-3702(01)00108-4 L. Zhang, S. Malik, Extracting small unsatisfiable cores from unsatisfiable boolean formulas, in: Proc. SAT-03, 2003 Blum, 1997, Fast planning through planning graph analysis, Artificial Intelligence, 90, 279 Moskewicz R. Brafman, A simplifier for propositional formulas with many binary clauses, in: [31], pp. 515–520 R.P.A. Petrick, F. Bacchus, A knowledge-based approach to planning with incomplete information and sensing, in: [30], pp. 212–221 Cimatti, 2004, Conformant planning via symbolic model checking and heuristic search, Artificial Intelligence, 159, 127, 10.1016/j.artint.2004.05.003 Slaney, 2001, Blocks world revisited, Artificial Intelligence, 125, 119, 10.1016/S0004-3702(00)00079-5 Smith, 1998, Conformant Graphplan, 889 J. Kurien, P.P. Nayak, D.E. Smith, Fragment-based conformant planning, in: [30], pp. 153–162 A. Cimatti, M. Roveri, P. Bertoli, Heuristic search + symbolic model checking = efficient conformant planning, in: [31], pp. 467–472 D. Bryce, S. Kambhampari, Heuristic guidance measures for conformant planning, in: [29], pp. 365–374 Rintanen, 1999, Constructing conditional plans by a theorem-prover, J. Artificial Intelligence Res., 10, 323, 10.1613/jair.591 Eiter, 2003, A logic programming approach to knowledge-state planning, II: The DLVK system, Artificial Intelligence, 144, 157, 10.1016/S0004-3702(02)00367-3 Gazen, 1997, Combining the expressiveness of UCPOP with the efficiency of Graphplan, vol. 1348, 221 Hoffmann, 2005, Contingent planning via heuristic forward search with implicit belief states 2004 2002 2001