Near-minimum-time control of a robot manipulator

This thesis deals with the problem of minimum time control of a rigid robot manipulator with point-to-point motion subject to constraints on the control inputs. Due to the nonlinear and coupled dynamics of the robot manipulator, finding minimum time strategies is algorithmically difficult and com...

Full description

Bibliographic Details
Main Author: Tao, Fan
Format: Others
Language:English
Published: 2009
Online Access:http://hdl.handle.net/2429/14293
id ndltd-UBC-oai-circle.library.ubc.ca-2429-14293
record_format oai_dc
spelling ndltd-UBC-oai-circle.library.ubc.ca-2429-142932018-01-05T17:37:13Z Near-minimum-time control of a robot manipulator Tao, Fan This thesis deals with the problem of minimum time control of a rigid robot manipulator with point-to-point motion subject to constraints on the control inputs. Due to the nonlinear and coupled dynamics of the robot manipulator, finding minimum time strategies is algorithmically difficult and computationally very intensive, even when the dynamic equations and parameters of the manipulator are precisely known. As a result, the practical applicability of the available methods currently is very limited. In this research, we assume the control inputs are always bang-bang and switch once. Using the Principle of Work and Energy, a simple and practical "zero-net-work" searching approach is proposed. The proposed method focuses on changes in the manipulator's kinetic energy during the time optimal motion, instead of concentrating on the system's state variables, as is usually done in conventional approaches. The "zero-net-work" method is used to develop the controllers for one-link manipulators, a 3-degree of freedom cylindrical manipulator and a two-degree of freedom revolute manipulator. The results show that if the structure of the exact minimum time control is bang-bang with a single switch, using the "zero-net-work" method we will get the exact minimum time solution. If the exact minimum time control has more than one switch, using the "zero-net-work" method we will get a near-minimum-time solution. The major advantages of the proposed method are that it does not require initial boundary value guesses and is computationally efficient. Applied Science, Faculty of Mechanical Engineering, Department of Graduate 2009-10-28T23:31:14Z 2009-10-28T23:31:14Z 2003 2003-11 Text Thesis/Dissertation http://hdl.handle.net/2429/14293 eng For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. 6496100 bytes application/pdf
collection NDLTD
language English
format Others
sources NDLTD
description This thesis deals with the problem of minimum time control of a rigid robot manipulator with point-to-point motion subject to constraints on the control inputs. Due to the nonlinear and coupled dynamics of the robot manipulator, finding minimum time strategies is algorithmically difficult and computationally very intensive, even when the dynamic equations and parameters of the manipulator are precisely known. As a result, the practical applicability of the available methods currently is very limited. In this research, we assume the control inputs are always bang-bang and switch once. Using the Principle of Work and Energy, a simple and practical "zero-net-work" searching approach is proposed. The proposed method focuses on changes in the manipulator's kinetic energy during the time optimal motion, instead of concentrating on the system's state variables, as is usually done in conventional approaches. The "zero-net-work" method is used to develop the controllers for one-link manipulators, a 3-degree of freedom cylindrical manipulator and a two-degree of freedom revolute manipulator. The results show that if the structure of the exact minimum time control is bang-bang with a single switch, using the "zero-net-work" method we will get the exact minimum time solution. If the exact minimum time control has more than one switch, using the "zero-net-work" method we will get a near-minimum-time solution. The major advantages of the proposed method are that it does not require initial boundary value guesses and is computationally efficient. === Applied Science, Faculty of === Mechanical Engineering, Department of === Graduate
author Tao, Fan
spellingShingle Tao, Fan
Near-minimum-time control of a robot manipulator
author_facet Tao, Fan
author_sort Tao, Fan
title Near-minimum-time control of a robot manipulator
title_short Near-minimum-time control of a robot manipulator
title_full Near-minimum-time control of a robot manipulator
title_fullStr Near-minimum-time control of a robot manipulator
title_full_unstemmed Near-minimum-time control of a robot manipulator
title_sort near-minimum-time control of a robot manipulator
publishDate 2009
url http://hdl.handle.net/2429/14293
work_keys_str_mv AT taofan nearminimumtimecontrolofarobotmanipulator
_version_ 1718589577295298560