Bearing-only solution for Fermat–Weber location problem: Generalized algorithms

This paper presents novel algorithms for the Fermat–Weber Location Problem, guiding an autonomous agent to the point that minimizes the weighted sum of Euclidean distances to some beacons using only bearing measurements. The current results address only the simple scenario where the beacons are stat...

Full description

Saved in:
Bibliographic Details
Published inAutomatica (Oxford) Vol. 176; p. 112242
Main Authors Le-Phan, Nhat-Minh, Nguyen, Phuoc Doan, Ahn, Hyo-Sung, Trinh, Minh Hoang
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.06.2025
Subjects
Bearing-only algorithm
Fermat–Weber location problem
Moving beacons
Single-integrator agent
Time-varying velocity
Bearing-only algorithm
Fermat–Weber location problem
Moving beacons
Single-integrator agent
Time-varying velocity
Online AccessGet full text
ISSN0005-1098
DOI10.1016/j.automatica.2025.112242

Cover

More Information
Summary:This paper presents novel algorithms for the Fermat–Weber Location Problem, guiding an autonomous agent to the point that minimizes the weighted sum of Euclidean distances to some beacons using only bearing measurements. The current results address only the simple scenario where the beacons are stationary and the agent is modeled by a single integrator. In this paper, we present a number of bearing-only algorithms that let the agent follow the Fermat–Weber point of a group of stationary or moving beacons. Exponential and finite-time stability of the Fermat–Weber point are also established. The theoretical results are rigorously proven using Lyapunov theory and supported with simulation examples.
ISSN:0005-1098
DOI:10.1016/j.automatica.2025.112242