Abstract
By exploiting an important property of the time optimal control law structure, this paper introduces a new dynamic programming approach for X-Y robot minimum time path following problem. Compared with the conventional dynamic programming method, the proposed approach significantly reduces the computational cost. The efficiency and effectiveness of the proposed approach are demonstrated via computer simulations. In addition, via experimental studies, this paper also addresses practical difficulties in implementing the minimum-time control law.
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.
