An efficient algorithm for managing partial orders in planning

M. Fox, D. Long

Research output: Contribution to journalArticlepeer-review


Partial orders are an essential supporting component of non-linear, constraint-posting planning algorithms. However, managing partial orders represents an expensive overhead in plan construction and development. Simple solutions are only suitable for very small planning problems involving tens rather than hundreds of partially ordered elements. For more sophisticated planning languages allowing the representation of point-based intervals and abstraction it is necessary to manage far larger sets of temporal elements. In this paper is presented an approach and algorithm, TEMPMAN, for the management of partial orders which exploits the typical properties of planned partial orders to achieve a significantly better performance than existing solutions to this problem.
Original languageEnglish
Pages (from-to)3-12
Number of pages9
JournalSIGART Newsletter
Issue number4
Publication statusPublished - 1996


  • planning systems
  • computer science
  • tempman


Dive into the research topics of 'An efficient algorithm for managing partial orders in planning'. Together they form a unique fingerprint.

Cite this