Loading…

A Heuristic Approach to Satellite Range Scheduling With Bounds Using Lagrangian Relaxation

This paper focuses on scheduling antennas to track satellites using a novel heuristic method. The objectives pursued in developing a schedule are twofold: 1) minimize the priority weighted number of time periods that satellites are not tracked, and 2) equalize the percentage of time each satellite i...

Full description

Saved in:
Bibliographic Details
Published in:IEEE systems journal 2018-12, Vol.12 (4), p.3828-3836
Main Authors: Brown, Nathanael, Arguello, Bryan, Nozick, Linda, Xu, Ningxiong
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper focuses on scheduling antennas to track satellites using a novel heuristic method. The objectives pursued in developing a schedule are twofold: 1) minimize the priority weighted number of time periods that satellites are not tracked, and 2) equalize the percentage of time each satellite is uncovered. The heuristic method is a population-based local search tailored to the unique characteristics of this problem. In order to validate the performance of the heuristic, bounds are developed using Lagrangian relaxation. The heuristic method and the bounds are applied to several test problems. In all cases, the heuristic identifies a solution that is better than the upper bound and is generally closer (but obviously larger) than the lower bound with about an order of magnitude reduction in computation time. Finally, a comparison with CPLEX 12.7 is provided.
ISSN:1932-8184
1937-9234
DOI:10.1109/JSYST.2018.2821094