Abstract
This paper reports new results of research, which started in 1972 in Moscow, USSR. For 16 years Boris Stilman was involved in the advanced research project PIONEER led by a formed World Chess champion, Professor Mikhail Botvinnik. The goal of the project was, at first, to discover and mathematically formalize methodologies utilized by the most advanced chess experts (including Botvinnik himself) in solving chess problems almost without search. The next step was to apply this new theory to complex search problems from various problem domains. In the 1980s, in Moscow, Stilman developed the foundations of the new approach. In 1991, while at McGill University, Montreal, Canada, Stilman coined the term “Linguistic Geometry” (LG) as a name for the new theory for solving Abstract Board Games. After 1991, this research continued at the University of Colorado at Denver, USA. In 1995, V. Yakhnis joined the LG effort. In the 1990s, it was shown that LG is applicable to a wide class of higher-dimensional, multi-agent games with concurrently moving agents, which are ideally suited for combat planning and control. Also, it was proved that for several classes of games LG generates optimal strategies in polynomial time. This groundbreaking results also suggests that for much wider classes of games LG strategies are also optimal or close to optimal. Over a hundred papers on LG have been published. Stilman wrote the first scholarly book on LG,Linguistic Geometry: From Search to Construction, published in February 2000. Over the last two years, defense applications of LG have attracted so much attention at the Defense Advanced Research Projects Agency (DARPA), Rockwell, and Boeing that the number of LG-based projects has skyrocketed. In 1999, recognizing the maturity and power of this technology, a group of scientists, engineers, and entrepreneurs founded a company, STILMAN Advanced Strategies, to facilitate development of government and commercial applications of LG.
Similar content being viewed by others
References
Stilman B (2000) Linguistic geometry: from search to construction. Kluwer, Dordrecht
Stilman B (1994) Linguistic geometry for control systems design. Int J Comput Appl 1(2):89–110
Stilman B (1997) Managing search complexity in linguistic geometry. IEEE Trans Syst Man Cybern 27:978–998
Stilman B (1997) Network languages for concurrent multiagent systems. Int J Comput Math Appl 34:103–136
Stilman B, Fletcher C (1998) Systems modeling in linguistic geometry: natural and artificial conflicts. Int J Syst Anal Model Simulation 33:57–97
Stilman B, Yakhnis V (1999) Solving adversarial control problems with abstract board games and linguistic geometry (LG) strategies. 1st DARPA-JFACC Symposium on Advances in Enterprise Control (AEC), San Diego, November 15–16, JFACC Program, DARPA-ISO
Stilman B, Yakhnis V (2000) Adapting the linguistic geometry-abstract board games approach to the air operations. 2nd DARPA-JFACC Symposium on Advances in Enterprise Control (AEC), Minneapolis, July 10–11, JFACC Program, DARP-ISO
Von Neumann J, Morgenstern O (1947) Theory of games and economic behavior. Princeton University Press, Princeton
Osborn M, Rubinstein A (1994) A course in game theory. MIT Press Cambridge, MA
Knuth D, Moore R (1975) An analysis of alpha-beta pruning, Artificial Intelligence 6:293–326
Lee J, Chen Y-L, Yakhnis V, et al. (2001) DARPA JFACC final Report, Rockwell Science Center
Yakhnis V, Stilman B (1995) A multi-agent graph-game approach to theoretical foundations of linguistic geometry. In: Proceedings of the 2nd World Conference on the Fundamentals of Artificial Intelligence (WOCFAI 95), Paris, July
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Stilman, B., Yakhnis, V. & Umansky, O. Winning strategies for robotic wars: defense applications of linguistic geometry. Artif Life Robotics 4, 148–155 (2000). https://doi.org/10.1007/BF02481336
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02481336