Hostname: page-component-76d6cb85b7-pn7tm Total loading time: 0 Render date: 2026-07-12T19:54:28.201Z Has data issue: false hasContentIssue false

Radar-based path planning of autonomous surface vehicle with static and dynamic obstacles in a Frenet Frame

Published online by Cambridge University Press:  04 March 2024

Zhihuan Hu
Affiliation:
Department of Automation, Shanghai Jiao Tong University, Shanghai, China
Ziheng Yang
Affiliation:
Department of Automation, Shanghai Jiao Tong University, Shanghai, China
Xiaocheng Liu
Affiliation:
Department of Automation, Shanghai Jiao Tong University, Shanghai, China
Weidong Zhang*
Affiliation:
Department of Automation, Shanghai Jiao Tong University, Shanghai, China
*
Corresponding author: Weidong Zhang; Email: wdzhang@sjtu.edu.cn
Rights & Permissions [Opens in a new window]

Abstract

Navigation safety at sea is vital for each autonomous surface vehicle (ASV), which involves the problem of motion planning in dynamic environments and their robust tracking through feedback control. We present a practical path-planning method that generates smooth trajectories for a marine vehicle traveling in an unknown environment, where obstacles are detected in real time by millimetre wave (mmWave) radar. Our approach introduces a polynomial curve to describe the lateral and longitudinal trajectories in the Frenet frame, known as the ‘motion primitives’, whose combination ensures that the planning area is properly covered. In addition, we can select a feasible, optimal and collision-free trajectory from such a set of motion primitives that is generated by considering the vehicle dynamics and comfort. The capabilities of proposed algorithm are demonstrated in the experiment with static and dynamic obstacles.

Information

Type
Research Article
Copyright
Copyright © The Author(s), 2024. Published by Cambridge University Press on behalf of The Royal Institute of Navigation
Figure 0

Figure 1. Motion planning architecture for ASVs. It consists of global planning, behavioural layers and local path planning (Paden et al., 2016)

Figure 1

Figure 2. CPA and TCPA

Figure 2

Figure 3. Trajectory generation based on the reference line in the Frenet frame

Figure 3

Figure 4. Optimal trajectory generation: blue triangle indicates static obstacles, red line indicates the reference line, pink lines indicate the state lattices, and blue dotted line indicates the best planning path

Figure 4

Figure 5. Pure pursuit algorithm: ${L_T}$ indicates the look ahead distance, ${\theta _T}$ means the angle error between target and estimated course

Figure 5

Figure 6. Algorithm overview. The path-planning algorithm inputs a desired trajectory from route planner or an operator, and outputs the local replanning trajectory for the vehicle's controller (‘Cart2Frenet’ means the coordinate transform from Cartesian to Frenet frame, and ‘Frenet2Cart’ means the inversion)

Figure 6

Figure 7. Sketch of the experimental system, including the own ship (a), the remote-controlled vehicle (b) and the floating pontoons with diameter of 0⋅9 m (c)

Figure 7

Table 1. Vehicle specifications

Figure 8

Figure 8. Planar trajectory for the pure pursuit tests at different target speeds (black solid line indicates the target path). The controller with pure pursuit algorithm was run at a rate of 10 Hz

Figure 9

Figure 9. Planar trajectory in scenario I (grey line indicates reference line, the blue dot-line indicates the optimal target path, and the estimated obstacles are marked with blue circle)

Figure 10

Figure 10. Time series of estimated (red dot line) and desired (black line) state in Scenario I

Figure 11

Figure 11. Planar trajectory in the second scenario (grey line indicates reference line, the blue and red dot-lines indicate the optimal target path at time 1022⋅3 s and 1042⋅6 s, the green dots denote the trajectory of own ship and the estimated obstacles are marked with blue circle)

Figure 12

Figure 12. Time series of estimated and desired state in Scenario II

Figure 13

Figure 13. Planar trajectory in Scenario III. The GNSS-estimated and radar-estimated positions of obstacles are marked with circles. The obstacle velocity measured by radar are marked with arrows. Best path indicates the optimal path generated by real-time path planning algorithm

Figure 14

Figure 14. Time series of estimated and desired state in Scenario III

Figure 15

Figure 15. Planar trajectory in Scenario IV. The GNSS-estimated and radar-estimated positions of obstacles are marked with circles. The obstacle velocity measured by radar are marked with arrows. Best path indicates the optimal path generated by real-time path planning algorithm

Figure 16

Figure 16. Time series of estimated and desired state in Scenario IV

Figure 17

Figure 17. Planar trajectory in Scenario V. The GNSS-estimated and radar-estimated positions of obstacles are marked with circles. The obstacle velocity measured by radar are marked with arrows

Figure 18

Figure 18. Time series of estimated and desired state in Scenario V

Figure 19

Figure 19. The success rate of collision avoidance and minimum distance between own ship and obstacle in each scenario