{"id":"https://openalex.org/W3085306822","doi":"https://doi.org/10.23919/fusion45008.2020.9190460","title":"A Dual- Ascent Algorithm for the Multi-dimensional Assignment Problem: Application to Multi-Target Tracking","display_name":"A Dual- Ascent Algorithm for the Multi-dimensional Assignment Problem: Application to Multi-Target Tracking","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3085306822","doi":"https://doi.org/10.23919/fusion45008.2020.9190460","mag":"3085306822"},"language":"en","primary_location":{"id":"doi:10.23919/fusion45008.2020.9190460","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fusion45008.2020.9190460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 23rd International Conference on Information Fusion (FUSION)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007025310","display_name":"Samhita Vadrevu","orcid":"https://orcid.org/0000-0002-6193-630X"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Samhita Vadrevu","raw_affiliation_strings":["Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084546619","display_name":"Rakesh Nagi","orcid":"https://orcid.org/0000-0003-4022-6277"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rakesh Nagi","raw_affiliation_strings":["Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007025310"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.3452,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73066187,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13371","display_name":"Military Defense Systems Analysis","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13371","display_name":"Military Defense Systems Analysis","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12158","display_name":"Guidance and Control Systems","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9671000242233276,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.774378776550293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6877703070640564},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5866650342941284},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5792353749275208},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5693600177764893},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5077394247055054},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.49966979026794434},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.43061986565589905},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.4274742007255554},{"id":"https://openalex.org/keywords/graphics-processing-unit","display_name":"Graphics processing unit","score":0.4254131317138672},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4200502932071686},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.21444487571716309},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21371158957481384}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.774378776550293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6877703070640564},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5866650342941284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5792353749275208},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5693600177764893},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5077394247055054},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.49966979026794434},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.43061986565589905},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.4274742007255554},{"id":"https://openalex.org/C2779851693","wikidata":"https://www.wikidata.org/wiki/Q183484","display_name":"Graphics processing unit","level":2,"score":0.4254131317138672},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4200502932071686},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.21444487571716309},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21371158957481384},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/fusion45008.2020.9190460","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fusion45008.2020.9190460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 23rd International Conference on Information Fusion (FUSION)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1607775576","https://openalex.org/W1998285872","https://openalex.org/W2014898029","https://openalex.org/W2097195835","https://openalex.org/W2115734113","https://openalex.org/W2123338732","https://openalex.org/W2124150970","https://openalex.org/W2124781496","https://openalex.org/W2128461485","https://openalex.org/W2129078811","https://openalex.org/W2139211712","https://openalex.org/W2139938665","https://openalex.org/W2165115362","https://openalex.org/W2165567889","https://openalex.org/W2165646785","https://openalex.org/W2358916922","https://openalex.org/W2362232363","https://openalex.org/W2390101256","https://openalex.org/W2401971606","https://openalex.org/W2476974423","https://openalex.org/W2890140718","https://openalex.org/W2974174883","https://openalex.org/W3012543212","https://openalex.org/W4242130683","https://openalex.org/W4288360975","https://openalex.org/W6775175165"],"related_works":["https://openalex.org/W2037613239","https://openalex.org/W3183857959","https://openalex.org/W4243844638","https://openalex.org/W2894990380","https://openalex.org/W195910675","https://openalex.org/W3032916910","https://openalex.org/W2363143319","https://openalex.org/W2351035339","https://openalex.org/W1980006501","https://openalex.org/W2138760184"],"abstract_inverted_index":{"Recently":[0],"we":[1,27,55],"proposed":[2],"a":[3,17,49,57,69,75,82,104],"new":[4,152],"Mixed-Integer":[5],"Linear":[6,107],"Programming":[7],"formulation":[8],"for":[9,35,74,87,111,183],"the":[10,36,101,121,148,169,172,184],"Multi-Target":[11],"Tracking":[12],"(MTT)":[13],"problem":[14],"and":[15,66,94,140,163,177,180],"used":[16],"standard":[18],"optimization":[19],"solver":[20],"to":[21,133,154],"demonstrate":[22,147,168],"its":[23],"viability":[24],"[1].":[25],"Subsequently,":[26],"provided":[28],"Graphics":[29],"Processing":[30],"Unit":[31],"(GPU)":[32],"accelerated":[33],"algorithms":[34],"underlying":[37],"Multidimensional":[38],"Assignment":[39,108],"Problem":[40],"(MAP)":[41],"with":[42,91,137,143,174],"decomposable":[43],"costs":[44,47],"or":[45],"triplet":[46],"using":[48,120],"Lagrangian":[50],"Relaxation":[51],"(LR)":[52],"framework.":[53],"Here,":[54],"present":[56],"Dual-Ascent":[58],"algorithm":[59,130,153,173],"that":[60],"provides":[61],"monotonically":[62],"increasing":[63],"lower":[64],"bounds":[65],"converges":[67],"in":[68,118,187],"fraction":[70],"of":[71,85,106,124,150,160,171],"iterations":[72],"required":[73],"subgradient":[76],"scheme.":[77],"This":[78],"approach":[79],"can":[80,115],"handle":[81],"large":[83],"number":[84],"targets":[86,139],"many":[88],"time":[89],"steps":[90],"massive":[92],"parallelism":[93],"computational":[95],"efficiency.":[96],"The":[97,127],"dual-ascent":[98,129],"framework":[99],"decomposes":[100],"MAP":[102],"into":[103],"set":[105],"Problems":[109],"(LAPs)":[110],"adjacent":[112],"time-steps,":[113],"which":[114],"be":[116],"solved":[117],"parallel":[119],"GPU-accelerated":[122],"method":[123],"[2],":[125],"[3].":[126],"overall":[128],"is":[131],"able":[132],"efficiently":[134],"solve":[135],"problems":[136,186],"100":[138,141],"time-frames":[142],"high":[144],"accuracy.":[145],"We":[146],"applicability":[149],"our":[151],"MTT":[155],"by":[156],"including":[157],"realistic":[158],"issues":[159],"missed":[161],"detections":[162],"false":[164],"alarms.":[165],"Computational":[166],"results":[167],"robustness":[170],"good":[175],"MMEP":[176],"ITCP":[178],"scores":[179],"solution":[181],"times":[182],"larger":[185],"less":[188],"than":[189],"6":[190],"seconds.":[191]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}