Connectivity-maintaining obstacle avoidance approach for leader-follower formation tracking of uncertain multiple nonholonomic mobile robots
- Authors
- Park, B.S.; Yoo, S.J.
- Issue Date
- 1-Jun-2021
- Publisher
- Elsevier Ltd
- Keywords
- Connectivity-maintaining obstacle avoidance; Guaranteed performance; Leader-follower formation; Uncertain multiple nonholonomic mobile robots
- Citation
- Expert Systems with Applications, v.171
- Journal Title
- Expert Systems with Applications
- Volume
- 171
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/44004
- DOI
- 10.1016/j.eswa.2021.114589
- ISSN
- 0957-4174
1873-6793
- Abstract
- This paper investigates a connectivity-maintaining obstacle avoidance problem for guaranteed-performance-based leader-follower formation tracking of uncertain multiple nonholonomic mobile robots with communication and sensing range constraints. All nonlinearities in the robot dynamics are assumed to be unknown. The desired relative angles among robots for preserving connectivity between the leader and the follower while avoiding obstacles are derived to develop a novel connectivity-maintaining obstacle avoidance strategy. Then, a leader-follower formation tracker using these desired relative angles and connectivity-preserving and collision-avoiding performance functions is designed for accomplishing connectivity maintenance, collision avoidance, and obstacle avoidance among robots. The performance-functions-based avoidance starting range for the connectivity-maintaining obstacle avoidance achievement is induced from the Lyapunov stability analysis. Furthermore, the proposed formation tracking strategy does not require any potential-functions-based approaches and adaptive approximation techniques. Finally, simulation studies clarify and verify the proposed theoretical approach. © 2021 Elsevier Ltd
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of ICT Engineering > School of Electrical and Electronics Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.