IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/8385904.html
   My bibliography  Save this article

A Method for Obtaining Optimal Path in Angle and Avoiding Collision for Robotic Belt Grinding

Author

Listed:
  • Tie Zhang
  • Xiaohong Liang
  • Ye Yu
  • Bin Zhang

Abstract

The angular variation of the joints may be large, and collision between workpieces and tools may occur in robotic grinding. Therefore, this paper proposes an optimal robotic grinding path search algorithm based on the recursive method. The algorithm is optimized by changing the position of the tool coordinate system on the belt wheel; thus, the pose of the robot during grinding is adjusted. First, the position adjustment formula of the tool coordinate system is proposed, and a coordinate plane is established to describe the grinding path of the robot based on the position adjustment formula. Second, the ordinate value of this coordinate plane is dispersed to obtain the search field of the optimal robotic grinding path search algorithm. Third, an optimal robotic grinding path search algorithm is proposed based on the recursive method and single-step search process. Finally, the algorithm is implemented on the V-REP platform. Robotic grinding paths for V-shaped workpieces and S-shaped workpieces are generated using this algorithm, and a grinding experiment is performed. The experimental results show that the robotic grinding paths generated by this algorithm can smoothly complete grinding operations and feature a smaller angular variation of the joint than other methods and no collision.

Suggested Citation

  • Tie Zhang & Xiaohong Liang & Ye Yu & Bin Zhang, 2019. "A Method for Obtaining Optimal Path in Angle and Avoiding Collision for Robotic Belt Grinding," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-19, November.
  • Handle: RePEc:hin:jnlmpe:8385904
    DOI: 10.1155/2019/8385904
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/8385904.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2019/8385904.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2019/8385904?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:8385904. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.