CS&E logo University of Washington Computer Science & Engineering
 Temporal Graphplan
  CSE Home   AI Home  About CSE    Search    Contact Info 

Project faculty
 Dan Weld
Project visitors
 David E. Smith

Temporal Graphplan (TGP)


Many planning domains require a richer notion of time in which actions can overlap and have different durations. The key to fast performance in classical planners (e.g., Graphplan, IPP, and Blackbox) has been the use of a disjunctive representation with powerful mutual exclusion reasoning. This paper presents TGP, a new algorithm for temporal planning. TGP operates by incrementally expanding a compact planning graph representation that handles actions of differing duration. The key to TGP performance is tight mutual exclusion reasoning which is based on an expressive language for bounding mutexes and includes mutexes between actions and propositions. Our experiments demonstrate that mutual exclusion reasoning remains valuable in a rich temporal setting.

TGP is available for download at ftp://ftp.cs.washington.edu/pub/ai/tgp.tgz.


CSE logo Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA  98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to Dan Weld]