Details

Robot Manipulator Redundancy Resolution


Robot Manipulator Redundancy Resolution


Wiley-ASME Press Series 1. Aufl.

von: Yunong Zhang, Long Jin

101,99 €

Verlag: Wiley
Format: EPUB
Veröffentl.: 06.09.2017
ISBN/EAN: 9781119381433
Sprache: englisch
Anzahl Seiten: 320

DRM-geschütztes eBook, Sie benötigen z.B. Adobe Digital Editions und eine Adobe ID zum Lesen.

Beschreibungen

<p><b>Introduces a revolutionary, quadratic-programming based approach to </b><b>solving long-standing problems in motion planning and control of redundant manipulators</b> </p> <p>This book describes a novel quadratic programming approach to solving redundancy resolutions problems with redundant manipulators. Known as ``QP-unified motion planning and control of redundant manipulators'' theory, it systematically solves difficult optimization problems of inequality-constrained motion planning and control of redundant manipulators that have plagued robotics engineers and systems designers for more than a quarter century.    </p> <p>An example of redundancy resolution could involve a robotic limb with six joints, or degrees of freedom (DOFs), with which to position an object. As only five numbers are required to specify the position and orientation of the object, the robot can move with one remaining DOF through practically infinite poses while performing a specified task. In this case redundancy resolution refers to the process of choosing an optimal pose from among that infinite set. A critical issue in robotic systems control, the redundancy resolution problem has been widely studied for decades, and numerous solutions have been proposed. This book investigates various approaches to motion planning and control of redundant robot manipulators and describes the most successful strategy thus far developed for resolving redundancy resolution problems. </p> <ul> <li>Provides a fully connected, systematic, methodological, consecutive, and easy approach to solving redundancy resolution problems</li> <li>Describes a new approach to the time-varying Jacobian matrix pseudoinversion, applied to the redundant-manipulator kinematic control</li> <li>Introduces The QP-based unification of robots' redundancy resolution</li> <li>Illustrates the effectiveness of the methods presented using a large number of computer simulation results based on PUMA560, PA10, and planar robot manipulators</li> <li>Provides technical details for all schemes and solvers presented, for readers to adopt and customize them for specific industrial applications </li> </ul> <p><i>Robot Manipulator Redundancy Resolution</i> is must-reading for advanced undergraduates and graduate students of robotics, mechatronics, mechanical engineering, tracking control, neural dynamics/neural networks, numerical algorithms, computation and optimization, simulation and modelling, analog, and digital circuits. It is also a valuable working resource for practicing robotics engineers and systems designers and industrial researchers.</p>
<p>List of Figures xiii</p> <p>List of Tables xxv</p> <p>Preface xxvii</p> <p>Acknowledgments xxxiii</p> <p>Acronyms xxxv</p> <p><b>Part I Pseudoinverse-Based ZD Approach 1</b></p> <p><b>1 Redundancy Resolution via Pseudoinverse and ZD Models 3</b></p> <p>1.1 Introduction 3</p> <p>1.2 Problem Formulation and ZD Models 5</p> <p>1.2.1 Problem Formulation 5</p> <p>1.2.2 Continuous-Time ZD Model 6</p> <p>1.2.3 Discrete-Time ZD Models 7</p> <p>1.2.3.1 Euler-Type DTZD Model with J̇ (t) Known 7</p> <p>1.2.3.2 Euler-Type DTZD Model with J̇ (t) Unknown 7</p> <p>1.2.3.3 Taylor-Type DTZD Models 8</p> <p>1.3 ZD Applications to Different-Type Robot Manipulators 9</p> <p>1.3.1 Application to a Five-Link Planar Robot Manipulator 9</p> <p>1.3.2 Application to a Three-Link Planar Robot Manipulator 12</p> <p>1.4 Chapter Summary 14</p> <p><b>Part II Inverse-Free Simple Approach 15</b></p> <p><b>2 G1 Type Scheme to JVL Inverse Kinematics 17</b></p> <p>2.1 Introduction 17</p> <p>2.2 Preliminaries and RelatedWork 18</p> <p>2.3 Scheme Formulation 18</p> <p>2.4 Computer Simulations 19</p> <p>2.4.1 Square-Path Tracking Task 19</p> <p>2.4.2 “Z”-Shaped Path Tracking Task 22</p> <p>2.5 Physical Experiments 25</p> <p>2.6 Chapter Summary 26</p> <p><b>3 D1G1 Type Scheme to JAL Inverse Kinematics 27</b></p> <p>3.1 Introduction 27</p> <p>3.2 Preliminaries and RelatedWork 28</p> <p>3.3 Scheme Formulation 28</p> <p>3.4 Computer Simulations 29</p> <p>3.4.1 Rhombus-Path Tracking Task 29</p> <p>3.4.1.1 Verifications 29</p> <p>3.4.1.2 Comparisons 30</p> <p>3.4.2 Triangle-Path Tracking Task 32</p> <p>3.5 Chapter Summary 36</p> <p><b>4 Z1G1 Type Scheme to JAL Inverse Kinematics 37</b></p> <p>4.1 Introduction 37</p> <p>4.2 Problem Formulation and Z1G1 Type Scheme 37</p> <p>4.3 Computer Simulations 38</p> <p>4.3.1 Desired Initial Position 38</p> <p>4.3.1.1 Isosceles-Trapezoid Path Tracking 40</p> <p>4.3.1.2 Isosceles-Triangle Path Tracking 41</p> <p>4.3.1.3 Square Path Tracking 42</p> <p>4.3.2 Nondesired Initial Position 44</p> <p>4.4 Physical Experiments 45</p> <p>4.5 Chapter Summary 45</p> <p><b>Part III QP Approach and Unification 47</b></p> <p><b>5 Redundancy Resolution via QP Approach and Unification 49</b></p> <p>5.1 Introduction 49</p> <p>5.2 Robotic Formulation 50</p> <p>5.3 Handling Joint Physical Limits 52</p> <p>5.3.1 Joint-Velocity Level 52</p> <p>5.3.2 Joint-Acceleration Level 52</p> <p>5.4 Avoiding Obstacles 53</p> <p>5.5 Various Performance Indices 54</p> <p>5.5.1 Resolved at Joint-Velocity Level 55</p> <p>5.5.1.1 MVN scheme 55</p> <p>5.5.1.2 RMP scheme 55</p> <p>5.5.1.3 MKE scheme 55</p> <p>5.5.2 Resolved at Joint-Acceleration Level 55</p> <p>5.5.2.1 MAN scheme 55</p> <p>5.5.2.2 MTN scheme 56</p> <p>5.5.2.3 IIWT scheme 56</p> <p>5.6 Unified QP Formulation 56</p> <p>5.7 Online QP Solutions 57</p> <p>5.7.1 Traditional QP Routines 57</p> <p>5.7.2 Compact QP Method 57</p> <p>5.7.3 Dual Neural Network 57</p> <p>5.7.4 LVI-Aided Primal-Dual Neural Network 57</p> <p>5.7.5 Numerical Algorithms E47 and 94LVI 59</p> <p>5.7.5.1 Numerical Algorithm E47 59</p> <p>5.7.5.2 Numerical Algorithm 94LVI 59</p> <p>5.8 Computer Simulations 61</p> <p>5.9 Chapter Summary 66</p> <p><b>Part IV Illustrative JVL QP Schemes and Performances 67</b></p> <p><b>6 Varying Joint-Velocity Limits Handled by QP 69</b></p> <p>6.1 Introduction 69</p> <p>6.2 Preliminaries and Problem Formulation 70</p> <p>6.2.1 Six-DOF Planar Robot System 70</p> <p>6.2.2 Varying Joint-Velocity Limits 73</p> <p>6.3 9 4LVI Assisted QP Solution 76</p> <p>6.4 Computer Simulations and Physical Experiments 77</p> <p>6.4.1 Line-Segment Path-Tracking Task 77</p> <p>6.4.2 Elliptical-Path Tracking Task 85</p> <p>6.4.3 Simulations with Faster Tasks 87</p> <p>6.4.3.1 Line-Segment-Path-Tracking Task 87</p> <p>6.4.3.2 Elliptical-Path-Tracking Task 89</p> <p>6.5 Chapter Summary 92</p> <p><b>7 Feedback-AidedMinimum Joint Motion 95</b></p> <p>7.1 Introduction 95</p> <p>7.2 Preliminaries and Problem Formulation 97</p> <p>7.2.1 Minimum Joint Motion Performance Index 97</p> <p>7.2.2 Varying Joint-Velocity Limits 100</p> <p>7.3 Computer Simulations and Physical Experiments 101</p> <p>7.3.1 “M”-Shaped Path-Tracking Task 101</p> <p>7.3.1.1 Simulation Comparisons with Different ;;p 101</p> <p>7.3.1.2 Simulation Comparisons with Different ;; 103</p> <p>7.3.1.3 Simulative and Experimental Verifications of FAMJM Scheme 105</p> <p>7.3.2 “P”-Shaped Path Tracking Task 107</p> <p>7.3.3 Comparisons with Pseudoinverse-Based Approach 108</p> <p>7.3.3.1 Comparison with Tracking Task of Larger “M”-Shaped Path 110</p> <p>7.3.3.2 Comparison with Tracking Task of Larger “P”-Shaped Path 112</p> <p>7.4 Chapter Summary 119</p> <p><b>8 QP Based Manipulator State Adjustment 121</b></p> <p>8.1 Introduction 121</p> <p>8.2 Preliminaries and Scheme Formulation 122</p> <p>8.3 QP Solution and Control of Robot Manipulator 124</p> <p>8.4 Computer Simulations and Comparisons 125</p> <p>8.4.1 State Adjustment without ZIV Constraint 125</p> <p>8.4.2 State Adjustment with ZIV Constraint 128</p> <p>8.5 Physical Experiments 132</p> <p>8.6 Chapter Summary 136</p> <p><b>Part V Self-Motion Planning 137</b></p> <p><b>9 QP-Based Self-Motion Planning 139</b></p> <p>9.1 Introduction 139</p> <p>9.2 Preliminaries and QP Formulation 140</p> <p>9.2.1 Self-Motion Criterion 140</p> <p>9.2.2 QP Formulation 141</p> <p>9.3 LVIAPDNN Assisted QP Solution 141</p> <p>9.4 PUMA560 Based Computer Simulations 142</p> <p>9.4.1 From Initial Configuration A to Desired Configuration B 144</p> <p>9.4.2 From Initial Configuration A to Desired Configuration C 146</p> <p>9.4.3 From Initial Configuration E to Desired Configuration F 147</p> <p>9.5 PA10 Based Computer Simulations 152</p> <p>9.6 Chapter Summary 158</p> <p><b>10 PseudoinverseMethod and Singularities Discussed 161</b></p> <p>10.1 Introduction 161</p> <p>10.2 Preliminaries and Scheme Formulation 162</p> <p>10.2.1 Modified Performance Index for SMP 163</p> <p>10.2.2 QP-Based SMP Scheme Formulation 163</p> <p>10.3 LVIAPDNN Assisted QP Solution with Discussion 164</p> <p>10.4 Computer Simulations 167</p> <p>10.4.1 Three-Link Redundant PlanarManipulator 168</p> <p>10.4.1.1 Verifications 168</p> <p>10.4.1.2 Comparisons 171</p> <p>10.4.2 PUMA560 Robot Manipulator 172</p> <p>10.4.3 PA10 Robot Manipulator 176</p> <p>10.5 Chapter Summary 180</p> <p>Appendix 181</p> <p>Equivalence Analysis in Limit Situation 181</p> <p><b>11 Self-Motion Planning with ZIV Constraint 183</b></p> <p>11.1 Introduction 183</p> <p>11.2 Preliminaries and Scheme Formulation 184</p> <p>11.2.1 Handling Joint Physical Limits 184</p> <p>11.2.2 QP Reformulation 187</p> <p>11.2.3 Design of ZIV Constraint 187</p> <p>11.3 E47 Assisted QP Solution 188</p> <p>11.4 Computer Simulations and Physical Experiments 189</p> <p>11.5 Chapter Summary 197</p> <p><b>Part VI Manipulability Maximization 199</b></p> <p><b>12 Manipulability-Maximizing SMP Scheme 201</b></p> <p>12.1 Introduction 201</p> <p>12.2 Scheme Formulation 202</p> <p>12.2.1 Derivation of Manipulability Index 202</p> <p>12.2.2 Handling Physical Limits 203</p> <p>12.2.3 QP Formulation 203</p> <p>12.3 Computer Simulations and Physical Experiments 204</p> <p>12.3.1 Computer Simulations 204</p> <p>12.3.2 Physical Experiments 205</p> <p>12.4 Chapter Summary 209</p> <p><b>13 Time-Varying Coefficient AidedMMScheme 211</b></p> <p>13.1 Introduction 211</p> <p>13.2 Manipulability-Maximization with Time-Varying Coefficient 212</p> <p>13.2.1 Nonzero Initial/Final Joint-Velocity Problem 212</p> <p>13.2.2 Scheme Formulation 213</p> <p>13.2.3 94LVI Assisted QP Solution 215</p> <p>13.3 Computer Simulations and Physical Experiments 216</p> <p>13.3.1 Computer Simulations 216</p> <p>13.3.2 Physical Experiments 224</p> <p>13.4 Chapter Summary 226</p> <p><b>Part VII Encoder Feedback and Joystick Control 227</b></p> <p><b>14 QP Based Encoder Feedback Control 229</b></p> <p>14.1 Introduction 229</p> <p>14.2 Preliminaries and Scheme Formulation 231</p> <p>14.2.1 Joint Description 231</p> <p>14.2.2 OMPFC Scheme 231</p> <p>14.3 Computer Simulations 234</p> <p>14.3.1 Petal-Shaped Path-Tracking Task 234</p> <p>14.3.2 Comparative Simulations 238</p> <p>14.3.2.1 Petal-Shaped Path Tracking Using Another Group of Joint-Angle Limits 238</p> <p>14.3.2.2 Petal-Shaped Path Tracking via the Method 4 (M4) Algorithm 238</p> <p>14.3.3 Hexagonal-Path-Tracking Task 239</p> <p>14.4 Physical Experiments 240</p> <p>14.5 Chapter Summary 248</p> <p><b>15 QP Based Joystick Control 251</b></p> <p>15.1 Introduction 251</p> <p>15.2 Preliminaries and Hardware System 251</p> <p>15.2.1 Velocity-Specified Inverse Kinematics Problem 252</p> <p>15.2.2 Joystick-Controlled Manipulator Hardware System 252</p> <p>15.3 Scheme Formulation 253</p> <p>15.3.1 Cosine-Aided Position-to-VelocityMapping 253</p> <p>15.3.2 Real-Time Joystick-Controlled Motion Planning 254</p> <p>15.4 Computer Simulations and Physical Experiments 254</p> <p>15.4.1 Movement Toward Four Directions 255</p> <p>15.4.2 “MVN” LetterWriting 259</p> <p>15.5 Chapter Summary 259</p> <p>References 261</p> <p>Index 277</p>
<p> <strong>Yunong Zhang, PhD,</strong> is a professor at the School of Information Science and Technology, Sun Yat-sen University, Guangzhou, China, and an associate editor at IEEE Transactions on Neural Networks and Learning Systems. He has researched motion planning and control of redundant manipulators and recurrent neural networks for 19 years, and he holds seven authorized patents. <p><strong>Long Jin</strong> is pursuing his doctorate in Communication and Information Systems at the School of Information Science and Technology, Sun Yat-sen University, Guangzhou, China. His main research interests include robotics, neural networks, and intelligent information processing.
<p> <strong>Introduces a revolutionary, quadratic-programming based approach to solving long-standing problems in motion planning and control of redundant manipulators</strong> <p> This book describes a novel quadratic programming approach to solving redundancy resolutions problems with redundant manipulators. Known as "QP-unified motion planning and control of redundant manipulators" theory, it systematically solves difficult optimization problems of inequality-constrained motion planning and control of redundant manipulators that have plagued robotics engineers and systems designers for more than a quarter of a century. <p> An example of redundancy resolution could involve a robotic limb with six joints, or degrees of freedom (DOFs), with which to position an object. As only five numbers are required to specify the position and orientation of the object, the robot can move with one remaining DOF through practically infinite poses while performing a specified task. In this case redundancy resolution refers to the process of choosing an optimal pose from among that infinite set. A critical issue in robotic systems control, the redundancy resolution problem has been widely studied for decades, and numerous solutions have been proposed. This book investigates various approaches to motion planning and control of redundant robot manipulators and describes the most successful strategy thus far developed for resolving redundancy resolution problems. <ul> <li>Provides a fully connected, systematic, methodological, consecutive, and easy approach to solving redundancy resolution problems</li> <li>Describes a new approach to the time-varying Jacobian matrix pseudoinversion, applied to the redundant-manipulator kinematic control</li> <li>Introduces the QP-based unification of robots' redundancy resolution</li> <li>Illustrates the effectiveness of the methods presented using a large number of computer simulation results based on PUMA560, PA10, and planar robot manipulators </li> <li>Provides technical details for all schemes and solvers presented, for readers to adopt and customize them for specific industrial applications </li> </ul> <br> <p> <em>Robot Manipulator Redundancy Resolution</em> is must-reading for advanced undergraduates and graduate students of robotics, mechatronics, mechanical engineering, tracking control, neural dynamics/neural networks, numerical algorithms, computation and optimization, simulation and modelling, analog, and digital circuits. It is also a valuable working resource for practicing robotics engineers and systems designers and industrial researchers.

Diese Produkte könnten Sie auch interessieren:

Pulsed Power
Pulsed Power
von: Gennady A. Mesyats
PDF ebook
309,23 €
High-Frequency Oscillator Design for Integrated Transceivers
High-Frequency Oscillator Design for Integrated Transceivers
von: J. van der Tang, Dieter Kasperkovitz, Arthur H.M. van Roermund
PDF ebook
149,79 €
MEMS Vibratory Gyroscopes
MEMS Vibratory Gyroscopes
von: Cenk Acar, Andrei Shkel
PDF ebook
149,79 €