Algorithm And Application Of Temporal Planning

In this paper,we further discuss the application of R_time table in temporal planning on the arrangement of campus game and college courses in practical life and we give the detailed account of the algorithms and the operations.From these we can learn the principle and mechanism of temporal planning.Temporal planning is the special schedule area in artificial intelligence according as restriction of temporal relation.The true-life problems relationed by time can be solved by temporal planning.This is a NP-hard problem.There are two kinds in temporal planning,the problem is relationed by only temporal order and the other is relationed by both temporal order and temporal interval.This paper introduces the R_time table algorithm constructed by relational matrix for the former problem.While it introduces D_time table for the later problem.This paper makes a forward and describable discuss in two algorithms.The example given in the paper of campus game arrangement is used by R_time table algorithm and the result is better.We meet some difficulties and troubles in the process of the operations. These mainly reflect on two facets that are strong relation and high complexity.A genetic algorithm (GA) is a heuristic used to find approximate solutions to difficult-to-solve problems through application of the principles of evolutionary biology to computer science. Genetic algorithms use biologically-derived techniques such as inheritance, mutation, natural selection, and recombination (or crossover). Genetic algorithms are a particular class of evolutionary algorithms.The problem of strong relation refected by the example ,we try improve it on using genetic algorithm.Genetic algorithm can solve the R_time table under the multi-ingredient time relation.We usually take tentative measure to achieve the reasonable aims and avoid the troubles of high complexity when we meet the complex and hard controled problems.We can observe and analyse the same problem on different granularity.We can jump quickly from one granularity to another with ease. This is an accepted character of artificial intelligence and a representation of our strong ability. Quotient set is a new spaceconstructed by equivalent classes acted as new elements.lt get a better coarse granularity naturally.A quotient space is a measure expressed object model by unifying different granularity spaces and mathematical quotient sets.Thus,this is a measure consructed by quotient sets acted as mathematical model in different sapces. According to the usual steps that we solve problem,we try to improve the complexity using the theory of quotient space.