Abstract
A sequential algorithm is presented for obtaining a cost-ranked set of solutions to the assignment problem. Concurrently, a conservative bound can be calculated that indicates how many of the ranked set are better than other potential assignments that may have been missed. Applications to two important strategic defense initiative measurement-assignment problems, namely the cycle-to-cycle and the sensor-to-sensor problems, are demonstrated. The procedure is useful for initiating new object tracks as well as for assigning incoming measurements to established tracking filters. Knowledge of the ranked set of assignments, as opposed to a single optimum, is important because of measurement uncertainties. The prudent course may be to initiate several tentative tracks in certain close-call situations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
