Leveraging sUAS for Infrastructure Network Exploration and Failure Isolation

• Published in: Journal of intelligent & robotic systems Vol. 93; no. 1-2; pp. 385 - 413
• Main Authors: Lee, Andrew C., Dahan, Mathieu, Weinert, Andrew J., Amin, Saurabh
• Format: Journal Article
• Language: English
• Published: Dordrecht Springer Netherlands 01.02.2019; Springer; Springer Nature B.V
• Subjects: Airspace; Artificial Intelligence; Control; Electrical Engineering; Engineering; Exploration; Failure; Infrastructure (Economics); Inspection; Localization; Mechanical Engineering; Mechatronics; Monitoring; Network topologies; Position (location); Repair; Robotics; Route planning; Sensors; Solvers; Unmanned aerial vehicles; Utilities; Vehicle routing; Network inspection and repair operations; Failure identification; Localization; Vehicle routing problems; Unmanned aerial systems
• DOI: 10.1007/s10846-018-0838-0
• ISSN: 0921-0296

Large-scale infrastructures are prone to simultaneous faults when struck by a natural or man-made event. The current operating procedure followed by many utilities needs improvement, both in terms of monitoring performance and time to repair. Motivated by the recent technological progress on small Unmanned Aerial Systems (sUAS), we propose a practical framework to integrate the monitoring capabilities of sUAS into standard utility repair operations. A key aspect of our framework is the use of monitoring locations for sUAS-based inspection of failures within a certain spatial zone (called a localization set). This set is defined based on the alerts from fixed sensors or customer calls. The positioning of monitoring locations is subject to several factors such as sUAS platform, network topology, and airspace restrictions. We formulate the problem of minimizing the maximum time to respond to all failures by routing repair vehicles to various localization sets and exploring these sets using sUAS. The formulation admits a natural decomposition into two sub-problems: the sUAS Network Exploration Problem (SNEP); and the Repair Vehicle Routing Problem (RVRP). Standard solvers can be used to solve the RVRP in a scalable manner; however, solving the SNEP for each localization set can be computationally challenging. To address this limitation, we propose a set cover based heuristic to approximately solve the SNEP. We implement the overall framework on a benchmark network.