Our project Towards Robust Multiagent Plans focuses on theoretical and applied research in field of multiagent planning in dynamic environments. The objective of the project is to connect, both formally and empirically, between the developments in domain-specific multiagent planning and the concepts of generic, domain-independent, problem solving and propose solutions and techniques robust to uncertainty, dynamism and non-determinism of environments modelled closely to real world.

In Computation Game Theory we study and design new algorithms for finding optimal behavior in finite sequential scenarios, where agents have to deal with limited information, uncertainty, and competing opponents. Typical examples include classical card and board games, scenarios from the security domain, or auctions

Pre-seed Project - Autonomous UAVs for tactical missions and critical infrastructure protection

Pre-seed aims at design and deployment of algorithms for surveillance and patrolling on multiple autonomous UAVs for protection of critical infrastructures (oil-pipelines, power lines, etc.) and use in tactical missions. We try to develop a system for integrated command and control that increases autonomy of fleet of UAVs and provides common operation picture for the UAV operator.