Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Leveraging sUAS for Infrastructure Network Exploration and Failure Isolation

Leveraging sUAS for Infrastructure Network Exploration and Failure Isolation

Thumbnail Image
Download
Name

10846_2018_838_ReferencePDF.pdf

Size

10.1 MB

Format

Adobe PDF

Checksum (MD5)

ff8646af1f7e3d0d730db879b97a041b

Download all files submitted through automated deposit
art_7446613851466662894.zip (5.51 MB)
Author(s)
Lee, Andrew C
•
Dahan, Mathieu
•
Weinert, Andrew J
•
Amin, Saurabh
Date Issued
April 26, 2018
Publisher
Springer Netherlands
Version
Author's final manuscript
Abstract
Abstract 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.
MIT Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Massachusetts Institute of Technology. Center for Computational Engineering
Lincoln Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/131764
DOI of Published Version
https://doi.org/10.1007/s10846-018-0838-0
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.