Satellite on-orbit autonomous task planning method and system

Abstract

The invention discloses a satellite in-orbit autonomous task planning method and system, and relates to the technical field of satellite in-orbit autonomous task planning. The anti-interference capability of a satellite in an ionized layer abnormal region is remarkably improved through task coding of a directed acyclic graph, lightweight state snapshot and a dynamic recovery mechanism; a redundant backup path of a DAG structure supports local abnormal jump of a task sequence, and the interruption rate is reduced; fingerprint data compression and majority voting rollback reduce recovery time consumption, and response delay caused by full-amount state reconstruction in a traditional scheme is avoided; and dynamic weight adjustment optimizes backup path selection logic, and the self-healing capability of the system is enhanced.

Description

Technical Field

[0001] The present invention relates to the technical field of satellite on-orbit autonomous mission planning, and in particular to a method and system for satellite on-orbit autonomous mission planning. Background Art

[0002] Low-orbit satellite constellations have important application value in fields such as ocean monitoring and meteorological observation. Their mission planning systems need to maintain high reliability in complex space environments. The ionospheric anomaly zone near the equator forms a dense area of ​​high-energy particles due to the superposition of solar activity and geomagnetic disturbances. When the satellite passes through this area, the onboard computer is susceptible to single-particle effects, resulting in abnormal jumps in memory data. The current mainstream satellite autonomous mission planning system adopts a real-time dynamic scheduling strategy, which requires continuous maintenance of the integrity of core data structures such as task queues and resource status. The continuous interference of the ionospheric anomaly zone may cause serious problems such as command sequence confusion and mission interruption.

[0003] Current anti-interference solutions mainly focus on hardware redundancy and software fault tolerance. One type adopts a triple modular redundant TMR architecture, which executes three copies of key computing units in parallel and votes on the output. Although this can reduce the single-point failure rate, it leads to increased power consumption and computing resource usage, making it difficult to adapt to the lightweight requirements of large-scale constellations. The other type is a checkpoint recovery mechanism based on dynamic task scheduling, which periodically saves task status snapshots and rolls back to the nearest stable node in the event of an anomaly. However, frequent storage operations aggravate flash memory wear, and the recovery process requires the reconstruction of an average of 20-30 task nodes, resulting in delays in critical task responses.

[0004] Recently, some proposals have proposed new algorithms such as reinforcement learning online planning and distributed negotiation. Although they have shown superiority under normal conditions, the effects are still less than expected under ionospheric interference. The parameters of the neural network model are irreversibly damaged due to memory bit flips, resulting in the failure of the planning strategy; the communication links that multi-satellite collaboration relies on have a sudden increase in bit error rate in ionospheric disturbances, causing task allocation conflicts. Summary of the Invention

[0005] In view of the above existing problems, the present invention is proposed.

[0006] The present invention provides a method and system for autonomous on-orbit satellite mission planning to solve the problem that existing solutions rely on high-energy redundant hardware or inefficient state rollback, making it difficult to cope with multi-bit flipping and communication interference in ionospheric anomaly areas.

[0007] In order to solve the above technical problems, the present invention provides the following technical solutions:

[0008] In a first aspect, an embodiment of the present invention provides a satellite on-orbit autonomous mission planning system, which includes:

[0009] Task scheduling module, used to generate and maintain dynamic task sequences;

[0010] A DAG encoding module, connected to the task scheduling module, encodes the dynamic task sequence into a directed acyclic graph structure comprising multiple nodes, wherein each node corresponds to a single task instruction, and hash check values ​​based on task parameters are set between adjacent nodes;

[0011] A state snapshot module interacts with the task scheduling module to compress the core variables of the current task queue according to a preset period to generate fingerprint data;

[0012] The verification recovery module is configured to trigger a task path jump or state rollback operation when an abnormal hash verification value or inconsistent fingerprint data is detected;

[0013] The directed acyclic graph structure includes at least one main execution path and two backup paths.

[0014] As a preferred solution of the satellite on-orbit autonomous mission planning system described in the present invention, wherein: in the DAG encoding module, each node contains a task type identifier, an execution time window, and resource requirement parameters, and the dependency relationship between nodes is established through the parent-child association of the task type identifier;

