Phase Transitions of EXPSPACE-Complete Problems: a Further Step

This paper further explores the phase transitions of the EXPSPACE-complete problems, focusing on the conformant plan modification. By analyzing features of the conformant plan modification, quantitative results are obtained. If the number of actions is't greater than θub, almost all the conformant planning instances can't be solved with the conformant plan modification. If the number of actions is't lower than θlb, almost all the conformant planning instances can be solved with the conformant plan modification. The results of the experiments show that there indeed exists an experimental threshold γc of density (ratio of number of actions to number of propositions), which separates the region where almost all conformant planning instances can't be solved with the conformant plan modification from the region where almost all conformant planning instances can be solved with the conformant plan modification.

[1]  Phokion G. Kolaitis,et al.  Phase transitions of PP-complete satisfiability problems , 2001, Discret. Appl. Math..

[2]  Toby Walsh,et al.  Beyond NP: the QSAT phase transition , 1999, AAAI/IAAI.

[3]  Toby Walsh,et al.  The TSP Phase Transition , 1996, Artif. Intell..

[4]  Wei Li,et al.  Exact Phase Transitions in Random Constraint Satisfaction Problems , 2000, J. Artif. Intell. Res..

[5]  Bernhard Nebel,et al.  Plan Modification versus Plan Generation: A Complexity-Theoretic Perspective , 1993, IJCAI.

[6]  Malte Helmert,et al.  The Fast Downward Planning System , 2006, J. Artif. Intell. Res..

[7]  Ping Huang,et al.  Phase Transitions of EXPSPACE-Complete Problems , 2010, Int. J. Found. Comput. Sci..

[8]  Kaile Su,et al.  Large Hinge Width on Sparse Random Hypergraphs , 2011, IJCAI.

[9]  Jussi Rintanen.  Phase Transitions in Classical Planning: An Experimental Study , 2004, ICAPS.

[10]  Ke Xu,et al.  Random constraint satisfaction: Easy generation of hard (satisfiable) instances , 2007, Artif. Intell..

[11]  Jigui Sun,et al.  Research on Decreasing Observation Variables for Strong Planning under Partial Observation: Research on Decreasing Observation Variables for Strong Planning under Partial Observation , 2009 .

[12]  Wei Li,et al.  Many hard examples in exact phase transitions , 2003, Theor. Comput. Sci..

[13]  S Kirkpatrick,et al.  Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .