Mission schedule of agile satellites based on Proximal Policy
Optimization Algorithm
- URL: http://arxiv.org/abs/2007.02352v1
- Date: Sun, 5 Jul 2020 14:28:44 GMT
- Title: Mission schedule of agile satellites based on Proximal Policy
Optimization Algorithm
- Authors: Xinrui Liu
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Mission schedule of satellites is an important part of space operation
nowadays, since the number and types of satellites in orbit are increasing
tremendously and their corresponding tasks are also becoming more and more
complicated. In this paper, a mission schedule model combined with Proximal
Policy Optimization Algorithm(PPO) is proposed. Different from the traditional
heuristic planning method, this paper incorporate reinforcement learning
algorithms into it and find a new way to describe the problem. Several
constraints including data download are considered in this paper.
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) - Quantum algorithms applied to satellite mission planning for Earth
observation [0.0]
This paper introduces a set of quantum algorithms to solve the satellite mission planning problem.
The problem is formulated as maximizing the number of high-priority tasks completed on real datasets.
A hybridized quantum-enhanced reinforcement learning agent can achieve a completion percentage of 98.5% over high-priority tasks.
arXiv Detail & Related papers (2023-02-14T16:49:25Z) - Innovations in the field of on-board scheduling technologies [64.41511459132334]
This paper proposes an onboard scheduler, that integrates inside an onboard software framework for mission autonomy.
The scheduler is based on linear integer programming and relies on the use of a branch-and-cut solver.
The technology has been tested on an Earth Observation scenario, comparing its performance against the state-of-the-art scheduling technology.
arXiv Detail & Related papers (2022-05-04T12:00:49Z) - GEO satellites on-orbit repairing mission planning with mission deadline
constraint using a large neighborhood search-genetic algorithm [2.106508530625051]
This paper proposes a large neighborhood search-adaptive genetic algorithm (LNS-AGA) for many-to-many on-orbit repairing mission planning.
In the many-to-many on-orbit repairing scenario, several servicing spacecrafts and target satellites are located in GEO orbits which have different inclination, RAAN and true anomaly.
The mission objective is to find the optimal servicing sequence and orbit rendezvous time of every servicing spacecraft to minimize total cost of all servicing spacecrafts with all target satellites repaired.
arXiv Detail & Related papers (2021-10-08T03:33:37Z) - 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) - A Maximum Independent Set Method for Scheduling Earth Observing
Satellite Constellations [41.013477422930755]
This paper introduces a new approach for solving the satellite scheduling problem by generating an infeasibility-based graph representation of the problem.
It is tested on a scenarios of up to 10,000 requested imaging locations for the Skysat constellation of optical satellites as well as simulated constellations of up to 24 satellites.
arXiv Detail & Related papers (2020-08-15T19:32:21Z) - Bottom-up mechanism and improved contract net protocol for the dynamic
task planning of heterogeneous Earth observation resources [61.75759893720484]
Earth observation resources are becoming increasingly indispensable in disaster relief, damage assessment and related domains.
Many unpredicted factors, such as the change of observation task requirements, to the occurring of bad weather and resource failures, may cause the scheduled observation scheme to become infeasible.
A bottom-up distributed coordinated framework together with an improved contract net are proposed to facilitate the dynamic task replanning for heterogeneous Earth observation resources.
arXiv Detail & Related papers (2020-07-13T03:51:08Z) - Jump Operator Planning: Goal-Conditioned Policy Ensembles and Zero-Shot
Transfer [71.44215606325005]
We propose a novel framework called Jump-Operator Dynamic Programming for quickly computing solutions within a super-exponential space of sequential sub-goal tasks.
This approach involves controlling over an ensemble of reusable goal-conditioned polices functioning as temporally extended actions.
We then identify classes of objective functions on this subspace whose solutions are invariant to the grounding, resulting in optimal zero-shot transfer.
arXiv Detail & Related papers (2020-07-06T05:13:20Z) - 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)
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.