检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京交科公路勘察设计研究院有限公司 [2]交通运输部公路科学研究院,北京10088
出 处:《北京邮电大学学报》2011年第1期126-129,共4页Journal of Beijing University of Posts and Telecommunications
基 金:十一五国家科技支撑计划项目(2009BAG13A02)
摘 要:为了解决传统无线定位技术中定位精度不高的问题,针对下一代移动通信系统,提出利用移动台(MS)之间的协同通信对目标MS进行协同定位,并利用非线性最优化理论解决MS协同定位问题,将该问题转化为线性最小二乘问题,最终利用Gauss-Newton算法估计目标MS的位置.仿真结果表明,Gauss-Newton算法在解决协同定位问题时,几乎都能收敛,收敛速度快,平均迭代数为2~3次.当2个或2个以上的参考终端(RT)参与定位,且RT的测距标准差小于50 m时,协同定位均方根误差可控制在100 m内.To enhance the precision of wireless localization in the traditional mobile network,a wireless cooperative localization algorithm is proposed for the next-generation mobile communication system by employing the cooperative communication between the mobile stations(MS).The cooperative localization problem is solved by non-linear optimization theory.With that this problem is converted to the linear least square problem,finally the location is estimated by the Gauss-Newton algorithm.Simulation shows that,when Gauss-Newton algorithm is applied in the cooperative localization,it is almost converged and the times for convergence(the converging speed) is about 2~3.When there are two or more than two reference terminals(RT) involved in the cooperative localization,and the standard deviation of the distance measured by RT is less than 50 m,the root mean square error of the location estimate is less than 100 m.
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.142.144.163