An effective Genetic Programming Hyper-Heuristic for Uncertain Agile Satellite Scheduling

• URL: http://arxiv.org/abs/2602.15070v1
• Date: Sun, 15 Feb 2026 02:09:57 GMT
• Title: An effective Genetic Programming Hyper-Heuristic for Uncertain Agile Satellite Scheduling
• Abstract summary: An effective Genetic Programming Hyper-Heuristic is designed to automate the generation of scheduling policies.<n>The evolved scheduling policies can be utilized to adjust plans in real time and perform exceptionally well.
• Score: 7.511388506308957
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper investigates a novel problem, namely the Uncertain Agile Earth Observation Satellite Scheduling Problem (UAEOSSP). Unlike the static AEOSSP, it takes into account a range of uncertain factors (e.g., task profit, resource consumption, and task visibility) in order to reflect the reality that the actual information is inherently unknown beforehand. An effective Genetic Programming Hyper-Heuristic (GPHH) is designed to automate the generation of scheduling policies. The evolved scheduling policies can be utilized to adjust plans in real time and perform exceptionally well. Experimental results demonstrate that evolved scheduling policies significantly outperform both well-designed Look-Ahead Heuristics (LAHs) and Manually Designed Heuristics (MDHs). Specifically, the policies generated by GPHH achieve an average improvement of 5.03% compared to LAHs and 8.14% compared to MDHs.

Related papers

• Reinforcement Learning-Guided Evolutionary Policy Optimization for Preference-Adjustable Heterogeneous Agile Earth Observation Satellite Scheduling [50.176885352114674]
  Heterogeneous agile Earth observation satellite (AEOS) scheduling requires task selection, satellite assignment, and observation sequencing.<n>This paper proposes an evolutionary policy optimization framework for heterogeneous AEOS scheduling with preference-adjustable weighted objectives.
  arXiv  Detail & Related papers  (2026-08-25T12:16:28Z)
• Efficient Policy Learning with Hybrid Evaluation-Based Genetic Programming for Uncertain Agile Earth Observation Satellite Scheduling [12.409081996599665]
  The Agile Earth Observation Satellite Scheduling Problem (UAEOSSP) is a novel optimization problem.<n>It incorporates uncertainties in profit, resource consumption, and visibility, which may render pre-planned schedules suboptimal or even infeasible.<n>This paper proposes a Hybrid Evaluation-based Genetic Programming (HE-GP) for effectively solving UAEOSSP.
  arXiv  Detail & Related papers  (2026-03-09T14:43:36Z)
• Beyond the Majority: Long-tail Imitation Learning for Robotic Manipulation [121.31598641762251]
  Long-tail distribution of training demonstrations hinders policy learning.<n>Approaching-Phase Augmentation (APA) transfers knowledge from data-rich head tasks to data-scarce tail tasks without requiring demonstrations.
  arXiv  Detail & Related papers  (2026-02-06T09:10:02Z)
• Learning to Solve Resource-Constrained Project Scheduling Problems with Duration Uncertainty using Graph Neural Networks [0.15749416770494704]
  Resource-Constrained Project Scheduling Problem (RCPSP) is a classical scheduling problem that has received significant attention due to its numerous applications in industry.<n>In this paper, we address the RCPSP variant with uncertain tasks duration (modeled using known probabilities) and aim to minimize the overall expected project duration.<n>We leverage Graph Neural Networks in conjunction with Deep Reinforcement Learning (DRL) to develop an effective policy for task scheduling.
  arXiv  Detail & Related papers  (2025-11-17T10:27:35Z)
• GATES: Cost-aware Dynamic Workflow Scheduling via Graph Attention Networks and Evolution Strategy [7.653021685451039]
  Cost-aware Dynamic Scheduling (CADWS) is a key challenge in cloud computing.<n>Deep reinforcement learning (DRL) has been widely employed for automated scheduling policy design.<n>This study proposes a novel DRL method combining Graph Attention Networks-based policy network and Evolution Strategy, referred to as GATES.
  arXiv  Detail & Related papers  (2025-05-18T10:38:41Z)
• Improving Large Language Model Planning with Action Sequence Similarity [50.52049888490524]
  In this work, we explore how to improve the model planning capability through in-context learning (ICL)<n>We propose GRASE-DC: a two-stage pipeline that first re-samples high AS exemplars and then curates the selected exemplars.<n>Our experimental result confirms that GRASE-DC achieves significant performance improvement on various planning tasks.
  arXiv  Detail & Related papers  (2025-05-02T05:16:17Z)
• PGU-SGP: A Pheno-Geno Unified Surrogate Genetic Programming For Real-life Container Terminal Truck Scheduling [7.678307721780809]
  This paper proposes a pheno-geno unified surrogate GP algorithm, PGU-SGP, to enhance surrogate sample selection and fitness prediction.<n>With the same training time, PGU-SGP significantly outperforms traditional GP and the state-of-the-art algorithm on most datasets.
  arXiv  Detail & Related papers  (2025-04-15T15:19:42Z)
• Learning from Reward-Free Offline Data: A Case for Planning with Latent Dynamics Models [79.2162092822111]
  We systematically evaluate reinforcement learning (RL) and control-based methods on a suite of navigation tasks.<n>We employ a latent dynamics model using the Joint Embedding Predictive Architecture (JEPA) and employ it for planning.<n>Our results show that model-free RL benefits most from large amounts of high-quality data, whereas model-based planning generalizes better to unseen layouts.
  arXiv  Detail & Related papers  (2025-02-20T18:39:41Z)
• Model Predictive Task Sampling for Efficient and Robust Adaptation [57.414812940406996]
  We introduce Model Predictive Task Sampling (MPTS), a framework that bridges the task space and adaptation risk distributions.<n>MPTS employs a generative model to characterize the episodic optimization process and predicts task-specific adaptation risk via posterior inference.<n>MPTS seamlessly integrates into zero-shot, few-shot, and supervised finetuning settings.
  arXiv  Detail & Related papers  (2025-01-19T13:14:53Z)
• Learning Logic Specifications for Policy Guidance in POMDPs: an Inductive Logic Programming Approach [57.788675205519986]
  We learn high-quality traces from POMDP executions generated by any solver. We exploit data- and time-efficient Indu Logic Programming (ILP) to generate interpretable belief-based policy specifications. We show that learneds expressed in Answer Set Programming (ASP) yield performance superior to neural networks and similar to optimal handcrafted task-specifics within lower computational time.
  arXiv  Detail & Related papers  (2024-02-29T15:36:01Z)
• Graph Neural Networks for the Offline Nanosatellite Task Scheduling Problem [6.650027907238541]
  This study investigates how to schedule nanosatellite tasks more efficiently using Graph Neural Networks (GNNs)<n>The goal is to find the optimal schedule for tasks to be carried out in orbit while taking into account Quality-of-Service (QoS) considerations.
  arXiv  Detail & Related papers  (2023-03-24T03:17:28Z)
• Dealing with Sparse Rewards in Continuous Control Robotics via Heavy-Tailed Policies [64.2210390071609]
  We present a novel Heavy-Tailed Policy Gradient (HT-PSG) algorithm to deal with the challenges of sparse rewards in continuous control problems. We show consistent performance improvement across all tasks in terms of high average cumulative reward.
  arXiv  Detail & Related papers  (2022-06-12T04:09:39Z)
• MAP-Elites based Hyper-Heuristic for the Resource Constrained Project Scheduling Problem [0.3359875577705538]
  Resource constrained project scheduling problem (RCPSP) is an NP-Hard optimization problem. We present a MAP-Elites based hyper-heuristic (MEHH) for the automated discovery of efficient priority rules for RCPSP.
  arXiv  Detail & Related papers  (2022-04-24T01:49:59Z)
• Deep Reinforcement Agent for Scheduling in HPC [1.6569798882223303]
  Cluster scheduler determines when and which user jobs should be allocated to available system resources. In this work, we present an automated HPC scheduling agent named DRAS (Deep Reinforcement Agent for Scheduling) by leveraging deep reinforcement learning.
  arXiv  Detail & Related papers  (2021-02-11T20:08:38Z)
• Hierarchical Reinforcement Learning as a Model of Human Task Interleaving [60.95424607008241]
  We develop a hierarchical model of supervisory control driven by reinforcement learning. The model reproduces known empirical effects of task interleaving. The results support hierarchical RL as a plausible model of task interleaving.
  arXiv  Detail & Related papers  (2020-01-04T17:53:28Z)
• Improving a State-of-the-Art Heuristic for the Minimum Latency Problem with Data Mining [69.00394670035747]
  Hybrid metaheuristics have become a trend in operations research. A successful example combines the Greedy Randomized Adaptive Search Procedures (GRASP) and data mining techniques.
  arXiv  Detail & Related papers  (2019-08-28T13:12:30Z)

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.