Chapter 15. Action Planning
This chapter gives a general introduction to search problems for optimal and suboptimal action planning, including state space search for numerical and temporal planning domains. It also considers plan constraints and soft goals.
Keywords: action planning, optimal planning, Graphplan, Satplan, planning pattern database, causal graph, metric planning, temporal planning, derived predicate, timed initial literal, state trajectory constraint, preference constraint
In domain-independent action planning, a running system must be able to find plans and exploit search knowledge fully automatically. In this chapter we concentrate on deterministic planning (each action application produces exactly one successor) with no ...

Get Heuristic Search now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.