Linguistic Geometry: From Search to Construction is the first book of its kind. Linguistic Geometry (LG) is an approach to the construction of mathematical models for large-scale multi-agent systems. A number of such systems, including air/space combat, robotic manufacturing, software re-engineering and Internet cyberwar, can be modeled as abstract board games. These are games with moves that can be represented by the movement of abstract pieces over locations on an abstract board. The purpose of LG is to provide strategies to guide the games' participants to their goals. Traditionally, discovering such strategies required searches in giant game trees. These searches are often beyond the capacity of modern and even conceivable future computers.
LG dramatically reduces the size of the search trees, making the problems computationally tractable. LG provides a formalization and abstraction of search heuristics used by advanced experts including chess grandmasters. Essentially, these heuristics replace search with the construction of strategies. To formalize the heuristics, LG employs the theory of formal languages (i.e. formal linguistics), as well as certain geometric structures over an abstract board. The new formal strategies solve problems from different domains far beyond the areas envisioned by the experts. For a number of these domains, Linguistic Geometry yields optimal solutions.

Klappentext

Linguistic Geometry: From Search to Construction is the first book of its kind. Linguistic Geometry (LG) is an approach to the construction of mathematical models for large-scale multi-agent systems. A number of such systems, including air/space combat, robotic manufacturing, software re-engineering and Internet cyberwar, can be modeled as abstract board games. These are games with moves that can be represented by the movement of abstract pieces over locations on an abstract board. The purpose of LG is to provide strategies to guide the games' participants to their goals. Traditionally, discovering such strategies required searches in giant game trees. These searches are often beyond the capacity of modern and even conceivable future computers. LG dramatically reduces the size of the search trees, making the problems computationally tractable. LG provides a formalization and abstraction of search heuristics used by advanced experts including chess grandmasters. Essentially, these heuristics replace search with the construction of strategies. To formalize the heuristics, LG employs the theory of formal languages (i.e. formal linguistics), as well as certain geometric structures over an abstract board. The new formal strategies solve problems from different domains far beyond the areas envisioned by the experts. For a number of these domains, Linguistic Geometry yields optimal solutions.

Inhalt
1 Introduction.- 2 Hierarchy of Formal Languages.- 3 Robot Combat for 2D District.- 4 Expanding to 3D Space.- 5 Deeper Search, More Agents.- 6 Concurrency, n×n District.- 7 Scheduling: Artificial Conflict.- 8 Generating Techniques.- 9 Language of Trajectories.- 10 Language of Zones.- 11 Translations.- 12 Languages of Searches.- 13 From Search to Construction.- 14 Computational Complexity.- Future Challenges.- References.