Gradient free cooperative seeking of a moving source

From MaRDI portal
Publication:6103010

DOI10.1016/J.AUTOMATICA.2023.110948zbMATH Open1519.93014arXiv2201.00446MaRDI QIDQ6103010FDOQ6103010


Authors: Elad Michael, Chris Manzie, Tony A. Wood, Daniel Zelazo, Iman Shames Edit this on Wikidata


Publication date: 26 June 2023

Published in: Automatica (Search for Journal in Brave)

Abstract: In this paper, we consider the optimisation of a time varying scalar field by a network of agents with no gradient information. We propose a composite control law, blending extremum seeking with formation control in order to converge to the extrema faster by minimising the gradient estimation error. By formalising the relationship between the formation and the gradient estimation error, we provide a novel analysis to prove the convergence of the network to a bounded neighbourhood of the field's time varying extrema. We assume the time-varying field satisfies the Polyak Lojasiewicz inequality and the gradient is Lipschitz continuous at each iteration. Numerical studies and comparisons are provided to support the theoretical results.


Full work available at URL: https://arxiv.org/abs/2201.00446




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Gradient free cooperative seeking of a moving source

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103010)