Heuristic networks for concurrent pursuit-evasion systems

Abstract

We consider briefly the Linguistic Geometry tools and their application to solving 2 0 optimization problem f o r autonomous robotic vehicles participating in the aerospace pursuit-evasion game. In this problem we allow the agents to move simultaneously if necessary. A comparison of the searches for serial and concurrent cases shows that search reduction achieved in the concu,rrent case is even more dramatic than it was in the serial one.