Innovations in the field of on-board scheduling technologies
- URL: http://arxiv.org/abs/2205.06792v1
- Date: Wed, 4 May 2022 12:00:49 GMT
- Title: Innovations in the field of on-board scheduling technologies
- Authors: Temenuzhka Avramova, Riccardo Maderna, Alessandro Benetton, Christian
Cardenio
- Abstract summary: 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.
- Score: 64.41511459132334
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Space missions are characterized by long distances, difficult or unavailable
communication and high operating costs. Moreover, complexity has been
constantly increasing in recent years. For this reason, improving the autonomy
of space operators is an attractive goal to increase the mission reward with
lower costs. This paper proposes an onboard scheduler, that integrates inside
an onboard software framework for mission autonomy. Given a set of activities,
it is responsible for determining the starting time of each activity according
to their priority, order constraints, and resource consumption. The presented
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.
Related papers
- Tera-SpaceCom: GNN-based Deep Reinforcement Learning for Joint Resource Allocation and Task Offloading in TeraHertz Band Space Networks [11.881917133887102]
Tera-SpaceCom is envisioned as a promising technology to enable various space science and communication applications.
A graph neural network (GNN)-deep reinforcement learning (DRL)-based joint resource allocation and task offloading algorithm is proposed.
arXiv Detail & Related papers (2024-09-12T10:26:17Z) - A Distance Similarity-based Genetic Optimization Algorithm for Satellite Ground Network Planning Considering Feeding Mode [53.71516191515285]
The low transmission efficiency of the satellite data relay back mission has become a problem that is currently constraining the construction of the system.
We propose a distance similarity-based genetic optimization algorithm (DSGA), which considers the state characteristics between the tasks.
The results of simulation experiments show that the DSGA can effectively solve the SGNPFM problem.
arXiv Detail & Related papers (2024-08-29T06:57:45Z) - A Meta-Engine Framework for Interleaved Task and Motion Planning using Topological Refinements [51.54559117314768]
Task And Motion Planning (TAMP) is the problem of finding a solution to an automated planning problem.
We propose a general and open-source framework for modeling and benchmarking TAMP problems.
We introduce an innovative meta-technique to solve TAMP problems involving moving agents and multiple task-state-dependent obstacles.
arXiv Detail & Related papers (2024-08-11T14:57:57Z) - Distance-Only Task Orchestration Algorithm for Energy Efficiency in Satellite-Based Mist Computing [1.0225653612678713]
We propose a heavy computing task offloading algorithm that prioritizes satellite proximity.
Our proposed algorithm outperforms other offloading schemes in terms of satellites energy consumption, average end-to-end delay, and tasks success rates.
arXiv Detail & Related papers (2023-11-24T06:38:41Z) - Assurance for Autonomy -- JPL's past research, lessons learned, and
future directions [56.32768279109502]
Autonomy is required when a wide variation in circumstances precludes responses being pre-planned.
Mission assurance is a key contributor to providing confidence, yet assurance practices honed over decades of spaceflight have relatively little experience with autonomy.
Researchers in JPL's software assurance group have been involved in the development of techniques specific to the assurance of autonomy.
arXiv Detail & Related papers (2023-05-16T18:24:12Z) - 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) - Autonomous Aerial Robot for High-Speed Search and Intercept Applications [86.72321289033562]
A fully-autonomous aerial robot for high-speed object grasping has been proposed.
As an additional sub-task, our system is able to autonomously pierce balloons located in poles close to the surface.
Our approach has been validated in a challenging international competition and has shown outstanding results.
arXiv Detail & Related papers (2021-12-10T11:49:51Z) - Time-Optimal Planning for Quadrotor Waypoint Flight [50.016821506107455]
Planning time-optimal trajectories at the actuation limit of a quadrotor is an open problem.
We propose a solution while exploiting the full quadrotor's actuator potential.
We validate our method in real-world flights in one of the world's largest motion-capture systems.
arXiv Detail & Related papers (2021-08-10T09:26:43Z) - Learning off-road maneuver plans for autonomous vehicles [0.0]
This thesis explores the benefits machine learning algorithms can bring to online planning and scheduling for autonomous vehicles in off-road situations.
We present a range of learning-baseds to assist different itinerary planners.
In order to synthesize strategies to execute synchronized maneuvers, we propose a novel type of scheduling controllability and a learning-assisted algorithm.
arXiv Detail & Related papers (2021-08-02T16:27:59Z) - 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)
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.