Research on SFSDP Optimization Based on Gradient Methods

Hanyue Hu, Zhe Zheng*, Yang Zhou

*Corresponding author for this work

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

Abstract

Multi-agent systems can be applied in many fields and have good prospects for development. It is particularly necessary to obtain the location information of a single agent in the system. In this paper, a sparse version of full semidefinite programming(SFSDP) is used to solve the multi-agent system localization problem. The results can be applied in networks of both robotic vehicles and unmanned aerial vehicles with located sensors. In this paper, a model of multi-agent system localization problem was built and converted into a convex optimization problem by SFSDP relaxation. To address the poor performance of SFSDP optimization based on the gradient method in some situations, this paper creatively adopts Adagrad to optimize the SFSDP and verifies the superiority of Adagrad in optimizing the SFSDP through experiments.

Original languageEnglish
Title of host publication2023 9th International Conference on Computer and Communications, ICCC 2023
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2638-2643
Number of pages6
ISBN (Electronic)9798350317251
DOIs
Publication statusPublished - 2023
Event9th International Conference on Computer and Communications, ICCC 2023 - Hybrid, Chengdu, China
Duration: 8 Dec 202311 Dec 2023

Publication series

Name2023 9th International Conference on Computer and Communications, ICCC 2023

Conference

Conference9th International Conference on Computer and Communications, ICCC 2023
Country/TerritoryChina
CityHybrid, Chengdu
Period8/12/2311/12/23

Keywords

  • Adagrad
  • Gradient Search Method
  • Multi-agent system
  • SFSDP

Fingerprint

Dive into the research topics of 'Research on SFSDP Optimization Based on Gradient Methods'. Together they form a unique fingerprint.

Cite this