A Novel Method for Discrete Evidence Fusion Based on Dijkstra Shortest Path Algorithm
作者单位：Science and Technology on Avionics Integration Laboratory School of Electronics and InformationNorthwestern Polytechnical University
会议名称：《第32届中国控制与决策会议》
会议日期：2020年
学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 081104[工学-模式识别与智能系统] 08[工学] 0835[工学-软件工程] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）]
关 键 词：Discrete evidence Dijkstra algorithm Jousselme distance Dempster combination
摘 要：Discrete evidence generally exists in the fields of expert systems,pattern recognition,and decision *** to solve the fusion of discrete evidence is an open *** 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 ***,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 *** Jousselme distance is designed to measure the conflict between the *** the Dijkstra shortest path algorithm is used to find the path with the largest and smallest Jousselme *** path here indicates the discrete evidence group with the largest fusion distance and smallest fusion *** use Dempster combination to fuse the evidence after weighted average and give the interval value of ***,two groups discrete evidence are given for verification to illustrate the rationality and effectiveness of the method.
