Path Planning for Multi-AGV Systems based on Two-Stage Scheduling

Author(s):  
Wan Xu
Keyword(s):  
Author(s):  
Rui Qiu ◽  
Yongtu Liang

Abstract Currently, unmanned aerial vehicle (UAV) provides the possibility of comprehensive coverage and multi-dimensional visualization of pipeline monitoring. Encouraged by industry policy, research on UAV path planning in pipeline network inspection has emerged. The difficulties of this issue lie in strict operational requirements, variable flight missions, as well as unified optimization for UAV deployment and real-time path planning. Meanwhile, the intricate structure and large scale of the pipeline network further complicate this issue. At present, there is still room to improve the practicality and applicability of the mathematical model and solution strategy. Aiming at this problem, this paper proposes a novel two-stage optimization approach for UAV path planning in pipeline network inspection. The first stage is conventional pre-flight planning, where the requirement for optimality is higher than calculation time. Therefore, a mixed integer linear programming (MILP) model is established and solved by the commercial solver to obtain the optimal UAV number, take-off location and detailed flight path. The second stage is re-planning during the flight, taking into account frequent pipeline accidents (e.g. leaks and cracks). In this stage, the flight path must be timely rescheduled to identify specific hazardous locations. Thus, the requirement for calculation time is higher than optimality and the genetic algorithm is used for solution to satisfy the timeliness of decision-making. Finally, the proposed method is applied to the UAV inspection of a branched oil and gas transmission pipeline network with 36 nodes and the results are analyzed in detail in terms of computational performance. In the first stage, compared to manpower inspection, the total cost and time of UAV inspection is decreased by 54% and 56% respectively. In the second stage, it takes less than 1 minute to obtain a suboptimal solution, verifying the applicability and superiority of the method.


Author(s):  
A. U. Shamsudin ◽  
K. Ohno ◽  
R. Hamada ◽  
S. Kojima ◽  
N. Mizuno ◽  
...  
Keyword(s):  

2021 ◽  
Vol 132 ◽  
pp. 102983
Author(s):  
Jiaxin Gao ◽  
Weiwei Qu ◽  
Di Yang ◽  
Weidong Zhu ◽  
Yinglin Ke

2017 ◽  
Vol 47 (7) ◽  
pp. 1039-1049 ◽  
Author(s):  
Jun Li ◽  
Xianghu Meng ◽  
MengChu Zhou ◽  
Xianzhong Dai

Sensors ◽  
2020 ◽  
Vol 20 (23) ◽  
pp. 6919
Author(s):  
Tao Song ◽  
Xiang Huo ◽  
Xinkai Wu

The path planning for target searching in mobile robots is critical for many applications, such as warehouse inspection and caring and surveillance for elderly people in the family scene. To ensure visual complete coverage from the camera equipped in robots is one of the most challenging tasks. To tackle this issue, we propose a two-stage optimization model to efficiently obtain an approximate optimal solution. In this model, we first develop a method to determine the key locations for visual complete coverage of a two-dimensional grid map, which is constructed by drawing lessons from the method of corner detection in the image processing. Then, we design a planning problem for searching the shortest path that passes all key locations considering the frequency of target occurrence. The testing results show that the proposed algorithm can achieve the significantly shorter search path length and the shorter target search time than the current Rule-based Algorithm and Genetic Algorithm (GA) in various simulation cases. Furthermore, the results show that the improved optimization algorithm with the priori known frequency of occurrence of the target can further improve the searching with shorter searching time. We also set up a test in a real environment to verify the feasibility of our algorithm.


Sign in / Sign up

Export Citation Format

Share Document