Font Size: a A A

Research On Photo-reconnaissance Satellites Scheduling Problem For Area Targets Observation

Posted on:2007-06-19Degree:DoctorType:Dissertation
Country:ChinaCandidate:Q M RuanFull Text:PDF
GTID:1102360215470582Subject:Management Science and Engineering
Abstract/Summary:PDF Full Text Request
Scheduling photo-reconnaissance satellites for area targets observation is to allocate photo-reconnaissance satellites and satellite-based sensors optimally according to the requirements of user's tactical application and the constraints of remote sensors, make imaging schedules for satellites and make the most of the limited resources by coordinating observation activities in order to satisfy realtime or near-realtime image requirement. Photo-reconnaissance satellite is a kind of earth observing satellite. The earth observing satellite scheduling problem for area targets observation is still a brand new problem to people at present, and there are few research reports about that. Based on the analysis of the characteristics of photo-reconnaissance satellite and the mission of area target observation, this thesis studies the constructing method of imaging activity, scheduling problem modeling method and algorithm on the photo-reconnaissance satellites scheduling problem for area targets observation. At last, a prototype of photo-reconnaissance satellites scheduling system for area targets observation is developed. The main contents and achievements of this thesis are as follows:Firstly, this thesis provides a constructing method of imaging activity containing the procedure of detecting visual zone boundary based on the analysis of characteristics of photo-reconnaissance satellite. Such factors as satellite orbit, parameter of satellite-based sensor, time window, and the position of area target are considered with this method.. In order to solve the problem of coordinate projection that is involved in activity constructing procedure, this thesis also gives the strategy of coordinate projection.Secondly, the thesis presents the concept and constructing method of grids space, defines the grid coverage value and its assigning rules, provides the method of computing percentage of coverage based on grid statistic method, and solves the problem of calculating the total profit with the characteristic of scenes owned to different imaging activities overlap with one another. Based on the analysis above, this thesis summarizes the scheduling constraints, and puts forward a mathematical model of photo-reconnaissance satellite scheduling problem for area targets observation.Thirdly, this paper designs a solving framework based on the idea of heuristic algorithm, and divides the solving process into three main phases: construction of initial solution, local search and inching. For the convenience of developing algorithm under the framework designed above, this thesis also designs several basic neighborhood structures, and provides several methods such as neighborhood constructing method with feasible analysis, evaluating method of activity profit on solution, rapid calculating method of total profit, quality improving method of solution and synchronizing method for grids space state. Fourthly, this thesis puts forward three algorithms with hierarchical improving strategy based on the framework introduced above: greedy randomized variable neighborhood search, tabu search, and simulated annealing. This thesis also compares the performance of these algorithms, and suggests the strategy of utilizing algorithm.Finally, this thesis designs and realizes the prototype system of scheduling photo-reconnaissance satellites for area targets observation. In addition, this thesis gives an example and solves it by the prototype system. The results verify the validity of the proposed activity constructing method, scheduling problem modeling method and algorithms.
Keywords/Search Tags:Photo-reconnaissance Satellite, Area Target, Scheduling, Grid Statistic Method, Greedy Algorithm, Tabu Search, Simulated Annealing
PDF Full Text Request
Related items