[0015] After concatenating the task type identifiers, execution time window start values, and resource requirement parameters of adjacent nodes, a unique checksum is generated using a preset hash function.

[0016] As a preferred solution of the satellite on-orbit autonomous mission planning system described in the present invention, wherein: in the DAG encoding module, a directed acyclic graph structure G = (V, E) is defined, wherein the vertex set V = {N1, ..., N M}, edge set Each node N i Expressed as:

[0017] N i =(t i ,s i ,e i ,r i ),

[0018] Among them, t i Indicates the task type identifier of the i-th node, s i Indicates the starting value of the execution time window of the i-th node, e i represents the termination value of the execution time window of the i-th node, r i Represents the resource requirement parameters of the i-th node. The dependency relationship between nodes is established by the parent-child association of task type identifiers: if N i N j The parent type of , then (i, j)∈E;

[0019] For each dependency edge (i, j), the task type identifiers, execution time window start values, and resource requirement parameters of the adjacent nodes are concatenated in sequence, and the SHA256 hash algorithm is applied. The high 32 bits of the output are intercepted to generate the checksum:

[0020] h i→j =TR 32 (SHA256(t i ||s i ||r i ||t j ||s j ||r j )),

[0021] Among them, t i Indicates the task type identifier of the i-th node, s i represents the starting value of the execution time window of the i-th node, r i represents the resource requirement parameter of the i-th node, t j Indicates the task type identifier of the jth node, s j represents the starting value of the execution time window of the jth node, r j represents the resource requirement parameter of the jth node, h i→j Represents the hash check value of the corresponding dependency edge (i, j).

[0022] As a preferred solution of the satellite on-orbit autonomous mission planning system of the present invention, the backup path of the directed acyclic graph structure meets the following conditions:

[0023] The number of nodes in the main execution path is N, and the first backup path contains at least N-2 nodes that overlap with the main path;

[0024] The starting node of the second backup path is the same as the third node of the primary path, and the end node points to the second-to-last node of the primary path;

[0025] The inter-node hash checksum for each backup path is generated independently of the primary path.

[0026] As a preferred solution of the satellite on-orbit autonomous mission planning system of the present invention, the execution logic of the state snapshot module includes:

[0027] Inserting a synchronization mark point in the task sequence, when the task scheduling module processes to the synchronization mark point, extracting the current satellite power, storage occupancy rate and task queue pointer;

[0028] The extracted variables are converted into fixed-length fingerprint data using a preset compression algorithm and stored in an ECC-protected memory partition;

[0029] When the difference between the checksums of the fingerprint data exceeds a threshold for three consecutive times, the majority voting rollback mechanism of the checksum recovery module is triggered;

[0030] During the conversion to fixed-length fingerprint data, the variable extraction rules are as follows:

[0031] The power value is discretized with an accuracy of 0.5% and mapped to an integer range of 0-200;

[0032] The storage occupancy rate is divided into 10 levels with a step size of 10%, and is encoded as a 4-bit binary number;

[0033] The task queue pointer and the current orbit period digital-analog operation result are concatenated into 16-bit data.

[0034] As a preferred solution of the satellite on-orbit autonomous mission planning system of the present invention, the compression algorithm satisfies:

[0035] The power value is quantized using piecewise linear coding, mapping 0-100% power to an 8-bit binary number;

[0036] Logarithmic scaling encoding is used for storage occupancy to generate a 6-bit feature value;

[0037] The task queue pointer and timestamp are concatenated and then subjected to a circular shift operation to generate the remaining bit data, which is finally combined into 24-bit fingerprint data;

[0038] The compression algorithm process includes:

[0039] Perform binary left shift of 12 bits on the discretized power value;

[0040] The storage occupancy rate code is shifted right by 8 bits and then bitwise-ORed with the power value;

[0041] The concatenation result of the queue pointer and orbit period is added to the lower 16 bits.

[0042] As a preferred solution of the satellite on-orbit autonomous mission planning system described in the present invention, the state snapshot module extracts the discretized power value d, storage occupancy rate α, task queue pointer q, and orbital cycle number T, and generates 24-bit fixed-length fingerprint data F using the following preset compression algorithm:

