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

Optimization of Skipping Rope Training Method Based on Chaotic Logistics

Author

Listed:
  • Han Li
  • Yuxia Wang
  • Long Wang

Abstract

Skipping training belongs to a competitive event, which can not only lose weight but also improve the physical quality of trainers. At present, there are some problems in skipping training, such as unreasonable plan and unsatisfactory actual training effect. The original rough set method cannot solve the analysis of multivariate data in skipping training, and the ability to evaluate the training effect of skipping is poor. Aiming at the problems existing in the training of skipping rope, this paper puts forward a skipping rope training method based on a chaotic logistics algorithm, aiming at improving the training effect of skipping rope. First, the chaos theory is used to classify the training data. Different data classifications correspond to different training results, which eliminates irrelevant information in the training scheme and reduces the amount of single data analysis. Finally, the data after classification are optimized in a single stage, and the optimal results of different training items are obtained and summarized. After the MATLAB test, the chaotic logistics algorithm is superior to the rough set method in accuracy and convergence speed and meets the actual training needs. Therefore, the chaotic logic analysis method proposed in this paper is suitable for the evaluation of skipping training.

Suggested Citation

  • Han Li & Yuxia Wang & Long Wang, 2022. "Optimization of Skipping Rope Training Method Based on Chaotic Logistics," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-10, August.
  • Handle: RePEc:hin:jnlmpe:3986247
    DOI: 10.1155/2022/3986247
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/3986247.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/3986247.xml
    Download Restriction: no

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