• DocumentCode
    596378
  • Title

    A continuous task transition algorithm for operational space control framework

  • Author

    Hyejin Han ; Jaemin Lee ; Jaeheung Park

  • Author_Institution
    Grad. Sch. of Sci. & Technol., Seoul Nat. Univ., Seoul, South Korea
  • fYear
    2012
  • fDate
    26-28 Nov. 2012
  • Firstpage
    148
  • Lastpage
    152
  • Abstract
    As more sophisticated robots are being developed, robots are increasingly expected to execute many types of task sets sequentially or simultaneously. When these multiple task sets are executed, the controllers of the robots should be able to deal dynamically with task changes. Especially during the task transitions, there will be discontinuous behaviors of robots in the absence of careful consideration of control. In this paper, a task transition approach is proposed to provide continuous task transitions and to ensure stable behavior of robots within the operational space control framework. In the proposed approach, the control law is not modified but the control command is composed using intermediate desired values. In this paper, a continuous task transition algorithm is applied for singularity avoidance and for joint limit avoidance purposes during the control of a 6-DOF manipulator to demonstrate its performance.
  • Keywords
    continuous systems; manipulators; stability; 6-DOF manipulator control; continuous task transition algorithm; control command composition; control law; joint limit avoidance purpose; operational space control framework; robot discontinuous behavior; robot stable behavior; singularity avoidance; sophisticated robot; task execution; Aerospace electronics; Equations; Jacobian matrices; Joints; Manipulators; Torque; Joint Limit Avoidance; Operational Space Control; Singularity Avoidance; Task Transition;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Ubiquitous Robots and Ambient Intelligence (URAI), 2012 9th International Conference on
  • Conference_Location
    Daejeon
  • Print_ISBN
    978-1-4673-3111-1
  • Electronic_ISBN
    978-1-4673-3110-4
  • Type

    conf

  • DOI
    10.1109/URAI.2012.6462955
  • Filename
    6462955