[0043]

[0044] u=q mod2 5 ,

[0045] v=T mod 2 5 ,

[0046] W=(u<<5)|v,

[0047] F=(b<<16)∣(s<<10)∣W,

[0048] Where d represents the discretized power value, α represents the decimal form of the current storage occupancy rate, q represents the task queue pointer, T represents the current orbital cycle number, b represents the quantized 8-bit power code, s represents the 6-bit storage occupancy code generated by logarithmic scaling, u represents the lower 5 bits of the task queue pointer, v represents the lower 5 bits of the orbital cycle number, W represents the 10-bit intermediate code obtained by bitwise ORing u with v after shifting it left by 5 bits, and F represents the final 24-bit fixed-length fingerprint data. Indicates rounding down, log2 indicates logarithm with base 2, mod indicates modular operation, < indicates binary left shift, and ∣ indicates bitwise OR operation.

[0049] As a preferred solution of the satellite on-orbit autonomous mission planning system of the present invention, the operation of the verification and recovery module includes:

[0050] When a single node fails hash verification, the node is skipped along the backup path to continue executing subsequent tasks, and the abnormal node is marked as pending repair;

[0051] When the fingerprint data verification fails, load at least two consistent versions of the latest three fingerprint data, and reconstruct the task queue pointer and resource status parameters based on the version;

[0052] After the state rollback is completed, a request is made to the DAG encoding module to rebuild the hash check chain of the affected nodes.

[0053] As a preferred solution of the satellite on-orbit autonomous mission planning system of the present invention, the dynamic weight of the backup path is adjusted according to the historical bit flip record, specifically:

[0054] For nodes that have experienced verification anomalies in the past 24 hours, the priority weight of the associated backup path is increased to 1.2 times that of the primary path;

[0055] When two backup paths associated with the same node both experience verification anomalies, a third backup path is temporarily generated, and the inter-node hash check value of this path is calculated using double bit width.

[0056] In a second aspect, the present invention provides a method for autonomous on-orbit mission planning of a satellite, comprising:

[0057] Step S1, generating an initial task sequence through a task scheduling module and converting it into a directed acyclic graph structure with redundant backup;

[0058] Step S2: During the task execution, the system status is captured according to a preset period and compressed fingerprint data is generated;

[0059] Step S3: When an instruction stream checksum anomaly or fingerprint data inconsistency is detected, the system switches to the backup path to continue execution and restores the consistency state based on the historical fingerprint copy.

[0060] Step S4: After the satellite leaves the ionospheric anomaly area, the hash check chain of the damaged node is reconstructed and the backup path weight distribution is optimized.

[0061] The beneficial effects of the present invention are as follows: the present invention significantly improves the anti-interference capability of satellites in ionospheric anomaly areas through directed acyclic graph task encoding, lightweight state snapshots and dynamic recovery mechanisms; the redundant backup paths of the DAG structure support local abnormal jumps of task sequences and reduce the interruption rate; compressed fingerprint data and majority vote rollback reduce recovery time and avoid response delays caused by full state reconstruction in traditional solutions; dynamic weight adjustment optimizes the backup path selection logic and enhances the system's self-healing capability;

[0062] The present invention realizes instruction stream integrity protection under limited resources, takes into account both real-time performance and reliability, and adapts to the long-term autonomous operation requirements of low-orbit constellations in extreme space environments. BRIEF DESCRIPTION OF THE DRAWINGS

[0063] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0064] Figure 1 This is a schematic diagram of the framework of the satellite on-orbit autonomous mission planning system in Example 1.

[0065] Figure 2 This is a flow chart of the satellite on-orbit autonomous mission planning method in Example 1. DETAILED DESCRIPTION

[0066] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the specific embodiments of the present invention are described in detail below with reference to the accompanying drawings.

[0067] In the following description, many specific details are set forth to facilitate a full understanding of the present invention. However, the present invention may also be implemented in other ways different from those described herein. Those skilled in the art may make similar generalizations without violating the connotation of the present invention. Therefore, the present invention is not limited to the specific embodiments disclosed below.

