CN115610704A - Orbital transfer method, device and medium capable of realizing grazing flight observation task on orbit - Google Patents
Orbital transfer method, device and medium capable of realizing grazing flight observation task on orbit Download PDFInfo
- Publication number
- CN115610704A CN115610704A CN202211185563.3A CN202211185563A CN115610704A CN 115610704 A CN115610704 A CN 115610704A CN 202211185563 A CN202211185563 A CN 202211185563A CN 115610704 A CN115610704 A CN 115610704A
- Authority
- CN
- China
- Prior art keywords
- objective function
- observation
- orbit
- value
- function values
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 46
- 238000012546 transfer Methods 0.000 title claims description 61
- 238000009304 pastoral farming Methods 0.000 title description 9
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 26
- 238000005457 optimization Methods 0.000 claims abstract description 16
- 238000012216 screening Methods 0.000 claims abstract description 10
- 230000006870 function Effects 0.000 claims description 68
- 239000013598 vector Substances 0.000 claims description 9
- 238000004891 communication Methods 0.000 claims description 7
- 238000004590 computer program Methods 0.000 claims description 6
- 238000010845 search algorithm Methods 0.000 claims description 4
- 230000005484 gravity Effects 0.000 claims description 3
- 238000009434 installation Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 5
- 238000012545 processing Methods 0.000 description 4
- 230000001360 synchronised effect Effects 0.000 description 4
- 230000007547 defect Effects 0.000 description 3
- 230000002068 genetic effect Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 230000008030 elimination Effects 0.000 description 2
- 238000003379 elimination reaction Methods 0.000 description 2
- 239000011664 nicotinic acid Substances 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 238000005286 illumination Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B64—AIRCRAFT; AVIATION; COSMONAUTICS
- B64G—COSMONAUTICS; VEHICLES OR EQUIPMENT THEREFOR
- B64G1/00—Cosmonautic vehicles
- B64G1/22—Parts of, or equipment specially adapted for fitting in or to, cosmonautic vehicles
- B64G1/24—Guiding or controlling apparatus, e.g. for attitude control
- B64G1/242—Orbits and trajectories
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B64—AIRCRAFT; AVIATION; COSMONAUTICS
- B64G—COSMONAUTICS; VEHICLES OR EQUIPMENT THEREFOR
- B64G1/00—Cosmonautic vehicles
- B64G1/22—Parts of, or equipment specially adapted for fitting in or to, cosmonautic vehicles
- B64G1/24—Guiding or controlling apparatus, e.g. for attitude control
- B64G1/244—Spacecraft control systems
- B64G1/245—Attitude control algorithms for spacecraft attitude control
Landscapes
- Engineering & Computer Science (AREA)
- Remote Sensing (AREA)
- Chemical & Material Sciences (AREA)
- Combustion & Propulsion (AREA)
- Radar, Positioning & Navigation (AREA)
- Aviation & Aerospace Engineering (AREA)
- Automation & Control Theory (AREA)
- Navigation (AREA)
Abstract
The embodiment of the invention discloses an orbit changing method, device and medium capable of realizing a sweep flight observation task in an orbit, belonging to the technical field of spacecraft navigation guidance and control; the method comprises the following steps: setting a method for calculating the objective function value; according to mutually independent variables in the variables to be optimized, performing large-step traversal in a set variable value area to obtain a plurality of data points; solving the Lambert problem for each data point to obtain an objective function value corresponding to each data point; screening the objective function values corresponding to all the data points to obtain objective function values meeting set observation constraint conditions; selecting the minimum value in the objective function values which accord with the set observation constraint condition as an iteration initial value; and carrying out iterative optimization based on a sequence quadratic programming algorithm according to the iterative initial value to obtain a final approximate global optimal solution.
Description
Technical Field
The embodiment of the invention relates to the technical field of spacecraft navigation guidance and control, in particular to an orbital transfer method, device and medium capable of realizing a sweep flight observation task in an orbit.
Background
The on-orbit perception technology gradually becomes a hotspot of aerospace technology research, and the technology can perform tasks such as interception and rendezvous, space observation and the like on a space target. On-orbit fly-by-fly observation is part of an on-orbit sensing technology, and has strict requirements on relative positions of two stars at the end of transfer. In order to realize the rail sweep observation, an accurate rail transfer model needs to be constructed and optimized.
At present, the model is usually optimized by a bionic Algorithm (GA), such as a conventional Genetic Algorithm (GA), a Sequence Quadratic Programming (SQP), or a composite Algorithm combining the two algorithms, but these algorithms have the following disadvantages:
firstly, the conventional genetic algorithm and other bionic algorithms have the defects of large operation amount and unstable convergence time; secondly, the conventional sequence quadratic programming algorithm is sensitive to the iteration initial value, the optimization results are different under different initial values, the global optimal solution cannot be converged, the robustness is poor, and finally, due to the fact that satellite computing resources are few, the satellite cannot autonomously optimize the orbit transfer model in orbit and depends on the ground computing resources due to the two defects.
Disclosure of Invention
In view of this, embodiments of the present invention are to provide an orbital transfer method, apparatus, and medium capable of implementing an on-orbit fly-by observation task; the calculation amount can be reduced, the approximate global optimal solution can be quickly converged, and the robustness and the reliability are improved.
The technical scheme of the embodiment of the invention is realized as follows:
in a first aspect, an embodiment of the present invention provides an orbit changing method for realizing a fly-by-flight observation task in an orbit, where the method includes:
setting and solving a Lambert problem according to position information and speed information of a tracking satellite when the parking time length is finished, transfer time length of the tracking satellite reaching an observation point position suitable for observing a target satellite based on applying an orbital transfer pulse and coordinate values of the tracking satellite so as to obtain a target function value;
according to mutually independent variables in the variables to be optimized, performing large-step traversal in a set variable value area to obtain a plurality of data points;
respectively solving the Lambert problem for each data point to obtain a target function value corresponding to each data point;
screening the objective function values corresponding to all the data points to obtain objective function values meeting set observation constraint conditions;
selecting the minimum value in the objective function values which accord with the set observation constraint conditions as an iteration initial value;
performing iterative optimization based on a sequence quadratic programming algorithm according to the iterative initial value to obtain a final approximate global optimal solution; wherein the final approximate global optimal solution is used to optimize the orbit transfer model.
In a second aspect, an embodiment of the present invention provides an orbital transfer device that can implement a fly-by observation task in orbit, where the device includes:
a setting section configured to set a solution of a lambert problem according to position information and speed information of a tracking star at the end of a parking period, a transfer period of the tracking star to an observation point position suitable for observing a target star based on application of a varying track pulse, and a coordinate value of the tracking star to obtain an objective function value;
the traversal part is configured to perform large-step traversal in a set variable value area according to mutually independent variables in the variables to be optimized to obtain a plurality of data points;
the first solving part is configured to solve the Lambert problem for each data point respectively to obtain an objective function value corresponding to each data point;
the screening part is configured to screen objective function values corresponding to all the data points to obtain objective function values meeting set observation constraint conditions;
a selecting part configured to select a minimum value among the objective function values that meet a set observation constraint condition as an iteration initial value;
the optimization part is configured to carry out iterative optimization based on a sequence quadratic programming algorithm according to the iterative initial value to obtain a final approximate global optimal solution; wherein the final approximate global optimal solution is used to optimize the orbit transfer model.
In a third aspect, an embodiment of the present invention provides an on-board computer, where the on-board computer includes: a communication interface, a memory, and a processor; the various components are coupled together by a bus system; wherein the content of the first and second substances,
the communication interface is used for receiving and sending signals in the process of receiving and sending information with other external network elements;
the memory for storing a computer program operable on the processor;
the processor is configured to execute the steps of the orbital transfer method capable of realizing the on-orbit flying observation task according to the first aspect when the computer program is run.
In a fourth aspect, an embodiment of the present invention provides a computer storage medium, where the computer storage medium stores an orbital transfer program capable of implementing an in-orbit flying observation task, and the orbital transfer program capable of implementing the in-orbit flying observation task is executed by at least one processor, and implements the steps of the orbital transfer method capable of implementing the in-orbit flying observation task according to the first aspect.
The embodiment of the invention provides an orbit changing method, device and medium capable of realizing a sweep flight observation task in an orbit; the large-step traversal algorithm and the SQP algorithm are combined, so that the calculated amount is reduced, the rapid convergence to the approximate global optimal solution is realized, and the robustness and the reliability are improved.
Drawings
Fig. 1 is a schematic diagram of a process for executing a sweep-flight observation task according to an embodiment of the present invention.
Fig. 2 is a schematic flow chart of an orbital transfer method capable of implementing a sweep flight observation task in orbit according to an embodiment of the present invention.
Fig. 3 is a four-dimensional schematic diagram of an objective function value corresponding to each data point in a variable value area according to an embodiment of the present invention.
Fig. 4 is a schematic view of observation constraint conditions provided in an embodiment of the present invention.
Fig. 5 is a four-dimensional schematic diagram of the objective function values after the first culling according to the embodiment of the present invention.
Fig. 6 is a four-dimensional schematic diagram of the objective function value after the second culling according to the embodiment of the present invention.
Fig. 7 is a schematic composition diagram of an orbital transfer device capable of realizing a sweep flight observation task in orbit according to an embodiment of the present invention.
Fig. 8 is a schematic diagram of a specific hardware structure of a satellite computer according to an embodiment of the present invention.
Detailed Description
The technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention.
Referring to fig. 1, it shows a process for performing a grazing flight observation task provided by an embodiment of the present invention, in the embodiment of the present invention, a satellite performing the grazing flight observation task may be referred to as a tracking satellite, and an observed satellite may be referred to as a target satellite, two satellites are on coplanar circular orbits with different heights and different phases, as shown in fig. 1, the tracking satellite is in orbit 1, and the target satellite is in orbit 2. The tracking satellite performs track maneuvering in a monopulse track transfer mode; the specific process is that the time point A on the track 1 is at the moment T =0, and the mooring duration T is 1 Then reaching the point B; at this time, applying a track-changing pulse, and then passing through a transfer time length T 2 And then, the path reaches the vicinity of the observation point D as shown by a dotted line, and the sum of the two sections of time length is the total time T of the sweep flight observation task. The embodiment of the invention sets that the target star does not maneuver within the complete execution time period of the task, namely, moves from the point C to the point D on the track 2.
For the sweep flight observation task, an accurate orbit transfer model needs to be constructed and optimized in the process of orbit transfer of the tracking star. Aiming at the defects of the current optimization algorithm stated in the background technology, the embodiment of the invention is expected to reduce the calculated amount, realize the rapid convergence to the approximate global optimal solution and improve the robustness and the reliability by combining the large-step traversal algorithm and the SQP algorithm. Based on this, referring to fig. 2, an orbital transfer method for implementing a grazing flight observation task in orbit according to an embodiment of the present invention is shown, where the method may be applied to track an on-board-satellite computer (or an on-board-satellite computer), and the method may include:
s201: setting and solving a Lambert problem according to position information and speed information of a tracking satellite when the parking time length is finished, transfer time length of the tracking satellite reaching an observation point position suitable for observing a target satellite based on applying an orbital transfer pulse and coordinate values of the tracking satellite so as to obtain a target function value; understandably, the objective function value is also the magnitude of the tracking pulse;
s202: according to mutually independent variables in the variables to be optimized, performing large-step traversal in a set variable value area to obtain a plurality of data points;
s203: solving the Lambert problem for each data point to obtain an objective function value corresponding to each data point;
s204: screening the objective function values corresponding to all the data points to obtain objective function values meeting set observation constraint conditions;
s205: selecting the minimum value in the objective function values which accord with the set observation constraint conditions as an iteration initial value;
s206: performing iterative optimization based on a sequence quadratic programming algorithm according to the iterative initial value to obtain a final approximate global optimal solution; wherein the final approximate global optimal solution is used to optimize the orbit transfer model.
For the technical solution shown in fig. 1, in some possible implementations, the observation point location suitable for observing the target star is a projection point of the sun in the orbital plane of the target star, a relative location where the target star and the earth are on the same straight line, and the target star is not in a shadow area.
For the technical solution shown in fig. 1, in some possible implementations, the method further includes:
according to the motion rule of the spacecraft on the circular orbit shown in the formula (1), the tracking satellite is obtained from the starting time T =0 through the parking duration T 1 Position information and velocity information at a position where application of a pulse for track transfer is started;
wherein mu is an earth gravity constant, r is a spacecraft position vector, and r represents the distance between the spacecraft and the earth geocenter.
It should be noted that, according to the motion law shown in the foregoing implementation, the observation point position suitable for the observation target star set forth in the foregoing implementation may also be obtained through calculation.
For the technical solution shown in fig. 1, in some possible implementations, for the orbit transfer model, the variables to be optimized may include: said mooring duration T 1 The transfer duration T 2 And the coordinate value R of the x, y and z axes of the expected arrival observation position of the tracking star under the earth inertial coordinate system x 、R y 、R z ；
Aiming at the optimization variables, based on the facts that the tracking star and the target star are located on the coplanar circular orbit and the total duration of the sweep-flight observation task is fixed, the mutually independent variables in the variables to be optimized comprise: the transfer duration T 2 Coordinate value R of x and y axes of the expected arrival observation position of the tracking star in the earth inertial coordinate system x 、R y (ii) a Thus, the three mutually independent variables described above may be selected as variables for subsequent optimization iterations.
For the above implementation manner, in some examples, the performing a large-step traversal in a set variable value area according to mutually independent variables in the variables to be optimized to obtain a plurality of data points includes:
in a variable space formed by the mutually independent variables, traversing according to a depth-first search algorithm based on a step length larger than a set step length threshold value in a set variable value area to obtain a plurality of data points, wherein each data point comprises a transfer time length value and coordinate values of x and y axes of an observation position expected to be reached by the tracking satellite in an earth inertial coordinate system.
For the above example, specifically, the three variables selected by the implementation manner can form a three-dimensional variable space, and in a set variable value area in the variable space, a step size threshold can be set to represent that the traversal process belongs to large-step traversal; and then, selecting a step length larger than the step length threshold value to traverse in the variable value area according to a depth-first search algorithm, so that a plurality of data points can be conveniently obtained in the variable value area. It will be appreciated that, due to the use of large step traversal algorithms, the computational load is much less than that of genetic algorithms.
Aiming at each data point obtained by traversal, obtaining an objective function value corresponding to each data point by solving a Lambert problem; referring to fig. 3, which shows a four-dimensional illustration of the objective function value corresponding to each data point of the variable-valued area, in fig. 3, the magnitude of the objective function value is represented by a gray scale, for example, the smaller the objective function value, the larger the gray scale value (the darker the objective function value); the larger the value of the objective function, the smaller the grey value (whiter)
For the solution shown in fig. 1, in some possible implementations, the observation constraint is as shown in formula (2):
wherein r is S 、r C And r T Position vectors of the sun, the tracking star and the target star under a J2000 coordinate system are respectively;
the projection of the direction vector of the load installation for the observation on the tracking star is in the J2000 coordinate system.
For the above implementation manner, it should be noted that, at the observation time, the tracking star and the target star need to satisfy a certain relative position relationship, which mainly includes the solar illumination angle and the load observation constraint, and the constraint can be described as formula (2); in connection with fig. 4, the constraint shown in equation (2) can be considered as the coincidence region of the two observation cones in fig. 4. Of course, the tracking star still needs to maintain a certain safe distance from the target star when performing observation.
For the technical solution shown in fig. 1, in some possible implementations, the screening out objective function values corresponding to all the data points to obtain objective function values meeting set observation constraints includes:
in the objective function values corresponding to all the data points, eliminating the objective function values larger than the set objective function value threshold for the first time;
and removing the data points of which the data points do not accord with the set observation constraint condition again from the residual objective function values after the first removal to obtain the objective function values which accord with the set observation constraint condition.
For the above implementation, specifically, based on the four-dimensional representation of the objective function value corresponding to each data point shown in fig. 3, a larger objective function value may be removed through a set objective function value threshold, so that the four-dimensional representation of the objective function value after the first removal is shown in fig. 5; next, based on the four-dimensional schematic of the objective function value after the first elimination shown in fig. 5, the data points that do not meet the observation constraint condition are eliminated again according to the observation constraint condition shown in equation (2), thereby obtaining the four-dimensional schematic of the objective function value after the second elimination shown in fig. 6. At the moment, compared with the search area for subsequent SQP iterative optimization, the search area is obviously reduced, so that the calculated amount is further reduced, and a technical basis is provided for realizing orbital transfer control on the satellite on orbit; in addition, by eliminating the search area which is continuously reduced, the problem of initial value sensitivity of the conventional SQP algorithm is avoided, and in addition, the advantages of rapid convergence and stable convergence result of the SQP algorithm are combined, so that the technical scheme provided by the embodiment of the invention can rapidly and stably converge to the approximate global optimal solution, and the robustness and the stability are improved compared with the conventional scheme.
It can be understood that, according to the technical scheme set forth in the embodiment of the present invention, after the iterative initial value is obtained by screening, iterative optimization can be performed by using the current conventional SQP algorithm and the SQP improvement algorithm, so as to finally obtain an approximate global optimal solution, which can be used for optimizing the orbit transfer model, thereby enabling the satellite to realize the grazing flight observation task in orbit by using the optimized orbit transfer model.
Based on the same inventive concept of the foregoing technical solution, referring to fig. 7, an orbital transfer device 70 capable of implementing a grazing flight observation task in orbit according to an embodiment of the present invention is shown, where the device 70 includes:
a setting part 701 configured to set a solution of the lambert problem according to position information and speed information of a tracking star at the end of a parking time period, a transfer time period for the tracking star to reach an observation point position suitable for observing a target star based on application of an orbital transfer pulse, and a coordinate value of the tracking star, to obtain an objective function value, that is, a magnitude of the orbital transfer pulse;
a traversal part 702 configured to perform a large-step traversal in a set variable value area according to mutually independent variables of the variables to be optimized, so as to obtain a plurality of data points;
a solving section 703 configured to solve the lambert problem for each data point, respectively, to obtain an objective function value corresponding to each data point;
a screening part 704 configured to screen objective function values corresponding to all the data points to obtain objective function values meeting set observation constraint conditions;
a selecting section 705 configured to select a minimum value among the objective function values that meet the set observation constraint condition as an iterative initial value;
an optimization part 706 configured to perform iterative optimization based on a sequential quadratic programming algorithm according to the initial iterative value to obtain a final approximate global optimal solution; wherein the final approximate global optimal solution is used to optimize the orbit transfer model.
In some examples, the first solving portion 701 is further configured to:
according to the motion rule of the spacecraft on the circular orbit, which is shown in the following formula, the tracking satellite is obtained from the starting time T =0 through the parking time length T 1 Position information and velocity information at a position where application of a pulse for track transfer is started;
wherein mu is an earth gravity constant, r is a spacecraft position vector, and r represents the distance between the spacecraft and the earth geocentric.
In some examples, the observation point location suitable for observing the target star is a projection point of the sun in the orbit plane of the target star, the target star and the earth are in the same straight line relative position, and the target star is not in the shadow area.
In some examples, the variables to be optimized include: said mooring duration T 1 The transfer duration T 2 And the coordinate value R of the expected observation position of the tracking star on the x, y and z axes in the earth inertial coordinate system x 、R y 、R z ；
Based on the fact that the tracking star and the target star are located on the coplanar circular orbit and the total duration of the sweep flight observation task is fixed, the mutually independent variables in the variables to be optimized comprise: the transfer duration T 2 And the coordinate value R of the x and y axes of the observation position of the tracking periscope under the earth inertial coordinate system x 、R y 。
In some examples, the traversal portion 702 is configured to:
in a variable space formed by the mutually independent variables, traversing according to a depth-first search algorithm based on a step length larger than a set step length threshold value in a set variable value area to obtain a plurality of data points, wherein each data point comprises a transfer duration value and coordinate values of x and y axes of the tracked periscopic observation position in an earth inertial coordinate system.
In some examples, the filtering portion 704 is configured to:
in the objective function values corresponding to all the data points, eliminating the objective function values larger than the set objective function value threshold for the first time;
and removing the data points of which the data points do not accord with the set observation constraint condition again from the residual objective function values after the first removal to obtain the objective function values which accord with the set observation constraint condition.
In some examples, the observation constraint is as follows:
wherein r is S 、r C And r T Position vectors of the sun, the tracking star and the target star under a J2000 coordinate system are respectively;
the projection of the direction vector of the load installation for the observation on the tracking star is in the J2000 coordinate system.
It is to be understood that, in this embodiment, "part" may be part of a circuit, part of a processor, part of a program or software, or the like, and may also be a unit, and may also be a module or a non-modular.
In addition, each component in this embodiment may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a hardware mode, and can also be realized in a software functional module mode.
Based on the understanding that the technical solution of the present embodiment essentially or partly contributes to the prior art, or all or part of the technical solution may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for enabling a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to execute all or part of the steps of the method of the present embodiment. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
Therefore, the present embodiment provides a computer storage medium, where an orbital transfer program capable of implementing an in-orbit flying observation task is stored, and the orbital transfer program capable of implementing an in-orbit flying observation task is executed by at least one processor to implement the steps of the orbital transfer method capable of implementing an in-orbit flying observation task in the foregoing technical solution.
Referring to fig. 8, a specific hardware structure of an on-board computer 80 capable of implementing the orbital transfer device 70 for realizing a grazing flight observation task according to the above-mentioned orbital transfer device 70 for realizing a grazing flight observation task and a computer storage medium is shown, where the on-board computer 80 may include: a communication interface 801, a memory 802, and a processor 803; the various components are coupled together by a bus system 804. It is understood that the bus system 804 is used to enable communications among the components. The bus system 804 includes a power bus, a control bus, and a status signal bus in addition to a data bus. For clarity of illustration, however, the various buses are labeled as bus system 804 in FIG. 8. Wherein, the first and the second end of the pipe are connected with each other,
the communication interface 801 is used for receiving and sending signals in the process of receiving and sending information with other external network elements;
the memory 802 for storing a computer program capable of running on the processor 803;
the processor 803 is configured to, when the computer program is run, execute the step of the orbital transfer method that can implement the fly-by-fly observation task in the foregoing technical solution, which is not described herein again.
It will be appreciated that the memory 802 in embodiments of the invention may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The non-volatile Memory may be a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash Memory. Volatile Memory can be Random Access Memory (RAM), which acts as external cache Memory. By way of illustration and not limitation, many forms of RAM are available, such as Static random access memory (Static RAM, SRAM), dynamic Random Access Memory (DRAM), synchronous Dynamic random access memory (Synchronous DRAM, SDRAM), double Data Rate Synchronous Dynamic random access memory (ddr Data Rate SDRAM, ddr SDRAM), enhanced Synchronous SDRAM (ESDRAM), synchlink DRAM (SLDRAM), and Direct Rambus RAM (DRRAM). The memory 802 of the systems and methods described herein is intended to comprise, without being limited to, these and any other suitable types of memory.
And the processor 803 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware or instructions in the form of software in the processor 803. The Processor 803 may be a general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components. The various methods, steps and logic blocks disclosed in the embodiments of the present invention may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present invention may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in the memory 802, and the processor 803 reads the information in the memory 802, and completes the steps of the above method in combination with the hardware thereof.
It is to be understood that the embodiments described herein may be implemented in hardware, software, firmware, middleware, microcode, or any combination thereof. For a hardware implementation, the Processing units may be implemented within one or more Application Specific Integrated Circuits (ASICs), digital Signal Processors (DSPs), digital Signal Processing Devices (DSPDs), programmable Logic Devices (PLDs), field Programmable Gate Arrays (FPGAs), general purpose processors, controllers, micro-controllers, microprocessors, other electronic units configured to perform the functions described herein, or a combination thereof.
For a software implementation, the techniques described herein may be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein. The software codes may be stored in a memory and executed by a processor. The memory may be implemented within the processor or external to the processor.
It can be understood that the above-mentioned exemplary technical solutions of the orbital transfer device 70 and the on-board computer 80 capable of implementing the on-orbit flying observation task belong to the same concept as the above-mentioned technical solution of the orbital transfer method capable of implementing the on-orbit flying observation task, and therefore, the above-mentioned details that are not described in detail about the technical solutions of the orbital transfer device 70 and the on-board computer 80 capable of implementing the on-orbit flying observation task can be referred to the description of the above-mentioned technical solution of the orbital transfer method capable of implementing the on-orbit flying observation task. The embodiments of the present invention will not be described in detail herein.
It should be noted that: the technical schemes described in the embodiments of the present invention can be combined arbitrarily without conflict.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.
Claims (10)
1. An orbital transfer method capable of realizing a sweep flight observation task in an orbit, which is characterized by comprising the following steps:
setting and solving a Lambert problem according to position information and speed information of a tracking satellite at the end of a parking time length, transfer time length of the tracking satellite reaching an observation point position suitable for observing a target satellite based on applying a tracking pulse and an observation position coordinate value expected to be reached by the tracking satellite so as to obtain an objective function value;
according to mutually independent variables in the variables to be optimized, performing large-step traversal in a set variable value area to obtain a plurality of data points;
solving the Lambert problem for each data point to obtain an objective function value corresponding to each data point;
screening the objective function values corresponding to all the data points to obtain objective function values meeting set observation constraint conditions;
selecting the minimum value in the objective function values which accord with the set observation constraint conditions as an iteration initial value;
performing iterative optimization based on a sequence quadratic programming algorithm according to the iterative initial value to obtain a final approximate global optimal solution; wherein the final approximate global optimal solution is used to optimize the orbit transfer model.
2. The method of claim 1, further comprising:
according to the motion rule of the spacecraft on the circular orbit, which is shown in the following formula, the tracking satellite is obtained from the starting time T =0 through the parking time T 1 Position information and velocity information at a position where the application of the pulse is started to track;
wherein mu is an earth gravity constant, r is a spacecraft position vector, and r represents the distance between the spacecraft and the earth geocenter.
3. The method of claim 1, wherein the observation point location suitable for observing the target star is a projection point of the sun in the orbital plane of the target star, the target star and the earth are in a same straight line relative position, and the target star is not in a shadow region.
4. The method of claim 1, wherein the variables to be optimized comprise: said mooring duration T 1 The transfer duration T 2 And the coordinate value R of the expected observation position of the tracking star on the x, y and z axes in the earth inertial coordinate system x 、R y 、R z ；
Based on the fact that the tracking star and the target star are located on the coplanar circular orbit and the total duration of the sweep flight observation task is fixed, the mutually independent variables in the variables to be optimized comprise: the transfer duration T 2 Coordinate value R of x and y axes of the expected arrival observation position of the tracking star in the earth inertial coordinate system x 、R y 。
5. The method according to claim 4, wherein the performing a large-step traversal in a set variable value area according to mutually independent variables of the variables to be optimized to obtain a plurality of data points comprises:
in a variable space formed by the mutually independent variables, traversing according to a depth-first search algorithm based on a step length larger than a set step length threshold value in a set variable value area to obtain a plurality of data points, wherein each data point comprises a transfer duration value and coordinate values of x and y axes of the tracked periscopic observation position in an earth inertial coordinate system.
6. The method of claim 1, wherein the screening of the objective function values corresponding to all data points to obtain objective function values meeting set observation constraints comprises:
in the objective function values corresponding to all the data points, eliminating the objective function values larger than the set objective function value threshold for the first time;
and removing the data points of which the data points do not accord with the set observation constraint condition again from the residual objective function values after the first removal to obtain the objective function values which accord with the set observation constraint condition.
7. The method of claim 1, wherein the observation constraint is expressed by:
wherein r is S 、r C And r T Position vectors of the sun, the tracking star and the target star under a J2000 coordinate system are respectively;
the projection of the direction vector of the load installation for the observation on the tracking star is in the J2000 coordinate system.
8. An orbital transfer device capable of performing a fly-by observation task in orbit, the device comprising:
a setting section configured to set a solution of a lambert problem according to position information and speed information of a tracking star at the end of a parking period, a transfer period of the tracking star to an observation point position suitable for observing a target star based on application of a varying track pulse, and a coordinate value of the tracking star to obtain an objective function value;
the traversal part is configured to perform large-step traversal in a set variable value area according to mutually independent variables in the variables to be optimized to obtain a plurality of data points;
the solving part is configured to solve the Lambert problem for each data point respectively to obtain an objective function value corresponding to each data point;
the screening part is configured to screen objective function values corresponding to all the data points to obtain objective function values meeting set observation constraint conditions;
a selecting part configured to select a minimum value among the objective function values that meet a set observation constraint condition as an iteration initial value;
the optimization part is configured to carry out iterative optimization based on a sequence quadratic programming algorithm according to the iterative initial value to obtain a final approximate global optimal solution; wherein the final approximate global optimal solution is used to optimize the orbit transfer model.
9. An on-board computer, comprising: a communication interface, a memory and a processor; the various components are coupled together by a bus system; wherein, the first and the second end of the pipe are connected with each other,
the communication interface is used for receiving and sending signals in the process of receiving and sending information with other external network elements;
the memory for storing a computer program operable on the processor;
the processor is used for executing the steps of the orbital transfer method capable of realizing the on-orbit flying observation task in any one of claims 1 to 7 when the computer program is run.
10. A computer storage medium, characterized in that the computer storage medium stores an orbital transfer program capable of implementing an in-orbit, flying observation task, and the orbital transfer program capable of implementing an in-orbit, flying observation task implements the steps of the orbital transfer method capable of implementing an in-orbit, flying observation task according to any one of claims 1 to 7 when executed by at least one processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211185563.3A CN115610704B (en) | 2022-09-27 | 2022-09-27 | Rail changing method, device and medium capable of realizing glancing observation task on rail |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211185563.3A CN115610704B (en) | 2022-09-27 | 2022-09-27 | Rail changing method, device and medium capable of realizing glancing observation task on rail |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115610704A true CN115610704A (en) | 2023-01-17 |
| CN115610704B CN115610704B (en) | 2023-09-29 |
Family
ID=84861163
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211185563.3A Active CN115610704B (en) | 2022-09-27 | 2022-09-27 | Rail changing method, device and medium capable of realizing glancing observation task on rail |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115610704B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116295452A (en) * | 2023-03-23 | 2023-06-23 | 哈尔滨工业大学 | Single-to-multi-star continuous sweepback track optimization method and device under sunlight constraint |
| CN117009606A (en) * | 2023-09-22 | 2023-11-07 | 中科星图测控技术股份有限公司 | Constraint-considered observation star orbit maneuver entry point selection method |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160210863A1 (en) * | 2015-01-19 | 2016-07-21 | The Aerospace Corporation | Autonomous nap-of-the-earth (anoe) flight path planning for manned and unmanned rotorcraft |
| CN108582072A (en) * | 2018-04-28 | 2018-09-28 | 北京邮电大学 | A kind of space manipulator mission planning method based on improvement figure planning algorithm |
| US20190102680A1 (en) * | 2017-09-30 | 2019-04-04 | Nec Corporation | Method, device and system for estimating causality among observed variables |
| CN111609857A (en) * | 2020-06-01 | 2020-09-01 | 中国科学院微小卫星创新研究院 | Space debris orbit determination traversal observation method and system |
| CN112561160A (en) * | 2020-12-14 | 2021-03-26 | 中国人民解放军国防科技大学 | Dynamic target traversal access sequence planning method and system |
| CN114970180A (en) * | 2022-06-06 | 2022-08-30 | 哈尔滨工业大学 | On-orbit optimization method for spacecraft fly-by-flight observation |
-
2022
- 2022-09-27 CN CN202211185563.3A patent/CN115610704B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160210863A1 (en) * | 2015-01-19 | 2016-07-21 | The Aerospace Corporation | Autonomous nap-of-the-earth (anoe) flight path planning for manned and unmanned rotorcraft |
| US20190102680A1 (en) * | 2017-09-30 | 2019-04-04 | Nec Corporation | Method, device and system for estimating causality among observed variables |
| CN108582072A (en) * | 2018-04-28 | 2018-09-28 | 北京邮电大学 | A kind of space manipulator mission planning method based on improvement figure planning algorithm |
| CN111609857A (en) * | 2020-06-01 | 2020-09-01 | 中国科学院微小卫星创新研究院 | Space debris orbit determination traversal observation method and system |
| CN112561160A (en) * | 2020-12-14 | 2021-03-26 | 中国人民解放军国防科技大学 | Dynamic target traversal access sequence planning method and system |
| CN114970180A (en) * | 2022-06-06 | 2022-08-30 | 哈尔滨工业大学 | On-orbit optimization method for spacecraft fly-by-flight observation |
Non-Patent Citations (1)
| Title |
|---|
| 闫循良;廖守亿;张金生;王仕成;: "天基发射方案与规划策略仿真研究", 计算机仿真, no. 09 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116295452A (en) * | 2023-03-23 | 2023-06-23 | 哈尔滨工业大学 | Single-to-multi-star continuous sweepback track optimization method and device under sunlight constraint |
| CN116295452B (en) * | 2023-03-23 | 2023-11-14 | 哈尔滨工业大学 | Single-to-multi-star continuous sweepback track optimization method and device under sunlight constraint |
| CN117009606A (en) * | 2023-09-22 | 2023-11-07 | 中科星图测控技术股份有限公司 | Constraint-considered observation star orbit maneuver entry point selection method |
| CN117009606B (en) * | 2023-09-22 | 2023-12-29 | 中科星图测控技术股份有限公司 | Constraint-considered observation star orbit maneuver entry point selection method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115610704B (en) | 2023-09-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115610704A (en) | Orbital transfer method, device and medium capable of realizing grazing flight observation task on orbit | |
| Huang et al. | The Tianwen-1 guidance, navigation, and control for Mars entry, descent, and landing | |
| Spiller et al. | Particle swarm optimization for time-optimal spacecraft reorientation with keep-out cones | |
| US9061775B2 (en) | Method and apparatus for spacecraft attitude control using polynomial interpolation | |
| Lagona et al. | Autonomous trajectory optimisation for intelligent satellite systems and space traffic management | |
| JP7199317B2 (en) | System and method for tracking spacecraft flight paths for orbital transitions | |
| CN113031638A (en) | Constellation deployment method, device and storage medium based on time-sharing phase modulation of low-thrust satellite | |
| Shen et al. | Indirect optimization of three-dimensional multiple-impulse Moon-to-Earth transfers | |
| CN114879709A (en) | Satellite attitude control method and device for tracking observation of moving target | |
| Brandonisio et al. | Deep reinforcement learning spacecraft guidance with state uncertainty for autonomous shape reconstruction of uncooperative target | |
| Lunghi et al. | Semi-analytical adaptive guidance computation based on differential algebra for autonomous planetary landing | |
| CN114781275B (en) | Fuel control method, device and medium for spacecraft orbit interception based on artificial intelligence | |
| CN116692028A (en) | Method and device for controlling ground rapid gaze direction tracking of small satellite | |
| Luo et al. | Proximity scenario design for geostationary rendezvous with collocated satellite avoidance | |
| CN113830330A (en) | Satellite attitude pointing method and system based on relay satellite measurement and control | |
| Pesce | Autonomous navigation for close proximity operations around uncooperative space objects | |
| CN113093776A (en) | Method and device for determining off-orbit parameters of spacecraft | |
| Price et al. | Render-to-real image dataset and CNN pose estimation for down-link restricted spacecraft missions | |
| CN112902957A (en) | Missile-borne platform navigation method and system | |
| Kahraman et al. | Incorporating delayed star tracker measurements in Gokturk-2 satellite attitude filter | |
| Nascimento et al. | Automatic satellite sun sensors placement using multi-objective genetic algorithm | |
| Karpenko et al. | Fast attitude maneuvers for the lunar reconnaissance orbiter | |
| Indelman et al. | Real-time mosaic-aided aerial navigation: II. Sensor fusion | |
| CN116039957B (en) | Spacecraft online game planning method, device and medium considering barrier constraint | |
| Song et al. | Performance Enhancement of a Satellite's Onboard Antenna Tracking Profile using the Ground Station Searching Method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |