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

Analysis and Evaluation of CDPR Cable Sagging Based on ANFIS

Author

Listed:
  • Tuong Phuoc Tho
  • Nguyen Truong Thinh

Abstract

The cable sagging problem of cable-driven parallel robots (CDPRs) is very complicated, because several models for calculating cable sag based on the well-known catenary equation have been studied, but time and computational efficiency are a problem to be solved. There is still no simple mathematical model to calculate cable sag by considering all relevant conditions due to the complexity and nonlinearity of the cable sagging model, which involves many dominant variables and their influence on the position accuracy of CDPRs. In this study, we proposed an ANFIS (adaptive neuro-fuzzy inference system) architecture to estimate cable sag for large-sized CDPRs. The ANFIS model can be used to solve nonlinear functions and detect nonlinear factors online in the control system; this characteristic is consistent with the nonlinear model of cable sag. The trained data for ANFIS models were taken from calculation results by Trust-Region-Dogleg algorithm based on two cable tension calculation algorithms as Dual Simplex Algorithm and Force Distribution in Closed Form. Cable sagging data obtained from ANFIS and Trust-Region-Dogleg algorithm are compared and evaluated by statistical factors of evaluations consisting of root-mean-square error, correlation coefficients, and scatter index. The analytical results show that the ANFIS gave computed results with small errors and can be applied to predict cable sagging for any CDPR configuration, with the advantage of fast calculation time and high precision. The results of these models are also applied on a CDPR that contains two redundant actuators.

Suggested Citation

  • Tuong Phuoc Tho & Nguyen Truong Thinh, 2021. "Analysis and Evaluation of CDPR Cable Sagging Based on ANFIS," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-20, November.
  • Handle: RePEc:hin:jnlmpe:4776317
    DOI: 10.1155/2021/4776317
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/4776317.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2021/4776317.xml
    Download Restriction: no

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