A model-based launch vehicle demand chain construction method

By constructing a launch vehicle demand chain and using complex network theory to define the relationships between demand loops and the weights of calculation points, the problems of incompleteness and consistency in launch vehicle demand management are solved, enabling accurate demand analysis and rapid iterative design, and improving R&D efficiency.

CN120046237BActive Publication Date: 2026-03-24SHANGHAI AEROSPACE SYST ENG INST
View PDF 2 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-12-30
Publication Date
2026-03-24

AI Technical Summary

Technical Problem

In traditional launch vehicle development, demand management suffers from incomplete and inconsistent requirements, leading to frequent demand changes, making it difficult to trace and control requirements, and increasing development costs and cycle risks.

Method used

The launch vehicle demand chain is constructed using complex network theory. By defining the relationships between demand loops, a demand network of missions, systems, subsystems and individual units is built. The point weights of demand nodes are calculated to form a demand baseline with controlled technical status.

Benefits of technology

It has improved the integrity and consistency of launch vehicle requirements management, enabled accurate requirements analysis and rapid iterative design, reduced requirements inconsistencies and the difficulty of changes, and improved R&D efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120046237B_ABST
    Figure CN120046237B_ABST
Patent Text Reader

Abstract

A model-based launch vehicle demand chain construction method aims to solve the problems of poor demand integrity and consistency, difficulty in analyzing the correlation between demands, and difficulty in grasping the importance of demands in launch vehicle demand management. The complex network theory is applied to the construction of multi-level demand loop correlation relationship of launch vehicle task demand, system demand, subsystem demand and single machine demand, forming a complete launch vehicle demand chain. It includes defining the demand correlation relationship in the demand chain, constructing the task demand network, system demand network, subsystem demand network, single machine demand network and demand loop network, using point weight to quantitatively analyze the importance of demands in the demand chain, and finally releasing the demand chain to ensure that the demand technical state is controlled. The present application can reduce the actual engineering problems of inconsistent demands and difficulty in changing, and help to improve the demand management level of launch vehicles and accelerate the iteration speed of model development.
Need to check novelty before this filing date? Find Prior Art

Description

TECHNICAL FIELD

[0001] The application relates to a model-based launch vehicle demand chain construction method and belongs to the technical field of spaceflight. BACKGROUND

[0002] In traditional launch vehicle research and development, demand elements, scheme elements, design elements, production elements and test elements are described in words, and demands cannot be mapped, task demand analysis cannot be accurate, and demand changes are frequent in the later period; rocket development is a multi-party cooperation across departments, units and regions, involving type overall, engineering overall, subsystem, single machine and component, and the like, and is characterized by large-scale text, multiple versions, great technical management difficulty, low coupling degree of development line technical documents, poor demand integrity and consistency, difficulty in tracing, increased difficulty in demand change control in scheme demonstration and product development, poor consistency between top-level demand and final product, and intensified development cost and task cycle risk, under the background, research and application of a model-based launch vehicle development method are carried out, a model-based launch vehicle demand chain is constructed from task demand, and this is a crucial link. SUMMARY

[0003] The technical problem to be solved by the application is to overcome the shortcomings of the prior art, and a model-based launch vehicle demand chain construction method is provided, which is applied to demand chain construction between different levels of launch vehicle task demand, system demand, subsystem demand and single machine demand, improves the rocket demand management level, solves the problems of poor demand integrity and consistency, and provides data support for rocket rapid iteration.

[0004] The object of the application is achieved by the following technical scheme:

[0005] A model-based launch vehicle demand chain construction method comprises:

[0006] (1) defining the association relationship of each node between demand loops;

[0007] (2) constructing a same-level demand network, including a task demand network G a , a system demand network G b , a subsystem demand network G c and a single machine demand network G d ;

[0008] (3) constructing a cross-level demand network, including a demand loop association network G a-b-c-d ;

[0009] (4) Demand node point weight calculation in demand chain: analyze the same level out weight, same level in weight, upper level in weight and lower level out weight of each demand node in the demand chain, calculate the point weight of the demand node, and determine the importance of the demand in different levels based on the point weight;

[0010] (5) Demand chain release: build and release the demand version controlled by the technology status, and form the demand baseline.

[0011] Preferably, in step (1), the association relationship is copy, track, inheritance, improvement, satisfaction and verification, and the association relationship edge is a single edge.

[0012] Preferably, the task demand network G a =(V a ,E a ,W a ), wherein V a is a set of task demand nodes, E a is a set of association relationship edges between different task demand nodes, and W a is a set of weights of each association edge.

[0013] Preferably, the system demand network G b =(V b ,E b ,W b ), wherein V b is a set of system demand nodes, E b is a set of association relationship edges between different system demand nodes, and W b is a set of weights of each association edge.

