Abstract
An adaptive control scheme is proposed for rigid link robots where the control signal computations are performed continuously and the control coefficient computations are performed in discrete time. A global boundedness result is established for the resulting scheme, independent of the sampling rate. It is also shown that the position, velocity, and acceleration tracking errors are of the order of the sampling period. Furthermore, it is shown that, if the reference trajectory is persistently exciting (in a continuous-time sense), then, for a sufficiently fast sampling rate, the tracking errors decay to zero.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
