Auction-based and Distributed Optimization Approaches for Scheduling Observations in Satellite Constellations with Exclusive Orbit Portions

• URL: http://arxiv.org/abs/2106.03548v1
• Date: Fri, 4 Jun 2021 09:34:20 GMT
• Title: Auction-based and Distributed Optimization Approaches for Scheduling Observations in Satellite Constellations with Exclusive Orbit Portions
• Authors: Gauthier Picard
• Abstract summary: We investigate the use of multi-agent allocation techniques on problems related to Earth observation scenarios with multiple users and satellites. As to solve EOSCSP, we propose market-based techniques and a distributed problem solving technique based on Distributed Constraint Optimization. These contributions are experimentally evaluated on randomly generated EOSCSP instances based on real large-scale or highly conflicting observation order books.
• Score: 0.45687771576879593
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate the use of multi-agent allocation techniques on problems related to Earth observation scenarios with multiple users and satellites. We focus on the problem of coordinating users having reserved exclusive orbit portions and one central planner having several requests that may use some intervals of these exclusives. We define this problem as Earth Observation Satellite Constellation Scheduling Problem (EOSCSP) and map it to a Mixed Integer Linear Program. As to solve EOSCSP, we propose market-based techniques and a distributed problem solving technique based on Distributed Constraint Optimization (DCOP), where agents cooperate to allocate requests without sharing their own schedules. These contributions are experimentally evaluated on randomly generated EOSCSP instances based on real large-scale or highly conflicting observation order books.

Related papers

• Design Optimization of NOMA Aided Multi-STAR-RIS for Indoor Environments: A Convex Approximation Imitated Reinforcement Learning Approach [51.63921041249406]
  Sixth-generation (6G) networks leverage simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs) to overcome the limitations of traditional RISs. deploying STAR-RISs indoors presents challenges in interference mitigation, power consumption, and real-time configuration. A novel network architecture utilizing multiple access points (APs) and STAR-RISs is proposed for indoor communication.
  arXiv  Detail & Related papers  (2024-06-19T07:17:04Z)
• Monte Carlo Tree Search Satellite Scheduling Under Cloud Cover Uncertainty [0.0]
  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.
  arXiv  Detail & Related papers  (2024-05-31T15:50:46Z)
• Scalable Scheduling Policies for Quantum Satellite Networks [10.91414940065524]
  We consider the problem of transmission scheduling in quantum satellite networks subject to resource constraints at the satellites and ground stations. We show that the most general problem of assigning satellites to ground station pairs for entanglement distribution is NP-hard. We propose four scalable algorithms and evaluate their performance for Starlink mega constellation.
  arXiv  Detail & Related papers  (2024-05-15T15:58:12Z)
• Scheduling for On-Board Federated Learning with Satellite Clusters [39.78458023920483]
  On-board federated learning enables satellites to train a machine learning model collaboratively. This paper introduces a scheme for scheduling on-board FL for constellations connected with intra-orbit inter-satellite links.
  arXiv  Detail & Related papers  (2024-02-14T11:26:30Z)
• Federated learning for LEO constellations via inter-HAP links [0.0]
  Low Earth Obit (LEO) satellite constellations have seen a sharp increase of deployment in recent years. To apply machine learning (ML) in such applications, the traditional way of downloading satellite data such as imagery to a ground station (GS) is not desirable. We show that existing FL solutions do not fit well in such LEO constellation scenarios because of significant challenges such as excessive convergence delay and unreliable wireless channels.
  arXiv  Detail & Related papers  (2022-05-15T08:22:52Z)
• 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)
• Learning Emergent Random Access Protocol for LEO Satellite Networks [51.575090080749554]
  We propose a novel grant-free random access solution for LEO SAT networks, dubbed emergent random access channel protocol (eRACH) eRACH is a model-free approach that emerges through interaction with the non-stationary network environment. Compared to RACH, we show from various simulations that our proposed eRACH yields 54.6% higher average network throughput.
  arXiv  Detail & Related papers  (2021-12-03T07:44:45Z)
• 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)
• Integrating LEO Satellite and UAV Relaying via Reinforcement Learning for Non-Terrestrial Networks [51.05735925326235]
  A mega-constellation of low-earth orbit (LEO) satellites has the potential to enable long-range communication with low latency. We study the problem of forwarding packets between two faraway ground terminals, through an LEO satellite selected from an orbiting constellation. To maximize the end-to-end data rate, the satellite association and HAP location should be optimized. We tackle this problem using deep reinforcement learning (DRL) with a novel action dimension reduction technique.
  arXiv  Detail & Related papers  (2020-05-26T05:39:27Z)
• Agile Earth observation satellite scheduling over 20 years: formulations, methods and future directions [69.47531199609593]
  Agile satellites with advanced attitude maneuvering capability are the new generation of Earth observation satellites (EOSs) The continuous improvement in satellite technology and decrease in launch cost have boosted the development of agile EOSs (AEOSs)
  arXiv  Detail & Related papers  (2020-03-13T09:38:40Z)

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.