Reviving partial order planning

XuanLong Nguyen, Subbarao Kambhampati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

84 Citations (Scopus)

Abstract

This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make them competitive with the state of the art plan synthesis algorithms. Our key insight is that the techniques responsible for the efficiency of the currently successful planners-viz., distance based heuristics, reachability analysis and disjunctive constraint handling-can also be adapted to dramatically improve the efficiency of the POP algorithm. We implement our ideas in a variant of UCPOP called REPOP 1. Our empirical results show that in addition to dominating UCPOP, REPOP also convincingly outperforms Graphplan in several "parallel" domains. The plans generated by REPOP also tend to be better than those generated by Graphplan and state search planners in terms of execution flexibility.

Original languageEnglish (US)
Title of host publicationIJCAI International Joint Conference on Artificial Intelligence
Pages459-464
Number of pages6
StatePublished - 2001
Event17th International Joint Conference on Artificial Intelligence, IJCAI 2001 - Seattle, WA, United States
Duration: Aug 4 2001Aug 10 2001

Other

Other17th International Joint Conference on Artificial Intelligence, IJCAI 2001
CountryUnited States
CitySeattle, WA
Period8/4/018/10/01

Fingerprint

Planning
Scalability

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Nguyen, X., & Kambhampati, S. (2001). Reviving partial order planning. In IJCAI International Joint Conference on Artificial Intelligence (pp. 459-464)

Reviving partial order planning. / Nguyen, XuanLong; Kambhampati, Subbarao.

IJCAI International Joint Conference on Artificial Intelligence. 2001. p. 459-464.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nguyen, X & Kambhampati, S 2001, Reviving partial order planning. in IJCAI International Joint Conference on Artificial Intelligence. pp. 459-464, 17th International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, WA, United States, 8/4/01.
Nguyen X, Kambhampati S. Reviving partial order planning. In IJCAI International Joint Conference on Artificial Intelligence. 2001. p. 459-464
Nguyen, XuanLong ; Kambhampati, Subbarao. / Reviving partial order planning. IJCAI International Joint Conference on Artificial Intelligence. 2001. pp. 459-464
@inproceedings{c7c14a32ab384c37a50660bbe7f92327,
title = "Reviving partial order planning",
abstract = "This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make them competitive with the state of the art plan synthesis algorithms. Our key insight is that the techniques responsible for the efficiency of the currently successful planners-viz., distance based heuristics, reachability analysis and disjunctive constraint handling-can also be adapted to dramatically improve the efficiency of the POP algorithm. We implement our ideas in a variant of UCPOP called REPOP 1. Our empirical results show that in addition to dominating UCPOP, REPOP also convincingly outperforms Graphplan in several {"}parallel{"} domains. The plans generated by REPOP also tend to be better than those generated by Graphplan and state search planners in terms of execution flexibility.",
author = "XuanLong Nguyen and Subbarao Kambhampati",
year = "2001",
language = "English (US)",
pages = "459--464",
booktitle = "IJCAI International Joint Conference on Artificial Intelligence",

}

TY - GEN

T1 - Reviving partial order planning

AU - Nguyen, XuanLong

AU - Kambhampati, Subbarao

PY - 2001

Y1 - 2001

N2 - This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make them competitive with the state of the art plan synthesis algorithms. Our key insight is that the techniques responsible for the efficiency of the currently successful planners-viz., distance based heuristics, reachability analysis and disjunctive constraint handling-can also be adapted to dramatically improve the efficiency of the POP algorithm. We implement our ideas in a variant of UCPOP called REPOP 1. Our empirical results show that in addition to dominating UCPOP, REPOP also convincingly outperforms Graphplan in several "parallel" domains. The plans generated by REPOP also tend to be better than those generated by Graphplan and state search planners in terms of execution flexibility.

AB - This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make them competitive with the state of the art plan synthesis algorithms. Our key insight is that the techniques responsible for the efficiency of the currently successful planners-viz., distance based heuristics, reachability analysis and disjunctive constraint handling-can also be adapted to dramatically improve the efficiency of the POP algorithm. We implement our ideas in a variant of UCPOP called REPOP 1. Our empirical results show that in addition to dominating UCPOP, REPOP also convincingly outperforms Graphplan in several "parallel" domains. The plans generated by REPOP also tend to be better than those generated by Graphplan and state search planners in terms of execution flexibility.

UR - http://www.scopus.com/inward/record.url?scp=84880865654&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880865654&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84880865654

SP - 459

EP - 464

BT - IJCAI International Joint Conference on Artificial Intelligence

ER -