An action is redundant in a planning domain if it is not needed to reach the goal. In this paper, we study the computational complexity of some problems related to the redundancy of actions: checking whether a domain contains a redundant action, what is the minimal number of actions needed to make the goal reachable, checking whether the removal of an action does not increase the minimal plan length, etc.
The complexity of action redundancy / Andrea, Ferrara; Liberatore, Paolo; Schaerf, Marco. - 3673:(2005), pp. 1-12. (Intervento presentato al convegno 9th Congress of the Italian-Association-for-Artificial-Intelligence tenutosi a Milan, ITALY) [10.1007/11558590_1].
The complexity of action redundancy
LIBERATORE, Paolo;SCHAERF, Marco
2005
Abstract
An action is redundant in a planning domain if it is not needed to reach the goal. In this paper, we study the computational complexity of some problems related to the redundancy of actions: checking whether a domain contains a redundant action, what is the minimal number of actions needed to make the goal reachable, checking whether the removal of an action does not increase the minimal plan length, etc.File | Dimensione | Formato | |
---|---|---|---|
VE_2005_11573-187782.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
3.43 MB
Formato
Adobe PDF
|
3.43 MB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.