[0068] Secondly, the term "one embodiment" or "embodiment" herein refers to a specific feature, structure, or characteristic that may be included in at least one implementation of the present invention. The phrase "in one embodiment" appearing in various places throughout this specification does not necessarily refer to the same embodiment, nor does it refer to a separate or selective embodiment that is mutually exclusive of other embodiments.

[0069] Example 1, reference Figure 1 and Figure 2 This embodiment provides a satellite on-orbit autonomous mission planning system, including:

[0070] Task scheduling module, used to generate and maintain dynamic task sequences;

[0071] The DAG encoding module is connected to the task scheduling module and encodes the dynamic task sequence into a directed acyclic graph structure containing multiple nodes, where each node corresponds to a single task instruction and adjacent nodes are set with hash values ​​based on task parameters;

[0072] In the DAG encoding module, each node contains a task type identifier, an execution time window, and resource requirement parameters, and the dependency between nodes is established through the parent-child association of the task type identifier;

[0073] After concatenating the task type identifiers, execution time window start values, and resource requirement parameters of adjacent nodes, a unique checksum is generated using a preset hash function (SHA-256 truncated to 32 bits).

[0074] In the DAG encoding module, a directed acyclic graph structure G = (V, E) is defined, where the vertex set V = {N1,…,N M}, edge set Each node N i Expressed as:

[0075] N i =(t i ,s i ,e i ,r i ),

[0076] Among them, t i Indicates the task type identifier of the i-th node, s i Indicates the starting value of the execution time window of the i-th node, e i represents the termination value of the execution time window of the i-th node, r i Represents the resource requirement parameters of the i-th node. The dependency relationship between nodes is established by the parent-child association of task type identifiers: if N i N j The parent type of , then (i, j)∈E;

[0077] For each dependency edge (i, j), the task type identifiers, execution time window start values, and resource requirement parameters of the adjacent nodes are concatenated in sequence, and the SHA256 hash algorithm is applied. The high 32 bits of the output are intercepted to generate the checksum:

[0078] h i→j =TR 32 (SHA256(t i ||s i ||r i ||t j ||s j ||r j )),

[0079] Among them, t i Indicates the task type identifier of the i-th node, s i represents the starting value of the execution time window of the i-th node, r i represents the resource requirement parameter of the i-th node, t j Indicates the task type identifier of the jth node, s j represents the starting value of the execution time window of the jth node, r j represents the resource requirement parameter of the jth node, h i→j Represents the hash check value of the corresponding dependency edge (i, j);

[0080] Specifically, by concatenating the key fields of adjacent nodes and truncating the high 32 bits of SHA256, we can ensure verification strength while reducing storage overhead. By incorporating the execution time window start value and resource requirement parameters into the verification scope, we can capture parameter tampering or transmission errors in real time during chain execution. Dependencies are established by parent-child associations of task type identifiers, making graph traversal and backup path generation more direct.

[0081] The backup path of the directed acyclic graph structure meets the following conditions:

[0082] The number of nodes in the main execution path is N, and the first backup path contains at least N-2 nodes that overlap with the main path;

[0083] The starting node of the second backup path is the same as the third node of the primary path, and the end node points to the second-to-last node of the primary path;

[0084] The inter-node hash checksum of each backup path is generated independently of the primary path;

[0085] The state snapshot module interacts with the task scheduling module to compress the core variables of the current task queue to generate fingerprint data according to the preset period;

[0086] The execution logic of the state snapshot module includes:

[0087] Insert synchronization mark points into the task sequence. When the task scheduling module processes the synchronization mark points, it extracts the current satellite power, storage occupancy rate and task queue pointer.

[0088] The extracted variables are converted into fixed-length fingerprint data using a preset compression algorithm and stored in an ECC-protected memory partition;

[0089] When the checksum difference of fingerprint data exceeds the threshold for three consecutive times, the majority voting rollback mechanism of the checksum recovery module is triggered;

[0090] During the conversion to fixed-length fingerprint data, the variable extraction rules are as follows:

[0091] The power value is discretized with an accuracy of 0.5% and mapped to an integer range of 0-200;

[0092] The storage occupancy rate is divided into 10 levels with a step size of 10%, and is encoded as a 4-bit binary number;

[0093] The task queue pointer and the current orbit period digital-analog operation result are concatenated into 16-bit data;

[0094] The compression algorithm satisfies:

[0095] The power value is quantized using piecewise linear coding, mapping 0-100% power to an 8-bit binary number;

[0096] Logarithmic scaling encoding is used for storage occupancy to generate a 6-bit feature value;

[0097] The task queue pointer and the timestamp are concatenated and then subjected to a circular shift operation to generate the remaining bit data, which is finally combined into 24-bit fingerprint data;

[0098] The compression algorithm process includes:

[0099] Perform binary left shift of 12 bits on the discretized power value;

[0100] The storage occupancy rate code is right-shifted by 8 bits and then bitwise-ORed with the power value;

[0101] Add the queue pointer and orbit period splicing result to the lower 16 bits;

[0102] In the state snapshot module, the discretized power value d, storage occupancy α, task queue pointer q, and orbit cycle number T are extracted, and a 24-bit fixed-length fingerprint data F is generated using the following preset compression algorithm:

[0103]

[0104] u=q mod2 5 ,

[0105] v=T mod 25 ,

[0106] W=(u<<5)|v,

[0107] F=(b<<16)∣(s<<10)∣W,

[0108] Where d represents the discretized power value, α represents the decimal form of the current storage occupancy rate, q represents the task queue pointer, T represents the current orbital cycle number, b represents the quantized 8-bit power code, s represents the 6-bit storage occupancy code generated by logarithmic scaling, u represents the lower 5 bits of the task queue pointer, v represents the lower 5 bits of the orbital cycle number, W represents the 10-bit intermediate code obtained by bitwise ORing u with v after shifting it left by 5 bits, and F represents the final 24-bit fixed-length fingerprint data. Indicates rounding down, log2 indicates logarithm with base 2, mod indicates modular operation, < indicates binary left shift, ∣ indicates bitwise OR operation;

[0109] The binary operation process includes:

[0110] Calculate the quantization code: The result is 8-bit binary.

[0111] Shift the 8-bit b left by 16 bits to generate the high-order 8-bit field and store it in bits 23-16.

[0112] Compute logarithmic codes: The result is 6 bits of binary.

[0113] Left shift alignment: Shift the 6-bit s left by 10 bits and place it at bits 15-10.

[0114] Extract low bit: u=q mod2 5 , v=T mod2 5 , each is 5 bits in binary,

[0115] Splicing generation: First shift u left by 5 bits to get u<<5, then bitwise OR it with v to get the 10-bit intermediate code W, which is located at bits 9-0.

[0116] Combine the three parts bitwise OR: F = (b<<16)|(s<<10)|W to form a 24-bit fixed-length fingerprint;

[0117] Specifically, this step uses refined binary bit operations to make each variable occupy a fixed and non-overlapping bit interval in the 24-bit fingerprint, achieving structured and efficient encoding. The power value is mapped to 8 bits, which can distinguish 256 levels of changes and meet the needs of capturing small fluctuations. The logarithmic scaling of storage occupancy is compressed to 6 bits, taking into account both large capacity intervals and low occupancy precision. The queue pointer and orbit period of the lower 5 bits are spliced ​​together, and the short-term dynamic information of the two is fully preserved in the 10-bit space. Left shift and bitwise OR operations can be efficiently implemented at the hardware or firmware level without floating-point operations, improving embedded execution performance. The 24-bit fixed-length design reduces the storage and communication burden while retaining key state characteristics.

[0118] The verification recovery module is configured to trigger a task path jump or state rollback operation when an abnormal hash verification value or inconsistent fingerprint data is detected;

[0119] The directed acyclic graph structure includes at least one main execution path and two backup paths;

[0120] The operations of the verification recovery module include:

[0121] When a single node fails hash verification, the node is skipped along the backup path to continue executing subsequent tasks, and the abnormal node is marked as pending repair;

[0122] When the fingerprint data verification fails, load at least two consistent versions of the latest three fingerprint data, and reconstruct the task queue pointer and resource status parameters based on the version;

[0123] After the state rollback is completed, the DAG encoding module is requested to rebuild the hash check chain of the affected nodes;

[0124] The dynamic weight of the backup path is adjusted based on the historical bit flip records, specifically:

