Network languages for concurrent multiagent systems

This paper reports new results in the development of Linguistic Geometry towards concurrent multiagent aerospace systems. 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. The Linguistic Geometry relies on the formalization of search heuristics of the highly-skilled human experts, which allow for the decomposition of a complex system into a dynamic hierarchy of subsystems, and thus solve intractable problems by reducing the search dramatically. In this paper, we consider briefly the Linguistic Geometry tools and their application to multiagent systems representing 2D optimization problems for autonomous robotic vehicles in aerospace environment. First, we consider only serial motions, then we relax these constraints by allowing the cooperating agents to move simultaneously if necessary while the motions of opposing agents alternate. Next we relax these constraints completely by allowing all the agents to move simultaneously if necessary. A comparison of the searches for serial and concurrent cases shows that search reduction achieved in all types of problems with concurrent motions is even more dramatic than it was in the serial one.