Heuristic Search for Planning with Different Forced Goal-Ordering Constraints

الملخص EN

Planning with forced goal-ordering (FGO) constraints has been proposed many times over the years, but there are still major difficulties in realizing these FGOs in plan generation.

In certain planning domains, all the FGOs exist in the initial state.

No matter which approach is adopted to achieve a subgoal, all the subgoals should be achieved in a given sequence from the initial state.

Otherwise, the planning may arrive at a deadlock.

For some other planning domains, there is no FGO in the initial state.

However, FGO may occur during the planning process if certain subgoal is achieved by an inappropriate approach.

This paper contributes to illustrate that it is the excludable constraints among the goal achievement operations (GAO) of different subgoals that introduce the FGOs into the planning problem, and planning with FGO is still a challenge for the heuristic search based planners.

Then, a novel multistep forward search algorithm is proposed which can solve the planning problem with different FGOs efficiently.