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

Celý popis

Podrobná bibliografia

Vydané v:	Advances in space research Ročník 60; číslo 9; s. 2077 - 2090
Hlavní autori:	Chu, Xiaogeng, Chen, Yuning, Tan, Yuejin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.11.2017
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!