๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

From dynamic influence nets to dynamic Bayesian networks: A transformation algorithm

โœ Scribed by Sajjad Haider


Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
173 KB
Volume
24
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

โœฆ Synopsis


This paper presents an algorithm to transform a dynamic influence net (DIN) into a dynamic Bayesian network (DBN). The transformation aims to bring the best of both probabilistic reasoning paradigms. The advantages of DINs lie in their ability to represent causal and time-varying information in a compact and easy-to-understand manner. They facilitate a system modeler in connecting a set of desired effects and a set of actionable events through a series of dynamically changing cause and effect relationships. The resultant probabilistic model is then used to analyze different courses of action in terms of their effectiveness to achieve the desired effect(s). The major drawback of DINs is their inability to incorporate evidence that arrive during the execution of a course of action (COA). Several belief-updating algorithms, on the other hand, have been developed for DBNs that enable a system modeler to insert evidence in dynamic probabilistic models. Dynamic Bayesian networks, however, suffer from the intractability of knowledge acquisition. The presented transformation algorithm combines the advantages of both DINs and DBNs. It enables a system analyst to capture a complex situation using a DIN and pick the best (or close-to-best) COA that maximizes the likelihood of achieving the desired effect. During the execution, if evidence becomes available, the DIN is converted into an equivalent DBN and beliefs of other nodes in the network are updated. If required, the selected COA can be revised on the basis of the recently received evidence. The presented methodology is applicable in domains requiring strategic level decision making in highly complex situations, such as war games, real-time strategy video games, and business simulation games.


๐Ÿ“œ SIMILAR VOLUMES


Monitoring scientific developments from
โœ Noyons, E. C. M. ;van Raan, A. F. J. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 291 KB ๐Ÿ‘ 2 views

With the help of bibliometric mapping techniques, we tion level choice has been made, the problem of selecting have developed a methodology of ''self-organized'' relevant data within the chosen source(s) arises. 1 Articles structuring of scientific fields. This methodology is ap-(or patents, or docu

A new set of channel allocation algorith
โœ Ailton A. Shinoda; Michel D. Yacoub ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 132 KB

A set of three allocation algorithms is proposed and analysed. As opposed to a number of allocation algorithms, whose performance is greatly dependent on the traffic profile, these techniques are dynamically adaptable to the change of the traffic load, combining the features of dynamic channel alloc