Skip to main navigation Skip to search Skip to main content

A Single Beacon-aided Cooperative Localization Algorithm based on Maximum Correntropy Criterion

  • Harbin Engineering University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Accurate cooperative localization (CL) is a crucial requirement for multi-AUVs operation. However, the Velocity Uncertainty (VU) measured by DVL (Doppler Velocity Logger) in certain environments makes it challenging for master-slaver CL. A single beacon-aided CL positioning method based on Maximum Correntropy Criterion (MCC) is proposed in this paper. Firstly, a velocity correction method is presented to deal with the problem of VU. Then a circular intersection solving method relying on time transmission delay is adopted to achieve slaver AUV's location. In which a judging rule is designed to distinguish mirror solutions in circular intersection equations. Simulation results verify that the proposed algorithm can achieve a high localization accuracy with velocity uncertainty.

Original languageEnglish
Title of host publication2021 International Wireless Communications and Mobile Computing, IWCMC 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1835-1839
Number of pages5
ISBN (Electronic)9781728186160
DOIs
StatePublished - 2021
Event17th IEEE International Wireless Communications and Mobile Computing, IWCMC 2021 - Virtual, Online, China
Duration: 28 Jun 20212 Jul 2021

Publication series

Name2021 International Wireless Communications and Mobile Computing, IWCMC 2021

Conference

Conference17th IEEE International Wireless Communications and Mobile Computing, IWCMC 2021
Country/TerritoryChina
CityVirtual, Online
Period28/06/212/07/21

Keywords

  • Cooperative localization
  • Single beacon
  • Velocity correction

Fingerprint

Dive into the research topics of 'A Single Beacon-aided Cooperative Localization Algorithm based on Maximum Correntropy Criterion'. Together they form a unique fingerprint.

Cite this