About this Journal Submit a Manuscript Table of Contents
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 398245, 6 pages
http://dx.doi.org/10.1155/2013/398245
Research Article

On the Completeness of Pruning Techniques for Planning with Conditional Effects

1School of Computer Science and Engineering, Wuhan Institute of Technology, Wuhan 430205, China
2Hubei Province Key Laboratory of Intelligent Robot, Wuhan Institute of Technology, Wuhan 430205, China

Received 18 May 2013; Accepted 17 July 2013

Academic Editor: William Guo

Copyright © 2013 Dunbo Cai 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. H. Kautz and B. Selman, “Pushing the envelope: planning, propositional logic, and stochastic search,” in Proceedings of the 13th National Conference on Artificial Intelligence, pp. 1194–1201, August 1996. View at Scopus
  2. B. Bonet and H. Geffner, “Planning as heuristic search,” Artificial Intelligence, vol. 129, no. 1-2, pp. 5–33, 2001, Heuristic search in artificial intelligence. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. M. B. Do and S. Kambhampati, “Planning as constraint satisfaction: solving the planning graph by compiling it into CSP,” Artificial Intelligence, vol. 132, no. 2, pp. 151–182, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  4. N. Eén and A. Biere, “Effective preprocessing in SAT through variable and clause elimination,” in Theory and Applications of Satisfiability Testing, vol. 3569, pp. 61–75, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. X. Li and M. Yin, “An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure,” Advances in Engineering Software, vol. 55, pp. 10–31, 2013.
  6. X. Li and M. Yin, “A discrete artificial bee colony algorithm with composite mutation strategies for permutation flow shop scheduling problem,” Scientia Iranica, vol. 19, no. 6, pp. 1921–1935, 2012. View at Publisher · View at Google Scholar
  7. D. Cai, J. Sun, and M. Yin, “Making FF faster in ADL domains,” in Proceedings of the 3rd International Conference on Natural Computation (ICNC '07), vol. 2, pp. 160–164, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  8. M. Katz, J. Hoffmann, and C. Domshlak, “Who said we need to relax all variables?” in Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS '13), AAAI Press, 2013.
  9. P. H. Tu, T. C. Son, M. Gelfond, and A. R. Morales, “Approximation of action theories and its application to conformant planning,” Artificial Intelligence, vol. 175, no. 1, pp. 79–119, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. J. Rintanen, “Planning as satisfiability: heuristics,” Artificial Intelligence, vol. 193, pp. 45–86, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  11. J. Hoffmann and B. Nebel, “The FF planning system: fast plan generation through heuristic search,” Journal of Artificial Intelligence Research, vol. 14, pp. 253–302, 2001. View at Scopus
  12. M. Helmert, “The fast downward planning system,” Journal of Artificial Intelligence Research, vol. 26, pp. 191–246, 2006. View at Scopus
  13. J. Hoffmann and R. I. Brafman, “Conformant planning via heuristic forward search: a new approach,” Artificial Intelligence, vol. 170, no. 6-7, pp. 507–541, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. J. Hoffmann and R. Brafman, “Contingent planning via heuristic forward search with implicit belief states,” in Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS' 05), vol. 2005, 2005.
  15. B. Bonet and E. Hansen, “Heuristic Search for Planning under Uncertainty,” in Heuristics, Probability and Causality: A Tribute To Judea Pearl, pp. 3–22, College Publications, 2010.
  16. A. Gerevini, I. Serina, A. Saetti, and S. Spinoni, “Local search techniques for temporal planning in lpg,” in Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS '03), pp. 62–72, 2003.
  17. Y. Chen, B. W. Wah, and C.-W. Hsu, “Temporal planning using subgoal partitioning and resolution in SGPlan,” Journal of Artificial Intelligence Research, vol. 26, pp. 323–369, 2006. View at Scopus
  18. S. Richter, M. Helmert, and M. Westphal, “Landmarks revisited,” in Proceedings of the 23rd AAAI Conference on Artificial Intelligence, pp. 975–982, July 2008. View at Scopus
  19. D. McDermott, “Using regression-match graphs to control search in planning,” Artificial Intelligence, vol. 109, no. 1, pp. 111–159, 1999. View at Publisher · View at Google Scholar · View at Scopus
  20. E. P. D. Pednault, “ADL: exploring the middle ground between STRIPS and the situation calculus,” in Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning, pp. 324–332, 1989. View at MathSciNet
  21. B. C. Gazen and C. A. Knoblock, “Combining the expressivity of ucpop with the efficiency of graphplan,” in Proceedings of the 4th European Conference on Planning (ECP '97), pp. 221–233, 1997.
  22. J. Koehler, B. Nebel, J. Hoffmann, and Y. Dimopoulos, “Extending planning graphs to an adl subset,” in Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning (ECP '97), pp. 273–285, 1997.
  23. C. R. Anderson, D. E. Smith, and D. S. Weld, “Conditional effects in graphplan,” in Proceedings of the AIPS, pp. 44–53, 1998.
  24. A. L. Blum and M. L. Furst, “Fast planning through planning graph analysis,” Artificial Intelligence, vol. 90, no. 1-2, pp. 281–300, 1997. View at Scopus
  25. D. S. Weld, “Introduction to least commitment planning,” AI Magazine, vol. 15, no. 4, pp. 27–61, 1994. View at Scopus
  26. B. Nebel, Y. Dimopoulos, and J. Koehler, “Ignoring irrelevant facts and operators in plan generation,” in Proceedings of the European Conference on Planning (ECP '97), pp. 338–350, 1997.
  27. D. Cai, J. Hoffmann, and M. Helmert, “Enhancing the context-enhanced additive heuristic with precedence constraints,” in Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS '09), pp. 50–57, grc, September 2009. View at Scopus
  28. C. Bäckström and B. Nebel, “Complexity results for SAS+ planning,” Computational Intelligence, vol. 11, no. 4, pp. 625–655, 1995. View at Publisher · View at Google Scholar · View at MathSciNet