scholarly journals Conflict Data Fusion in a Multi-Agent System Premised on the Base Basic Probability Assignment and Evidence Distance

Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 820
Author(s):  
Jingyu Liu ◽  
Yongchuan Tang
Keyword(s):  
Data Fusion ◽  
Evidence Theory ◽  
Multi Agent System ◽  
Agent System ◽  
Combination Rules ◽  
Probability Assignment ◽  
Basic Probability Assignment ◽  
Reasonable Evidence ◽  
Basic Probability ◽  
Multi Agent

The multi-agent information fusion (MAIF) system can alleviate the limitations of a single expert system in dealing with complex situations, as it allows multiple agents to cooperate in order to solve problems in complex environments. Dempster–Shafer (D-S) evidence theory has important applications in multi-source data fusion, pattern recognition, and other fields. However, the traditional Dempster combination rules may produce counterintuitive results when dealing with highly conflicting data. A conflict data fusion method in a multi-agent system based on the base basic probability assignment (bBPA) and evidence distance is proposed in this paper. Firstly, the new bBPA and reconstructed BPA are used to construct the initial belief degree of each agent. Then, the information volume of each evidence group is obtained by calculating the evidence distance so as to modify the reliability and obtain more reasonable evidence. Lastly, the final evidence is fused with the Dempster combination rule to obtain the result. Numerical examples show the effectiveness and availability of the proposed method, which improves the accuracy of the identification process of the MAIF system.

scholarly journals An Improved Data Fusion Method Based on Weighted Belief Entropy considering the Negation of Basic Probability Assignment

2020 ◽  
Vol 2020 ◽  
pp. 1-11 ◽  
Author(s):  
Yong Chen ◽  
Yongchuan Tang ◽  
Yan Lei
Keyword(s):  
Data Fusion ◽  
Evidence Theory ◽  
Mass Function ◽  
Sensor Data ◽  
Artificial Data ◽  
Probability Assignment ◽  
Basic Probability Assignment ◽  
Fusion Applications ◽  
Basic Probability ◽  
Belief Entropy

Uncertainty in data fusion applications has received great attention. Due to the effectiveness and flexibility in handling uncertainty, Dempster–Shafer evidence theory is widely used in numerous fields of data fusion. However, Dempster–Shafer evidence theory cannot be used directly for conflicting sensor data fusion since counterintuitive results may be attained. In order to handle this issue, a new method for data fusion based on weighted belief entropy and the negation of basic probability assignment (BPA) is proposed. First, the negation of BPA is applied to represent the information in a novel view. Then, by measuring the uncertainty of the evidence, the weighted belief entropy is adopted to indicate the relative importance of evidence. Finally, the ultimate weight of each body of evidence is applied to adjust the mass function before fusing by the Dempster combination rule. The validity of the proposed method is demonstrated in accordance with an experiment on artificial data and an application on fault diagnosis.

scholarly journals An improved conflicting-evidence combination method based on the redistribution of the basic probability assignment

2021 ◽  
Author(s):  
Zezheng Yan ◽  
Hanping Zhao ◽  
Xiaowen Mei
Keyword(s):  
Evidence Theory ◽  
Combination Method ◽  
Probability Assignment ◽  
Basic Probability Assignment ◽  
Combination Methods ◽  
Conflicting Evidence ◽  
Basic Probability ◽  
The Right ◽  
Conflict Intensity ◽  
Dempster’S Rule Of Combination

AbstractDempster–Shafer evidence theory is widely applied in various fields related to information fusion. However, the results are counterintuitive when highly conflicting evidence is fused with Dempster’s rule of combination. Many improved combination methods have been developed to address conflicting evidence. Nevertheless, all of these approaches have inherent flaws. To solve the existing counterintuitive problem more effectively and less conservatively, an improved combination method for conflicting evidence based on the redistribution of the basic probability assignment is proposed. First, the conflict intensity and the unreliability of the evidence are calculated based on the consistency degree, conflict degree and similarity coefficient among the evidence. Second, the redistribution equation of the basic probability assignment is constructed based on the unreliability and conflict intensity, which realizes the redistribution of the basic probability assignment. Third, to avoid excessive redistribution of the basic probability assignment, the precision degree of the evidence obtained by information entropy is used as the correction factor to modify the basic probability assignment for the second time. Finally, Dempster’s rule of combination is used to fuse the modified basic probability assignment. Several different types of examples and actual data sets are given to illustrate the effectiveness and potential of the proposed method. Furthermore, the comparative analysis reveals the proposed method to be better at obtaining the right results than other related methods.

