TY - GEN
T1 - Reasoning about the executability of goal-plan trees
AU - Yao, Yuan
AU - de Silva, Lavindra
AU - Logan, Brian
N1 - Publisher Copyright:
© Springer International Publishing AG 2016.
PY - 2016
Y1 - 2016
N2 - User supplied domain control knowledge in the form of hierarchically structured agent plans is at the heart of a number of approaches to reasoning about action. This knowledge encodes the “standard operating procedures” of an agent for responding to environmental changes, thereby enabling fast and effective action selection. This paper develops mechanisms for reasoning about a set of hierarchical plans and goals, by deriving “summary information” from the conditions on the execution of the basic actions forming the “leaves” of the hierarchy. We provide definitions of necessary and contingent pre-, in-, and postconditions of goals and plans that are consistent with the conditions of the actions forming a plan. Our definitions extend previous work with an account of both deterministic and non-deterministic actions, and with support for specifying that actions and goals within a (single) plan can execute concurrently. Based on our new definitions, we also specify requirements that are useful in scheduling the execution of steps in a set of goal-plan trees. These requirements essentially define conditions that must be protected by any scheduler that interleaves the execution of steps from different goal-plan trees.
AB - User supplied domain control knowledge in the form of hierarchically structured agent plans is at the heart of a number of approaches to reasoning about action. This knowledge encodes the “standard operating procedures” of an agent for responding to environmental changes, thereby enabling fast and effective action selection. This paper develops mechanisms for reasoning about a set of hierarchical plans and goals, by deriving “summary information” from the conditions on the execution of the basic actions forming the “leaves” of the hierarchy. We provide definitions of necessary and contingent pre-, in-, and postconditions of goals and plans that are consistent with the conditions of the actions forming a plan. Our definitions extend previous work with an account of both deterministic and non-deterministic actions, and with support for specifying that actions and goals within a (single) plan can execute concurrently. Based on our new definitions, we also specify requirements that are useful in scheduling the execution of steps in a set of goal-plan trees. These requirements essentially define conditions that must be protected by any scheduler that interleaves the execution of steps from different goal-plan trees.
UR - http://www.scopus.com/inward/record.url?scp=85009787182&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-50983-9_10
DO - 10.1007/978-3-319-50983-9_10
M3 - Conference contribution
AN - SCOPUS:85009787182
SN - 9783319509822
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 176
EP - 191
BT - Engineering Multi-Agent Systems - 4th International Workshop, EMAS 2016, Revised, Selected, and Invited Papers
A2 - Muller, Jorg P.
A2 - Nunes, Ingrid
A2 - Baldoni, Matteo
A2 - Zalila-Wenkstern, Rym
PB - Springer Verlag
T2 - 4th International Workshop on Engineering Multi-Agent Systems, EMAS 2016
Y2 - 9 May 2016 through 10 May 2016
ER -
