Astronomy and Astrophysics – Astronomy
Scientific paper
Aug 1984
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1984adans..54.1071l&link_type=abstract
IN: Astrodynamics 1983; Proceedings of the Conference, Lake Placid, NY, August 22-25, 1983. Part 2 (A84-30526 13-13). San Diego,
Astronomy and Astrophysics
Astronomy
Circular Orbits, Earth Orbits, Orbit Calculation, Satellite Networks, Trajectory Optimization, Algorithms, Flow Charts, Latitude, Longitude, Satellite Orbits
Scientific paper
Recently considerable attention has been given to the determination of constellations of the minimum number of satellites in a given altitude orbit which provide continuous or nearly continuous earth coverage. In many cases, however, the number of satellites required to provide continuous global coverage is excessive. In such a situation, it is attempted to find constellations which minimize the maximum satellite revisit time over all or part of the earth. 'Revisit time' is an interval of time during which a specified point on the ground is not visible to at least one of the satellites in the constellation. The 'maximum revisit time' is the largest of these intervals for a specific ground point. The present investigation is concerned with the General Optimized Revisit Program (GORP) which was developed to solve the considered problem. A description is provided of the algorithm for circular orbits, although GORP can also handle elliptical orbits.
Hanson John M.
Lang Timothy J.
No associations
LandOfFree
Orbital constellations which minimize revisit time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Orbital constellations which minimize revisit time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Orbital constellations which minimize revisit time will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1673791