Heuristic search methods promise to find shortest paths for path-planning problems faster
than uninformed search methods. Incremental search methods, on the other hand, promise …

We present some techniques for planning in domains specified with the recent standard
language PDDL2. 1, supporting'durative actions' and numerical quantities. These …

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 …

The ultimate objective in planning is to construct plans for execution. However, when a plan
is executed in a real environment it can encounter differences between the expected and …

This article analyzes the current state of case-based plan adaptation research. Rather than
perform an exhaustive literature review, the authors identify six dimensions to classify …

In this paper we describe COLIN, a forward-chaining heuristic search planner, capable of
reasoning with COntinuous LINear numeric change, in addition to the full temporal …

Incremental search reuses information from previous searches to find solutions to a series of
similar search problems potentially faster than is possible by solving each search problem …

In dynamic environments, agents have to deal with changing situations. In these cases,
repairing a plan is often more efficient than planning from scratch, but existing planning …

Over the last few years constraint satisfaction, planning, and scheduling have received
increased attention, and substantial effort has been invested in exploiting constraint …

The treatment of exogenous events in planning is practically important in many real-world
domains where the preconditions of certain plan actions are affected by such events. In this …