Using Temporal Knowledge in a Constraint-Based Planner

Placeholder Show Content

Abstract/Contents

Abstract
Incorporating domain-specific temporal knowledge into a constraint-based planner can significantly decrease the computation time. This paper describes a method for compiling and embedding user specified temporal information into the constraint problem translation of a planning problems.

Description

Type of resource text
Date created 2002

Creators/Contributors

Author Bradley, Aaron R.
Advisor Nayak, Pandu
Advisor Stanford University. Department of Computer Science.

Subjects

Subject Logic > Symbolic and mathematical
Subject Planning
Genre Thesis

Bibliographic information

Access conditions

Use and reproduction
User agrees that, where applicable, content will not be used to identify or to otherwise infringe the privacy or confidentiality rights of individuals. Content distributed via the Stanford Digital Repository may be subject to additional license and use restrictions applied by the depositor.
License
This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).

Preferred citation

Preferred Citation
Bradley, Aaron R. (2002). Using Temporal Knowledge in a Constraint-Based Planner. Stanford Digital Repository. Available at http://purl.stanford.edu/rv840qz8865.

Collection

Undergraduate Theses, School of Engineering

View other items in this collection in SearchWorks

Contact information

Also listed in

Loading usage metrics...