MULTIAGENT AIR COMBAT WITH CONCURRENT MOTIONS

This paper is a new step in the development of the Linguistic Geometry. This formal theory is intended to discover the inner properties of human expert heuristics, which have been successful in a certain class of complex control systems, and apply them to different systems. The Linguistic Geometry relies on the formalization of search heuristics of the highly-skilled human experts, which allow for the decomposition of a complex system into a dynamic hierarchy of subsystems, and thus solve intractable problems by reducing the search dramatically. In this paper we report application of the Linguistic Geometry tools to a new example of a solution of simplified 2D optimization problem for the autonomous robotic vehicles in aerospace environment. The novelty of this example with respect to other Linguistic Geometry applications is that in this multiagent problem some agents can move simultaneously. There are many such problems where human expert skills in reasoning about complex systems are incomparably higher than the level of modern computing systems. At the same time there are even more areas, especially in the aerospace problem domain, where advances are required but human problem-solving skills can not be directly applied. For example, there are problems of tactics planning and automatic control of autonomous agents such as aerospace vehicles, space stations and robots with cooperative and opposing interests functioning in a complex, hazardous environment. Reasoning about such complex systems should be done automatically, in a timely manner, and often in a real time. Moreover, there are no highly-skilled human experts in these fields ready to substitute for robots (on a virtual model) or transfer their knowledge to them. There is no grand-master in robot control, although, of course, the knowledge of existing experts in this field should not be neglected – it is even more valuable. Due to the special significance of these problems and the fabulous costs of mistakes, the quality of solutions must be very high and usually subject to continuous improvement.

[1]  Jerome Feder,et al.  Plex languages , 1971, Inf. Sci..

[2]  Edmund H. Durfee,et al.  Incremental Planning to Control a Blackboard-based Problem Solver , 1986, AAAI.

[3]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[4]  Jane W.-S. Liu,et al.  Scheduling Periodic Jobs That Allow Imprecise Results , 1990, IEEE Trans. Computers.

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Jay K. Strosnider,et al.  A Structured View of Real-Time Problem Solving , 1994, AI Mag..

[7]  James S. Albus,et al.  Outline for a theory of intelligence , 1991, IEEE Trans. Syst. Man Cybern..

[8]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[9]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[10]  Boris Stilman A formal model for heuristic search , 1994, CSC '94.

[11]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[12]  Boris Stilman Network languages for complex systems , 1993 .

[13]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[14]  Ervin Y. Rodin,et al.  Application of semantic control to a class of pursuer-evader problems , 1993 .

[15]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Boris Stilman A linguistic geometry for space applications , 1994 .

[17]  Michael L. Baird Structural Pattern Recognition , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Boris Stilman Translations of network languages , 1994 .

[19]  Mikhail M. Botvinnik Computers in chess - solving inexact search problems , 1984, Springer series in symbolic computation.

[20]  Daniel J. Rosenkrantz,et al.  Programmed Grammars and Classes of Formal Languages , 1969, JACM.

[21]  Boris Stilman,et al.  Network languages for intelligent control , 1996 .

[22]  Edmund H. Durfee,et al.  Approximate Processing in Real-Time Problem Solving , 1988, AI Mag..

[23]  Azriel Rosenfeld,et al.  Picture languages: Formal models for picture recognition , 1979 .

[24]  Boris Stilman A linguistic approach to geometric reasoning , 1993 .

[25]  O. Firschein,et al.  Syntactic pattern recognition and applications , 1983, Proceedings of the IEEE.

[26]  George Leitmann,et al.  Optimization techniques, with applications to aerospace systems , 1964 .

[27]  Mark S. Boddy,et al.  Solving Time-Dependent Planning Problems , 1989, IJCAI.

[28]  Mark Stefik,et al.  Planning and Meta-Planning (MOLGEN: Part 2) , 1981, Artif. Intell..

[29]  Richard E. Korf,et al.  Real-Time Heuristic Search , 1990, Artif. Intell..

[30]  Earl D. Sacerdoti,et al.  The Nonlinear Nature of Plans , 1975, IJCAI.