Uva Cooperative Searching With And Without Adversaries

UVA cooperative searching is an important research area in cooperative control. An approach of distributed algorithm is presented to solve the time delay problem and a framework of path planning in adversarial environments is studied.MDMPC is an approach based on Decentralized Model Predictive Control theory. By using this method the searching problem is decoupled completely. This method is useful in distributed environments.In the presence of an adversary, an efficient patrolling path requires enough unpredictability in order to prevent the adversary to predict the schedule. This paper presents an approach of stochastic path planning with Stackelberg games theory based strategy.