Skip to main content

Planning

  • Chapter
  • 1075 Accesses

Part of the Applied Logic Series book series (APLS,volume 33)

Keywords

  • Planning Problem
  • Search Tree
  • Complex Action
  • Optimal Plan
  • Conditional Action

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   19.99
Price excludes VAT (Canada)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6.5 Bibliographical Notes

  1. C. Bäckström and I. Klein. Planning in polynomial time: The SAS-PUBS class. Journal of Computational Intelligence, 7(3):181–197, 1991.

    Google Scholar 

  2. C. Bäckström and B. Nebel. Complexity Results for SAS+ Planning. In R. Bajcsy, editor, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 1430–1435, Chambéry, France, August 1993. Morgan Kaufmann.

    Google Scholar 

  3. Fahiem Bacchus and Froduald Kabanza. Using temporal logic to express search control knowledge for planning. Artificial Intelligence, 116(1–2):123–191, 2000.

    Google Scholar 

  4. Chitta Baral and Tran Cao Son. Approximate reasoning about actions in presence of sensing and incomplete information. In J. Maluszynski, editor, Proceedings of the International Logic Programming Symposium (ILPS), pages 387–401, Port Jefferson, NY, October 1997. MIT Press.

    Google Scholar 

  5. Avrim L. Blum and Merrick L. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90(1–2):281–300, 1997.

    Google Scholar 

  6. Tom Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69:165–204, 1994.

    CrossRef  Google Scholar 

  7. [Ernst et al., 1997]_Michael D. Ernst, Todd D. Millstein, and Daniel S. Weld. Automatic SAT-compilation of planning problems. In M. E. Pollack, editor, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 1169–1176, Nagoya, Japan, August 1997. Morgan Kaufmann.

    Google Scholar 

  8. [Giacomo et al., 1997]_Giuseppe De Giacomo, Luca Iocchi, Daniele Nardi, and Riccardo Rosati. Planning with sensing for a mobile robot. In Proceedings of the European Conference on Planning (ECP), volume 1348 of LNAI, pages 158–170. Springer, 1997.

    Google Scholar 

  9. [Giacomo et al., 2002]_Giuseppe De Giacomo, Yves Lespérance, Hector Levesque, and Sebastian Sardiña. On the semantics of deliberation in IndiGolog—from theory to practice. In D. Fensel, D. McGuinness, and M.-A. Williams, editors, Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 603–614, Toulouse, France, April 2002. Morgan Kaufmann.

    Google Scholar 

  10. Giuseppe De Giacomo and Hector Levesque. An incremental interpreter for high-level programs with sensing. In H. Levesque and F. Pirri, editors, Logical Foundations for Cognitive Agents, pages 86–102. Springer, 1999.

    Google Scholar 

  11. Keith Golden and Daniel Weld. Representing sensing actions: The middle ground revisited. In L. C. Aiello, J. Doyle, and S. Shapiro, editors, Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 174–185, Cambridge, MA, November 1996. Morgan Kaufmann.

    Google Scholar 

  12. Henry Kautz and Bart Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In B. Clancey and D. Weld, editors, Proceedings of the AAAI National Conference on Artificial Intelligence, pages 1194–1201, Portland, OR, August 1996. MIT Press.

    Google Scholar 

  13. Jonas Kvarnström. Applying domain analysis techniques for domain-dependent control in TALplanner. In Proceedings of the International Conference on AI Planning Systems (AIPS), pages 369–378, Toulouse, France, April 2002. Morgan Kaufmann.

    Google Scholar 

  14. Jonas Kvarnström and Patrick Doherty. TALplanner: A temporal logic based forward chaining planner. Annals of Mathematics and Artificial Intelligence, 30:119–169, 2000.

    Google Scholar 

  15. Gerhard Lakemeyer. On sensing and off-line interpreting GOLOG. In H. Levesque and F. Pirri, editors, Logical Foundations for Cognitive Agents, pages 173–189. Springer, 1999.

    Google Scholar 

  16. [Levesque et al., 1997]_Hector Levesque, Raymond Reiter, Yves Lespérance, Fangzhen Lin, and Richard Scherl. GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming, 31(1–3):59–83, 1997.

    Google Scholar 

  17. Jorge Lobo. COPLAS: A conditional planner with sensing actions. In Cognitive Robotics, volume FS-98-02 of AAAI Fall Symposia, pages 109–116. AAAI Press, October 1998.

    Google Scholar 

  18. John McCarthy. Programs with Common Sense. In Proceedings of the Symposium on the Mechanization of Thought Processes, volume 1, pages 77–84, London, November 1958. (Reprinted in: [McCarthy, 1990]).

    Google Scholar 

  19. John McCarthy. Situations and Actions and Causal Laws. Stanford Artificial Intelligence Project, Memo 2, Stanford University, CA, 1963.

    Google Scholar 

  20. Raymond Reiter. Knowledge in Action. MIT Press, 2001.

    Google Scholar 

  21. Richard Scherl and Hector Levesque. The frame problem and knowledge-producing actions. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 689–695, Washington, DC, July 1993.

    Google Scholar 

  22. Murray Shanahan. Prediction is deduction but explanation is abduction. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 1055–1060, Detroit, MI, 1989.

    Google Scholar 

Download references

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer

About this chapter

Cite this chapter

(2005). Planning. In: Reasoning Robots. Applied Logic Series, vol 33. Springer, Dordrecht. https://doi.org/10.1007/1-4020-3069-X_6

Download citation

Publish with us

Policies and ethics