Heuristic networks for concurrent pursuit-evasion systems

摘要

We consider briefly the linguistic geometry tools and their application to solving 2D optimization problem for 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 aerial and concurrent cases shows that search reduction achieved in the concurrent case is even more dramatic than it was in the serial one.