Skip to main content

Replanning using hierarchical task network and operator-based planning

  • Conference paper
  • First Online:
Recent Advances in AI Planning (ECP 1997)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1348))

Included in the following conference series:

Abstract

To scale-up to real-world problems, planning systems must be able to replan in order to deal with changes in problem context. In this paper we describe hierarchical task network and operator-based replanning techniques which allow adaptation of a previous plan to account for problems associated with executing plans in real-world domains with uncertainty, concurrency, changing objectives. We focus on replanning which preserves elements of the original plan in order to use more reliable domain knowledge and to facilitate user understanding of produced plans. We present empirical results documenting the effectiveness of these techniques in a NASA antenna operations application.

2 This paper describes work performed by the Jet Propulsion Laboratory, California Institute of Technology, under contract with the National Aeronautics and Space Administration.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Carbonell, J.G.; Blythe, J.; Etzioni, O.; Gil, Y.; Joseph, R.; Kahn, D.; Knoblock, C.; Minton, S.; Pérez, M. A.; Reilly, S.; Veloso, M.; and Wang, X. PRODIGY 4.0: The Manual and Tutorial. Technical report, School of Computer Science, Carnegie Mellon University, 1992.

    Google Scholar 

  2. S. Chien, A. Govindjee, T. Estlin, X. Wang, and R. Hill Jr., Integrating Hierarchical Task Network and Operator-based Planning Techniques to Automate Operations of Communications Antennas, IEEE Expert, December 1996.

    Google Scholar 

  3. B. Drabble. Replanning in the O(Plan) architecture. Personal communication, 1995.

    Google Scholar 

  4. K. Erol, J. Hendler, and D. Nau, UMCP:A Sound and Complete Procedure for Hierarchical Task Network Planning, Proceedings of the Second International Conference on AI Planning Systems, Chicago, IL, June 1994, pp. 249–254.

    Google Scholar 

  5. K. Hammond. Case-Based Planning: Viewing planning as a memory task. 1989.

    Google Scholar 

  6. S. Kambhampati. A theory of plan modification. In Proceedings of the Eighth National Conference on Artificial Intelligence, Boston, MA, 1990.

    Google Scholar 

  7. S. Kambhampati. A Comparative analysis of Partial Order Planning and Task Reduction Planning In ACM SIGART Bulletin, Vol.6., No.1, 1995.

    Google Scholar 

  8. C. Knoblock. Planning, executing, sensing, and replanning for information gathering. In Proceedings of IJCAI 95, Montreal, CA, 1995.

    Google Scholar 

  9. J. S. Pemberthy and D. S. Weld, UCPOP: A Sound Complete, Partial Order Planner for ADL, Proceedings of the Third International Conference on Knowledge Representation and Reasoning, October 1992.

    Google Scholar 

  10. K. Currie and A. Tate, The Open Planning Architecture, In Artificial Intelligence, 51(1), 1991.

    Google Scholar 

  11. M. Veloso. Learning by Analogical Reasoning in General Problem Solving. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1992.

    Google Scholar 

  12. D. Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xuemei Wang .

Editor information

Sam Steel Rachid Alami

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, X., Chien, S. (1997). Replanning using hierarchical task network and operator-based planning. In: Steel, S., Alami, R. (eds) Recent Advances in AI Planning. ECP 1997. Lecture Notes in Computer Science, vol 1348. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63912-8_104

Download citation

  • DOI: https://doi.org/10.1007/3-540-63912-8_104

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63912-1

  • Online ISBN: 978-3-540-69665-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics