Optimizing Line Segment Inspection with Limited-Range Drones

• URL: http://arxiv.org/abs/2605.15765v1
• Date: Fri, 15 May 2026 09:24:50 GMT
• Title: Optimizing Line Segment Inspection with Limited-Range Drones
• Abstract summary: We are given a set of line segments (e.g. tubes in a solar plant) to inspect by drones.<n>The objective is to detect broken pipes using artificial intelligence and path planning must be carried out efficiently.<n>We are able to prove that this optimization problem is strongly NP-hard even when the segments are positioned on a line.
• Score: 1.137457877869062
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Optimization problems with drones are widely studied in a variety of civilian tasks, mainly due to their ability to traverse rough terrains and to carry cameras and other sensors for surveillance tasks. The limited battery life of these aerial robots poses challenges in operational research. In this paper, we address the following optimization problem. We are given a set of line segments (e.g. tubes in a solar plant) to inspect by drones. The objective is to detect broken pipes using artificial intelligence and path planning must be carried out efficiently. On the one hand, the limited capacity of the batteries necessitates periodic visits (tours) to a fixed base station. However, it is desirable to allocate a set of tours for each drone to ensure that the segments are covered as quickly as possible, aiming to minimize the makespan, which is the maximum time spent by any drone. We are able to prove that this optimization problem is strongly NP-hard even when the segments are positioned on a line and the scenario involves only two drones. Then, approximation algorithms are proposed. Our computational experiments demonstrate that the proposed algorithm achieves near-optimal performance across diverse operational scenarios.

Related papers

• A Time-efficient Prioritised Scheduling Algorithm to Optimise Initial Flock Formation of Drones [0.3058685580689604]
  This paper presents a time-efficient prioritised scheduling algorithm that improves the initial formation process of drone flocks.<n>The method assigns each drone a priority based on its number of potential collisions and its likelihood of reaching its target position.<n> Simulation results show that the proposed algorithm successfully generates collision-free trajectories for flocks of up to 5000 drones.
  arXiv  Detail & Related papers  (2025-12-22T22:37:58Z)
• Cooperative Search and Track of Rogue Drones using Multiagent Reinforcement Learning [8.775925011558995]
  This work considers the problem of intercepting rogue drones targeting sensitive critical infrastructure facilities.<n>A holistic system that can reliably detect, track, and neutralize rogue drones is proposed.
  arXiv  Detail & Related papers  (2025-01-07T16:22:51Z)
• Robotic warehousing operations: a learn-then-optimize approach to large-scale neighborhood search [84.39855372157616]
  This paper supports robotic parts-to-picker operations in warehousing by optimizing order-workstation assignments, item-pod assignments and the schedule of order fulfillment at workstations. We solve it via large-scale neighborhood search, with a novel learn-then-optimize approach to subproblem generation. In collaboration with Amazon Robotics, we show that our model and algorithm generate much stronger solutions for practical problems than state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-08-29T20:22:22Z)
• Q-Learning based system for path planning with unmanned aerial vehicles swarms in obstacle environments [38.82157836789187]
  A Reinforcement Learning based system is proposed for solving this problem in environments with obstacles by making use of Q-Learning. The goal of these paths is to ensure complete coverage of an area with fixed obstacles for tasks, like field prospecting. The results are satisfactory, showing that the system obtains solutions in fewer movements the more UAVs there are.
  arXiv  Detail & Related papers  (2023-03-30T18:37:34Z)
• TransVisDrone: Spatio-Temporal Transformer for Vision-based Drone-to-Drone Detection in Aerial Videos [57.92385818430939]
  Drone-to-drone detection using visual feed has crucial applications, such as detecting drone collisions, detecting drone attacks, or coordinating flight with other drones. Existing methods are computationally costly, follow non-end-to-end optimization, and have complex multi-stage pipelines, making them less suitable for real-time deployment on edge devices. We propose a simple yet effective framework, itTransVisDrone, that provides an end-to-end solution with higher computational efficiency.
  arXiv  Detail & Related papers  (2022-10-16T03:05:13Z)
• Time-Optimal Planning for Quadrotor Waypoint Flight [50.016821506107455]
  Planning time-optimal trajectories at the actuation limit of a quadrotor is an open problem. We propose a solution while exploiting the full quadrotor's actuator potential. We validate our method in real-world flights in one of the world's largest motion-capture systems.
  arXiv  Detail & Related papers  (2021-08-10T09:26:43Z)
• Drone swarm patrolling with uneven coverage requirements [22.475492500154573]
  In this paper, we focus on visual coverage optimization with drone-mounted camera sensors. We model these coverage requirements with relevance maps and propose a deep reinforcement learning algorithm to guide the swarm.
  arXiv  Detail & Related papers  (2021-07-01T10:58:57Z)
• Dogfight: Detecting Drones from Drones Videos [58.158988162743825]
  This paper attempts to address the problem of drones detection from other flying drones variations. The erratic movement of the source and target drones, small size, arbitrary shape, large intensity, and occlusion make this problem quite challenging. To handle this, instead of using region-proposal based methods, we propose to use a two-stage segmentation-based approach.
  arXiv  Detail & Related papers  (2021-03-31T17:43:31Z)
• Extending the Multiple Traveling Salesman Problem for Scheduling a Fleet of Drones Performing Monitoring Missions [4.477547027158141]
  We show how to schedule the travel path of a set of drones across a graph where the nodes need to be visited multiple times at pre-defined points in time. The proposed formulation can be applied in several domains such as the monitoring of traffic flows in a transportation network, or the monitoring of remote locations to assist search and rescue missions. In a detailed evaluation, it is observed that the greedy algorithm has near-optimal performance as it is on average at 92.06% of the optimal, while it can potentially scale up to settings with hundreds of drones and locations.
  arXiv  Detail & Related papers  (2020-06-02T09:17:18Z)
• University-1652: A Multi-view Multi-source Benchmark for Drone-based Geo-localization [87.74121935246937]
  We introduce a new multi-view benchmark for drone-based geo-localization, named University-1652. University-1652 contains data from three platforms, i.e., synthetic drones, satellites and ground cameras of 1,652 university buildings around the world. Experiments show that University-1652 helps the model to learn the viewpoint-invariant features and also has good generalization ability in the real-world scenario.
  arXiv  Detail & Related papers  (2020-02-27T15:24:15Z)
• Detection and Tracking Meet Drones Challenge [131.31749447313197]
  This paper presents a review of object detection and tracking datasets and benchmarks, and discusses the challenges of collecting large-scale drone-based object detection and tracking datasets with manual annotations. We describe our VisDrone dataset, which is captured over various urban/suburban areas of 14 different cities across China from North to South. We provide a detailed analysis of the current state of the field of large-scale object detection and tracking on drones, and conclude the challenge as well as propose future directions.
  arXiv  Detail & Related papers  (2020-01-16T00:11:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.