Cart (Loading....) | Create Account
Close category search window

Satellites Scheduling Algorithm Based on Dynamic Constraint Satisfaction Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Baolin Sun ; State Key Lab. of Inf. Eng. in Surveying, Wuhan Univ., Wuhan ; Wenxiang Wang ; Qianqing Qi

The Earth observation satellites scheduling problem (SMS) involves scheduling tasks to be performed by a satellite, where new task requests can arrive at any time, non-deterministically, and must be scheduled in real-time. This paper describes a new satellite mission scheduling algorithm based on constraint satisfaction problem (CPP). We describe the dynamic scheduling problem as a dynamic weighted maximal CSP in which constraints can be changed dynamically. It is usually undesirable to drastically modify the previous schedule in the re-scheduling process. This paper presents a new satellite mission scheduling problem based on constraint satisfaction problem (SMSCSP). The simulation results show that the proposed approach is effective and efficient in applications to the real problems.

Published in:

Computer Science and Software Engineering, 2008 International Conference on  (Volume:4 )

Date of Conference:

12-14 Dec. 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.