Determining linearity of optimal plans by operator schema analysis

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

2 Citations (Scopus)

Abstract

Analysing the structures of solution plans generated by AI Planning engines is helpful in improving the generative planning process, as well as shedding light in the study of its theoretical foundations.We investigate a specific property of solution plans, that we called linearity, which refers to a situation where each action achieves an atom (or atoms) for a directly following action, or achieves goal atom(s). Similarly, linearity can be defined for parallel plans where each action in a set of actions executed at some time step, achieves either goal atom(s) or atom(s) for some action executed in the directly following time step. In this paper, we present a general and problem-independent theoretical framework focusing on the analysis of planning operator schema, namely relations of achiever, clobberer and independence, in order to determine whether solvable planning problems using a given operator schema have as solutions optimal (parallel) plans which are linear. The findings presented in this paper deepen current theoretical knowledge, provide helpful information to engineers of new planning domain models, and suggest new ways of improving the performance of state-of-theart (optimal) planning engines.

Original languageEnglish
Title of host publicationProceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation, SARA 2013
Pages34-41
Number of pages8
Publication statusPublished - 2013
Event10th Symposium on Abstraction, Reformulation, and Approximation - Leavenworth, United States
Duration: 11 Jul 201312 Jul 2013
https://www.aaai.org/ocs/index.php/SARA/SARA13 (Link to Symposium Details )

Conference

Conference10th Symposium on Abstraction, Reformulation, and Approximation
Abbreviated titleSARA 2013
CountryUnited States
CityLeavenworth
Period11/07/1312/07/13
Internet address

Fingerprint

Planning
Atoms
Engines
Engineers

Cite this

Chrpa, L., Vallati, M., & McCluskey, T. L. (2013). Determining linearity of optimal plans by operator schema analysis. In Proceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation, SARA 2013 (pp. 34-41)
Chrpa, Luḱǎs ; Vallati, Mauro ; McCluskey, Thomas Leo. / Determining linearity of optimal plans by operator schema analysis. Proceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation, SARA 2013. 2013. pp. 34-41
@inproceedings{6b293787a7814c7197afe3c66458e5d1,
title = "Determining linearity of optimal plans by operator schema analysis",
abstract = "Analysing the structures of solution plans generated by AI Planning engines is helpful in improving the generative planning process, as well as shedding light in the study of its theoretical foundations.We investigate a specific property of solution plans, that we called linearity, which refers to a situation where each action achieves an atom (or atoms) for a directly following action, or achieves goal atom(s). Similarly, linearity can be defined for parallel plans where each action in a set of actions executed at some time step, achieves either goal atom(s) or atom(s) for some action executed in the directly following time step. In this paper, we present a general and problem-independent theoretical framework focusing on the analysis of planning operator schema, namely relations of achiever, clobberer and independence, in order to determine whether solvable planning problems using a given operator schema have as solutions optimal (parallel) plans which are linear. The findings presented in this paper deepen current theoretical knowledge, provide helpful information to engineers of new planning domain models, and suggest new ways of improving the performance of state-of-theart (optimal) planning engines.",
author = "Luḱǎs Chrpa and Mauro Vallati and McCluskey, {Thomas Leo}",
year = "2013",
language = "English",
isbn = "9781577356301",
pages = "34--41",
booktitle = "Proceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation, SARA 2013",

}

Chrpa, L, Vallati, M & McCluskey, TL 2013, Determining linearity of optimal plans by operator schema analysis. in Proceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation, SARA 2013. pp. 34-41, 10th Symposium on Abstraction, Reformulation, and Approximation, Leavenworth, United States, 11/07/13.

Determining linearity of optimal plans by operator schema analysis. / Chrpa, Luḱǎs; Vallati, Mauro; McCluskey, Thomas Leo.

Proceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation, SARA 2013. 2013. p. 34-41.

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

TY - GEN

T1 - Determining linearity of optimal plans by operator schema analysis

AU - Chrpa, Luḱǎs

AU - Vallati, Mauro

AU - McCluskey, Thomas Leo

PY - 2013

Y1 - 2013

N2 - Analysing the structures of solution plans generated by AI Planning engines is helpful in improving the generative planning process, as well as shedding light in the study of its theoretical foundations.We investigate a specific property of solution plans, that we called linearity, which refers to a situation where each action achieves an atom (or atoms) for a directly following action, or achieves goal atom(s). Similarly, linearity can be defined for parallel plans where each action in a set of actions executed at some time step, achieves either goal atom(s) or atom(s) for some action executed in the directly following time step. In this paper, we present a general and problem-independent theoretical framework focusing on the analysis of planning operator schema, namely relations of achiever, clobberer and independence, in order to determine whether solvable planning problems using a given operator schema have as solutions optimal (parallel) plans which are linear. The findings presented in this paper deepen current theoretical knowledge, provide helpful information to engineers of new planning domain models, and suggest new ways of improving the performance of state-of-theart (optimal) planning engines.

AB - Analysing the structures of solution plans generated by AI Planning engines is helpful in improving the generative planning process, as well as shedding light in the study of its theoretical foundations.We investigate a specific property of solution plans, that we called linearity, which refers to a situation where each action achieves an atom (or atoms) for a directly following action, or achieves goal atom(s). Similarly, linearity can be defined for parallel plans where each action in a set of actions executed at some time step, achieves either goal atom(s) or atom(s) for some action executed in the directly following time step. In this paper, we present a general and problem-independent theoretical framework focusing on the analysis of planning operator schema, namely relations of achiever, clobberer and independence, in order to determine whether solvable planning problems using a given operator schema have as solutions optimal (parallel) plans which are linear. The findings presented in this paper deepen current theoretical knowledge, provide helpful information to engineers of new planning domain models, and suggest new ways of improving the performance of state-of-theart (optimal) planning engines.

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

M3 - Conference contribution

SN - 9781577356301

SP - 34

EP - 41

BT - Proceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation, SARA 2013

ER -

Chrpa L, Vallati M, McCluskey TL. Determining linearity of optimal plans by operator schema analysis. In Proceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation, SARA 2013. 2013. p. 34-41