Parametrized Families of Hard Planning Problems from Phase Transitions
暂无分享,去创建一个
Jeremy Frank | Eleanor G. Rieffel | Davide Venturelli | Itay Hen | Minh Do | J. Frank | M. Do | E. Rieffel | I. Hen | D. Venturelli
[1] Cristopher Moore,et al. Almost all graphs with average degree 4 are 3-colorable , 2002, STOC '02.
[2] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[3] Christoph Lenzen,et al. A generalized timeline representation, services, and interface for automating space mission operations , 2012, SpaceOps 2012 Conference.
[4] Jj Org Hoomann. Where Ignoring Delete Lists Works: Local Search Topology in Planning Benchmarks , 2003 .
[5] Malte Helmert,et al. Complexity results for standard benchmark domains in planning , 2003, Artif. Intell..
[6] Tom Bylander,et al. A Probabilistic Analysis of Propositional STRIPS Planning , 1996, Artif. Intell..
[7] A. Beacham. Hiding Our Colors , 1995 .
[8] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[9] Jussi Rintanen,et al. Planning as satisfiability: Heuristics , 2012, Artif. Intell..
[10] Bart Selman,et al. Unifying SAT-based and Graph-based Planning , 1999, IJCAI.
[11] O. Dubois,et al. On the non-3-colourability of random graphs , 2002 .
[12] Tad Hogg,et al. Phase Transitions in Artificial Intelligence Systems , 1987, Artif. Intell..
[13] Jussi Rintanen,et al. TR-CS-1203 Generation of Hard Solvable Planning Problems , 2012 .
[14] M. Fox,et al. The 3rd International Planning Competition: Results and Analysis , 2003, J. Artif. Intell. Res..
[15] P. Erdos,et al. On the evolution of random graphs , 1984 .
[16] Blai Bonet,et al. Automatic Polytime Reductions of NP Problems into a Fragment of STRIPS , 2011, ICAPS.
[17] B. Bollobás. The evolution of random graphs , 1984 .
[18] Ivan Serina,et al. Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..
[19] Jussi Rintanen. Phase Transitions in Classical Planning: An Experimental Study , 2004, ICAPS.
[20] Silvia Richter,et al. The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks , 2010, J. Artif. Intell. Res..
[21] John K. Slaney,et al. On the Hardness of Decision and Optimisation Problems , 1998, ECAI.
[22] János Komlós,et al. Limit distribution for the existence of hamiltonian cycles in a random graph , 1983, Discret. Math..
[23] D. Achlioptas,et al. A sharp threshold for k-colorability , 1999 .
[24] Hector J. Levesque,et al. Generating Hard Satisfiability Problems , 1996, Artif. Intell..
[25] Amin Coja-Oghlan,et al. Upper-Bounding the k-Colorability Threshold by Counting Covers , 2013, Electron. J. Comb..