Traffic Patrolling Routing Problem with Drones in an Urban Road System
Autor: | Guoqiang Wang, Meng Fanhe, Wang Jiajie, Zhang Peng, He Luo |
---|---|
Rok vydání: | 2019 |
Předmět: |
050210 logistics & transportation
021103 operations research Computer science Heuristic (computer science) ComputingMethodologies_SIMULATIONANDMODELING Patrolling vehicle and drone coordination 05 social sciences Real-time computing joint path planning 0211 other engineering and technologies 02 engineering and technology Biochemistry Atomic and Molecular Physics and Optics Drone Article Analytical Chemistry traffic patrolling 0502 economics and business Electrical and Electronic Engineering Routing (electronic design automation) task assignment Instrumentation Arc routing Integer programming |
Zdroj: | Sensors (Basel, Switzerland) Sensors Volume 19 Issue 23 |
ISSN: | 1424-8220 |
Popis: | The remarkable development of various sensor equipment and communication technologies has stimulated many application platforms of automation. A drone is a sensing platform with strong environmental adaptability and expandability, which is widely used in aerial photography, transmission line inspection, remote sensing mapping, auxiliary communication, traffic patrolling, and other fields. A drone is an effective supplement to the current patrolling business in road traffic patrolling with complex urban buildings and road conditions and a limited ground perspective. However, the limited endurance of patrol drones can be directly solved by vehicles that cooperate with drones on patrolling missions. In this paper, we first proposed and studied the traffic patrolling routing problem with drones (TPRP-D) in an urban road system. Considering road network equations and the heterogeneity of patrolling tasks in the actual patrolling process, we modeled the problem as a double-layer arc routing problem (DL-ARP). Based on graph theory and related research work, we present the mixed integer linear programming formulations and two-stage heuristic solution approaches to solve practical-sized problems. Through analysis of numerical experiments, the solution method proposed in this paper can quickly provide an optimal path planning scheme for different test sets, which can save 9%&ndash 16% of time compared with traditional vehicle patrol. At the same time, we analyze several relevant parameters of the patrol process to determine the effect of coordinated traffic patrol. Finally, a case study was completed to verify the practicability of the algorithm. |
Databáze: | OpenAIRE |
Externí odkaz: |