An anytime branch and bound algorithm for agile earth observation satellite onboard scheduling

•We consider a bi-satellite cluster for targets recognition over sea.•We propose a mathematical model for the agile satellite scheduling problem.•We develop an anytime branch and bound (AB&B) algorithm for problem solution.•AB&B helps the cluster improve the efficiency of targets recognition...

Full description

Bibliographic Details

Published in:	Advances in space research Vol. 60; no. 9; pp. 2077 - 2090
Main Authors:	Chu, Xiaogeng, Chen, Yuning, Tan, Yuejin
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.11.2017
Subjects:	Agile satellite onboard scheduling problem Anytime branch and bound algorithm Targets recognition over sea Targets recognition over sea Anytime branch and bound algorithm Agile satellite onboard scheduling problem
ISSN:	0273-1177, 1879-1948
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!