• Title/Summary/Keyword: waypoint replanning

Search Result 2, Processing Time 0.014 seconds

Study on a Waypoint Tracking Algorithm for Unmanned Surface Vehicle (USV) (무인수상선을 위한 경유점 추적 제어 알고리즘에 관한 연구)

  • Son, Nam-Sun;Yoon, Hyeon-Kyu
    • Journal of Navigation and Port Research
    • /
    • v.33 no.1
    • /
    • pp.35-41
    • /
    • 2009
  • A waypoint tracking algorithm(WTA) is designed for Unmanned Surface Vehicle(USV) in which water-jet system is installed for propulsion To control the heading of USV for waypoint tracking, the steering nozzle of water-jet need, to be controlled. Firstly, target heading is calculated by using the position information of waypoints input from the land control center. Secondly, the command for the steering nozzle of water-jet is calculated in real time by using the heading and the rate-of-turn( ROT) from magnetic compass, In this study, in order to consider the drift angle due to external disturbance such as wind and wave, the course of ground( COG) can be used instead of heading at higher speed than a certain value, To test the performance of newly-designed WTA, the tests were carried out in actual sea area near Gwang-an bridge of Busan. In this paper, the sea trial test results from WTA are analyzed and compared with those from manual control and those from commercial controller.

Boundary-RRT* Algorithm for Drone Collision Avoidance and Interleaved Path Re-planning

  • Park, Je-Kwan;Chung, Tai-Myoung
    • Journal of Information Processing Systems
    • /
    • v.16 no.6
    • /
    • pp.1324-1342
    • /
    • 2020
  • Various modified algorithms of rapidly-exploring random tree (RRT) have been previously proposed. However, compared to the RRT algorithm for collision avoidance with global and static obstacles, it is not easy to find a collision avoidance and local path re-planning algorithm for dynamic obstacles based on the RRT algorithm. In this study, we propose boundary-RRT*, a novel-algorithm that can be applied to aerial vehicles for collision avoidance and path re-planning in a three-dimensional environment. The algorithm not only bounds the configuration space, but it also includes an implicit bias for the bounded configuration space. Therefore, it can create a path with a natural curvature without defining a bias function. Furthermore, the exploring space is reduced to a half-torus by combining it with simple right-of-way rules. When defining the distance as a cost, the proposed algorithm through numerical analysis shows that the standard deviation (σ) approaches 0 as the number of samples per unit time increases and the length of epsilon ε (maximum length of an edge in the tree) decreases. This means that a stable waypoint list can be generated using the proposed algorithm. Therefore, by increasing real-time performance through simple calculation and the boundary of the configuration space, the algorithm proved to be suitable for collision avoidance of aerial vehicles and replanning of local paths.