A Semidefinite Relaxation Method for Localization in Vehicular Ad-Hoc Networks

Xiaomei Qu, Tao Liu, Wenrong Tan
{"title":"A Semidefinite Relaxation Method for Localization in Vehicular Ad-Hoc Networks","authors":"Xiaomei Qu, Tao Liu, Wenrong Tan","doi":"10.1109/ICCA.2019.8899546","DOIUrl":null,"url":null,"abstract":"Accurate localization is one of the most important premises for the application of vehicular Ad-Hoc networks. This paper explores the information fusion of the GPS measurements and the Radar TOA measurements to improve the localization accuracy. However, the formulation based on the Maximum-Likelihood method is a non-convex optimization problem. We reformulate it as a homogeneous quadratic programming with homogeneous quadratic equality constraints, which is non-convex and NP-hard. Therefore we propose a semidefinite relaxation method which can efficiently solve this non-convex problem. The Monte Carlo simulations are carried out and the results demonstrate that the proposed SDR method can achieve the CRLB accuracy.","PeriodicalId":413310,"journal":{"name":"International Conferences on Computing Advancements","volume":"15 9","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conferences on Computing Advancements","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCA.2019.8899546","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Accurate localization is one of the most important premises for the application of vehicular Ad-Hoc networks. This paper explores the information fusion of the GPS measurements and the Radar TOA measurements to improve the localization accuracy. However, the formulation based on the Maximum-Likelihood method is a non-convex optimization problem. We reformulate it as a homogeneous quadratic programming with homogeneous quadratic equality constraints, which is non-convex and NP-hard. Therefore we propose a semidefinite relaxation method which can efficiently solve this non-convex problem. The Monte Carlo simulations are carried out and the results demonstrate that the proposed SDR method can achieve the CRLB accuracy.
车载Ad-Hoc网络定位的半定松弛法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书