Monte Carlo Tree Search Satellite Scheduling Under Cloud Cover Uncertainty
- URL: http://arxiv.org/abs/2405.20951v1
- Date: Fri, 31 May 2024 15:50:46 GMT
- Title: Monte Carlo Tree Search Satellite Scheduling Under Cloud Cover Uncertainty
- Authors: Justin Norman, Francois Rivest,
- Abstract summary: This paper addresses the multi-satellite collection scheduling problem (m-SatCSP)
It aims to optimize task scheduling over a constellation of satellites under uncertain conditions such as cloud cover.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Efficient utilization of satellite resources in dynamic environments remains a challenging problem in satellite scheduling. This paper addresses the multi-satellite collection scheduling problem (m-SatCSP), aiming to optimize task scheduling over a constellation of satellites under uncertain conditions such as cloud cover. Leveraging Monte Carlo Tree Search (MCTS), a stochastic search algorithm, two versions of MCTS are explored to schedule satellites effectively. Hyperparameter tuning is conducted to optimize the algorithm's performance. Experimental results demonstrate the effectiveness of the MCTS approach, outperforming existing methods in both solution quality and efficiency. Comparative analysis against other scheduling algorithms showcases competitive performance, positioning MCTS as a promising solution for satellite task scheduling in dynamic environments.
Related papers
- Quantum Optimization Methods for Satellite Mission Planning [0.3252295747842729]
The ever-growing amount of satellites in orbit underscores the need to operate them efficiently.
Current classical algorithms often fail to find the global optimum or take too long to execute.
Here, we approach the problem from a quantum computing point of view, which offers a promising alternative.
arXiv Detail & Related papers (2024-04-08T13:36:29Z) - Security-Sensitive Task Offloading in Integrated Satellite-Terrestrial Networks [15.916368067018169]
We propose the deployment of LEO satellite edge in an integrated satellite-terrestrial networks (ISTN) structure to support textitsecurity-sensitive computing task offloading.
We model the task allocation and offloading order problem as a joint optimization problem to minimize task offloading delay, energy consumption, and the number of attacks while satisfying reliability constraints.
arXiv Detail & Related papers (2024-01-20T07:29:55Z) - Continuous Monte Carlo Graph Search [61.11769232283621]
Continuous Monte Carlo Graph Search ( CMCGS) is an extension of Monte Carlo Tree Search (MCTS) to online planning.
CMCGS takes advantage of the insight that, during planning, sharing the same action policy between several states can yield high performance.
It can be scaled up through parallelization, and it outperforms the Cross-Entropy Method (CEM) in continuous control with learned dynamics models.
arXiv Detail & Related papers (2022-10-04T07:34:06Z) - An adaptive bi-objective optimization algorithm for the satellite image
data downlink scheduling problem considering request split [0.0]
We introduce the dynamic two-phase satellite image data downlink scheduling problem (D-SIDSP)
D-SIDSP combines two interlinked operations of image data segmentation and image data downlink, in a dynamic way.
An adaptive bi-objective memetic algorithm, ALNS+NSGA-II, is developed to solve D-SIDSP.
arXiv Detail & Related papers (2022-06-28T15:37:34Z) - A Two-stage Framework and Reinforcement Learning-based Optimization
Algorithms for Complex Scheduling Problems [54.61091936472494]
We develop a two-stage framework, in which reinforcement learning (RL) and traditional operations research (OR) algorithms are combined together.
The scheduling problem is solved in two stages, including a finite Markov decision process (MDP) and a mixed-integer programming process, respectively.
Results show that the proposed algorithms could stably and efficiently obtain satisfactory scheduling schemes for agile Earth observation satellite scheduling problems.
arXiv Detail & Related papers (2021-03-10T03:16:12Z) - Reinforcement Learning for Low-Thrust Trajectory Design of
Interplanetary Missions [77.34726150561087]
This paper investigates the use of reinforcement learning for the robust design of interplanetary trajectories in presence of severe disturbances.
An open-source implementation of the state-of-the-art algorithm Proximal Policy Optimization is adopted.
The resulting Guidance and Control Network provides both a robust nominal trajectory and the associated closed-loop guidance law.
arXiv Detail & Related papers (2020-08-19T15:22:15Z) - Mission schedule of agile satellites based on Proximal Policy
Optimization Algorithm [0.0]
Mission schedule of satellites is an important part of space operation nowadays.
This paper incorporate reinforcement learning algorithms into it and find a new way to describe the problem.
arXiv Detail & Related papers (2020-07-05T14:28:44Z) - Dynamic Multi-Robot Task Allocation under Uncertainty and Temporal
Constraints [52.58352707495122]
We present a multi-robot allocation algorithm that decouples the key computational challenges of sequential decision-making under uncertainty and multi-agent coordination.
We validate our results over a wide range of simulations on two distinct domains: multi-arm conveyor belt pick-and-place and multi-drone delivery dispatch in a city.
arXiv Detail & Related papers (2020-05-27T01:10:41Z) - Decentralized MCTS via Learned Teammate Models [89.24858306636816]
We present a trainable online decentralized planning algorithm based on decentralized Monte Carlo Tree Search.
We show that deep learning and convolutional neural networks can be employed to produce accurate policy approximators.
arXiv Detail & Related papers (2020-03-19T13:10:20Z) - Simulated annealing based heuristic for multiple agile satellites
scheduling under cloud coverage uncertainty [1.100580615194563]
Agile satellites are the new generation of Earth observation satellites (EOSs) with stronger attitude maneuvering capability.
We are the first to address multiple agile EOSs scheduling problem under cloud coverage uncertainty.
An improved simulated annealing based combining a fast insertion strategy is proposed for large-scale observation missions.
arXiv Detail & Related papers (2020-03-14T16:37:26Z) - 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.