Abstract
Multi-agent consensus problem in an obstacle-laden environment is addressed in this study. A novel optimal control approach is proposed for the multi-agent system to reach consensus as well as avoid obstacles with a reasonable control effort. An innovative nonquadratic penalty function is constructed to achieve obstacle avoidance capability from an inverse optimal control perspective. The asymptotic stability and optimality of the consensus algorithm are proven. In addition, the optimal control law only requires local information from the communication topology to guarantee the proposed behaviour, rather than all agents’ information. The consensus and obstacle avoidance are validated through various simulations.
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.
