اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAstronomical observation tasks short-term scheduling using PDDS algorithm
104
0
0.0
(
0
)
تأليف
Matwey V. Kornilov
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A concept of the ground-based optical astronomical observations efficiency is considered in this paper. We believe that a telescope efficiency can be increased by properly allocating observation tasks with respect to the current environment state and probability to obtain the data with required properties under the current conditions. An online observations scheduling is assumed to be essential part for raising the efficiency. The short-term online scheduling is treated as the discrete optimisation problems which are stated using several abstraction levels. The optimisation problems are solved using a parallel depth-bounded discrepancy search (PDDS) algorithm [13]. Some aspects of the algorithm performance are discussed. The presented algorithm is a core of open-source chelyabinsk C++ library which is supposed to be used at 2.5 m telescope of Sternberg Astronomical Institude of Lomonosov Moscow State University.
قيم البحث
اقرأ أيضاً
Astronomical observation data require long-term preservation, and the rapid accumulation of observation data makes it necessary to consider the cost of long-term archive storage. In addition to low-speed disk-based online storage, optical disk or tap
e-based offline storage can be used to save costs. However, for astronomical research that requires historical data (particularly time-domain astronomy), the performance and energy consumption of data-accessing techniques cause problems because the requested data (which are organized according to observation time) may be located across multiple storage devices. In this study, we design and develop a tool referred to as AstroLayout to redistribute the observation data using spatial aggregation. The core algorithm uses graph partitioning to generate an optimized data placement according to the original observation data statistics and the target storage system. For the given observation data, AstroLayout can copy the long-term archive in the target storage system in accordance with this placement. An efficiency evaluation shows that AstroLayout can reduce the number of devices activated when responding to data-access requests in time-domain astronomy research. In addition to improving the performance of data-accessing techniques, AstroLayout can also reduce the storage systems power consumption. For enhanced adaptability, it supports storage systems of any media, including optical disks, tapes, and hard disks.
The Earth observation satellites (EOSs) scheduling is of great importance to achieve efficient observation missions. The agile EOSs (AEOS) with stronger attitude maneuvering capacity can greatly improve observation efficiency while increasing schedul
ing complexity. The multiple AEOSs, oversubscribed targets scheduling problem with multiple observations are addressed, and the potential observation missions are modeled as nodes in the complex networks. To solve the problem, an improved feedback structured heuristic is designed by defining the node and target importance factors. On the basis of a real world Chinese AEOS constellation, simulation experiments are conducted to validate the heuristic efficiency in comparison with a constructive algorithm and a structured genetic algorithm.
Targeted spectroscopic exoplanet surveys face the challenge of maximizing their planet detection rates by means of careful planning. The number of possible observation combinations for a large exoplanet survey, i.e., the sequence of observations nigh
t after night, both in total time and amount of targets, is enormous. Sophisticated scheduling tools and the improved understanding of the exoplanet population are employed to investigate an efficient and optimal way to plan the execution of observations. This is applied to the CARMENES instrument, which is an optical and infrared high-resolution spectrograph that has started a survey of about 300 M-dwarf stars in search for terrestrial exoplanets. We use evolutionary computation techniques to create an automatic scheduler that minimizes the idle periods of the telescope and that distributes the observations among all the targets using configurable criteria. We simulate the case of the CARMENES survey with a realistic sample of targets, and we estimate the efficiency of the planning tool both in terms of telescope operations and planet detection. Our scheduling simulations produce plans that use about 99$%$ of the available telescope time (including overheads) and optimally distribute the observations among the different targets. Under such conditions, and using current planet statistics, the optimized plan using this tool should allow the CARMENES survey to discover about 65$%$ of the planets with radial-velocity semi-amplitudes greater than 1$~mthinspace s^{-1}$ when considering only photon noise. The simulations using our scheduling tool show that it is possible to optimize the survey planning by minimizing idle instrument periods and fulfilling the science objectives in an efficient manner to maximize the scientific return.
Satellite observation scheduling plays a significant role in improving the efficiency of Earth observation systems. To solve the large-scale multi-satellite observation scheduling problem, this paper proposes an ensemble of meta-heuristic and exact a
lgorithm based on a divide-and-conquer framework (EHE-DCF), including a task allocation phase and a task scheduling phase. In the task allocation phase, each task is allocated to a proper orbit based on a meta-heuristic incorporated with a probabilistic selection and a tabu mechanism derived from ant colony optimization and tabu search respectively. In the task scheduling phase, we construct a task scheduling model for every single orbit, and use an exact method (i.e., branch and bound, B&B) to solve this model. The task allocation and task scheduling phases are performed iteratively to obtain a promising solution. To validate the performance of EHE-DCF, we compare it with B&B, three divide-and-conquer based meta-heuristics, and a state-of-the-art meta-heuristic. Experimental results show that EHE-DCF can obtain higher scheduling profits and complete more tasks compared with existing algorithms. EHE-DCF is especially efficient for large-scale satellite observation scheduling problems.
The Earth observation satellites (EOSs) are specially designed to collect images according to user requirements. The agile EOSs (AEOS), with stronger attitude maneuverability, greatly improve the observation capability, while increasing the complexit
y in scheduling. We address a multiple AEOSs scheduling with multiple observations for the first time}, where the objective function aims to maximize the entire observation profit over a fixed horizon. The profit attained by multiple observations for each target is nonlinear to the number of observations. We model the multiple AEOSs scheduling as a specific interval scheduling problem with each satellite orbit respected as machine. Then A column generation based framework is developed to solve this problem, in which we deal with the pricing problems with a label-setting algorithm. Extensive simulations are conducted on the basis of a Chinas AEOS constellation, and the results indicate the optimality gap is less than 3% on average, which validates the performance of the scheduling solution obtained by the proposed framework. We also compare the framework in the conventional EOS scheduling.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
