IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v37y2025i5p1413-1432.html

Computational Framework for Target Tracking Information Fusion Problems

Author

Listed:
  • Tianyu Yang

    (Department of Mechanical and Industrial Engineering, Northeastern University, Boston, Massachusetts 02115)

  • Jiongbai Liu

    (Department of Mechanical and Industrial Engineering, Northeastern University, Boston, Massachusetts 02115)

  • Tasnim Ibn Faiz

    (Department of Mechanical and Industrial Engineering, Northeastern University, Boston, Massachusetts 02115)

  • Chrysafis Vogiatzis

    (Industrial and Enterprise Systems Engineering, University of Illinois Urbana-Champaign, Urbana, Illinois 61801)

  • Md. Noor-E-Alam

    (Department of Mechanical and Industrial Engineering, Northeastern University, Boston, Massachusetts 02115)

Abstract

In this work, we propose computationally tractable techniques for extracting valuable information from diverse data sources collected by multiple sensors in a variety of formats (visual, sonar, quantitative, qualitative, social information, etc.). More specifically, we develop an integrated approach consisting of two algorithms for extracting information and achieving a consensus-based, robust solution. The first algorithm extracts solutions from sensors within each data source, whereas the second algorithm reaches a compromise among the generated solutions from the previous algorithm across all data sources. To accomplish these goals, we initially transform the multisensor multitarget tracking problem (MSMTT) problem into a multidimensional assignment problem. Subsequently, we introduce a decomposition-based multisensor recursive approach referred to as a revised multisensor recursive algorithm, which can efficiently deliver a robust solution for each single data source MSMTT problem. In the second algorithm, we extend our methodology to the multisource MSMTT problem by introducing a connection-based symmetric nonnegative matrix factorization technique, which is shown to be computationally feasible and efficient in obtaining high-quality solutions.

