- -

Greedy and K-Greedy algoritmhs for multidimensional data association

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Greedy and K-Greedy algoritmhs for multidimensional data association

Show simple item record

Files in this item

dc.contributor.author Perea Rojas Marcos, Federico es_ES
dc.contributor.author de Waard, Huub. W. es_ES
dc.date.accessioned 2015-12-15T15:51:09Z
dc.date.available 2015-12-15T15:51:09Z
dc.date.issued 2011-07
dc.identifier.issn 0018-9251
dc.identifier.uri http://hdl.handle.net/10251/58849
dc.description.abstract [EN] The multidimensional assignment (MDA) problem is a combinatorial optimization problem arising in many applications, for instance multitarget tracking (MTT). The objective of an MDA problem of dimension $d\in\Bbb{N}$ is to match groups of $d$ objects in such a way that each measurement is associated with at most one track and each track is associated with at most one measurement from each list, optimizing a certain objective function. It is well known that the MDA problem is NP-hard for $d\geq3$. In this paper five new polynomial time heuristics to solve the MDA problem arising in MTT are presented. They are all based on the semi-greedy approach introduced in earlier research. Experimental results on the accuracy and speed of the proposed algorithms in MTT problems are provided. © 2006 IEEE. es_ES
dc.description.sponsorship This research was supported by a Marie Curie fellowship of the European Community program "Improving Human Research Potential and the Socio-economic Knowledge Base" under Contract HPMI-CT-2002-00221.
dc.language Inglés es_ES
dc.publisher Institute of Electrical and Electronics Engineers (IEEE) es_ES
dc.relation EU/HPMI-CT-2002-00221 es_ES
dc.relation.ispartof IEEE Transactions on Aerospace and Electronic Systems es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Combinatorial optimization problems es_ES
dc.subject Multi-target tracking es_ES
dc.subject Multidimensional assignment es_ES
dc.subject Multidimensional data es_ES
dc.subject NP-hard es_ES
dc.subject Objective functions es_ES
dc.subject Polynomial time heuristics es_ES
dc.subject Combinatorial optimization es_ES
dc.subject Optimization es_ES
dc.subject Polynomial approximation es_ES
dc.subject Algorithms es_ES
dc.subject.classification ESTADISTICA E INVESTIGACION OPERATIVA es_ES
dc.title Greedy and K-Greedy algoritmhs for multidimensional data association es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1109/TAES.2011.5937273
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat es_ES
dc.description.bibliographicCitation Perea Rojas Marcos, F.; De Waard, HW. (2011). Greedy and K-Greedy algoritmhs for multidimensional data association. IEEE Transactions on Aerospace and Electronic Systems. 47(3):1915-1925. doi:10.1109/TAES.2011.5937273 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1109/TAES.2011.5937273 es_ES
dc.description.upvformatpinicio 1915 es_ES
dc.description.upvformatpfin 1925 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 47 es_ES
dc.description.issue 3 es_ES
dc.relation.senia 208886 es_ES
dc.contributor.funder European Commission


This item appears in the following Collection(s)

Show simple item record