scholarly journals Long-Endurance Dynamic Path Planning Method of NSV Considering Wind Energy Capture

2021 ◽  
Vol 9 (8) ◽  
pp. 878
Author(s):  
Qi Jia ◽  
Yulei Liao ◽  
Peihong Xu ◽  
Zixiao Wang ◽  
Shuo Pang ◽  
...  

To meet the mission requirements of long-endurance and unmanned marine environment observation, the natural energy-driven unmanned surface vehicle (NSV) usually takes special sailing paths to increase energy capture to achieve the purpose of improving endurance. Aiming at the route planning problems of the “Wave Rider” NSV in the time-varying ocean wind field, this paper is organized as follows. Firstly, a visual modeling method of the real-time-varying ocean wind field for NSV is proposed. Then, through the wind energy capture experiment, the NSV system energy net output model is calculated, and a Dynamic Dijkstra algorithm considering wind energy capture (DW–Dijkstra) has been proposed in this paper based on a Dijkstra algorithm, of which weight function has been improved. Accordingly, the NSV long-endurance dynamic path planning method is designed. Finally, the DW–Dijkstra algorithm has been verified through a set of comparison simulations and a set of semi-physical comparison simulations. The results show that the DW–Dijkstra algorithm can plan a collision-free and high-efficiency energy capture path in the real-time-varying ocean wind field environment in the southern waters of China. Compared with the traditional A* algorithm and the Wind_A* algorithm, the proposed method can save energy by between 15.07% and 6.50%, respectively, which effectively increases the endurance of the NSV.

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 19632-19638
Author(s):  
Lisang Liu ◽  
Jinxin Yao ◽  
Dongwei He ◽  
Jian Chen ◽  
Jing Huang ◽  
...  

2011 ◽  
Vol 142 ◽  
pp. 12-15
Author(s):  
Ping Feng

The paper puts forward the dynamic path planning algorithm based on improving chaos genetic algorithm by using genetic algorithms and chaos search algorithm. In the practice of navigation, the algorithm can compute at the best path to meet the needs of the navigation in such a short period of planning time. Furthermore,this algorithm can replan a optimum path of the rest paths after the traffic condition in the sudden.


Author(s):  
Hongying Shan ◽  
Chuang Wang ◽  
Cungang Zou ◽  
Mengyao Qin

This paper is a study of the dynamic path planning problem of the pull-type multiple Automated Guided Vehicle (multi-AGV) complex system. First, based on research status at home and abroad, the conflict types, common planning algorithms, and task scheduling methods of different AGV complex systems are compared and analyzed. After comparing the different algorithms, the Dijkstra algorithm was selected as the path planning algorithm. Secondly, a mathematical model is set up for the shortest path of the total driving path, and a general algorithm for multi-AGV collision-free path planning based on a time window is proposed. After a thorough study of the shortcomings of traditional single-car planning and conflict resolution algorithms, a time window improvement algorithm for the planning path and the solution of the path conflict covariance is established. Experiments on VC++ software showed that the improved algorithm reduces the time of path planning and improves the punctual delivery rate of tasks. Finally, the algorithm is applied to material distribution in the OSIS workshop of a C enterprise company. It can be determined that the method is feasible in the actual production and has a certain application value by the improvement of the data before and after the comparison.


2021 ◽  
Vol 13 (6) ◽  
pp. 3194
Author(s):  
Fang Zong ◽  
Meng Zeng ◽  
Yang Cao ◽  
Yixuan Liu

Path planning is one of the most important aspects for ambulance driving. A local dynamic path planning method based on the potential field theory is presented in this paper. The potential field model includes two components—repulsive potential and attractive potential. Repulsive potential includes road potential, lane potential and obstacle potential. Considering the driving distinction between an ambulance and a regular vehicle, especially in congested traffic, an adaptive potential function for a lane line is constructed in association with traffic conditions. The attractive potential is constructed with target potential, lane-velocity potential and tailgating potential. The design of lane-velocity potential is to characterize the influence of velocity on other lanes so as to prevent unnecessary lane-changing behavior for the sake of time-efficiency. The results obtained from simulation demonstrate that the proposed method yields a good performance for ambulance driving in an urban area, which can provide support for designing an ambulance support system for the ambulance personnel and dispatcher.


Sign in / Sign up

Export Citation Format

Share Document