Journal
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS
Volume 70, Issue 7, Pages 2490-2494Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCSII.2023.3238052
Keywords
Multi-agent systems; task scheduling; potential game; double auction
Categories
Ask authors/readers for more resources
This study investigates the task scheduling problem for an earth observation satellite (EOS) constellation. The EOS constellation collaboratively completes a set of observation tasks, with each EOS following a specified observation order described by a task graph. The goal is to maximize the total number of observation tasks by the constellation, considering repeated observations only once. The task scheduling problem is formulated as an exact potential game to find a Nash equilibrium (NE), and a double auction strategy along with a sieving scheme is proposed to iteratively solve for an NE, with proven convergence in finite steps.
This brief investigates the task scheduling problem for an earth observation satellite (EOS) constellation. The EOS constellation needs to collaboratively complete a set of observation tasks, but each EOS should satisfy the observation order specification described by a task graph due to its motion constraints. The goal is to maximize the total number of observation tasks by the constellation, for which repeated observations are counted only for once. Firstly, the task scheduling problem is formulated as an exact potential game and the goal of the task scheduling problem is converted to find a Nash equilibrium (NE). Secondly, a double auction strategy is proposed to solve for an NE iteratively and a sieving scheme is presented for the buyer to build its candidate set. It is proved that our algorithm converges to an NE in finite steps.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available