Reasoning about the executability of goal-plan treesTools Yao, Yuan, de Silva, Lavindra and Logan, Brian (2016) Reasoning about the executability of goal-plan trees. Lecture Notes in Computer Science, 10093 . pp. 176-191. ISSN 0302-9743 Full text not available from this repository.AbstractUser 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.
Actions (Archive Staff Only)
|
Tools
Tools
