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

An Optimum Design Method of Pneu-Net Actuators for Trajectory Matching Utilizing a Bending Model and GA

Author

Listed:
  • Yilin Sun
  • Qiuju Zhang
  • Xiaoyan Chen
  • Haiwei Chen

Abstract

This study addresses the problem in designing pneu-net actuators to achieve specific target trajectories for particular applications. The finite element analysis (FEA) method is used to study the sensitivity of 9 design parameters to bending deformation of actuators, and the results of FEA demonstrate that the width of the chamber and the width of the middle layer have great influence on the bending performance. Besides, the relations between the bending angles of actuators with different width parameters and the pressure are always highly linear. Using FEA and the cubic polynomial fitting algorithm, a unified bending model of the pneu-net actuator is established with three crucial design parameters (i.e., segment length, chamber width, and middle-layer width). An optimum design method based on the bending model and genetic algorithm (GA) is put forward to automatically adjust these three crucial parameters to realise trajectory matching. The method is developed to be an effective solution for the problem in matching the target trajectory with the experimental results achieved on an actuator designed by imitating a human index finger. Furthermore, the results of the experiment also verify that the actuator can achieve stable grasping, and the proposed method has an important directive to design pneu-net actuators for their application in the fields of robotics, rescue, and detection.

Suggested Citation

  • Yilin Sun & Qiuju Zhang & Xiaoyan Chen & Haiwei Chen, 2019. "An Optimum Design Method of Pneu-Net Actuators for Trajectory Matching Utilizing a Bending Model and GA," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-12, October.
  • Handle: RePEc:hin:jnlmpe:6721897
    DOI: 10.1155/2019/6721897
    as

    Download full text from publisher

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

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

    File URL: https://libkey.io/10.1155/2019/6721897?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:6721897. 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.