z-logo
Premium
Distributed finite‐time fault‐tolerant error constraint containment algorithm for multiple ocean bottom flying nodes with tan‐type barrier Lyapunov function
Author(s) -
Qin Hongde,
Chen Hui,
Sun Yanchao
Publication year - 2020
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.5046
Subject(s) - control theory (sociology) , backstepping , lyapunov function , controller (irrigation) , fault (geology) , trajectory , computer science , function (biology) , constraint (computer aided design) , mathematics , adaptive control , control (management) , nonlinear system , physics , geometry , quantum mechanics , artificial intelligence , astronomy , seismology , evolutionary biology , agronomy , biology , geology
Summary The ocean bottom flying node (OBFN) is a special autonomous underwater vehicle (AUV) for seabed resource exploration. In this article, unmodeled uncertainties, thruster faults, and ocean disturbances are considered. The trajectory errors are constrained. Based on the directed topology, the distributed finite‐time fault‐tolerant error constraint containment control problem for multiple OBFN systems is solved, while only a part of follower OBFNs can measure the state of leaders. By using the backstepping method and a tan‐type barrier lyapunov function (BLF), a novel form of virtual controller is constructed. Neural network is employed to approximate and compensate the general disturbances. And the upper bound of the estimation error is dealt with by proposing an adaptive law. Besides, the trajectory errors can be constrained to a small neighborhood of zero in finite time. In other words, follower OBFNs can reach the convex hull consisted of leaders in finite time. The effectiveness of the designed algorithm is shown by presenting numerical experiment.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here