[0014] Preferably, the subsystem demand network G c =(V c ,E c ,W c ), wherein V c is a set of subsystem demand nodes, E c is a set of association relationship edges between different subsystem demand nodes, and W c is a set of weights of each association edge.

[0015] Preferably, the single machine demand network G d =(V d ,E d ,W d ), wherein V d is a set of single machine demand nodes, E d is a set of association relationship edges between different single machine demand nodes, and W d is a set of weights of each association edge.

[0016] Preferably, the demand loop association network G a-b-c-d=(G a G b G c G d E ab E bc E cd W ab W bc W cd ), by the task requirement network G a System requirements network G b Subsystem requirement G c Single-machine requirement G d Composition, of which E ab G represents a With G b The set of associated edges, where E bc G represents b With G c The set of associated edges, where E cd G represents c With G d The set of associated edges, W ab W bc W cd For the weight set of the corresponding edge set,

[0017] Preferably, in step (4), the importance of a demand is identified by the point weights of the demand nodes in the demand loop, including the upper-level entry point weight (UIP). t,s Level-of-service entry point (LIP) t,s Subordinate DIP (Delegation Points) t,s LIP (Level of Intake) t,s t∈(a,b,c,d), s represents a node;

[0018] (a) Access to superiors

[0019] (b) Access rights for peer-level demands

[0020] (c) Subordinate demand origination authority

[0021] (d) Right to request requests from peers

[0022] (e) Demand node weight P t,s =UIP t,s +LIP t,s +DIP t,s +LIP t,s

[0023] t1 and t2 represent different values ​​of t, and the subscripts 1, 2... of t1 and t2 represent the level; i and j represent different requirement nodes at the same level.

[0024] Compared with the prior art, the present invention has the following advantages:

[0025] (1) This invention constructs a complex network covering multiple levels of requirements for launch vehicles, a complex product. By constructing relationships between requirements, it helps to solve the problems of poor integrity and consistency of requirements for complex products.

[0026] (2) This invention starts with task requirements, and realizes the decomposition and correlation of requirements layer by layer, which helps to accurately grasp task requirements, improve the matching between products and tasks, and realize positive design.

[0027] (3) This invention calculates the weight of each demand node in the demand network by using the upper-level entry point weight, the same-level entry point weight, the lower-level exit point weight, and the same-level exit point weight, which helps to quantitatively analyze the importance and priority of complex product demands.

[0028] (4) Based on the MBSE methodology, this invention constructs a multi-level requirement network, which helps to assess the impact of rapid changes, realize rapid iterative product design, and improve product design efficiency.

[0029] (5) This invention introduces complex network technology into the demand management of launch vehicles, a complex product, and proposes a multi-level complex network that matches the product design, which helps to improve the level of demand management for complex products. Attached Figure Description

[0030] Figure 1 A demand loop diagram based on complex networks;

[0031] Figure 2 A weighted graph of demand nodes;

[0032] Figure 3 The loop from satellite mission requirements to the single-unit requirements of the satellite-rocket adapter. Detailed Implementation

[0033] To make the objectives, technical solutions, and advantages of the present invention clearer, the embodiments of the present invention will be described in further detail below with reference to the accompanying drawings.

[0034] A model-based method for constructing a launch vehicle demand chain aims to address problems in launch vehicle demand management, such as poor demand completeness and consistency, difficulty in analyzing the relationships between demands, and difficulty in grasping the importance of demands. Complex network theory is applied to construct multi-level demand loop relationships, including mission requirements, system requirements, subsystem requirements, and individual unit requirements, forming a complete launch vehicle demand chain. This includes defining the demand relationships within the demand chain, constructing mission demand networks, system demand networks, subsystem demand networks, individual unit demand networks, and demand loop networks, using point weights to quantitatively analyze the importance of demands in the demand chain, and finally, ensuring the technical status of demands is under control by publishing the demand chain. This invention can reduce practical engineering problems such as inconsistent and difficult-to-change demands, helping to improve the level of launch vehicle demand management and accelerate the iteration speed of model development.

[0035] Specifically:

[0036] A model-based method for constructing the demand chain of launch vehicles, comprising:

[0037] (1) Using complex network theory, define the relationships between nodes.

[0038] Using complex network theory, the relationships between nodes in the demand loop are defined. These relationships are categorized into replication, tracking, inheritance, improvement, satisfaction, and verification, and all edges in these relationships are unidirectional.

[0039] (2) Constructing the task requirement network G a System Requirements Network G b Subsystem Requirements Network G c Single-machine network requirements G d

[0040] Analyze mission objectives and meet the top-level needs of stakeholders to construct the launch vehicle mission requirement network G. a =(V a E a W a ), where V a E is the set of task requirement nodes. a W is a set of edges representing the relationships between nodes with different task requirements. a It is the set of weights for each associated edge, see Figure 1 .

[0041] To meet mission requirements, the rocket system must possess certain system requirements, including functions, performance, and interfaces. A launch vehicle system requirement network G is then constructed. b =(V b E b W b ), where V b E is the set of system requirement nodes. bW is a set of edges representing the relationships between different system requirement nodes. b It is the set of weights for each associated edge, see Figure 1 .

[0042] To meet system requirements, the analysis identifies the functional, performance, and interface requirements of each subsystem of the rocket, and constructs a requirement network G for each subsystem of the launch vehicle. c =(V c E c W c ), where V c E is the set of subsystem requirement nodes. c W is a set of edges representing the relationships between different subsystem requirement nodes. c It is the set of weights for each associated edge, see Figure 1 .

[0043] To meet the requirements of each subsystem, the individual machine requirements, such as functions, performance, and interfaces, must be analyzed, and a single-machine requirement network G for the launch vehicle is constructed. d =(V d E d W d ), where V d E is a set of single-machine demand nodes. d W is a set of edges representing the relationships between different single-machine demand nodes. d It is the set of weights for each associated edge, see Figure 1 .

[0044] (3) Construct a demand loop correlation network G a-b-c-d

[0045] Based on the relationships between different levels of requirements—task requirements, system requirements, subsystem requirements, and single-machine requirements—a requirement loop relationship network is constructed:

[0046] G a-b-c-d =(G a G b G c G d E ab E bc E cd W ab W bc W cd ), which is composed of the task requirement network G a System requirements network G b Subsystem requirement G c Single-machine requirement G d Composition, of which E ab G represents a With G b The set of associated edges, where Ebc G represents b With G c The set of associated edges, where E cd G represents c With G d The set of associated edges, W ab W bc W cd For the weight set of the corresponding edge set, see Figure 1 .

[0047] (4) Connecting the network G through demand loops a-b-c-d Point weights are used to determine the importance of demand nodes in the network.

[0048] The importance of a requirement is indicated by the weight of the requirement nodes in the requirement loop, including the upper-level entry point weight (UIP). t,s Level-of-service entry point (LIP) t,s Subordinate DIP (Delegation Points) t,s LIP (Level of Intake) t,s , t∈(a,b,c,d), s represents a node.

[0049] (a) Access to superiors

[0050] (b) Access rights for peer-level demands

[0051] (c) Subordinate demand origination authority

[0052] (d) Right to request requests from peers

[0053] (e) Demand node weight P t,s =UIP t,s +LIP t,s +DIP t,s +LIP t,s

[0054] t1 and t2 represent different values ​​of t, and the subscripts "1, 2..." of t1 and t2 indicate the level; i and j represent different requirement nodes at the same level.

[0055] See Figure 2 s node is V b,3 The superior's entry point authority is w ab,23 and w ab,43 The entry point weight at the same level is w b,23 The lower-level point-issuing authority is w bc,32 The point weight at the same level is w b,34 V b,3 =w ab,23 +w ab,43 +wb,23 +w bc,32 +w b,34 .

[0056] (5) Demand chain release, forming demand baseline.

[0057] The demand chain release includes building and releasing a technology-controlled demand loop association network to form a demand baseline.

[0058] Example:

[0059] Taking the mission requirements of the launch vehicle and satellite as an example, and analyzing the single-unit requirements of the satellite-rocket adapter, the implementation work was carried out in the following steps:

[0060] 1. Define the relationships between nodes: Define the relationships between nodes in the demand loop. The relationships are divided into replication, tracking, inheritance, improvement and satisfaction. All relationship edges are unidirectional edges. The weights of each relationship are shown in Table 1.

[0061] Table 1. Weights of Demand Relationships

[0062] Serial number Relationship type (E) Weight (W) Meaning 1 Copy 0.8 The target party's requirements are identical to the provider's 2 Trace 0.1 The provider's modifications will cause the target party's modifications 3 Derive 0.3 The target party inherits the provider's requirements, having common points 4 Refine 0.5 The target party's requirements are more specific than the provider's 5 Satisfy 0.4 The target party's content will satisfy the provider's requirements

[0063] 2. Taking the satellite's requirements in the launch vehicle mission requirements as input, analyze the requirements of the rocket system, satellite-rocket separation system, and adapter single-unit system, and define the requirement nodes, as shown in Table 2.

[0064] Table 2 Demand Nodes

[0065]

[0066]

[0067] Based on requirement nodes, the relationships between requirements at the same level are analyzed using requirement association and weight analysis to construct a requirement network, including the task requirement network G. a System Requirements Network G b Subsystem Requirements Network G c Single-machine network requirements G d .

