Axiomatisation of fully probabilistic design

被引:40
|
作者
Karny, Miroslav [1 ]
Kroupa, Tomas [1 ]
机构
[1] ASCR, Inst Informat Theory & Automat, Prague 18208 8, Czech Republic
关键词
Bayesian decision making; Fully probabilistic design; Kullback-Leibler divergence; Unified decision making; INFORMATION;
D O I
10.1016/j.ins.2011.09.018
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This text provides background of fully probabilistic design (FPD) of decision-making strategies and shows that it is a proper extension of the standard Bayesian decision making. FPD essentially minimises Kullback-Leibler divergence of closed-loop model on its ideal counterpart. The inspection of the background is important as the current motivation for FPD is mostly heuristic one, while the technical development of FPD confirms its far reaching possibilities. FPD unifies and simplifies subtasks and elements of decision making under uncertainty. For instance, (i) both system model and decision preferences are expressed in common probabilistic language; (ii) optimisation is simplified due to existence of explicit minimiser in stochastic dynamic programming; (iii) DM methodology for single and multiple aims is unified; (iv) a way is open to completion and sharing non-probabilistic and probabilistic knowledge and preferences met in knowledge and preference elicitation as well as unsupervised cooperation of decision makers. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:105 / 113
页数:9
相关论文
共 50 条
  • [31] Discrete fully probabilistic design: towards a control pipeline for the synthesis of policies from examples
    Ferrentino, Enrico
    Chiacchio, Pasquale
    Russo, Giovanni
    2023 31ST MEDITERRANEAN CONFERENCE ON CONTROL AND AUTOMATION, MED, 2023, : 759 - 764
  • [32] Hierarchical Fully Probabilistic Design for Deliberator-Based Merging in Multiple Participant Systems
    Azizi, Shahram
    Quinn, Anthony
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2018, 48 (04): : 565 - 573
  • [33] An Axiomatisation of a Pure Calculus of Names
    Kulicki, Piotr
    STUDIA LOGICA, 2012, 100 (05) : 921 - 946
  • [34] Canonical varieties with no canonical axiomatisation
    Hodkinson, I
    Venema, Y
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2005, 357 (11) : 4579 - 4605
  • [35] A Diagrammatic Axiomatisation for Qubit Entanglement
    Hadzihasanovic, Amar
    2015 30TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2015, : 573 - 584
  • [36] An axiomatisation of the set theory
    von Neumann, J
    JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 1925, 154 (1/4): : 219 - 240
  • [37] Weak bisimulation for fully probabilistic processes
    Baier, C
    Hermanns, H
    COMPUTER AIDED VERIFICATION, 1997, 1254 : 119 - 130
  • [38] Fully probabilistic knowledge expression and incorporation
    Karny, Miroslav
    Guy, Tatiana V.
    Kracik, Jan
    Nedoma, Petr
    Bodini, Antonella
    Ruggeri, Fabrizio
    STATISTICS AND ITS INTERFACE, 2014, 7 (04) : 503 - 515
  • [39] A complete axiomatisation for timed automata
    Lin, HM
    Yi, W
    FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2000, 1974 : 277 - 289
  • [40] Barrier synchronisation:: Axiomatisation and relaxation
    Stewart, A
    Clint, M
    Gabarró, J
    FORMAL ASPECTS OF COMPUTING, 2004, 16 (01) : 36 - 50