In the framework of random finite set (RFS) theory, a V-shaped multi-agent formation (VMAF) tracking algorithm based on a probability hypothesis density (PHD) filter is proposed. The algorithm incorporates the control input (CI) generated by the formation model into the PHD filter to enhance its ability to predict the localization of agents, thus enabling effective tracking and control of VMAF in environments with obstacles. The algorithm, referred to as CI-based PHD, addresses the uncertainties caused by sensor detection probabilities, clutter, and noise in formation path planning. By comparing with the standard PHD algorithm, the simulation results verify the effectiveness and robustness of CI-based PHD under different detection probabilities and Poisson clutter rates.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A V-Shaped Multi-Agent Formation Navigation Method Based on the Probability Hypothesis Density Filter

  • Yusong Zhou,
  • Jin Zhao,
  • Ping Chen,
  • Zhiwen Ma

摘要

In the framework of random finite set (RFS) theory, a V-shaped multi-agent formation (VMAF) tracking algorithm based on a probability hypothesis density (PHD) filter is proposed. The algorithm incorporates the control input (CI) generated by the formation model into the PHD filter to enhance its ability to predict the localization of agents, thus enabling effective tracking and control of VMAF in environments with obstacles. The algorithm, referred to as CI-based PHD, addresses the uncertainties caused by sensor detection probabilities, clutter, and noise in formation path planning. By comparing with the standard PHD algorithm, the simulation results verify the effectiveness and robustness of CI-based PHD under different detection probabilities and Poisson clutter rates.