Model-based carrier rocket demand chain construction method

Abstract

The invention discloses a carrier rocket demand chain construction method based on a model, and aims to solve the problems of poor demand integrity and consistency, difficulty in analyzing association relation between demands, difficulty in mastering importance of the demands and the like in carrier rocket demand management. A complex network theory is applied to construction of a multi-level demand loop association relation of a carrier rocket task demand, a system demand, a subsystem demand, a single machine demand and the like, and a complete carrier rocket demand chain is formed. Comprising the steps of defining a demand association relationship in a demand chain, constructing a task demand network, a system demand network, a subsystem demand network, a single-machine demand network and a demand loop network, quantitatively analyzing importance of demands in the demand chain by using point weights, and finally ensuring that a demand technology state is controlled by publishing the demand chain. The method can reduce the actual engineering problems of inconsistent demands, difficult change and the like, facilitates the improvement of the demand management level of the carrier rocket, and accelerates the model research and development iteration speed.

Description

Technical Field

[0001] The invention relates to a model-based launch vehicle demand chain construction method, belonging to the field of aerospace technology. Background Art

[0002] In traditional launch vehicle development, text is used to describe demand elements, program elements, design elements, production elements, and test elements. There is no way to map between requirements, and the mission requirement analysis cannot be accurate, resulting in frequent changes in later requirements. Rocket development is a cross-departmental, cross-unit, and cross-regional collaboration, involving multiple parties such as the overall model, overall engineering, subsystems, single machines, and parts and components. The text is large in size and has many versions, making technical management difficult. The coupling degree of technical documents on the development line is not high, the integrity and consistency of requirements are poor, and traceability is difficult. As a result, during the program demonstration and product development process, the difficulty of demand change control increases, the consistency between top-level requirements and final products is poor, and the development cost and mission cycle risk increase. Against this background, it is crucial to conduct research and application of model-based launch vehicle development methods, starting from mission requirements, and building a model-based launch vehicle demand chain. Summary of the invention

[0003] The technical problem to be solved by the present invention is: to overcome the shortcomings of the existing technology, and propose a model-based launch vehicle demand chain construction method, which is applied to the construction of demand chains between different levels of demand loops such as launch vehicle mission requirements, system requirements, subsystem requirements, and single-machine requirements, to improve the level of rocket demand management, solve the problems of poor demand integrity and consistency, and provide data support for rapid iteration of rockets.

[0004] The purpose of the present invention is achieved through the following technical solutions:

[0005] A launch vehicle demand chain construction method based on a model, comprising:

[0006] (1) Define the relationship between nodes in the demand loop;

[0007] (2) Constructing the same-level demand network, including the task demand network G a 、System Requirements Network G b , Subsystem Requirements Network G c , Single machine demand network G d ;

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

[0009] (4) Calculation of point weights of demand nodes in the demand chain: Analyze the same-level outgoing weights, same-level incoming weights, upper-level incoming weights, and lower-level outgoing weights of each demand node in the demand chain, calculate the point weights of the demand nodes, and determine the importance of demands at different levels based on the point weights;

[0010] (5) Demand chain release: Build and release a technically controlled demand version to form a demand baseline.

[0011] Preferably, in step (1), the association relationships are replication, tracking, inheritance, improvement, satisfaction and verification, and the association relationship edges are all unidirectional edges.

[0012] Preferably, the task requirement network G a =(V a ,E a ,W a ), where V a is the set of task requirement nodes, E a is the set of association edges between nodes with different task requirements, W a is the weight set of each incident edge.

[0013] Preferably, the system requires network G b =(V b ,E b ,W b ), where V b is the set of system demand nodes, E b is the set of association edges between different system requirement nodes, W b is the weight set of each incident edge.

[0014] Preferably, the subsystem requires network G c =(V c ,E c ,W c ), where V c is the subsystem requirement node set, E c is the set of association edges between different subsystem demand nodes, W c is the weight set of each incident edge.

[0015] Preferably, a single machine requires network G d =(V d ,E d ,W d ), where V d is the set of stand-alone demand nodes, E d is the set of association edges between different stand-alone demand nodes, W d is the weight set of each incident edge.

[0016] Preferably, the demand loop associated 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 demand G d Composition, of which E ab Represents G a With G b The set of associated edges, where E bc Represents G b With G c The set of associated edges, where E cd Represents G c With G d The set of associated edges, W ab , W bc , W cd is the weight set of the corresponding edge set,

[0017] Preferably, in step (4), the importance of the demand is identified by the point weight of the demand node in the demand loop, including the upper entry point weight UIP t,s , LIP t,s , Subordinate point right DIP t,s , LIP of the same level t,s , t∈(a,b,c,d), s represents a node;

[0018] (a) Superior access rights

[0019] (b) Same-level demand entry point rights

[0020] (c) Subordinate demand point right

[0021] (d) The right to issue points for the same level of demand

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

[0023] t 1 ,t 2 Indicates different t, t1 and t 2 The subscripts 1, 2, ... represent the levels; i and j represent different demand nodes at the same level.

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

