On the Solution of Data Association Problem Using Rollout Algorithms

Date

2016-07-08

Author

Ozgen, Selim
Demirekler, Mübeccel
Orguner, Umut

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

99
views

0
downloads

The quality and precision of tracking maneuvering targets under heavy clutter is highly dependent on both the data association and the state estimation algorithms. In this study, measurement-to-track association problem for a single target when P-D = 1 is discussed. The problem considers the batch set of measurements in a time interval. An approximate stochastic optimization algorithm for data association is presented. To reduce the computational load, the rollout algorithm is utilized. The algorithm is applied to a tracking scenario and GNN, JPDA and MHT algorithms are compared with their rollout versions. In the comparison several different track quality measures are used to demonstrate the efficiency of the algorithm.

Subject Keywords

Measurement-to-track association, Markov decision process, Dynamic programming, Rollout algorithms

URI

https://hdl.handle.net/11511/54418

Collections

Graduate School of Natural and Applied Sciences, Conference / Seminar

Suggestions

OpenMETU
Core

Rollout Algorithms for the Measurement-to-Track Association Problem Ozgen, Selim; Demirekler, Mübeccel (2016-05-19) The quality and precision of tracking manuevering targets under large clutter is highly dependent on both the data association and state estimation algorithms. In this study, measurement-to track association problem was discussed and the optimal association problem was shown to be a Markov Decision Process. The problem model considers the batch measurements in a time interval. The optimization problem has an heavy computational load, therefore the rollout algorithm is used to solve this problem. The approxi...
On numerical optimization theory of infinite kernel learning Ozogur-Akyuz, S.; Weber, Gerhard Wilhelm (2010-10-01) In Machine Learning algorithms, one of the crucial issues is the representation of the data. As the given data source become heterogeneous and the data are large-scale, multiple kernel methods help to classify "nonlinear data". Nevertheless, the finite combinations of kernels are limited up to a finite choice. In order to overcome this discrepancy, a novel method of "infinite" kernel combinations is proposed with the help of infinite and semi-infinite programming regarding all elements in kernel space. Look...
On Equivalence Relationships Between Classification and Ranking Algorithms Ertekin Bolelli, Şeyda (2011-10-01) We demonstrate that there are machine learning algorithms that can achieve success for two separate tasks simultaneously, namely the tasks of classification and bipartite ranking. This means that advantages gained from solving one task can be carried over to the other task, such as the ability to obtain conditional density estimates, and an order-of-magnitude reduction in computational time for training the algorithm. It also means that some algorithms are robust to the choice of evaluation metric used; the...
Study on Q-RAM and Feasible Directions Based Methods for Resource Management in Phased Array Radar Systems Irci, Ayhan; Saranlı, Afşar; Baykal, Buyurman (2010-10-01) Our recent progress and results on optimal real-time resource allocation in phased array radar systems are reported. A previously proposed discrete resource allocation approach, the Quality of Service based Resource Allocation Model (Q-RAM), is analyzed and is observed to generate nonoptimal results. We identify the shortcomings of this method and first extend it using the Karush-Kuhn-Tucker (KKT) optimality conditions for the single resource type case. We obtain an algorithm that delivers a globally optima...
The strong partial transitive-closure problem: Algorithms and performance evaluation Toroslu, İsmail Hakkı (1996-08-01) The development of efficient algorithms to process the different forms of transitive-closure (To) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, the so called strong partially instantiated transitive closure, in which one of the query's arguments is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values...

Citation Formats

S. Ozgen, M. Demirekler, and U. Orguner, “On the Solution of Data Association Problem Using Rollout Algorithms,” 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/54418.