Determination of Basic Probability Assignment Based on Recognition Sequence

2014 ◽  
Vol 1049-1050 ◽  
pp. 1171-1175
Author(s):  
Yan Fei Chen ◽  
Xue Zhi Xia ◽  
Kui Tu
Keyword(s):  
Target Recognition ◽  
Evidence Theory ◽  
Practical Application ◽  
Recognition Sequence ◽  
Probability Assignment ◽  
Basic Probability Assignment ◽  
Recognition Result ◽  
Basic Probability ◽  
Simulation Results

In some practical application of target recognition with sensors, the sensors will give the recognition sequence of targets, which is more detailed than the single recognition result. How to properly construct the basic probability assignment by the recognition sequence becomes the key to successful application of evidence theory. For the recognition sequence of the target recognition results of general sensor is incomplete, and the importance of the types in the recognition sequence is in descending order, this paper proposes a method to construct weights of recognition sequence, the basic probability assignments constructed by the weights are closer to the real recognition results. Simulation results show that this method is more reasonable and effective than the method of contrast.

Development for granular computing-based multi-agent system for data fusion process

2013 ◽  
Vol 48 (4) ◽  
pp. 321
Author(s):  
Bin Ma ◽  
Nannan Li ◽  
Kuan Huang ◽  
Changtao Wang ◽  
Zhonghua Han ◽  
...  
Keyword(s):  
Data Fusion ◽  
Granular Computing ◽  
Fusion Process ◽  
Multi Agent System ◽  
Agent System ◽  
Multi Agent

scholarly journals An improved method to determine basic probability assignment based on fuzzy mathematics

2022 ◽  
Vol 355 ◽  
pp. 02002
Author(s):  
Leihui Xiong ◽  
Xiaoyan Su
Keyword(s):  
Target Recognition ◽  
Evidence Theory ◽  
Intersection Point ◽  
Fuzzy Mathematics ◽  
Improved Method ◽  
Probability Assignment ◽  
Basic Probability Assignment ◽  
Robot Hands ◽  
Basic Probability

In D-S evidence theory, the determination of the basic probability assignment function (BPA) is the first and important step. However, the generation of BPA is still a problem to be solved. Based on the concepts in fuzzy mathematics, this paper proposes an improved BPA generation method. By introducing the value of the intersection point of membership function of different targets under the same index to describe the overlap degree of targets, the assignment of unknown items is optimized on this basis. This article applies it to target recognition of robot hands. The results show that the proposed method is more reliable and more accurate.

scholarly journals An improved method to determine basic probability assignment with interval number and its application in classification

2019 ◽  
Vol 15 (1) ◽  
pp. 155014771882052 ◽  
Author(s):  
Bowen Qin ◽  
Fuyuan Xiao
Keyword(s):  
Evidence Theory ◽  
Classification Problem ◽  
Interval Number ◽  
Training Data ◽  
Cluster Method ◽  
Uncertain Information ◽  
Data Set ◽  
Probability Assignment ◽  
Basic Probability Assignment ◽  
Basic Probability

Due to its efficiency to handle uncertain information, Dempster–Shafer evidence theory has become the most important tool in many information fusion systems. However, how to determine basic probability assignment, which is the first step in evidence theory, is still an open issue. In this article, a new method integrating interval number theory and k-means++ cluster method is proposed to determine basic probability assignment. At first, k-means++ clustering method is used to calculate lower and upper bound values of interval number with training data. Then, the differentiation degree based on distance and similarity of interval number between the test sample and constructed models are defined to generate basic probability assignment. Finally, Dempster’s combination rule is used to combine multiple basic probability assignments to get the final basic probability assignment. The experiments on Iris data set that is widely used in classification problem illustrated that the proposed method is effective in determining basic probability assignment and classification problem, and the proposed method shows more accurate results in which the classification accuracy reaches 96.7%.

Sign in / Sign up

Export Citation Format

Share Document