[0068] 3. Using demand relationships and weights, analyze cross-level demand relationships and construct a demand loop network G. a-b-c-d ,See Figure 3 .

[0069] 4. Calculation of demand node weights in the demand chain: Analyze the peer exit weights, peer entry weights, superior entry weights, and subordinate exit weights of each demand node in the demand chain to determine the weight of the demand node, and analyze the importance of demand in different levels of demand based on the weights.

[0070] Table 3 Demand Point Weights

[0071]

[0072]

[0073] 5. Demand chain release: Construct and release a demand loop network with controlled technical status to form a demand baseline for launch vehicles.

[0074] The contents not described in detail in this specification are common knowledge to those skilled in the art.

[0075] Although the present invention has been disclosed above with reference to preferred embodiments, it is not intended to limit the present invention. Any person skilled in the art can make possible changes and modifications to the technical solutions of the present invention by utilizing the methods and techniques disclosed above without departing from the spirit and scope of the present invention. Therefore, any simple modifications, equivalent changes and alterations made to the above embodiments based on the technical essence of the present invention without departing from the content of the technical solutions of the present invention shall fall within the protection scope of the technical solutions of the present invention.

Claims

1. A model-based method for constructing a launch vehicle demand chain, characterized in that, include: (1) Define the relationships between nodes in the demand loop; The required nodes include separation observation requirements, satellite size requirements, fairing size envelope requirements, satellite-rocket separation timing requirements, satellite-rocket separation system mechanical interface requirements, and satellite-rocket adapter unlocking device installation requirements. (2) Construct a hierarchical requirement network, including a task requirement network. System Requirements Network Subsystem Requirements Network Single-machine network requirements The task requirement network is among them. Includes separate observations, satellite size-related nodes, and system requirement network. Includes fairing size envelope, satellite-launch separation timing related nodes, and subsystem requirement network. Includes nodes related to the precision of the mechanical interface of the spacecraft-rocket separation system, and the network requirements for a single unit. Includes the installation of relevant nodes for the Star Arrow Adapter Unlocking Device; (3) Construct a cross-level demand network, including a demand loop association network. ; (4) Calculation of demand node weights in the demand chain: Analyze the same-level outgoing weights, same-level incoming weights, superior incoming weights, and subordinate outgoing weights of each demand node in the demand chain, calculate the weights of the demand nodes, and determine the importance of demand in different levels of demand based on the weights. (5) Demand chain release: Build and release a technically controlled version of the demand to form a demand baseline.

2. The method for constructing a launch vehicle demand chain according to claim 1, characterized in that, In step (1), the relationships are copy, track, inherit, improve, satisfy and verify, and all the edges of the relationships are unidirectional.

3. The method for constructing a launch vehicle demand chain according to claim 1, characterized in that, Task Requirements Network ,in For the set of task requirement nodes, It is a set of edges representing the relationships between nodes with different task requirements. It is the set of weights for each associated edge.

4. The method for constructing a launch vehicle demand chain according to claim 1, characterized in that, System Requirements Network ,in For the set of system requirement nodes, It is a set of edges representing the relationships between nodes that require different systems. It is the set of weights for each associated edge.

5. The method for constructing a launch vehicle demand chain according to claim 1, characterized in that, Subsystem Requirements Network ,in For the set of subsystem requirement nodes, It is a set of edges representing the relationships between different subsystem requirement nodes. It is the set of weights for each associated edge.

6. The method for constructing a launch vehicle demand chain according to claim 1, characterized in that, Single-machine demand network ,in For a single-machine demand node set, It is a set of edges representing the relationships between different individual nodes with different requirements. It is the set of weights for each associated edge.

7. The method for constructing a launch vehicle demand chain according to claim 1, characterized in that, Demand loop correlation network , by task requirement network System requirements network Subsystem requirements stand-alone requirements Composition, in which express and The set of associated edges, where express and The set of associated edges, where express and The set of associated edges, , , This is the weight set of the corresponding edge set.

8. The method for constructing a launch vehicle demand chain according to claim 1, characterized in that, In step (4), the importance of a demand is identified by the weight of the demand nodes in the demand loop, including the weight of the higher-level entry point. Same-level entry point rights Subordinates' authority to issue points Same-level right to play , , Represents a node; (a) Access rights of superiors ; (b) Access to peer-level demand ; (c) Subordinate demand authority ; (d) Right to issue requests at the same level ; (e) Demand node weights The indices 1, 2... of t1 and t2 represent different levels; i and j represent different requirement nodes at the same level.

Citation Information

Patent Citations

  • Carrier rocket rapid architecture modeling method based on MBSE

    CN116167157A

  • Carrier rocket demand change influence domain analysis method based on complex network

    CN118839919A