Heuristic networks for space exploration

Abstract This paper reports new results from the development of 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. Linguistic Geometry relies on the formalization of search heuristics of high-skilled human experts, which allow for the decomposition of a complex system into a hierarchy of subsystems, and thus solve intractable problems by reducing the search. Currently, we investigate heuristics extracted in the form of hierarchical networks of paths. Employing Linguistic Geometry tools, the dynamic hierarchy of networks is represented as a hierarchy of formal attribute languages. This paper includes a formal survey of a Linguistic Geometry, and a new example of a solution of optimization problems for space robotic vehicles. This example includes the actual generation of the hierarchy of languages, with some details of trajectory generation, and it demonstrates the dramatic reduction of search in comparison with conventional search algorithms.

[1]  Boris Stilman.  Syntactic Hierarchy for Robotic Systems , 1993 .

[2]  Alan C. Shaw,et al.  A Formal Picture Description Scheme as a Basis for Picture Processing Systems , 1969, Inf. Control..

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

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

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

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

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

[8]  M. Mesarovic,et al.  Theory of Hierarchical, Multilevel, Systems , 1970 .

[9]  Kai von Luck,et al.  Knowledge Representation in LILOG , 1990, Sorts and Types in Artificial Intelligence.

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

[11]  King-Sun Fu,et al.  Syntactic Pattern Recognition And Applications , 1968 .

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

[13]  Theodosios Pavlidis,et al.  Structural pattern recognition , 1977 .

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

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

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

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

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

[19]  R. Narasimhan,et al.  Syntax-directed interpretation of classes of pictures , 1966, CACM.

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

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

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

[23]  Herbert A. Simon,et al.  The Sciences of the Artificial , 1970 .

[24]  Eugene Galanter,et al.  Handbook of mathematical psychology: I. , 1963 .

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

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