Multi Satellites Scheduling Problem for Area Target Based on Grid

Peng Gao; Yue Jin Tan

doi:10.4028/www.scientific.net/AMR.791-793.1520

Paper Titles

Multi-Standards Deblocking Filter Based SIMD Technology
p.1501

Research on Aggregated Multicast Based on Wide-Sense Circuit Tree
p.1506

Effect of Breakage on the Bipolarly Charged Particles
p.1512

Magnetic-Thermo Coupling Model for Cable Tension Sensor Based on Magnetoelastic Effect
p.1516

Multi Satellites Scheduling Problem for Area Target Based on Grid
p.1520

Stability Outage Analysis for LDPC Codes
p.1525

Derrick Spectrum Analysis Based on ANSYS
p.1529

Affinity Propagation for the Context Quantization
p.1533

Application of Immune Algorithm on Input Variable Dimension Reduction in Neural Network Modeling
p.1537

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 791-793Multi Satellites Scheduling Problem for Area...

Multi Satellites Scheduling Problem for Area Target Based on Grid

Abstract:

This paper transfer the area target scheduling problem into maximal coverage problem based on summaring the traditional sovling problem. A MIP model is build based on problem characters; simulated anneanling problem is used to solve the problem. Four neighborhood and tow differentiation mechanisms are designed to fit the study problem, such as offset neighborhood. The relationship between coverage and overlap and division angle is analysised by test data, and algorithm validation and effective is test based on example data.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 791-793)

Pages:

1520-1524

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.791-793.1520

Citation:

Cite this paper

Online since:

September 2013

Authors:

Peng Gao, Yue Jin Tan

Keywords:

Area Target Scheduling Problem, Earth Observation Satellite, Simulated Annealing Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] M. Lemaître, G. Verfaillie. Daily Management of an Earth Observation Satellite: Comparison of ILOG Solver with Dedicated Algorithms for Valued Constraint Satisfaction Problems. Third ILOG International Users Meeting. Paris, (1997).

Google Scholar

[2] Michel emaître, Gérard Verfaillie, Frank Jouhaud, Jean-Michel Lachiver. Selecting and Scheduling Observations of Agile Satellites. Aerospace Science and Technology, 2002, 6 (5): 367-381.

DOI: 10.1016/s1270-9638(02)01173-2

Google Scholar

[3] Mancel C. Complex Optimization Problems in Space Systems. 13Th International Conference on Automated Planning&Scheduling. Trento, Italy, (2003).

Google Scholar

[4] RuanQiming, Tanyuejin, Liyongtai, Chenyingwu. Using Constraint Satisfaction to Cooperate Satellites' Activities for the Mission of Area Target Observation. Journal of Astronautics, 2007, 28 (1): 238-242.

Google Scholar

[5] RuanQiming. Research on Photo-reconnaissance Satellite Scheduling Problem for Area Targets Observation [D]. ChangSha: National University of Defense Technology Doctor Degree Paper, (2006).

Google Scholar

[6] RuanQiming, Tanyuejin, Lijufang, Chenyingwu. Research on segmenting and selecting of area targets[J]. Science of Surverying and Mapping, 2006, 34(1): 98-100.

Google Scholar

[7] Globus A, Crawford J, Lohn J, et al. A Comparison of Techniques for Scheduling Earth Observing Satellites[C]. Proceedings of the 16th Conference on Innovative Applications of Artificial Intelligence, San Jose, CA, USA, (2004).

Google Scholar

[8] Kuipers E J. Algorithm for the management of the missions of Earth observation satellites[C]. Fifth ROADEF Annual Conference, Avignon , France, (2003).

Google Scholar