[0125] For nodes that have experienced verification anomalies in the past 24 hours, the priority weight of the associated backup path is increased to 1.2 times that of the primary path;

[0126] When two backup paths associated with the same node both experience verification anomalies, a third backup path is temporarily generated, and the inter-node hash check value of this path is calculated using double bit width.

[0127] This embodiment also provides a method for autonomous satellite on-orbit mission planning, including:

[0128] Step S1, generating an initial task sequence through a task scheduling module and converting it into a directed acyclic graph structure with redundant backup;

[0129] Step S2: During the task execution, the system status is captured according to a preset period and compressed fingerprint data is generated;

[0130] Step S3: When an instruction stream checksum anomaly or fingerprint data inconsistency is detected, the system switches to the backup path to continue execution and restores the consistency state based on the historical fingerprint copy.

[0131] Step S4: After the satellite leaves the ionospheric anomaly area, the hash check chain of the damaged node is reconstructed and the backup path weight distribution is optimized.

[0132] It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit the present invention. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solutions of the present invention may be modified or replaced by equivalents without departing from the spirit and scope of the technical solutions of the present invention, which should all be included in the scope of the claims of the present invention.

Claims

1. A satellite on-orbit autonomous mission planning system, characterized in that: include, Task scheduling module, used to generate and maintain dynamic task sequences; A DAG encoding module, connected to the task scheduling module, encodes the dynamic task sequence into a directed acyclic graph structure comprising multiple nodes, wherein each node corresponds to a single task instruction, and hash check values ​​based on task parameters are set between adjacent nodes; A state snapshot module interacts with the task scheduling module to compress the core variables of the current task queue according to a preset period to generate fingerprint data; The verification recovery module is configured to trigger a task path jump or state rollback operation when an abnormal hash verification value or inconsistent fingerprint data is detected; The directed acyclic graph structure includes at least one main execution path and two backup paths.

2. The satellite on-orbit autonomous mission planning system according to claim 1, characterized in that: In the DAG encoding module, each node contains a task type identifier, an execution time window, and resource requirement parameters, and the dependency between nodes is established through the parent-child association of the task type identifier; After concatenating the task type identifiers, execution time window start values, and resource requirement parameters of adjacent nodes, a unique checksum is generated using a preset hash function.

3. The satellite on-orbit autonomous mission planning system according to claim 2, characterized in that: In the DAG encoding module, a directed acyclic graph structure G = (V, E) is defined, where the vertex set V = {N1, ..., N M }, edge set Each node N i Expressed as: N i =(t i ,s i ,e i ,r i ), Among them, t i Indicates the task type identifier of the i-th node, s i Indicates the starting value of the execution time window of the i-th node, e i represents the termination value of the execution time window of the i-th node, r i Represents the resource requirement parameters of the i-th node. The dependency relationship between nodes is established by the parent-child association of task type identifiers: if N i N j The parent type of , then (i, j)∈E; For each dependency edge (i, j), the task type identifiers, execution time window start values, and resource requirement parameters of the adjacent nodes are concatenated in sequence, and the SHA256 hash algorithm is applied. The high 32 bits of the output are intercepted to generate the checksum: h i→j =TR 32 (SHA256(t i ||s i ||r i ||t j ||s j ||r j )), Among them, t i Indicates the task type identifier of the i-th node, s i represents the starting value of the execution time window of the i-th node, r i represents the resource requirement parameter of the i-th node, t j Indicates the task type identifier of the jth node, s j represents the starting value of the execution time window of the jth node, r j represents the resource requirement parameter of the jth node, h i→j Represents the hash check value of the corresponding dependency edge (i, j).

4. The satellite on-orbit autonomous mission planning system according to claim 3, characterized in that: The backup path of the directed acyclic graph structure meets the following conditions: The number of nodes in the main execution path is N, and the first backup path contains at least N-2 nodes that overlap with the main path; The starting node of the second backup path is the same as the third node of the primary path, and the end node points to the second-to-last node of the primary path; The inter-node hash checksum for each backup path is generated independently of the primary path.

