Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 687578, 9 pages
http://dx.doi.org/10.1155/2013/687578
Research Article

Phase Transitions of Contingent Planning Problem

College of Computer, Northeast Normal University, Changchun 130117, China

Received 19 June 2013; Accepted 18 July 2013

Academic Editor: William Guo

Copyright © 2013 Junping Zhou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. A. Cook, “The complexity of theorem proving procedures,” in Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, M. A. Harrison, R. B. Banerji, and J. D. Ullman, Eds., pp. 151–158, New York, NY, USA, 1971.
  2. J. M. Crawford and L. D. Auton, “Experimental results on the crossover point in satisfiability problems,” in Proceedings of the 11th National Conference on Artificial Intelligence, W. R. Swartout, Ed., pp. 21–27, Washington, DC, USA, July 1993. View at Scopus
  3. B. Selman, D. G. Mitchell, and H. J. Levesque, “Generating hard satisfiability problems,” Artificial Intelligence, vol. 81, no. 1-2, pp. 17–29, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, “Determining computational complexity from characteristic ‘phase transitions’,” Nature, vol. 400, no. 6740, pp. 133–137, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. D. Mitchell, B. Selman, and H. Levesque, “Hard and easy distributions of SAT problems,” in Proceedings of the 10th National Conference on Artificial Intelligence (AAAI '92), W. R. Swartout, Ed., pp. 459–465, San Jose, Calif, USA, July 1992. View at Scopus
  6. E. Friedgut, “Sharp thresholds of graph properties, and the k-sat problem,” Journal of the American Mathematical Society, vol. 12, no. 4, pp. 1017–1054, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. A. Frieze and S. Suen, “Analysis of two simple heuristics on a random instance of k-SAT,” Journal of Algorithms, vol. 20, no. 2, pp. 312–355, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. L. M. Kirousis, E. Kranakis, D. Krizanc, and Y. C. Stamatiou, “Approximating the unsatisfiability threshold of random formulas,” Random Structures and Algorithms, vol. 12, no. 3, pp. 253–269, 1998. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  9. I. P. Gent and T. Walsh, “The TSP phase transition,” Artificial Intelligence, vol. 88, no. 1-2, pp. 349–358, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. K. Xu and W. Li, “Exact phase transitions in random constraint satisfaction problems,” Journal of Artificial Intelligence Research, vol. 12, pp. 93–103, 2000. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  11. D. Coppersmith, D. Gamarnik, M. Hajiaghayi, and G. B. Sorkin, “Random MAX SAT, random MAX CUT, and their phase transitions,” Random Structures and Algorithms, vol. 24, no. 4, pp. 502–545, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  12. J. Rintanen, “Phase transitions in classical planning: an experimental study,” in Proceedings of the 14th International Conference on Automated Planning and Scheduling, S. Zilberstein, J. Koehler, and S. Koenig, Eds., pp. 101–110, British Columbia, Canada, 2004.
  13. J. Zhou, P. Huang, M. Yin, and C. Zhou, “Phase transitions of expspace-complete problems,” International Journal of Foundations of Computer Science, vol. 21, no. 6, pp. 1073–1088, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. J. Zhou, M. Yin, X. Li, and J. Wang, “Phase transitions of expspace-complete problems: a further step,” International Journal of Foundations of Computer Science, vol. 23, no. 1, pp. 173–184, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. H. Palacios and H. Geffner, “From conformant into classical planning: efficient translations that may be complete too,” in Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS '07), M. S. Boddy, M. Fox, and S. Thiébaux, Eds., pp. 264–271, Providence, RI, USA, September 2007. View at Scopus
  16. D. Bryce, S. Kambhampati, and D. E. Smith, “Planning graph heuristics for belief space search,” Journal of Artificial Intelligence Research, vol. 26, pp. 35–99, 2006. View at Google Scholar · View at Scopus
  17. M. Helmert, “The fast downward planning system,” Journal of Artificial Intelligence Research, vol. 26, pp. 191–246, 2006. View at Google Scholar · View at Scopus
  18. U. Kuter, D. Nau, M. Pistore, and P. Traverso, “Task decomposition on abstract states, for planning under nondeterminism,” Artificial Intelligence, vol. 173, no. 5-6, pp. 669–695, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  19. J.-P. Zhou, M.-H. Yin, W.-X. Gu, and J.-G. Sun, “Research on decreasing observation variables for strong planning under partial observation,” Journal of Software, vol. 20, no. 2, pp. 290–304, 2009. View at Publisher · View at Google Scholar · View at Scopus
  20. R. P. Goldman and M. S. Boddy, “Expressive planning and explicit knowledge,” in Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems, B. Drabble, Ed., pp. 110–117, Edinburgh, Scotland, 1996.
  21. J. Hoffmann and R. I. Brafman, “Contingent planning via heuristic forward search with implicit belief states,” in Proceedings of the 15th International Conference on Automated Planning and Scheduling, S. Biundo, K. L. Myers, and K. Rajan, Eds., pp. 71–80, Monterey, Calif, USA, 2005.