An efficient algorithm for managing partial orders in planning

Fox, M. and Long, D. (1996) An efficient algorithm for managing partial orders in planning. SIGART Newsletter, 7 (4). pp. 3-12. ISSN 0163-5719 (http://doi.acm.org/10.1145/264927.264930)

Full text not available in this repository.Request a copy

Abstract

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.

CORE (COnnecting REpositories)