We address the problem of generalizing a plan to maximize the flexibility and robustness with which an agent can execute it. A key area of automated planning is the study of how to generate a plan for an agent to execute. The plan itself may take on many forms: a sequence of actions, a partial ordering over a set of actions, or a procedure-like description of what the agent should do. Many form...

Generally, test cases derived from a formal model can not be directly fed into implementations under test (IUT), because model based test generation techniques produce abstract test cases. In order to run an abstract test case against an IUT the abstract test case either has to be transformed to a concrete test case or an execution of the abstract test case is needed. In this paper we propose a...

Optimization of nested queries, in particular finding equivalent “flattened” queries for queries that employ the SQL sub-query construct, has been researched extensively. In contrast, with the exception of nested loops join, execution of nested plans has found little interest. Nested execution plans may result from a failure to flatten nested SQL expressions but just as likely are created by a ...

We consider plan execution for an autonomous robot to be a computational process that performs the following task: given (1) a plan that has been designed accomplish some jobs, (2) a stream of sensory data, and (3) a stream of feedback signals from the robot control processes, cause the robot to exhibit a behavior that accomplishes its jobs as specified by the plan. Plan execution would be triv...