Comparison of sampling-based algorithms for multisensor distributed target tracking

被引:0
|
作者
Nguyen, TM [1 ]
Jilkov, VP [1 ]
Li, XR [1 ]
机构
[1] Univ New Orleans, Dept Elect Engn, New Orleans, LA 70148 USA
关键词
target tracking; multisensor data fusion; nonlinear filtering; particle filter; unscented Kalman filter; unscented particle filter;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper considers the problem of tracking a maneuvering target in multisensor environment. A novel scheme is proposed for distributed tracking which utilizes a nonlinear target model and estimates from local (sensor-based) estimators. The resulting estimation problem is nonlinear In order to evaluate the performance capabilities of the architecture considered, advanced sampling-based nonlinear filters are implemented-particle filter (PF), unscented Kalman filter (UKF), and unscented particle filter (UPF). Results front extensive Monte Carlo simulations using different configurations of these algorithms are obtained to compare their effectiveness for solving a distributed target tracking problem.
引用
收藏
页码:114 / 121
页数:8
相关论文
共 50 条
  • [41] Machine Learning Guided Exploration for Sampling-based Motion Planning Algorithms
    Arslan, Oktay
    Tsiotras, Panagiotis
    2015 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2015, : 2646 - 2652
  • [42] Theory of Monte Carlo sampling-based alopex algorithms for neural networks
    Chen, Z
    Haykin, S
    Becker, S
    2004 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL V, PROCEEDINGS: DESIGN AND IMPLEMENTATION OF SIGNAL PROCESSING SYSTEMS INDUSTRY TECHNOLOGY TRACKS MACHINE LEARNING FOR SIGNAL PROCESSING MULTIMEDIA SIGNAL PROCESSING SIGNAL PROCESSING FOR EDUCATION, 2004, : 501 - 504
  • [43] Incremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games
    Karaman, Sertac
    Frazzoli, Emilio
    ALGORITHMIC FOUNDATIONS OF ROBOTICS IX, 2010, 68 : 71 - +
  • [44] A Framework for Description and Analysis of Sampling-based Approximate Triangle Counting Algorithms
    Chehreghani, Mostafa Haghir
    PROCEEDINGS OF 3RD IEEE/ACM INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS, (DSAA 2016), 2016, : 80 - 89
  • [45] Sampling-based Algorithms for Optimal Motion Planning with Deterministic μ-Calculus Specifications
    Karaman, Sertac
    Frazzoli, Emilio
    2012 AMERICAN CONTROL CONFERENCE (ACC), 2012, : 735 - 742
  • [46] Distributed Gibbs: A Linear-Space Sampling-Based DCOP Algorithm
    Duc Thien Nguyen
    Yeoh, William
    Lau, Hoong Chuin
    Zivan, Roie
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2019, 64 : 705 - 748
  • [47] Dynamic Programming Guided Exploration for Sampling-based Motion Planning Algorithms
    Arslan, Oktay
    Tsiotras, Panagiotis
    2015 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2015, : 4819 - 4826
  • [48] Sampling-based approximation algorithms for multi-stage stochastic optimization
    Swamy, C
    Shmoys, DB
    46TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2005, : 357 - 366
  • [49] Optimal Path Planning in Complex Cost Spaces With Sampling-Based Algorithms
    Devaurs, Didier
    Simeon, Thierry
    Cortes, Juan
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2016, 13 (02) : 415 - 424
  • [50] Performance evaluation of sampling-based large-scale clustering algorithms
    Olukanmi, Peter O.
    Nelwamondo, Fulufhelo
    Marwala, Tshilidzi
    2019 SOUTHERN AFRICAN UNIVERSITIES POWER ENGINEERING CONFERENCE/ROBOTICS AND MECHATRONICS/PATTERN RECOGNITION ASSOCIATION OF SOUTH AFRICA (SAUPEC/ROBMECH/PRASA), 2019, : 194 - 199