Chuanhui Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chuanhui Hu has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Yan Jin
University of Southern California Department of Aerospace and Mechanical Engineering Los Angeles, CA 90089
2 shared publications
Latest Publications
- 9 January 2023
- Published by Wiley in Journal of Computing and Information Science in Engineering
- Vol. 23 (4) , 1-34
Long-Range Risk-Aware Path Planning for Autonomous Ships in Complex and Dynamic Environments
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.
- 9 January 2023
- Published by Wiley in Journal of Computing and Information Science in Engineering
- Vol. 23 (4) , 1-34
Long-Range Risk-Aware Path Planning for Autonomous Ships in Complex and Dynamic Environments
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.
- 1 October 2022
- Published by Wiley in Journal of Autonomous Vehicles and Systems
- Vol. 2 (4) , 1-54
Path Planning for Autonomous Systems Design: A Focus Genetic Algorithm for Complex Environments
Path planning has been a hot research topic in robotics and is a vital functionality for autonomous systems. As the time complexity of traditional path planning algorithms grows rapidly with the complexity of the problem, evolutionary algorithms are widely applied for their near-optimal solutions. However, evolutionary algorithms can be trapped in a local optimum or converge to infeasible solutions, especially for large search spaces. As the problem scale increases, evolutionary algorithms often cannot find feasible solutions with random exploration, making it extremely challenging to solve long-range path-planning problems in environments with obstacles of various shapes and sizes. For long-range path planning of an autonomous ship, the current downsampling map approach may result in the disappearance of rivers and make the problem unsolvable. This paper introduces a novel area-based collision assessment method for genetic algorithm (GA) that can always converge to feasible solutions with various waypoints in large-scale and obstacle-filled environments. Waypoint-based crossover and mutation operators are developed to allow GA to modify the length of the solution during planning. To avoid the premature problem of GA, the mutation process is replaced by a self-improving process to let the algorithm focus the operations on any potential solutions before discarding them in the selection process. The case studies show that the proposed GA-focus algorithm converges faster than RRT* and can be applied to various large-scale and challenging problems filled with obstacles of different shapes and sizes, and find high-quality solutions.
- 1 October 2022
- Published by Wiley in Journal of Autonomous Vehicles and Systems
- Vol. 2 (4) , 1-54
Path Planning for Autonomous Systems Design: A Focus Genetic Algorithm for Complex Environments
Path planning has been a hot research topic in robotics and is a vital functionality for autonomous systems. As the time complexity of traditional path planning algorithms grows rapidly with the complexity of the problem, evolutionary algorithms are widely applied for their near-optimal solutions. However, evolutionary algorithms can be trapped in a local optimum or converge to infeasible solutions, especially for large search spaces. As the problem scale increases, evolutionary algorithms often cannot find feasible solutions with random exploration, making it extremely challenging to solve long-range path-planning problems in environments with obstacles of various shapes and sizes. For long-range path planning of an autonomous ship, the current downsampling map approach may result in the disappearance of rivers and make the problem unsolvable. This paper introduces a novel area-based collision assessment method for genetic algorithm (GA) that can always converge to feasible solutions with various waypoints in large-scale and obstacle-filled environments. Waypoint-based crossover and mutation operators are developed to allow GA to modify the length of the solution during planning. To avoid the premature problem of GA, the mutation process is replaced by a self-improving process to let the algorithm focus the operations on any potential solutions before discarding them in the selection process. The case studies show that the proposed GA-focus algorithm converges faster than RRT* and can be applied to various large-scale and challenging problems filled with obstacles of different shapes and sizes, and find high-quality solutions.