Optimisation of Active Space Debris Removal Missions With Multiple
Targets Using Quantum Annealing
- URL: http://arxiv.org/abs/2311.01852v1
- Date: Fri, 3 Nov 2023 11:35:55 GMT
- Title: Optimisation of Active Space Debris Removal Missions With Multiple
Targets Using Quantum Annealing
- Authors: Thomas Swain
- Abstract summary: A strategy for the analysis of active debris removal missions targeting multiple objects is presented.
Algebraic techniques successfully reduce the orbital mechanics regarding specific inter-debris transfer and disposal methods.
A quadratic unconstrained binary optimisation problem formulation is used to minimise the total propellant used in the mission.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A strategy for the analysis of active debris removal missions targeting
multiple objects from a set of objects in near-circular orbit with similar
inclination is presented. Algebraic techniques successfully reduce the orbital
mechanics regarding specific inter-debris transfer and disposal methods to
simple computations, which can be used as the coefficients of a quadratic
unconstrained binary optimisation (QUBO) problem formulation which minimises
the total propellant used in the mission whilst allowing for servicing time and
meeting the mission deadline. The QUBO is validated by solving artificial small
problems (from 2 to 11 debris) using classical computational methods and the
weaknesses in using these methods are examined prior to solution using quantum
annealing hardware. The quantum processing unit (QPU) and quantum-classical
hybrid solvers provided by D-Wave are then used to solve the same small
problems, with attention paid to evident strengths and weaknesses of each
approach. Hybrid solvers are found to be significantly more effective at
solving larger problems. Finally, the hybrid method is used to solve a large
problem using a real dataset. From a set of 79 debris objects resulting from
the destruction of the Kosmos-1408 satellite, an active debris removal mission
starting on 30 September 2023 targeting 5 debris objects for disposal within a
year with 20 days servicing time per object is successfully planned. This plan
calculates the total propellant cost of transfer and disposal to be 0.87km/s
and would be complete well within the deadline at 241 days from the start date.
This problem uses 6,478 binary variables in total and is solved using around
25s of QPU access time.
Related papers
- Localizing Task Information for Improved Model Merging and Compression [61.16012721460561]
We show that the information required to solve each task is still preserved after merging as different tasks mostly use non-overlapping sets of weights.
We propose Consensus Merging, an algorithm that eliminates such weights and improves the general performance of existing model merging approaches.
arXiv Detail & Related papers (2024-05-13T14:54:37Z) - 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) - Scalable Mechanism Design for Multi-Agent Path Finding [87.40027406028425]
Multi-Agent Path Finding (MAPF) involves determining paths for multiple agents to travel simultaneously and collision-free through a shared area toward given goal locations.
Finding an optimal solution is often computationally infeasible, making the use of approximate, suboptimal algorithms essential.
We introduce the problem of scalable mechanism design for MAPF and propose three strategyproof mechanisms, two of which even use approximate MAPF algorithms.
arXiv Detail & Related papers (2024-01-30T14:26:04Z) - A Hybrid Quantum-assisted Column Generation Algorithm for the Fleet
Conversion Problem [0.7373617024876725]
Fleet Conversion aims to reduce the carbon emissions and cost of operating a fleet of vehicles for a given set of tours.
We show how quantum and classical solvers can be used together to approach an industrial-sized use-case.
arXiv Detail & Related papers (2023-09-15T09:23:15Z) - 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) - QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum
machines [81.4597482536073]
Quantum approximate optimization algorithms (QAOAs) utilize the power of quantum machines and inherit the spirit of adiabatic evolution.
We propose QAOA-in-QAOA ($textQAOA2$) to solve arbitrary large-scale MaxCut problems using quantum machines.
Our method can be seamlessly embedded into other advanced strategies to enhance the capability of QAOAs in large-scale optimization problems.
arXiv Detail & Related papers (2022-05-24T03:49:10Z) - Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time.
As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware.
We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
arXiv Detail & Related papers (2022-02-17T18:59:20Z) - 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 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) - Combining Deep Learning and Optimization for Security-Constrained
Optimal Power Flow [94.24763814458686]
Security-constrained optimal power flow (SCOPF) is fundamental in power systems.
Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs.
This paper proposes a novel approach that combines deep learning and robust optimization techniques.
arXiv Detail & Related papers (2020-07-14T12:38:21Z) - Reinforcement Learning Based Vehicle-cell Association Algorithm for
Highly Mobile Millimeter Wave Communication [53.47785498477648]
This paper investigates the problem of vehicle-cell association in millimeter wave (mmWave) communication networks.
We first formulate the user state (VU) problem as a discrete non-vehicle association optimization problem.
The proposed solution achieves up to 15% gains in terms sum of user complexity and 20% reduction in VUE compared to several baseline designs.
arXiv Detail & Related papers (2020-01-22T08:51:05Z)
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.