The global nearest pattern (GNP) approach to data association is closely related to the global nearest neighbor (GNN) problem, and both require that a cost of non-assignment of tracks be established. The existing theory for GNN can be reasonably applied to GNP problems, but adjustments are required to optimally account for bias estimation and uncertainty in GNP. These adjustments are presented along with Monte Carlo analysis showing the achieved performance is nearly optimal.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal Non-Assignment Costs for the GNP Problem


    Contributors:


    Publication date :

    2020-03-01


    Size :

    3536532 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English






    Dynamic User Optimal Assignment Problem Based on Greenshields Model

    Ren, H. / Gao, Z. / Lian, A. et al. | British Library Conference Proceedings | 2006


    An equivalent optimization formulation for the traffic assignment problem with asymmetric linear costs

    Grange, Louis de / Muñoz, Juan Carlos | Taylor & Francis Verlag | 2009