• Opto-Electronic Engineering
  • Vol. 41, Issue 12, 1 (2014)
AN Kai1、* and MA Jiaguang2
Author Affiliations
  • 1[in Chinese]
  • 2[in Chinese]
  • show less
    DOI: 10.3969/j.issn.1003-501x.2014.12.001 Cite this Article
    AN Kai, MA Jiaguang. A Shortest-path Planning Algorithm of the 3R Manipulator[J]. Opto-Electronic Engineering, 2014, 41(12): 1 Copy Citation Text show less

    Abstract

    In order to search out the shortest path of the 3R manipulator, a path length expression of manipulator’s end-effectors is given first, and then the problem is modeled as a functional extreme problem. For the purpose of simplifying the solving process, the functional extreme problem is translated into a new one with the same solution, and the solution of the latter expressed by a system of differential equations is derived by using variational method. By means of the inverse matrix expression of the upper triangular matrix, the system of differential equations is translated into a new one consisted of normal state equations. The method can avoid complex inverse matrix computing, and make the computation of the transition process simpler when compared with differential geometry method. By using Matlab simulation method, 3 joint angle functions corresponding to the shortest path of the 3R manipulator’s end-effectors is obtained.
    AN Kai, MA Jiaguang. A Shortest-path Planning Algorithm of the 3R Manipulator[J]. Opto-Electronic Engineering, 2014, 41(12): 1
    Download Citation