Abstract
AbstractIn this paper, we consider the problem of extremum seeking in the presence of obstacles. The analytical expression of the cost function as well as locations and shapes of the obstacles are assumed to be partially or completely unknown. We describe a broad family of control algorithms for a unicycle type system, which provides a solution of the above problem based on Lie bracket approximation ideas. The obtained controllers generalize some known results and allow to construct new control strategies. Furthermore, it is shown that gradient‐free control algorithms can be used for excluding the attraction of trajectories to undesirable equilibriuma in obstacle avoidance problems.
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.
