This paper considers the maneuvering penetration methods of missile which do not know the intercepting strategies of the interceptor beforehand. Based on reinforcement learning, the online intelligent maneuvering penetration methods of missile are derived. When the missile is locked by the interceptor, in terms of the tracking characteristics of the interceptor, the missile carries out tentative maneuvers which lead to the interceptor makes the responses respectively, in the light of the information on interceptor responses which can be gathered by the missile-borne detectors, online game confrontation learning is employed to increase the miss distance of the interceptor in guidance blind area by reinforcement learning algorithm, the results of which are used to generate maneuvering strategies that make the missile to achieve the successful penetration. The simulation results show that, compared with no maneuvering methods or random maneuvering methods, the methods proposed not only present higher probability of successful penetration, but also need less overload and lower command switching frequency. Moreover, the effectiveness of this maneuvering penetration methods can be realized under the condition of limited number of training.

Language phrases are an effective way to express uncertain pieces of information, and easily conforms to the language habits of decision makers to describe the evaluation of things. The consistency judgment of a linguistic judgment matrices is the key to analytic hierarchy process (AHP). If a linguistic judgment matrix has a satisfactory consistency, then the rank of the decision schemes can be determined. In this study, the comparison relation between the decision schemes is first represented by a directed graph. The preference relation matrix of the linguistic judgment matrix is the adjacency matrix of the directed graph. We can use the $n-1$ st power of the preference relation to judge the linguistic judgment matrix whether has a satisfactory consistency. The method is utilized if there is one and only one element in the $n-1$ st power of the preference relation, and the element 1 is not on the main diagonal. Then the linguistic judgment matrix has a satisfactory consistency. If there are illogical judgments, the decision schemes that form a 3-loop can be identified and expressed through the second-order sub-matrix of the preference relation matrix. The feasibility of this theory can be verified through examples. The corresponding schemes for illogical judgments are represented in spatial coordinate system.