We provide a theoretical framework and empirical evidence for how verbally planning an action creates direct perception-action links and behavioral automaticity. We argue that planning actions in an if (situation)-then (action) format induces sensorimotor simulations (i.e., activity patterns reenacting the event in the sensory and motor brain areas) of the anticipated situation and the intended...

We present an extension to classical planning techniques that facilitates their use in complex multi-agent domains. The approach implements a form of metaplanning that enables a planner to reason about properties of multiple plans in a single plan network. With this approach, a planning agent can simultaneously generate an individual plan, repair a second, and, together with a group, execute a ...

The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for pattern traversal (as an extension to traditional multiplicity and type considerations of existing tools) by estimating the expected performance of search plans on typical instance models that are available at transformatio...

We study the complexity of solving decision trees with a Skew-Symmetric Bilinear (SSB) utility function. The SSB model is an extension of Expected Utility (EU) with enhanced descriptive possibilities. Unlike EU, the optimality principle does not hold for SSB, which makes its optimization trickier. We show that determining an SSB optimal plan is NP-hard if one only considers deterministic plans ...

In this paper we present experiments with search-based planning as the most generic description of intelligent behaviour for virtual actors. Using a MinMin heuristic search-based planner (HSP), we demonstrate how this can be used to generate efficient plans (in terms of plan length), and how the production of these minimum length plans is performed in times suitable for the real-time 3D virtual...

We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditions; we seek a contingency plan that maximises the probability of reaching the goal. The Graphplan framework has proven to be highly successful at solving classical planning problems, but has not previously been applie...

This paper explains plans for the immediate development of the OpenSP/OpenJade tool-set, its objectives and philosophical approach, and the partial results already obtained. Four works in progress are explained: extension of the style language towards complete coverage of page and column models, and plans to include bidirectional communication between formatter and style engine; full coverage o...

How do people turn their intentions into behavior? This mirac1e is c1arified in the present chapter by analyzing how if-then planning (i.e., implementation intentions; Gollwitzer, 1993, 1999) supports the translation of intentions into actions. In addition, wewill examine how if-then plans should be worded best to maximize their effectiveness. Subsequently, we will address the importance of the...

Agents operating in the real world often have limited time available for planning their next actions. Producing optimal plans is infeasible in these scenarios. Instead, agents must be satisfied with the best plans they can generate within the time available. One class of planners well-suited to this task are anytime planners, which quickly find an initial, highly suboptimal plan, and then impro...

Today’s commercial relational database systems use treeshaped execution plans. The evaluation techniques for these plan are well understood and have been refined over the last decade. However, for queries that contain disjunctive predicates, using the more general class of direct acyclic graphs and splitting data streams can be beneficial. Unfortunately, the iterator based evaluation techniques...