YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASME
    • Journal of Computing and Information Science in Engineering
    • View Item
    •   YE&T Library
    • ASME
    • Journal of Computing and Information Science in Engineering
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    Long-Range Risk-Aware Path Planning for Autonomous Ships in Complex and Dynamic Environments

    Source: Journal of Computing and Information Science in Engineering:;2023:;volume( 023 ):;issue: 004::page 41007-1
    Author:
    Hu, Chuanhui
    ,
    Jin, Yan
    DOI: 10.1115/1.4056064
    Publisher: The American Society of Mechanical Engineers (ASME)
    Abstract: Path planning and collision avoidance are common problems for researchers in vehicle and robotics engineering design. In the case of autonomous ships, the navigation is guided by the regulations for preventing collisions at sea (COLREGs). However, COLREGs do not provide specific guidance for collision avoidance, especially for multi-ship encounters, which is a challenging task even for humans. In short-range path planning and collision avoidance problems, the motion of target ships is often considered as moving at a constant velocity and direction, which cannot be assumed in long-range planning and complex environments. The research challenge here is how to factor in the uncertainty of the motion of the target ships when making long-range path plans. In this paper, we introduce a long-range path planning algorithm for autonomous ships navigating in complex and dynamic environments to reduce the risk of encountering other ships during future motion. Based on the information on the position, speed over ground, and course over ground of other ships, our algorithm can estimate their intentions and future motions based on the probabilistic roadmap algorithm and use a risk-aware A* algorithm to find the optimal path that has low accumulated risk of encountering other ships. A case study is carried out on real automatic identification systems (AIS) datasets. The result shows that our algorithm can help reduce multi-ship encounters in long-term path planning.
    • Download: (1.181Mb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Price: 5000 Rial
    • Statistics

      Long-Range Risk-Aware Path Planning for Autonomous Ships in Complex and Dynamic Environments

    URI
    http://yetl.yabesh.ir/yetl1/handle/yetl/4294475
    Collections
    • Journal of Computing and Information Science in Engineering

    Show full item record

    contributor authorHu, Chuanhui
    contributor authorJin, Yan
    date accessioned2023-11-29T18:56:09Z
    date available2023-11-29T18:56:09Z
    date copyright1/9/2023 12:00:00 AM
    date issued1/9/2023 12:00:00 AM
    date issued2023-01-09
    identifier issn1530-9827
    identifier otherjcise_23_4_041007.pdf
    identifier urihttp://yetl.yabesh.ir/yetl1/handle/yetl/4294475
    description abstractPath planning and collision avoidance are common problems for researchers in vehicle and robotics engineering design. In the case of autonomous ships, the navigation is guided by the regulations for preventing collisions at sea (COLREGs). However, COLREGs do not provide specific guidance for collision avoidance, especially for multi-ship encounters, which is a challenging task even for humans. In short-range path planning and collision avoidance problems, the motion of target ships is often considered as moving at a constant velocity and direction, which cannot be assumed in long-range planning and complex environments. The research challenge here is how to factor in the uncertainty of the motion of the target ships when making long-range path plans. In this paper, we introduce a long-range path planning algorithm for autonomous ships navigating in complex and dynamic environments to reduce the risk of encountering other ships during future motion. Based on the information on the position, speed over ground, and course over ground of other ships, our algorithm can estimate their intentions and future motions based on the probabilistic roadmap algorithm and use a risk-aware A* algorithm to find the optimal path that has low accumulated risk of encountering other ships. A case study is carried out on real automatic identification systems (AIS) datasets. The result shows that our algorithm can help reduce multi-ship encounters in long-term path planning.
    publisherThe American Society of Mechanical Engineers (ASME)
    titleLong-Range Risk-Aware Path Planning for Autonomous Ships in Complex and Dynamic Environments
    typeJournal Paper
    journal volume23
    journal issue4
    journal titleJournal of Computing and Information Science in Engineering
    identifier doi10.1115/1.4056064
    journal fristpage41007-1
    journal lastpage41007-11
    page11
    treeJournal of Computing and Information Science in Engineering:;2023:;volume( 023 ):;issue: 004
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian