Radar is a cornerstone of modern intelligence, surveillance and reconnaissance. While radar can determine the location of a target to within a region of space, fundamental uncertainties exist that limit the accuracy of individual radars. A method that is used to reduce these uncertainties is known as data fusion and involves processing the measurements from multiple radars together. One of the main challenges of using data fusion in the field is the difficulty of being able to associate individual detections that correspond to the same target into tracks in real time. Different data fusion algorithms exist to reduce the computation time but the trade-off is lower track accuracy. The goal of the MQP was to quantify the trade-offs for different data fusion algorithms under several scenarios.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Kovar, Jordan A

Publisher

• Worcester Polytechnic Institute

Identifier

• E-project-032116-220509

Advisor

• Iannacchione, Germano S.
• Fehribach, Joseph D.

Year

• 2016

Center

• MIT Lincoln Laboratory-Lexington, Massachusetts Project Center - MQP

Sponsor

• MIT Lincoln Laboratory

Date created

• 2016-03-21

Resource type

• Major Qualifying Project

Major

• Interdisciplinary

Rights statement

• In Copyright

License

• All rights reserved