Abstract
Abstract The paper presents an extremum seeking-based optimisation algorithm guaranteeing global convergence to an arbitrary small neighbourhood of the optimum. We present a modification of canonical solutions present in literature yielding semiglobal and practical convergence by overtaking the need to know the set of initial conditions for tuning the design parameters. A comparison with existing solutions and numerical results are also presented to highlight the main features of the proposed algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