Suggested Citation

  • Tianyu Yang & Jiongbai Liu & Tasnim Ibn Faiz & Chrysafis Vogiatzis & Md. Noor-E-Alam, 2025. "Computational Framework for Target Tracking Information Fusion Problems," INFORMS Journal on Computing, INFORMS, vol. 37(5), pages 1413-1432, September.
  • Handle: RePEc:inm:orijoc:v:37:y:2025:i:5:p:1413-1432
    DOI: 10.1287/ijoc.2023.0016
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2023.0016
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2023.0016?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Walteros, Jose L. & Vogiatzis, Chrysafis & Pasiliao, Eduardo L. & Pardalos, Panos M., 2014. "Integer programming models for the multidimensional assignment problem with star costs," European Journal of Operational Research, Elsevier, vol. 235(3), pages 553-568.
    2. William P. Pierskalla, 1968. "Letter to the Editor—The Multidimensional Assignment Problem," Operations Research, INFORMS, vol. 16(2), pages 422-431, April.
    3. Crama, Yves & Spieksma, Frits C. R., 1992. "Approximation algorithms for three-dimensional assignment problems with triangle inequalities," European Journal of Operational Research, Elsevier, vol. 60(3), pages 273-279, August.
    4. H-J Bandelt & A Maas & F C R Spieksma, 2004. "Local search heuristics for multi-index assignment problems with decomposable costs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 694-704, July.
    5. Chrysafis Vogiatzis & Eduardo Pasiliao & Panos Pardalos, 2014. "Graph partitions for the multidimensional assignment problem," Computational Optimization and Applications, Springer, vol. 58(1), pages 205-224, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Walteros, Jose L. & Vogiatzis, Chrysafis & Pasiliao, Eduardo L. & Pardalos, Panos M., 2014. "Integer programming models for the multidimensional assignment problem with star costs," European Journal of Operational Research, Elsevier, vol. 235(3), pages 553-568.
    2. Duc Manh Nguyen & Hoai An Le Thi & Tao Pham Dinh, 2014. "Solving the Multidimensional Assignment Problem by a Cross-Entropy method," Journal of Combinatorial Optimization, Springer, vol. 27(4), pages 808-823, May.
    3. P. Senthil Kumar, 2020. "Developing a New Approach to Solve Solid Assignment Problems Under Intuitionistic Fuzzy Environment," International Journal of Fuzzy System Applications (IJFSA), IGI Global Scientific Publishing, vol. 9(1), pages 1-34, January.
    4. H-J Bandelt & A Maas & F C R Spieksma, 2004. "Local search heuristics for multi-index assignment problems with decomposable costs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 694-704, July.
    5. Jingqun Li & R. Tharmarasa & Daly Brown & Thia Kirubarajan & Krishna R. Pattipati, 2019. "A novel convex dual approach to three-dimensional assignment problem: theoretical analysis," Computational Optimization and Applications, Springer, vol. 74(2), pages 481-516, November.
    6. Maurice Queyranne & Frits Spieksma & Fabio Tardella, 1998. "A General Class of Greedily Solvable Linear Programs," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 892-908, November.
    7. Renata M. Aiex & Mauricio G. C. Resende & Panos M. Pardalos & Gerardo Toraldo, 2005. "GRASP with Path Relinking for Three-Index Assignment," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 224-247, May.
    8. Boštjan Gabrovšek & Tina Novak & Janez Povh & Darja Rupnik Poklukar & Janez Žerovnik, 2020. "Multiple Hungarian Method for k -Assignment Problem," Mathematics, MDPI, vol. 8(11), pages 1-18, November.
    9. P. Senthil Kumar, 2020. "Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(1), pages 189-222, February.
    10. Alla Kammerdiner & Alexander Semenov & Eduardo L. Pasiliao, 2022. "Multidimensional Assignment Problem for Multipartite Entity Resolution," Journal of Global Optimization, Springer, vol. 84(2), pages 491-523, October.
    11. Jingqun Li & Thia Kirubarajan & R. Tharmarasa & Daly Brown & Krishna R. Pattipati, 2021. "A dual approach to multi-dimensional assignment problems," Journal of Global Optimization, Springer, vol. 81(3), pages 691-716, November.
    12. Christopher T. B. Strömblad & Upasana Raval & Kristy Zhou & Shok-Jean Yee & Thomas C. Barber & Martin R. Weiser, 2025. "Overbooking Surgical Blocks," Interfaces, INFORMS, vol. 55(4), pages 344-359, July.
    13. Benjamin Lev, 2010. "Book Reviews," Interfaces, INFORMS, vol. 40(6), pages 480-485, December.
    14. Alla Kammerdiner & Alexander Semenov & Eduardo L. Pasiliao, 2024. "Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem," Journal of Global Optimization, Springer, vol. 88(3), pages 653-683, March.
    15. Huang, Gaofeng & Lim, Andrew, 2006. "A hybrid genetic algorithm for the Three-Index Assignment Problem," European Journal of Operational Research, Elsevier, vol. 172(1), pages 249-257, July.
    16. Don A. Grundel & Pavlo A. Krokhmal & Carlos A. S. Oliveira & Panos M. Pardalos, 2007. "On the number of local minima for the multidimensional assignment problem," Journal of Combinatorial Optimization, Springer, vol. 13(1), pages 1-18, January.
    17. Spieksma, Frits C. R. & Woeginger, Gerhard J., 1996. "Geometric three-dimensional assignment problems," European Journal of Operational Research, Elsevier, vol. 91(3), pages 611-618, June.
    18. Alla R. Kammerdiner & Andre N. Guererro, 2019. "Data-driven combinatorial optimization for sensor-based assessment of near falls," Annals of Operations Research, Springer, vol. 276(1), pages 137-153, May.
    19. Urban, Timothy L. & Russell, Robert A., 2003. "Scheduling sports competitions on multiple venues," European Journal of Operational Research, Elsevier, vol. 148(2), pages 302-311, July.
    20. Andrew Perrykkad & Andreas T. Ernst & Mohan Krishnamoorthy, 2022. "A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem," Operations Research, INFORMS, vol. 70(3), pages 1531-1559, May.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijoc:v:37:y:2025:i:5:p:1413-1432. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.