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

Research on UUV Obstacle Avoiding Method Based on Recurrent Neural Networks

Author

Listed:
  • Changjian Lin
  • Hongjian Wang
  • Jianya Yuan
  • Dan Yu
  • Chengfeng Li

Abstract

In this paper, we present an online obstacle avoidance planning method for unmanned underwater vehicle (UUV) based on clockwork recurrent neural network (CW-RNN) and long short-term memory (LSTM), respectively. In essence, UUV online obstacle avoidance planning is a spatiotemporal sequence planning problem with the spatiotemporal data sequence of sensors as input and control instruction to motion controller of UUV as output. And recurrent neural networks (RNNs) have proven to give state-of-the-art performance on many sequence labeling and sequence prediction tasks. In order to train the networks, a UUV obstacle avoidance dataset is generated and an offline training and testing is adopted in this paper. Finally, the proposed two types of RNN based online obstacle avoidance planners are compared in path cost, obstacle avoidance planning success rate, training time, time-consumption, learning, and generalization, respectively. And the good performance of the proposed methods is demonstrated with a series of simulation experiments in different environments.

Suggested Citation

  • Changjian Lin & Hongjian Wang & Jianya Yuan & Dan Yu & Chengfeng Li, 2019. "Research on UUV Obstacle Avoiding Method Based on Recurrent Neural Networks," Complexity, Hindawi, vol. 2019, pages 1-16, January.
  • Handle: RePEc:hin:complx:6320186
    DOI: 10.1155/2019/6320186
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2019/6320186.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2019/6320186.xml
    Download Restriction: no

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