{"title":"基于信念-行为图的交互式动态影响图的近似解","authors":"Jian Luo, Bo Li, Le Tian, Huayi Yin","doi":"10.1109/ISA.2011.5873376","DOIUrl":null,"url":null,"abstract":"Interactive Dynamic Influence Diagrams(I-DIDs) constitute a graphic model for multi-agent decision making under uncertainty, but solving them is provably intractable. Algorithms for solving I-DIDs face the challenge of an exponentially growing space of candidate models ascribed to other agents, over time. Pruning behaviorally equivalent models is one way toward minimizing the model set, but composing behavioral equivalence classes is a complex process as we need to compare all solutions of possible models of other agents in the merge operation. In this paper, we seek a more efficient way to construct behavioral equivalence classes using belief-behavior Graph(BBG). We present a method of solving I-DIDs approximately that reduces the candidate model space by clustering models that are likely to be -behavioral equivalence and selecting a representative one from each cluster. We discuss the complexity of the approximation technique and demonstrate its empirical performance.","PeriodicalId":128163,"journal":{"name":"2011 3rd International Workshop on Intelligent Systems and Applications","volume":"34 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximate Solution for Interactive Dynamic Influence Diagrams Based on Belief-Behavior Graphs\",\"authors\":\"Jian Luo, Bo Li, Le Tian, Huayi Yin\",\"doi\":\"10.1109/ISA.2011.5873376\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Interactive Dynamic Influence Diagrams(I-DIDs) constitute a graphic model for multi-agent decision making under uncertainty, but solving them is provably intractable. Algorithms for solving I-DIDs face the challenge of an exponentially growing space of candidate models ascribed to other agents, over time. Pruning behaviorally equivalent models is one way toward minimizing the model set, but composing behavioral equivalence classes is a complex process as we need to compare all solutions of possible models of other agents in the merge operation. In this paper, we seek a more efficient way to construct behavioral equivalence classes using belief-behavior Graph(BBG). We present a method of solving I-DIDs approximately that reduces the candidate model space by clustering models that are likely to be -behavioral equivalence and selecting a representative one from each cluster. We discuss the complexity of the approximation technique and demonstrate its empirical performance.\",\"PeriodicalId\":128163,\"journal\":{\"name\":\"2011 3rd International Workshop on Intelligent Systems and Applications\",\"volume\":\"34 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 3rd International Workshop on Intelligent Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISA.2011.5873376\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 3rd International Workshop on Intelligent Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISA.2011.5873376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Approximate Solution for Interactive Dynamic Influence Diagrams Based on Belief-Behavior Graphs
Interactive Dynamic Influence Diagrams(I-DIDs) constitute a graphic model for multi-agent decision making under uncertainty, but solving them is provably intractable. Algorithms for solving I-DIDs face the challenge of an exponentially growing space of candidate models ascribed to other agents, over time. Pruning behaviorally equivalent models is one way toward minimizing the model set, but composing behavioral equivalence classes is a complex process as we need to compare all solutions of possible models of other agents in the merge operation. In this paper, we seek a more efficient way to construct behavioral equivalence classes using belief-behavior Graph(BBG). We present a method of solving I-DIDs approximately that reduces the candidate model space by clustering models that are likely to be -behavioral equivalence and selecting a representative one from each cluster. We discuss the complexity of the approximation technique and demonstrate its empirical performance.