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

Chaotic Path Planner of Autonomous Mobile Robots Based on the Standard Map for Surveillance Missions

Author

Listed:
  • Caihong Li
  • Yong Song
  • Fengying Wang
  • Zhenying Liang
  • Baoyan Zhu

Abstract

This paper proposes a fusion iterations strategy based on the Standard map to generate a chaotic path planner of the mobile robot for surveillance missions. The distances of the chaotic trajectories between the adjacent iteration points which are produced by the Standard map are too large for the robot to track. So a fusion iterations strategy combined with the large region iterations and the small grids region iterations is designed to resolve the problem. The small region iterations perform the iterations of the Standard map in the divided small grids, respectively. It can reduce the adjacent distances by dividing the whole surveillance workspace into small grids. The large region iterations combine all the small grids region iterations into a whole, switch automatically among the small grids, and maintain the chaotic characteristics of the robot to guarantee the surveillance missions. Compared to simply using the Standard map in the whole workspace, the proposed strategy can decrease the adjacent distances according to the divided size of the small grids and is convenient for the robot to track.

Suggested Citation

  • Caihong Li & Yong Song & Fengying Wang & Zhenying Liang & Baoyan Zhu, 2015. "Chaotic Path Planner of Autonomous Mobile Robots Based on the Standard Map for Surveillance Missions," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-11, August.
  • Handle: RePEc:hin:jnlmpe:263964
    DOI: 10.1155/2015/263964
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/263964.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2015/263964.xml
    Download Restriction: no

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lazaros Moysis & Karthikeyan Rajagopal & Aleksandra V. Tutueva & Christos Volos & Beteley Teka & Denis N. Butusov, 2021. "Chaotic Path Planning for 3D Area Coverage Using a Pseudo-Random Bit Generator from a 1D Chaotic Map," Mathematics, MDPI, vol. 9(15), pages 1-16, August.

    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:263964. 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.