5. The satellite on-orbit autonomous mission planning system according to claim 1, wherein: The execution logic of the state snapshot module includes: Inserting a synchronization mark point in the task sequence, when the task scheduling module processes to the synchronization mark point, extracting the current satellite power, storage occupancy rate and task queue pointer; The extracted variables are converted into fixed-length fingerprint data using a preset compression algorithm and stored in an ECC-protected memory partition; When the difference between the checksums of the fingerprint data exceeds a threshold for three consecutive times, the majority voting rollback mechanism of the checksum recovery module is triggered; During the conversion to fixed-length fingerprint data, the variable extraction rules are as follows: The power value is discretized with an accuracy of 0.5% and mapped to an integer range of 0-200; The storage occupancy rate is divided into 10 levels with a step size of 10%, and is encoded as a 4-bit binary number; The task queue pointer and the current orbit period digital-analog operation result are concatenated into 16-bit data.

6. The satellite on-orbit autonomous mission planning system according to claim 5, characterized in that: The compression algorithm satisfies: The power value is quantized using piecewise linear coding, mapping 0-100% power to an 8-bit binary number; Logarithmic scaling encoding is used for storage occupancy to generate a 6-bit feature value; The task queue pointer and timestamp are concatenated and then subjected to a circular shift operation to generate the remaining bit data, which is finally combined into 24-bit fingerprint data; The compression algorithm process includes: Perform binary left shift of 12 bits on the discretized power value; The storage occupancy rate code is shifted right by 8 bits and then bitwise-ORed with the power value; The concatenation result of the queue pointer and orbit period is added to the lower 16 bits.

7. The satellite on-orbit autonomous mission planning system according to claim 6, characterized in that: In the state snapshot module, the discretized power value d, storage occupancy α, task queue pointer q, and orbit cycle number T are extracted, and a 24-bit fixed-length fingerprint data F is generated using the following preset compression algorithm: u=q mod2 5 , v=T mod2 5 , W=(u<<5)|v, F=(b<<16)∣(s<<10)∣W, Where d represents the discretized power value, α represents the decimal form of the current storage occupancy rate, q represents the task queue pointer, T represents the current orbital cycle number, b represents the quantized 8-bit power code, s represents the 6-bit storage occupancy code generated by logarithmic scaling, u represents the lower 5 bits of the task queue pointer, v represents the lower 5 bits of the orbital cycle number, W represents the 10-bit intermediate code obtained by bitwise ORing u with v after shifting it left by 5 bits, and F represents the final 24-bit fixed-length fingerprint data. Indicates rounding down, log2 indicates logarithm with base 2, mod indicates modular operation, < indicates binary left shift, and ∣ indicates bitwise OR operation.

8. The satellite on-orbit autonomous mission planning system according to claim 1, wherein: The operations of the verification recovery module include: When a single node fails hash verification, the node is skipped along the backup path to continue executing subsequent tasks, and the abnormal node is marked as pending repair; When the fingerprint data verification fails, load at least two consistent versions of the latest three fingerprint data, and reconstruct the task queue pointer and resource status parameters based on the version; After the state rollback is completed, a request is made to the DAG encoding module to rebuild the hash check chain of the affected nodes.

9. The satellite on-orbit autonomous mission planning system according to claim 8, characterized in that: The dynamic weight of the backup path is adjusted according to the historical bit flip record, specifically: For nodes that have experienced verification anomalies in the past 24 hours, the priority weight of the associated backup path is increased to 1.2 times that of the primary path; When two backup paths associated with the same node both experience verification anomalies, a third backup path is temporarily generated, and the inter-node hash check value of this path is calculated using double bit width.

10. A satellite on-orbit autonomous mission planning method, based on a satellite on-orbit autonomous mission planning system according to any one of claims 1 to 9, characterized in that: include: Step S1, generating an initial task sequence through a task scheduling module and converting it into a directed acyclic graph structure with redundant backup; Step S2: During the task execution, the system status is captured according to a preset period and compressed fingerprint data is generated; Step S3: When an instruction stream checksum anomaly or fingerprint data inconsistency is detected, the system switches to the backup path to continue execution and restores the consistency state based on the historical fingerprint copy. Step S4: After the satellite leaves the ionospheric anomaly area, the hash check chain of the damaged node is reconstructed and the backup path weight distribution is optimized.

Images