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

Synergistic Design of the Bipedal Lower-Limb through Multiobjective Differential Evolution Algorithm

Author

Listed:
  • Jesús S. Pantoja-García
  • Miguel G. Villarreal-Cervantes
  • Consuelo V. García-Mendoza
  • Víctor M. Silva-García

Abstract

The complexity in the design of bipedal robots has motivated the use of simple mechanisms to accomplish the desired locomotion task with a minimum control effort. Nevertheless, a diverse set of conflictive design criteria must be met to develop the bipedal gait. In this paper, the synergy in the eight-bar mechanism design criteria to satisfy the bipedal lower-limb behavior is promoted by proposing a Pareto-based Nonlinear Mixed Discrete-Continuous Constrained Multiobjective Optimization Problem and by improving the search in the optimizer through the inclusion of the Multiselection Strategy into the multiobjective differential evolution algorithm, where the conflictive design objectives are the continuous path generation based on an approximation error to track twenty precision points of the bipedal gait and also the force transmission exerted when the foot reaches the ground. The manufacture of a prototype with a specific design trade-off experimentally validates the obtained synergistic design with the proposed design approach. In addition, the empirical analysis in simulation through a statistical validation indicates that the Multiselection Strategy explores and exploits the design solutions promoting the diversity, convergence, and capacity features of the obtained Pareto front with respect to other four multiobjective optimizers and consequently improves the reconfigurability in the design such that more alternatives result to the designer decision making.

Suggested Citation

  • Jesús S. Pantoja-García & Miguel G. Villarreal-Cervantes & Consuelo V. García-Mendoza & Víctor M. Silva-García, 2019. "Synergistic Design of the Bipedal Lower-Limb through Multiobjective Differential Evolution Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-17, May.
  • Handle: RePEc:hin:jnlmpe:2301714
    DOI: 10.1155/2019/2301714
    as

    Download full text from publisher

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

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

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