It investigates general problem description languages, and general problem solving algorithms, where a "problem" comes in the form of an "initial state", a "goal", and a set of "actions" that can be applied to change states and thus, eventually, reach the goal.
aI Planning is concerned with models of, and algorithms for, goal reachability testing in large statetransition systems.