Dynamic decision making (DM) maps knowledge into DM strategy, which ensures reaching DM aims under given constraints. Under general conditions, Bayesian DM, minimizing expected loss over admissible strategies, has to be used. Existing limitations of the paradigm impede its applicability to complex DM as:

1. Complexity of the information processing often crosses resources accessible.
2. Quantification of domain-specific knowledge, aims and constraints is weakly supported. It concerns mapping of domain-specific elements on probabilistic distributions (pd).
3. Methodology of the DM with multiple aims is incomplete.

The research aims to overcome these problems. It relies on distributed DM and fully probabilistic design (FPD) of strategies. The goal is to build a firm theoretical background of FPD of distributed DM strategies. Besides, it will enrich available results and unify them into internally consistent theory suitable for a flat cooperation structure.

This aim implies the main tasks:

1. Inspection of conditions leading to FPD
2. Extension of FPD to design with sets of ideal pds
3. Design of computerized conversion of knowledge and aims into environment-describing and ideal pds
4. Elaboration of theoretical framework for selecting cooperation tools

 

 

Active projects

Former projects

In general, research activities in the department are always motivated by real-world application. Projects listed on this page are those that goes beyonds academic considerations and actually implemented the developed algorithms in real environment. List of theoretical projects is available here

List of former application-oriented projects