Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Comparative Study of Rapidly-exploring Random Tree Algorithms Applied to Ship Trajectory Planning and Behavior Generation (2403.01194v2)

Published 2 Mar 2024 in cs.RO, cs.SY, and eess.SY

Abstract: Rapidly Exploring Random Tree (RRT) algorithms, notably used for nonholonomic vehicle navigation in complex environments, are often not thoroughly evaluated for their specific challenges. This paper presents a first such comparison study of the variants Potential-Quick RRT* (PQ-RRT*), Informed RRT* (IRRT*), RRT*, and RRT, in maritime single-query nonholonomic motion planning. Additionally, the practicalities of using these algorithms in maritime environments are discussed and outlined. We also contend that these algorithms are beneficial not only for trajectory planning in Collision Avoidance Systems (CAS) but also for CAS verification when used as vessel behavior generators. Optimal RRT variants tend to produce more distance-optimal paths but require more computational time due to complex tree wiring and nearest neighbor searches. Our findings, supported by Welch`s t-test at a significance level of Alpha = 0.05, indicate that PQ-RRT* slightly outperform IRRT* and RRT* in achieving shorter trajectory length but at the expense of higher tuning complexity and longer run-times. Based on the results, we argue that these RRT algorithms are better suited for smaller-scale problems or environments with low obstacle congestion ratio. This is attributed to the curse of dimensionality, and trade-off with available memory and computational resources.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (50)
  1. The r*-tree: An efficient and robust access method for points and rectangles, in: Proceedings of the 1990 ACM SIGMOD international conference on Management of data, pp. 322–331.
  2. Multidimensional binary search trees used for associative searching. Communications of the ACM 18, 509–517.
  3. Electronic navigational charts for visualization, simulation, and autonomous ship control. IEEE Access 10, 3716–3737. doi:10.1109/ACCESS.2021.3139767.
  4. Autonomous machinery management for supervisory risk control using particle swarm optimization. J. Marine Science and Engineering 11.
  5. Automatic traffic scenarios generation for autonomous ships collision avoidance system testing. Ocean Engineering 254, 111309.
  6. Guidance laws for planar motion control, in: Proc. 47th IEEE Conf. Decision and Control, pp. 570–577. doi:10.1109/CDC.2008.4739465.
  7. Decision making and strategies in an interaction situation: Collision avoidance at sea. Transportation Research Part F: Traffic Psychology and Behaviour 11, 259–269.
  8. COLREG-RRT: An RRT-based COLREGS-compliant motion planner for surface vehicle navigation. IEEE Robotics and Automation Letters 3, 2024–2031. doi:10.1109/LRA.2018.2801881.
  9. Rl-rrt: Kinodynamic motion planning via learning reachability estimators from rl policies. IEEE Robotics and Automation Letters 4, 4298–4305. doi:10.1109/LRA.2019.2931199.
  10. Sensitive state-space exploration, in: 2008 47th IEEE Conference on Decision and Control, pp. 4049–4054. doi:10.1109/CDC.2008.4739371.
  11. Sampling-based collision and grounding avoidance for marine crafts. Ocean Engineering 261, 112078.
  12. Colregs-informed rrt* for collision avoidance of marine crafts, in: 2021 IEEE International Conference on Robotics and Automation (ICRA), IEEE. pp. 8083–8089.
  13. Informed rrt: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic, in: 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, IEEE. pp. 2997–3004.
  14. R-trees: A dynamic index structure for spatial searching, in: Proceedings of the 1984 ACM SIGMOD international conference on Management of data, pp. 47–57.
  15. A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics 4, 100–107.
  16. Ship collision avoidance methods: State-of-the-art. Safety Science 121, 451–473.
  17. Convention on the International Regulations for Preventing Collisions at SEA, 1972.
  18. Quick-rrt*: Triangular inequality-based implementation of rrt* with improved initial solution and convergence rate. Expert Systems with Applications 123, 82–90.
  19. Optimal kinodynamic motion planning using incremental sampling-based methods, in: 49th IEEE Conference on Decision and Control (CDC), pp. 7681–7687. doi:10.1109/CDC.2010.5717430.
  20. Anytime motion planning using the rrt*, in: 2011 IEEE International Conference on Robotics and Automation, pp. 1478–1483. doi:10.1109/ICRA.2011.5980479.
  21. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE transactions on Robotics and Automation 12, 566–580.
  22. Rrt*-connect: Faster, asymptotically optimal motion planning, in: 2015 IEEE international conference on robotics and biomimetics (ROBIO), IEEE. pp. 1670–1677.
  23. Computationally efficient safety falsification of adaptive cruise control systems, in: 2019 IEEE Intelligent Transportation Systems Conference (ITSC), pp. 2879–2886. doi:10.1109/ITSC.2019.8917287.
  24. Safe maritime autonomous navigation with COLREGS, using velocity obstacles. IEEE Journal of Oceanic Engineering 39, 110–119. doi:10.1109/JOE.2013.2254214.
  25. Balancing global exploration and local-connectivity exploitation with rapidly-exploring random disjointed-trees, in: 2019 International Conference on Robotics and Automation (ICRA), pp. 5537–5543. doi:10.1109/ICRA.2019.8793618.
  26. Rapidly-exploring random trees: A new tool for path planning .
  27. Pq-rrt*: An improved path planning algorithm for mobile robots. Expert systems with applications 152, 113425.
  28. Incrementally reducing dispersion by increasing voronoi bias in rrts, in: IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA ’04. 2004, pp. 3251–3257 Vol.4. doi:10.1109/ROBOT.2004.1308755.
  29. Automatic testing of maritime collision avoidance algorithms. Master’s thesis. NTNU.
  30. Rrt*-smart: A rapid convergence implementation of rrt*. International Journal of Advanced Robotic Systems 10, 299. doi:10.5772/56718.
  31. A comparison of rrt, rrt* and rrt*-smart path planning algorithms. International Journal of Computer Science and Network Security (IJCSNS) 16, 20.
  32. Optimal path planning using rrt* based approaches: a survey and future directions. International Journal of Advanced Computer Science and Applications 7.
  33. Towards simulation-based verification of autonomous navigation systems. Safety Science 129, 104799.
  34. Evolution of safety in marine systems: From system-theoretic process analysis to automated test scenario generation. Journal of Physics: Conference Series 2311, 012016. doi:10.1088/1742-6596/2311/1/012016.
  35. Lqr-rrt*: Optimal sampling-based motion planning with automatically derived extension heuristics, in: 2012 IEEE International Conference on Robotics and Automation, IEEE. pp. 2537–2542.
  36. Scenario-based testing of a ship collision avoidance system, in: 2020 46th Euromicro Conference on Software Engineering and Advanced Applications (SEAA), pp. 545–552. doi:10.1109/SEAA51224.2020.00090.
  37. Potential functions based sampling heuristic for optimal path planning. Autonomous Robots 40, 1079–1093.
  38. An iterative procedure for the polygonal approximation of plane curves. Computer Graphics and Image Processing 1, 244–256.
  39. Simulation framework and software environment for evaluating automatic ship collision avoidance algorithms*, in: 2023 IEEE Conference on Control Technology and Applications (CCTA), pp. 186–193. doi:10.1109/CCTA54093.2023.10252863.
  40. Ship collision avoidance and anti grounding using parallelized cost evaluation in probabilistic scenario-based model predictive control. IEEE Access 10, 111650–111664. doi:10.1109/ACCESS.2022.3215654.
  41. Obstacle intention awareness in automatic collision avoidance: Full scale experiments in confined waters. Field Robotics In press.
  42. Automatic simulation-based testing of autonomous ships using gaussian processes and temporal logic. Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability 0. doi:10.1177/1748006X211069277.
  43. Rapidly-exploring random trees for testing automated vehicles, in: 2019 IEEE Intelligent Transportation Systems Conference (ITSC), pp. 661–666. doi:10.1109/ITSC.2019.8917375.
  44. Path planning and collision avoidance for autonomous surface vehicles ii: a comparative study of algorithms. Journal of Marine Science and Technology doi:10.1007/s00773-020-00790-x.
  45. Systematic literature review of sampling process in rapidly-exploring random trees. IEEE Access 7, 50933–50953.
  46. Neural rrt*: Learning-based optimal path planning. IEEE Transactions on Automation Science and Engineering 17, 1748–1758. doi:10.1109/TASE.2020.2976560.
  47. Spline-based rrt path planner for non-holonomic robots. Journal of Intelligent & Robotic Systems 73, 763–782.
  48. Lazy steering rrt*: An optimal constrained kinodynamic neural network based planner with no in-exploration steering, in: 2019 19th International Conference on Advanced Robotics (ICAR), pp. 400–407. doi:10.1109/ICAR46387.2019.8981551.
  49. A generalized continuous collision detection framework of polynomial trajectory for mobile robots in cluttered environments. IEEE Robotics and Automation Letters 7, 9810–9817. doi:10.1109/LRA.2022.3191934.
  50. Randomly testing an autonomous collision avoidance system with real-world ship encounter scenario from ais data. Journal of Marine Science and Engineering 10. doi:10.3390/jmse10111588.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now