| Description |
viii, 143 pages : digital, PDF file. |
|
text txt rdacontent |
|
computer c rdamedia |
|
online resource cr rdacarrier |
| Series |
NASA CR ; 181017 |
|
NASA contractor report ; NASA CR-181017.
|
| System Details |
Mode of access: Internet from the NTRS web site. |
| Note |
Title from title screen (viewed Nov. 20, 2008). |
| Bibliography |
Includes bibliographical references (pages 139-143). |
| Summary |
Satellite system synthesis consists of allocating orbit locations, frequency channels, and polarizations to satellites that transmit signals to service areas. The problem of assigning orbit locations to geostationary satellites is considered in this manuscript. Position assignments are to be made so as not to exceed specified acceptable interference levels that are stated in terms of conservative minimum required orbital separations between pairs of satellites. The objective function is the minimization of the total deviation of assigned orbit locations from corresponding specified desired locations. Four solution methods are proposed--mixed integer programming, Benders' decomposition, linear programming with restricted basis entry, and a new switching heuristic. The switching algorithm combines an interchange heuristic and the simplex method for linear programming. Experimental results on seven test problems show that the switching heuristic is superior to the other methods in terms of solution quality, as measured by the objective function, and computation time. |
|
Variations of the satellite location problem are also examined. The problem variations considered are the addition of feasible arcs for satellites, alternate objective functions, and the use of less conservative, location-dependent, minimum required orbital separations. Experiments with these variations are performed on the seven test problems and one large "real-world" problem using the switching heuristic. It is demonstrated that the use of location-dependent satellite separations requires only minor modification to the implementation of the switching heuristic. Substantially more extensive changes would be necessary to apply any of the other three solution methods to this variation in the satellite location problem. |
|
Further applications of and extensions to the switching heuristic are suggested. |
| Subject |
Communication satellites.
|
|
Linear programming.
|
|
Mathematical programming.
|
|
Orbit spectrum utilization.
|
|
Synchronous satellites.
|
|
Geostationary satellites.
|
|
Artificial satellites in telecommunication.
|
|
Artificial satellites in telecommunication. (OCoLC)fst00817444
|
|
Geostationary satellites. (OCoLC)fst00941108
|
| Added Author |
Reilly, Charles H. (Charles Henry)
|
|
Mount-Campbell, Clark A.
|
|
Ohio State University. ElectroScience Laboratory.
|
|
Lewis Research Center.
|
| In: |
Dissertation Abstracts International 47-10B. |
| Other Form: |
Gonsalvez, David J.A. (David Joseph Antony), 1956- On orbital allotments for geostationary satellites. 1 v. (OCoLC)275278694 |
| Gpo Item No. |
0830-H-14 (online) |
| Sudoc No. |
NAS 1.26:181017 |
|
