Hierarchically merging plans in decomposable domains

John M. Britanik, Michael Mahmoud Marefat

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Recent works in domain-independent plan merging have shown that the optimal plan merging problem is NP-hard, and heuristic algorithms have been proposed to generate near-optimal solutions. We have developed a plan merging methodology that merges partial-order plans based on the notion of plan fragments. In contrast to previous works, mergeability classes no longer necessarily form a partition over the set of actions in the input plans. This methodology applies to a class of planning domains which are decomposable. We also investigate the previously unexplored notion of alternative actions in domain-independent plan merging, which can improve the quality of the resulting merged plan, and a novel approach is presented for removing cyclic dependencies that may result during the plan merging process. We provide theoretical analyses of several algorithms for computing the minimum cost cover of plan fragments, a central component of the methodology. We support the theoretical analysis of these algorithms with experimental data to show that a greedy approach is near-optimal and efficient.

Original languageEnglish (US)
Pages (from-to)27-40
Number of pages14
JournalIEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans
Volume29
Issue number1
DOIs
StatePublished - 1999

Fingerprint

Decomposable
Merging
Heuristic algorithms
Methodology
Computational complexity
Fragment
Planning
Analysis of Algorithms
Partial Order
Heuristic algorithm
Costs
Theoretical Analysis
NP-complete problem
Optimal Solution
Partition
Experimental Data
Cover
Computing
Alternatives

Keywords

  • Plan merging
  • Planning

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Human-Computer Interaction
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Hierarchically merging plans in decomposable domains. / Britanik, John M.; Marefat, Michael Mahmoud.

In: IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans, Vol. 29, No. 1, 1999, p. 27-40.

Research output: Contribution to journalArticle

@article{b49c566b86654cabb09406913ab99b08,
title = "Hierarchically merging plans in decomposable domains",
abstract = "Recent works in domain-independent plan merging have shown that the optimal plan merging problem is NP-hard, and heuristic algorithms have been proposed to generate near-optimal solutions. We have developed a plan merging methodology that merges partial-order plans based on the notion of plan fragments. In contrast to previous works, mergeability classes no longer necessarily form a partition over the set of actions in the input plans. This methodology applies to a class of planning domains which are decomposable. We also investigate the previously unexplored notion of alternative actions in domain-independent plan merging, which can improve the quality of the resulting merged plan, and a novel approach is presented for removing cyclic dependencies that may result during the plan merging process. We provide theoretical analyses of several algorithms for computing the minimum cost cover of plan fragments, a central component of the methodology. We support the theoretical analysis of these algorithms with experimental data to show that a greedy approach is near-optimal and efficient.",
keywords = "Plan merging, Planning",
author = "Britanik, {John M.} and Marefat, {Michael Mahmoud}",
year = "1999",
doi = "10.1109/3468.736358",
language = "English (US)",
volume = "29",
pages = "27--40",
journal = "IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.",
issn = "1083-4427",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Hierarchically merging plans in decomposable domains

AU - Britanik, John M.

AU - Marefat, Michael Mahmoud

PY - 1999

Y1 - 1999

N2 - Recent works in domain-independent plan merging have shown that the optimal plan merging problem is NP-hard, and heuristic algorithms have been proposed to generate near-optimal solutions. We have developed a plan merging methodology that merges partial-order plans based on the notion of plan fragments. In contrast to previous works, mergeability classes no longer necessarily form a partition over the set of actions in the input plans. This methodology applies to a class of planning domains which are decomposable. We also investigate the previously unexplored notion of alternative actions in domain-independent plan merging, which can improve the quality of the resulting merged plan, and a novel approach is presented for removing cyclic dependencies that may result during the plan merging process. We provide theoretical analyses of several algorithms for computing the minimum cost cover of plan fragments, a central component of the methodology. We support the theoretical analysis of these algorithms with experimental data to show that a greedy approach is near-optimal and efficient.

AB - Recent works in domain-independent plan merging have shown that the optimal plan merging problem is NP-hard, and heuristic algorithms have been proposed to generate near-optimal solutions. We have developed a plan merging methodology that merges partial-order plans based on the notion of plan fragments. In contrast to previous works, mergeability classes no longer necessarily form a partition over the set of actions in the input plans. This methodology applies to a class of planning domains which are decomposable. We also investigate the previously unexplored notion of alternative actions in domain-independent plan merging, which can improve the quality of the resulting merged plan, and a novel approach is presented for removing cyclic dependencies that may result during the plan merging process. We provide theoretical analyses of several algorithms for computing the minimum cost cover of plan fragments, a central component of the methodology. We support the theoretical analysis of these algorithms with experimental data to show that a greedy approach is near-optimal and efficient.

KW - Plan merging

KW - Planning

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

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

U2 - 10.1109/3468.736358

DO - 10.1109/3468.736358

M3 - Article

AN - SCOPUS:0032714848

VL - 29

SP - 27

EP - 40

JO - IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

JF - IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

SN - 1083-4427

IS - 1

ER -