Abstract: In the real world domain，observation information acquisition need some kind of cost，however，for a planning，some observation variables are useless in the execution of the plan. So it is very necessary that how to remove these unnecessary observation variables in order to save the cost in the real word. In this paper，there is a new algorithm which can deal with strong cycle planning. This algorithm can find an approximate minimal set of observation variables which are necessary for the execution of a strong cycle planning under full observability. It also can further improve the implementation efficiency of strong cycle planning by using the approximate minimal set of observation variables.

Key words: strong cycle planning, observation information reduction, minimal observation variables set

摘要： 在现实的规划领域中，观察信息的获得需要花费一定的代价，然而对于一个规划解来说，一些观察信息在执行规划解的过程中是不会被用到的，所以如何把这些不必要的观察信息去除从而节省实际过程中的成本是非常有必要的。针对强循环规划的观察信息展开研究，提出了一个对强循环规划观察信息进行约简的算法，该算法能够找出在完全可观察条件下强循环规划的最小观察变量集合，通过使用最小观察变量集合，可以进一步提高执行强循环规划解的效率。

关键词: 强循环规划, 观察信息约简, 最小观察变量集合