Image collection planning for KOrea Multi-Purpose SATellite-2

Jinbong Jang; Jiwoong Choi; Hee Jin Bae; In Chan Choi

doi:10.1016/j.ejor.2013.04.009

Image collection planning for KOrea Multi-Purpose SATellite-2

Jinbong Jang, Jiwoong Choi, Hee Jin Bae, In Chan Choi

Research output: Contribution to journal › Article › peer-review

24 Citations (Scopus)

Abstract

This paper studies an image collection planning problem for a Korean satellite, KOMPSAT-2 (KOrea Multi-Purpose SATellite-2). KOMPSAT-2 has the mission goal of maximizing image acquisition in time and quality requested by customers and operates under several complicating conditions. One of the characteristics in KOMPSAT-2 is its strip mode operation, in which segments of continuous-observation areas with known sizes are captured one at a time. In this paper, we regard the segment as a group of adjoining geographical square regions (scenes), whose size must also be determined. Thus, the problem involves the determination of proper segment lengths as well as an image collection schedule. We present a binary integer programming model for this problem in a multi-orbit long-term planning environment and provide a heuristic solution approach based on the Lagrangian relaxation and subgradient methods. We also present the results of our computational experiment based on randomly generated data.

Original language	English
Pages (from-to)	190-199
Number of pages	10
Journal	European Journal of Operational Research
Volume	230
Issue number	1
DOIs	https://doi.org/10.1016/j.ejor.2013.04.009
Publication status	Published - 2013 Oct 1

Bibliographical note

Funding Information:
This works was supported by 2010 technology royalties program (Technical Development of Optimized Image Collection Planning for Multi-Satellite) of The Ministry of Education, Science and Technology in Korea.

Keywords

Decomposition
Image collection planning problem
Lagrangian relaxation
Large scale optimization
Subgradient method Scheduling

ASJC Scopus subject areas

General Computer Science
Modelling and Simulation
Management Science and Operations Research
Information Systems and Management

Access to Document

10.1016/j.ejor.2013.04.009

Cite this

@article{87105d9540bc4b3ca2865880ecc37849,

title = "Image collection planning for KOrea Multi-Purpose SATellite-2",

abstract = "This paper studies an image collection planning problem for a Korean satellite, KOMPSAT-2 (KOrea Multi-Purpose SATellite-2). KOMPSAT-2 has the mission goal of maximizing image acquisition in time and quality requested by customers and operates under several complicating conditions. One of the characteristics in KOMPSAT-2 is its strip mode operation, in which segments of continuous-observation areas with known sizes are captured one at a time. In this paper, we regard the segment as a group of adjoining geographical square regions (scenes), whose size must also be determined. Thus, the problem involves the determination of proper segment lengths as well as an image collection schedule. We present a binary integer programming model for this problem in a multi-orbit long-term planning environment and provide a heuristic solution approach based on the Lagrangian relaxation and subgradient methods. We also present the results of our computational experiment based on randomly generated data.",

keywords = "Decomposition, Image collection planning problem, Lagrangian relaxation, Large scale optimization, Subgradient method Scheduling",

author = "Jinbong Jang and Jiwoong Choi and Bae, {Hee Jin} and Choi, {In Chan}",

note = "Funding Information: This works was supported by 2010 technology royalties program (Technical Development of Optimized Image Collection Planning for Multi-Satellite) of The Ministry of Education, Science and Technology in Korea.",

year = "2013",

month = oct,

day = "1",

doi = "10.1016/j.ejor.2013.04.009",

language = "English",

volume = "230",

pages = "190--199",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Image collection planning for KOrea Multi-Purpose SATellite-2

AU - Jang, Jinbong

AU - Choi, Jiwoong

AU - Bae, Hee Jin

AU - Choi, In Chan

N1 - Funding Information: This works was supported by 2010 technology royalties program (Technical Development of Optimized Image Collection Planning for Multi-Satellite) of The Ministry of Education, Science and Technology in Korea.

PY - 2013/10/1

Y1 - 2013/10/1

N2 - This paper studies an image collection planning problem for a Korean satellite, KOMPSAT-2 (KOrea Multi-Purpose SATellite-2). KOMPSAT-2 has the mission goal of maximizing image acquisition in time and quality requested by customers and operates under several complicating conditions. One of the characteristics in KOMPSAT-2 is its strip mode operation, in which segments of continuous-observation areas with known sizes are captured one at a time. In this paper, we regard the segment as a group of adjoining geographical square regions (scenes), whose size must also be determined. Thus, the problem involves the determination of proper segment lengths as well as an image collection schedule. We present a binary integer programming model for this problem in a multi-orbit long-term planning environment and provide a heuristic solution approach based on the Lagrangian relaxation and subgradient methods. We also present the results of our computational experiment based on randomly generated data.

AB - This paper studies an image collection planning problem for a Korean satellite, KOMPSAT-2 (KOrea Multi-Purpose SATellite-2). KOMPSAT-2 has the mission goal of maximizing image acquisition in time and quality requested by customers and operates under several complicating conditions. One of the characteristics in KOMPSAT-2 is its strip mode operation, in which segments of continuous-observation areas with known sizes are captured one at a time. In this paper, we regard the segment as a group of adjoining geographical square regions (scenes), whose size must also be determined. Thus, the problem involves the determination of proper segment lengths as well as an image collection schedule. We present a binary integer programming model for this problem in a multi-orbit long-term planning environment and provide a heuristic solution approach based on the Lagrangian relaxation and subgradient methods. We also present the results of our computational experiment based on randomly generated data.

KW - Decomposition

KW - Image collection planning problem

KW - Lagrangian relaxation

KW - Large scale optimization

KW - Subgradient method Scheduling

UR - http://www.scopus.com/inward/record.url?scp=84878012649&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2013.04.009

DO - 10.1016/j.ejor.2013.04.009

M3 - Article

AN - SCOPUS:84878012649

SN - 0377-2217

VL - 230

SP - 190

EP - 199

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

Image collection planning for KOrea Multi-Purpose SATellite-2

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this