On the completeness of replacing primitive actions with macro-actions and its generalization to planning operators and macro-operators

Lukáš Chrpa, Thomas Leo McCluskey, Hugh Osborne

Research output: Contribution to journalArticle

Abstract

Automated planning, which deals with the problem of generating sequences of actions, is an emerging research topic due to its potentially wide range of real-world application domains. As well as developing and improving planning engines, the acquisition of domain-specific knowledge is a promising way to improve the planning process. Domain-specific knowledge can be encoded into the modelling language that a range of planning engines can accept. This makes encoding domain-specific knowledge planner-independent, and entails reformulating the domain models and/or problem specifications. While many encouraging practical results have been derived from such reformulation methods (e.g. learning macro-actions), little attention has been paid to the theoretical properties such as completeness (keeping solvability of reformulated problems). In this paper, we focus on a special case - removing primitive actions replaced by macro-actions. We provide a theoretical study and come up with conditions under which it is safe to remove primitive actions, so completeness of reformulation is preserved. We extend this study also for planning operators (actions are instances of operators).

LanguageEnglish
Pages163-183
Number of pages21
JournalAI Communications
Volume29
Issue number1
DOIs
Publication statusPublished - 29 Dec 2015

Fingerprint

Macros
Planning
Engines
Specifications

Cite this

@article{f9b5dbc72299440fb7c0fa8ba945d674,
title = "On the completeness of replacing primitive actions with macro-actions and its generalization to planning operators and macro-operators",
abstract = "Automated planning, which deals with the problem of generating sequences of actions, is an emerging research topic due to its potentially wide range of real-world application domains. As well as developing and improving planning engines, the acquisition of domain-specific knowledge is a promising way to improve the planning process. Domain-specific knowledge can be encoded into the modelling language that a range of planning engines can accept. This makes encoding domain-specific knowledge planner-independent, and entails reformulating the domain models and/or problem specifications. While many encouraging practical results have been derived from such reformulation methods (e.g. learning macro-actions), little attention has been paid to the theoretical properties such as completeness (keeping solvability of reformulated problems). In this paper, we focus on a special case - removing primitive actions replaced by macro-actions. We provide a theoretical study and come up with conditions under which it is safe to remove primitive actions, so completeness of reformulation is preserved. We extend this study also for planning operators (actions are instances of operators).",
keywords = "action elimination, AI planning, macro-actions, problem reformulation",
author = "Luk{\'a}š Chrpa and McCluskey, {Thomas Leo} and Hugh Osborne",
year = "2015",
month = "12",
day = "29",
doi = "10.3233/AIC-150679",
language = "English",
volume = "29",
pages = "163--183",
journal = "AI Communications",
issn = "0921-7126",
publisher = "IOS Press",
number = "1",

}

On the completeness of replacing primitive actions with macro-actions and its generalization to planning operators and macro-operators. / Chrpa, Lukáš; McCluskey, Thomas Leo; Osborne, Hugh.

In: AI Communications, Vol. 29, No. 1, 29.12.2015, p. 163-183.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On the completeness of replacing primitive actions with macro-actions and its generalization to planning operators and macro-operators

AU - Chrpa, Lukáš

AU - McCluskey, Thomas Leo

AU - Osborne, Hugh

PY - 2015/12/29

Y1 - 2015/12/29

N2 - Automated planning, which deals with the problem of generating sequences of actions, is an emerging research topic due to its potentially wide range of real-world application domains. As well as developing and improving planning engines, the acquisition of domain-specific knowledge is a promising way to improve the planning process. Domain-specific knowledge can be encoded into the modelling language that a range of planning engines can accept. This makes encoding domain-specific knowledge planner-independent, and entails reformulating the domain models and/or problem specifications. While many encouraging practical results have been derived from such reformulation methods (e.g. learning macro-actions), little attention has been paid to the theoretical properties such as completeness (keeping solvability of reformulated problems). In this paper, we focus on a special case - removing primitive actions replaced by macro-actions. We provide a theoretical study and come up with conditions under which it is safe to remove primitive actions, so completeness of reformulation is preserved. We extend this study also for planning operators (actions are instances of operators).

AB - Automated planning, which deals with the problem of generating sequences of actions, is an emerging research topic due to its potentially wide range of real-world application domains. As well as developing and improving planning engines, the acquisition of domain-specific knowledge is a promising way to improve the planning process. Domain-specific knowledge can be encoded into the modelling language that a range of planning engines can accept. This makes encoding domain-specific knowledge planner-independent, and entails reformulating the domain models and/or problem specifications. While many encouraging practical results have been derived from such reformulation methods (e.g. learning macro-actions), little attention has been paid to the theoretical properties such as completeness (keeping solvability of reformulated problems). In this paper, we focus on a special case - removing primitive actions replaced by macro-actions. We provide a theoretical study and come up with conditions under which it is safe to remove primitive actions, so completeness of reformulation is preserved. We extend this study also for planning operators (actions are instances of operators).

KW - action elimination

KW - AI planning

KW - macro-actions

KW - problem reformulation

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

U2 - 10.3233/AIC-150679

DO - 10.3233/AIC-150679

M3 - Article

VL - 29

SP - 163

EP - 183

JO - AI Communications

T2 - AI Communications

JF - AI Communications

SN - 0921-7126

IS - 1

ER -