By Topic

Combinatorial quick JPDA algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Quan Pan ; Dept. of Autom. Control, Northwestern Polytech. Univ., Xian, China ; Hongcai Zhang ; Yangzhao Xiang

Based upon the graph searching method in ordered state space of combinatorial problem, we define the joint event as the problem node and transform a problem of data association for multitarget tracking to one in state space. In order to reduce the number of extended nodes during searching, we define the function of the joint probability data association as the valuation function of node and present a new simple approach to determining whether a node is an old one produced previously. After all we put forward a new algorithm which can easily search out N events with the largest joint probabilities and calculate their joint probabilities quickly. The new algorithm has the advantages of both Bayesian and non-Bayesian methods.

Published in:

American Control Conference, 1994  (Volume:3 )

Date of Conference:

29 June-1 July 1994