No-search approach in linguistic geometry: state space chart

Linguistic geometry includes mathematical models and tools for knowledge representation and reasoning about multiagent discrete pursuit-evasion games. A new approach to solving a class of search problems without search is shown on the example of a aircraft war game. The paper includes a problem statement and the first part of the solution construction, a decomposition of the state space in the form of the state space chart based on the expansion of the terminal sets. This decomposition allows us to navigate the agents through the state space.

[1]  Boris Stilman.  Linguistic geometry for computationally challenging problems , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[2]  Boris Stilman,et al.  Managing search complexity in linguistic geometry , 1997, IEEE Trans. Syst. Man Cybern. Part B.

[3]  Boris Stilman,et al.  No-search approach in linguistic geometry: experiments with concurrent agents , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[4]  Boris Stilman.  Fighting Dimensionality with Linguistic Geometry: Serial and Concurrent Strategies , 1997 .

[5]  Boris Stilman,et al.  Network languages for concurrent multiagent systems , 1997 .

[6]  Boris Stilman.  Introduction to linguistic geometry tools: selected topics , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[7]  Boris Stilman.  No-search approach in linguistic geometry: construction of strategies , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).