[0025] (1) The present invention constructs a complex network covering multi-level requirements for a complex product such as a launch vehicle. By building relationships between requirements, it helps to solve the problems of poor integrity and consistency of complex product requirements.

[0026] (2) The present invention starts from the task requirements and realizes layer-by-layer decomposition and layer-by-layer association of the requirements, which helps to accurately grasp the task requirements, improve the matching between the product and the task, and realize forward design.

[0027] (3) The present invention calculates the weight of each demand node in the demand network through the superior entry point weight, the same level entry point weight, the subordinate exit point weight, and the same level exit point weight, which helps to quantify the importance and priority of complex product demands.

[0028] (4) The present invention relies on the MBSE methodology to construct a multi-level demand network, which helps to evaluate the impact of rapid changes, realize rapid iterative product design, and improve product design efficiency.

[0029] (5) The present invention introduces complex network technology into the demand management of a complex product such as a launch vehicle, and proposes a multi-level complex network that matches the product design, which helps to improve the level of complex product demand management. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] Figure 1 It is a demand loop diagram based on complex network;

[0031] Figure 2 is the demand node weight graph;

[0032] Figure 3 It is the single-machine demand loop from the satellite mission requirements to the satellite-rocket adapter. DETAILED DESCRIPTION

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

[0034] A model-based launch vehicle demand chain construction method is designed 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. Complex network theory is used to construct multi-level demand loop correlation relationships such as launch vehicle mission requirements, system requirements, subsystem requirements, and single-machine requirements to form a complete launch vehicle demand chain. It includes defining the demand correlation relationship in the demand chain, constructing the mission demand network, system demand network, subsystem demand network, single-machine demand network, and demand loop network, using point weights to quantitatively analyze the importance of demands in the demand chain, and finally ensuring that the demand technical status is controlled by publishing the demand chain. The present invention can reduce practical engineering problems such as inconsistent demands and difficulty in changing, help improve the level of launch vehicle demand management, and accelerate the speed of model research and development iteration.

[0035] Specific:

[0036] A launch vehicle demand chain construction method based on a model, comprising:

[0037] (1) Using complex network theory to define the relationship between nodes

[0038] Using complex network theory, the relationship between nodes in the demand loop is defined. The relationship is divided into replication, tracking, inheritance, improvement, satisfaction and verification, and the edges of the relationship are all unidirectional.

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

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

[0041] Analyze the system requirements such as functions, performance, interfaces, etc. that the rocket system needs to have to meet the mission requirements, and build the launch vehicle system requirements network G b =(V b ,E b ,W b ), where V b is the set of system demand nodes, E bis the set of association edges between different system requirement nodes, W b is the weight set of each associated edge, see Figure 1 .

[0042] Analyze the functions, performance, interfaces and other subsystem requirements of each rocket subsystem to meet the system requirements, and build the subsystem requirements network G of the launch vehicle c =(V c ,E c ,W c ), where V c is the subsystem requirement node set, E c is the set of association edges between different subsystem demand nodes, W c is the weight set of each associated edge, see Figure 1 .

[0043] Analyze the functions, performance, interfaces and other stand-alone requirements of each subsystem to meet the subsystem requirements, and build the launch vehicle stand-alone requirement network G d =(V d ,E d ,W d ), where V d is the set of stand-alone demand nodes, E d is the set of association edges between different stand-alone demand nodes, W d is the weight set of each associated edge, see Figure 1 .

[0044] (3) Constructing the demand loop association network G a-b-c-d

[0045] According to the correlation between different levels of requirements such as task requirements, system requirements, subsystem requirements, and single-machine requirements, a demand loop correlation 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 demand G d Composition, of which E ab Represents G a With G b The set of associated edges, where Ebc Represents G b With G c The set of associated edges, where E cd Represents G c With G d The set of associated edges, W ab , W bc , W cd is the weight set of the corresponding edge set, see Figure 1 .

[0047] (4) Connecting network G through demand loop a-b-c-d , using point weights to determine the importance of demand nodes in the network

[0048] The importance of demand is identified by the point weight of the demand node in the demand loop, including the upper entry point weight UIP t,s , LIP t,s , Subordinate point right DIP t,s , LIP of the same level t,s , t∈(a,b,c,d), s represents a node.

[0049] (a) Superior access rights

[0050] (b) Same-level demand entry point rights

[0051] (c) Subordinate demand point right

[0052] (d) The right to issue points for the same level of demand

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

[0054] t 1 ,t 2 The subscripts “1, 2...” of different t, t1 and t2 represent the levels; i and j represent different demand nodes at the same level.

[0055] See Figure 2 , s node is V b,3 , the superior entry point weight is w ab,23 and w ab,43 , the entry point weight of the same level is w b,23 , the subordinate output weight is w bc,32 , the same level point weight is w b,34 , V b,3 =wab,23 +w ab,43 +w b,23 +w bc,32 +w b,34 .

[0056] (5) Demand chain release to form demand baseline

[0057] The demand chain release includes constructing and releasing a demand loop association network with controlled technical status to form a demand baseline.

