Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 1999

Total order planning is more efficient than we thought

Vincent Vidal, P. Régnier

Cited by 6Abstract and details only

Abstract

In this paper, we present VVPLAN, a planner based on a classical state space search algorithm. The language used for domain and problem representation is ADL (Pednault 1989). We have compared VVPLAN to UCPOP (Penberthy and Weld 1992)(Weld 1994), a planner that admits the same representation language. Our experiments prove that such an algorithm is often more efficient than a planner based on a search in the space of partial plans. This result is achieved as soon as we introduce in VVPLAN’s algorithm a loop test relating to previously visited states. In particular domains, VVPLAN can also outperform IPP (Koehler et al. 1997), which makes a planning graph analysis as GRAPHPLAN. We present here the details of our comparison with UCPOP, the results we obtain and our conclusions.

Cite this paper

APA 7

Vidal, V., & Régnier, P. (1999). Total order planning is more efficient than we thought.

MLA 9

Vidal, Vincent, and P. Régnier. “Total order planning is more efficient than we thought.” 1999, pp. 591–96.

Chicago

Vidal, Vincent, and P. Régnier. 1999. “Total order planning is more efficient than we thought.”

Harvard

Vidal, V. and Régnier, P. (1999) ‘Total order planning is more efficient than we thought’.

BibTeX
@article{vidal1999total,
  title = {{Total order planning is more efficient than we thought}},
  author = {Vidal, Vincent and Régnier, P.},
  pages = {591--596},
  year = {1999}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers