首页> 外文会议>International Conference on Telecommunications >A Dynamic Constrained Cooperative Localization Algorithm
【24h】

A Dynamic Constrained Cooperative Localization Algorithm

机译:动态约束协同定位算法

获取原文

摘要

Cooperative localization (CL) algorithms are widely used in various systems, such as wireless sensor networks (WSNs), urban vehicular networks and unmanned aerial vehicle (UAV) networks. The performance of traditional CL algorithms degrades when these algorithms are applied to sparse distribution and high mobility scenarios. In this paper, a dynamic constrained CL algorithm based on the sum-product algorithm (SPA) is proposed. Dynamic constraints can effectively reduce the negative impact caused by the network nodes' mobility, and improve the accuracy of the prior position estimates. Based on the prior information, the SPA is used to fuse range measurements. Simulation results show that the proposed algorithm has better localization performance than EKF-based CL algorithms and SPAWN in critical environment.
机译:合作定位(CL)算法广泛用于各种系统中,例如无线传感器网络(WSN),城市车辆网络和无人机(UAV)网络。当这些算法应用于稀疏分布和高移动性场景时,传统CL算法的性能会下降。提出了一种基于和积算法(SPA)的动态约束CL算法。动态约束可以有效减少网络节点的移动性带来的负面影响,并提高先前位置估计的准确性。根据先前的信息,SPA用于融合距离测量。仿真结果表明,在关键环境下,该算法比基于EKF的CL算法和SPAWN算法具有更好的定位性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号