A Novel Method for Discrete Evidence Fusion Based on Dijkstra Shortest Path Algorithm

Bo Liu, Yang Yang, Xinyang Deng

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Discrete evidence generally exists in the fields of expert systems, pattern recognition, and decision processing. How to solve the fusion of discrete evidence is an open question. In order to solve the problem that the number of calculations increases exponentially with the increase of the number of discrete evidences, a method for calculating the shortest path based on Dijkstra is proposed. First, the normalized discrete evidence is decomposed into the exact value of the evidence as far as possible, and then the Jousselme distance between the two pairs of evidence between the evidence groups is calculated. The Jousselme distance is designed to measure the conflict between the evidence. Then the Dijkstra shortest path algorithm is used to find the path with the largest and smallest Jousselme distance. The path here indicates the discrete evidence group with the largest fusion distance and smallest fusion distance. Then use Dempster combination to fuse the evidence after weighted average and give the interval value of BPA. Finally, two groups discrete evidence are given for verification to illustrate the rationality and effectiveness of the method.

源语言英语
主期刊名Proceedings of the 32nd Chinese Control and Decision Conference, CCDC 2020
出版商Institute of Electrical and Electronics Engineers Inc.
3574-3579
页数6
ISBN(电子版)9781728158549
DOI
出版状态已出版 - 8月 2020
活动32nd Chinese Control and Decision Conference, CCDC 2020 - Hefei, 中国
期限: 22 8月 202024 8月 2020

出版系列

姓名Proceedings of the 32nd Chinese Control and Decision Conference, CCDC 2020

会议

会议32nd Chinese Control and Decision Conference, CCDC 2020
国家/地区中国
Hefei
时期22/08/2024/08/20

指纹

探究 'A Novel Method for Discrete Evidence Fusion Based on Dijkstra Shortest Path Algorithm' 的科研主题。它们共同构成独一无二的指纹。

引用此