Alt Alt p: Online parallelization of plans with heuristic state search

Romeo Sanchez Nigenda, Subbarao Kambhampati

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Despite their near dominance, heuristic state search planners still lag behind disjunctive planners in the generation of parallel plans in classical planning. The reason is that directly searching for parallel solutions in state space planners would require the planners to branch on all possible subsets of parallel actions, thus increasing the branching factor exponentially. We present a variant of our heuristic state search planner AltAlt called AltAlt p which generates parallel plans by using greedy online parallelization of partial plans. The greedy approach is significantly informed by the use of novel distance heuristics that AHAlt p derives from a graphplan-style planning graph for the problem. While this approach is not guaranteed to provide optimal parallel plans, empirical results show that AltAlt p is capable of generating good quality parallel plans at a fraction of the cost incurred by the disjunctive planners.

Original languageEnglish (US)
Pages (from-to)631-657
Number of pages27
JournalJournal of Artificial Intelligence Research
Volume19
StatePublished - Jul 2003

Fingerprint

Planning
Costs

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Artificial Intelligence

Cite this

Alt Alt p : Online parallelization of plans with heuristic state search. / Nigenda, Romeo Sanchez; Kambhampati, Subbarao.

In: Journal of Artificial Intelligence Research, Vol. 19, 07.2003, p. 631-657.

Research output: Contribution to journalArticle

@article{f39089e54f1e4a04b75944e668ea780e,
title = "Alt Alt p: Online parallelization of plans with heuristic state search",
abstract = "Despite their near dominance, heuristic state search planners still lag behind disjunctive planners in the generation of parallel plans in classical planning. The reason is that directly searching for parallel solutions in state space planners would require the planners to branch on all possible subsets of parallel actions, thus increasing the branching factor exponentially. We present a variant of our heuristic state search planner AltAlt called AltAlt p which generates parallel plans by using greedy online parallelization of partial plans. The greedy approach is significantly informed by the use of novel distance heuristics that AHAlt p derives from a graphplan-style planning graph for the problem. While this approach is not guaranteed to provide optimal parallel plans, empirical results show that AltAlt p is capable of generating good quality parallel plans at a fraction of the cost incurred by the disjunctive planners.",
author = "Nigenda, {Romeo Sanchez} and Subbarao Kambhampati",
year = "2003",
month = "7",
language = "English (US)",
volume = "19",
pages = "631--657",
journal = "Journal of Artificial Intelligence Research",
issn = "1076-9757",
publisher = "Morgan Kaufmann Publishers, Inc.",

}

TY - JOUR

T1 - Alt Alt p

T2 - Online parallelization of plans with heuristic state search

AU - Nigenda, Romeo Sanchez

AU - Kambhampati, Subbarao

PY - 2003/7

Y1 - 2003/7

N2 - Despite their near dominance, heuristic state search planners still lag behind disjunctive planners in the generation of parallel plans in classical planning. The reason is that directly searching for parallel solutions in state space planners would require the planners to branch on all possible subsets of parallel actions, thus increasing the branching factor exponentially. We present a variant of our heuristic state search planner AltAlt called AltAlt p which generates parallel plans by using greedy online parallelization of partial plans. The greedy approach is significantly informed by the use of novel distance heuristics that AHAlt p derives from a graphplan-style planning graph for the problem. While this approach is not guaranteed to provide optimal parallel plans, empirical results show that AltAlt p is capable of generating good quality parallel plans at a fraction of the cost incurred by the disjunctive planners.

AB - Despite their near dominance, heuristic state search planners still lag behind disjunctive planners in the generation of parallel plans in classical planning. The reason is that directly searching for parallel solutions in state space planners would require the planners to branch on all possible subsets of parallel actions, thus increasing the branching factor exponentially. We present a variant of our heuristic state search planner AltAlt called AltAlt p which generates parallel plans by using greedy online parallelization of partial plans. The greedy approach is significantly informed by the use of novel distance heuristics that AHAlt p derives from a graphplan-style planning graph for the problem. While this approach is not guaranteed to provide optimal parallel plans, empirical results show that AltAlt p is capable of generating good quality parallel plans at a fraction of the cost incurred by the disjunctive planners.

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

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

M3 - Article

AN - SCOPUS:9444280520

VL - 19

SP - 631

EP - 657

JO - Journal of Artificial Intelligence Research

JF - Journal of Artificial Intelligence Research

SN - 1076-9757

ER -