The Research For State Reachability Relation Of Uncertain Planning Via Model Checking

Intelligent planning is an important field of artificial intelligence. Uncertainplanning is an important branch of the intelligent planning, it is more realistic than theclassic planning. In recent years, many researchers extensive and in-depth research onuncertainty planning via Model checking and achieved good results. Uncertaintyplanning via Model checking for solving programming problems require repeatedsearch operation to find the target state, it brings a large number of redundantcomputation and repeat operation. To obtain a state of uncertainty transition systemreachability relation for solving programming problems can improve efficiency,reduce the redundancy calculation, construction of state of uncertainty transitionsystem boot information. Hance, This paper has some researches as follows:1. In state of uncertainty transfer system, the common method to solve theseplanning problems will have a lot of redundant computation, which reduces theefficiency of problem solving. Getting non circular reachability relationship of state ofuncertainty transfer system can greatly improve the efficiency of solvingprogramming problems with strong planning solutions and weakly planning solutions.This paper designed the method of state of uncertainty transfer system of non circularreachability relation, as well as algorithm that getting the strong planning solution inobtaining state transition system non circulating state reachability relation, andthrough the analysis revealed the efficiency that getting the strong planning solutionin obtaining state transition system non circulating state reachability relation enhancedobviously. It is proved theoretically that the state of uncertainty transition system fornon circular reachability relation method is correct.2. Designed the method for state of uncertainty transfer system of circulationstate reachability relation, circular reachability relation is a widespread reachabilityrelation in state of circulation transition system. Circulating reachability relation is animportant part of the accessibility relation, seek circular reachability relation canmake reachability relation complete and increase the application range of reachabilityrelation. In this paper. Firstly, analyzing the characteristics of cyclic reachabilityrelation, and defining the classification of circular reachability relation. Secondly, toconfirm the key of the causing circulatory reachability relation is own tworeachability relation. On this premise, designed the mathod for finding two reachability relation. Thirdly, designed the method that according to own tworeachability relation to get circular reachability relation, and designed the algorithm.Finally, through the example to unfold this solving process, through the proceduresfor the realization of the algorithm.