Abstract

Airship-based Earth observation is of great significance in many fields such as disaster rescue and environment monitoring. To facilitate efficient observation of high-altitude airships (HAA), a high-quality observation scheduling approach is crucial. This paper considers the scheduling of the imaging sensor and proposes a hierarchical observation scheduling approach based on task clustering (SA-TC). The original observation scheduling problem of HAA is transformed into three sub-problems (i.e., task clustering, sensor scheduling, and cruise path planning) and these sub-problems are respectively solved by three stages of the proposed SA-TC. Specifically, a novel heuristic algorithm integrating an improved ant colony optimization and the backtracking strategy is proposed to address the task clustering problem. The 2-opt local search is embedded into a heuristic algorithm to solve the sensor scheduling problem and the improved ant colony optimization is also implemented to solve the cruise path planning problem. Finally, extensive simulation experiments are conducted to verify the superiority of the proposed approach. Besides, the performance of the three algorithms for solving the three sub-problems are further analyzed on instances with different scales.

Highlights

  • Earth observation techniques play a key role in environmental surveillance, intelligence reconnaissance, and disaster relief [1]

  • The contributions of this paper are summarized as follows. (i) We consider the scheduling of the imaging sensor in the observation scheduling of high-altitude airship (HAA), which is rarely considered in previous studies. (ii) To solve the studied problem, we transform the original problem into three sub-problems and propose an observation scheduling approach based on task clustering (SA-TC)

  • We propose an improved ant colony optimization (IACO) to solve the routing problems yielded in the task clustering problem and cruise path planning problem

Read more

Summary

Introduction

Earth observation techniques play a key role in environmental surveillance, intelligence reconnaissance, and disaster relief [1]. As 2-opt local search and ant colony optimization (ACO) have been proved effective in solving vehicle routing problems [19–21], we appropriately combine them with several sophisticated mechanisms into a hierarchical framework to solve the observation scheduling problem of the HAA. Sensors 2022, 22, 2050 algorithm embedding an improved ant colony optimization (IACO) and a backtracking strategy to solve the task clustering problem as well as find stagnation nodes. (ii) To solve the studied problem, we transform the original problem into three sub-problems and propose an observation scheduling approach based on task clustering (SA-TC). A heuristic algorithm that combines the 2-opt local search and NNS is proposed to solve the scheduling problem of the sensor, followed by the third stage in which IACO is implemented to solve the planning problems of the cruise path.

Related Work
Problem Description
Observation Scheduling Approach Based on Task Clustering
Framework of the Proposed Approach
Heuristic Algorithm for Task Clustering
11 Calculate the distances between o and the targets in UT
Heuristic Algorithm for Sensor Scheduling
Improved ant Colony Optimization
Simulation Experiment and Results
Simulation Setup
Comparative Study of the Proposed Approach
Performance Analysis of HATC
Performance Analysis of HASS with Different Numbers of Targets
Performance Analysis of IACO
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.