Planning the search for a space object

Planning the search for a space object

EnglishPaperback / softbackPrint on demand
Veniaminov, Stanislav
LAP Lambert Academic Publishing
EAN: 9783848408771
Print on demand
Delivery on Friday, 28. of August 2026
CZK 1,799
Common price CZK 1,999
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

A new mathematical theory of planning the search for a space object using imprecise a-priori information of its orbit parameters was developed. The basis of the theory includes the set-theoretical treatment and presentation of the space object current position uncertainty domain and its dynamics, the formulation and use of the principle of equivalence of the search plan elements for different times, and mathematical description of the phenomenon of the search plan degradation during its realization. All the main search situations taking place in the space surveillance practice were considered and investigated in terms of this theory. Some constructive means for compensation of the search plan degradation negative consequences were suggested. The most efficiency can be achieved in terms of this theory for narrow-angle and narrow-beam sensors and for acquisition of a faint intelligence signal from the sought for space object. Some of the suggested search methods have been implemented in real space surveillance sensors.
EAN 9783848408771
ISBN 3848408775
Binding Paperback / softback
Publisher LAP Lambert Academic Publishing
Pages 164
Language English
Authors Veniaminov, Stanislav
Edition Aufl.
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.