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
相关论文
共 30 条
  • [1] [Anonymous], 1970, Utility Theory for Decision Making
  • [2] [Anonymous], OPTIMIZED BAYESIAN D
  • [3] [Anonymous], 1989, Theory of Statistical Inference and Information
  • [4] [Anonymous], MULTIPLE PARTICIPANT
  • [5] [Anonymous], 1954, DECISION PROCESSES
  • [6] [Anonymous], IMPLICATIONS RATIONA
  • [7] [Anonymous], 16 IFAC WORLD C IFAC
  • [8] [Anonymous], 2006, P 20 C NEUR INF PROC
  • [9] [Anonymous], P 49 IEEE C DEC CONT
  • [10] [Anonymous], 2005, P 2 INT C INF CONTR