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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Advances in space research Jg. 60; H. 9; S. 2077 - 2090
Hauptverfasser:	Chu, Xiaogeng, Chen, Yuning, Tan, Yuejin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.11.2017
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!