An efficient algorithm for managing partial orders in planning

M. Fox, D. Long

Research output: Contribution to journalArticle

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.
LanguageEnglish
Pages3-12
Number of pages9
JournalSIGART Newsletter
Volume7
Issue number4
DOIs
Publication statusPublished - 1996

Fingerprint

Planning

Keywords

  • planning systems
  • computer science
  • tempman

Cite this

Fox, M. ; Long, D. / An efficient algorithm for managing partial orders in planning. In: SIGART Newsletter. 1996 ; Vol. 7, No. 4. pp. 3-12.
@article{e9eb562039e74aa09e201b25b34e3de0,
title = "An efficient algorithm for managing partial orders in planning",
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.",
keywords = "planning systems, computer science, tempman",
author = "M. Fox and D. Long",
year = "1996",
doi = "10.1145/264927.264930",
language = "English",
volume = "7",
pages = "3--12",
journal = "SIGART Newsletter",
issn = "0163-5719",
number = "4",

}

An efficient algorithm for managing partial orders in planning. / Fox, M.; Long, D.

In: SIGART Newsletter, Vol. 7, No. 4, 1996, p. 3-12.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An efficient algorithm for managing partial orders in planning

AU - Fox, M.

AU - Long, D.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

KW - planning systems

KW - computer science

KW - tempman

UR - http://doi.acm.org/10.1145/264927.264930

U2 - 10.1145/264927.264930

DO - 10.1145/264927.264930

M3 - Article

VL - 7

SP - 3

EP - 12

JO - SIGART Newsletter

T2 - SIGART Newsletter

JF - SIGART Newsletter

SN - 0163-5719

IS - 4

ER -