Improvements to the Strong Planning Algorithm

Abstract

This paper points out some drawbacks and gives some modifications to the strong planning algorithm. In particular, a set of states is found by using of adjacency matrix that corresponds to a non-deterministic state-transition system. The set of states is composed of four parts, the first part is a part of initial states which can not reach goal states, if the first part is not empty, there is not strong planning; if a state which is not a initial state can not reach goal states,we put the state into the second part; the third part are the states that are unreachable from the initial states; so the station-action pairs which relate to the second part or third part are absolutely useless; the fourth part are the states which the initial states can not reach without passing any goal state before, the state-action pairs which relate to the fourth part are useless as well, because they move the execution away from the goal. So a great many of state-action pairs can be eliminated directly from the universal policy. Finally, the efficiency of the modified algorithm is illustrated by an example and some experiments.