[0058] Example:

[0059] Taking the analysis of the mission requirements of the launch vehicle satellite to the single-machine requirements of the rocket adapter as an example, the implementation work is carried out. The specific execution steps are as follows:

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

[0061] Table 1 Demand association weights

[0062] Serial number Relationship Type Weight (W) meaning 1 Copy 0.8 The target party's needs are exactly the same as the provider's 2 Trace 0.1 Changes to the provider will result in changes to the target 3 Derive 0.3 The target inherits the needs of the provider and has commonalities 4 Refine 0.5 The needs of the target party are more specific than those of the provider party. 5 Satifisy 0.4 The target party's content will meet the needs of the provider

[0063] 2. Taking the satellite requirements in the launch vehicle mission requirements as input, analyze the requirements of the rocket system, the satellite-rocket separation system, and the adapter stand-alone system, and define the requirement nodes, see Table 2.

[0064] Table 2 Demand nodes

[0065]

[0066]

[0067] Based on the demand nodes, the demand association and weight are used to analyze the relationship between the same-level demands and build a demand network, including the task demand network G a 、System Requirements Network G b , Subsystem Requirements Network G c , Single machine demand network G d .

[0068] 3. Use demand associations and weights to analyze cross-level demand relationships and build a demand loop association network G a-b-c-d ,See Figure 3 .

[0069] 4. Calculation of point weights of demand nodes in the demand chain: Analyze the same-level output rights, same-level input rights, upper-level input rights, and lower-level output rights of each demand node in the demand chain, determine the point weight of the demand node, and analyze the importance of demands at different levels based on the point weight.

[0070] Table 3 Demand point weight

[0071]

[0072]

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

[0074] The contents not described in detail in the specification of the present invention belong to the common knowledge of those skilled in the art.

[0075] Although the present invention has been disclosed as above in the form of a preferred embodiment, it is not intended to limit the present invention. Any person skilled in the art may make possible changes and modifications to the technical solution of the present invention by using the methods and technical contents disclosed above without departing from the spirit and scope of the present invention. Therefore, any simple modifications, equivalent changes and modifications made to the above embodiments based on the technical essence of the present invention without departing from the content of the technical solution of the present invention shall fall within the protection scope of the technical solution of the present invention.

Claims

1. A method for constructing a launch vehicle demand chain based on a model, characterized in that: include: (1) Define the relationship between nodes in the demand loop; (2) Constructing the same-level demand network, including the task demand network G a 、System Requirements Network G b , Subsystem Requirements Network G c , Single machine demand network G d ; (3) Constructing a cross-level demand network, including the demand loop association network G a-b-c-d ; (4) Calculation of point weights of demand nodes in the demand chain: Analyze the same-level outgoing weights, same-level incoming weights, upper-level incoming weights, and lower-level outgoing weights of each demand node in the demand chain, calculate the point weights of the demand nodes, and determine the importance of demands at different levels based on the point weights; (5) Demand chain release: Build and release a technically controlled demand version 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 association relationships are copy, track, inherit, improve, satisfy and verify, and the edges of the association relationships are all unidirectional edges.

3. The method for constructing a launch vehicle demand chain according to claim 1, characterized in that: Task Requirements Network G a =(V a ,E a ,W a ), where V a is the set of task requirement nodes, E a is the set of association edges between nodes with different task requirements, W a is the weight set of each incident edge.

4. The method for constructing a launch vehicle demand chain according to claim 1, characterized in that: System Requirements Network G b =(V b ,E b ,W b ), where V b is the set of system demand nodes, E b is the set of association edges between different system requirement nodes, W b is the weight set of each incident edge.

5. The method for constructing a launch vehicle demand chain according to claim 1, characterized in that: Subsystem Requirements Network G c =(V c ,E c ,W c ), where V c is the subsystem requirement node set, E c is the set of association edges between different subsystem demand nodes, W c is the weight set of each incident edge.

6. The method for constructing a launch vehicle demand chain according to claim 1, characterized in that: Single machine demand network G d =(V d ,E d ,W d ), where V d is the set of stand-alone demand nodes, E d is the set of association edges between different stand-alone demand nodes, W d is the weight set of each incident edge.

7. The method for constructing a launch vehicle demand chain according to claim 1, characterized in that: 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 demand G d Composition, of which E ab Represents G a With G b The set of associated edges, where E bc Represents G b With G c The set of associated edges, where E cd Represents G c With G d The set of associated edges, W ab , W bc , W cd 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 the demand is identified by the point weight of the demand node in the demand loop, including the upper entry point weight UIP t,s , LIP t,s , Subordinate point right DIP t,s , LIP of the same level t,s , t∈(a,b,c,d), s represents a node; (a) Superior access rights (b) Same-level demand entry point rights (c) Subordinate demand point right (d) The right to issue points for the same level of demand (e) Demand node weight P t,s =UIP t,s +LIP t,s +DIP t,s +LIP t,s t1 and t2 represent different t, and the subscripts 1, 2, ... of t1 and t2 represent the levels; i and j represent different demand nodes at the same level.

Images