Autonomy increases the ability of earth observing satellites by allowing them to acquire more images. This is enabled by an efficient planning and scheduling algorithm which is able to make quick decisions onboard. Due to the NP-hardness of the agile earth observing satellite (AEOS) onboard scheduling problem, heuristic and metaheuristic algorithms seem to be appropriate to cope with increasingly enlarged problems. Also, the algorithms need to be intelligent enough to deal with dynamically changing situations onboard. Such algorithms are missing in the literature and we make the first attempt to propose a learning-based approach (LBA) for the AEOS onboard scheduling problem. LBA adopts an offline trainingonboard scheduling paradigm where it trains a classifier using massive historical data offline on the ground and embeds this classifier to an onboard greedy construction algorithm. At each construction step, the greedy algorithm uses the classifier to test the potential of a task and arranges its observation time if it is accepted by the classifier. Extensive experimental results show that the proposed LBA is highly suitable for onboard use in terms of both solution quality and response time. In particular, LBA easily dominates state-of-the-art algorithms by producing very high quality solutions for large-size problems (with over 100 tasks) in seconds. INDEX TERMS Agile autonomous satellite, onboard scheduling, learning algorithm, feature selection.
Earth observation satellites (EOSs) are taking a large number of pictures with increasing resolution which produce massive image data. Satellite data transmission becomes the bottleneck part in the process of EOS resource management. In this paper, we study the earth observation satellite integrated scheduling problem (EOSIS) where the imaging activities and download activities are considered integratively. We propose an integer linear programming model to formulate the problem. Due to the NP-hardness of the problem, we propose an efficient local search heuristic (ELSH) to solve problems of large size. ELSH uses a dedicated local search method to guarantee algorithm performance and efficient constraint handling mechanisms to guarantee algorithm efficiency. Numerical experimental results show that the algorithm demonstrates excellent performance on a set of benchmark instances. The ELSH achieves optimal results for all small-size instances (with 50 targets, two satellites, and three ground stations), and is very robust for large instances with up to 2000 targets. Moreover, the proposed ELSH easily dominates the state-of-the-art algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.