Linguistic geometry for computationally challenging problems

摘要

Linguistic geometry (LG) includes a mathematical model for reasoning about multiagent discrete concurrent pursuit-evasion games. This approach gives us powerful tools for reducing the search space in various problems by introducing a concurrent multiagent game and decomposing it into a hierarchy of dynamic interacting subsystems. The LG tools provide a framework for the evaluation of the complexity and quality of solutions. We consider an approach to applying LG in various problem domains.