You have full access to this open access chapter, Download chapter PDF
Space exploration is in the ascendant. In order to carry more things and fly farther and higher, people are beginning to use multi-engine high-thrust rockets (Fig. 25.1). How to optimize the cooperation of these engines to make the overall energy efficiency of the rocket higher and lower cost are becoming increasingly important.
Generally, the energy efficiency of electric heating, chemical reactions and some combustion processes is very high, because most of the energy loss in nature is ultimately lost in the form of heat dissipation. However, in the process of doing work, there is inevitably a conduction process, that is, there is heat energy loss. Therefore, the actual operating efficiency is not 100%. Rocket engines are no exception.
25.1 The Energy Efficiency of a Rocket Engine
For the energy efficiency curve of a rocket engine, for the convenience of measurement, we define that the abscissa is the mass of fuel burned per unit time of the i-th engine, mi, and the ordinate is the energy efficiency of the i-th engine, ηi, ηi is replaced by kFi/ mi, k is a constant, Fi represents the thrust of the i-th engine during unit time, the curve is as shown in Fig. 25.2.
Assume the energy efficiency functions η1(m) and ηi(m) of the first and the i-th engine is as shown in Fig. 25.3.
If the following equation holds:
We call the first engine and the i-th engine as the energy efficiency similarity engines.
25.2 Analysis of Launch Process of Launch Vehicle
The total rocket thrust F is
The energy efficiency optimization problem of multi-engine rocket is
In Eq. (25.3), S is the total distance traveled by the rocket, and V is the speed of the rocket at time t.
In the vacuum resistance-free state, the kinetic energy and pressure energy output by the engine become the potential energy of the rocket, causing the rocket to rise ΔH, with the following relationship
gh is the acceleration of gravity at different altitudes, n is the number of working engines, Vi is the speed of fuel ejection by the i-th engine, Pi is the pressure of the gas ejected by the i-th engine, and M is the rocket total mass at the previous time t.
Taking resistance such as wind resistance into account, according to Newton's second law, we have
In Eq. (25.5), k1 is the wind resistance coefficient, which changes with the thinness of the air or the altitude of the rocket. The expression for F becomes
In a short period of time t, gh and k1 are approximately constant. There are two variables, V and M1. V is the current speed of the rocket, and M1 is the current total mass of the rocket.
The total mass of the rocket has been decreasing and the wind resistance has been increasing. Derive V and M1 to get the optimal thrust F.
For each F, Fi is arranged according to the principle of maximum energy efficiency, that is, the principle of minimum fuel consumption, and the corresponding fuel combustion quality mi is calculated. Then we have
where mt is the total mass ejected per unit time by the rocket.
25.3 Optimal Scheduling of Multiple Engines in a Rocket
-
1.
If the n engines are identical, the energy expression of the thrust becomes
$$ F = k_{2} m_{t} \sum\limits_{i = 1}^{n} {\theta_{i} } \eta \left( {\theta_{i} m_{t} } \right) $$(25.9)
where θi is
Consider the maximization problem of the total thrust F
This problem can also be written as
We consider three cases:
-
(1)
n = 2
The rocket has two variables and has
The objective function F can be expressed as
The optimization condition is
It is easy to see that
for the optimization point. Then we have
That is, the optimal control method is to keep
The total F is
Since the shape of the overall efficiency curve of the rocket is the same as that of a single engine, so the second derivative of F is also less than zero
F is the unique maximum value.
The overall energy efficiency ηt of the rocket is the only maximum value.
-
(2)
n = 3
The rocket has three variables, based on known conditions, we have
The F expression becomes
Assuming that θ3 is fixed and an optimization point, only θ1 and θ2 are variables, we have
Based on the conclusion of n = 2 above, there are
is the optimal point.
Assuming that θ2 is fixed and is an optimization point, only θ1 and θ3 are variables, we have
According to the conclusion of n = 2 above, there are
is the optimal point.
Similarly, assuming that θ1 is fixed and is an optimization point, only θ2 and θ3 are variables, we have
According to the conclusion of n = 2 above, we have
to be the optimal point.
So, we have the optimal point
That is, the optimal control method is to keep
The maximum value of the total F is
The maximum value of the overall energy efficiency ηt is
-
(3)
n = k
The rocket has k variables, the above conclusion can be extended to the case of n = k, the optimal point is
That is, the optimal control method is to keep
The maximum value of F is
The maximum value of the overall energy efficiency ηt is
-
2.
If the n engines are the energy efficiency similarity engines, the energy expression of the total thrust becomes
$$ F = F = k_{2} m_{t} \sum\limits_{i = 1}^{n} {\theta_{i} } \eta_{i} \left( {\theta_{i} m_{t} } \right) $$(25.39)
where
Consider the maximization problem of the total thrust F
This problem can also be written as
We consider three cases:
-
(1)
n = 2
The rocket has two variables and has
The objective function F can be expressed as
The optimization condition is
It is easy to see that
for the optimization point. Then we have
That is, the optimal control method is to keep
The total thrust F is
Since the shape of the overall efficiency curve of the rocket is the same as that of a single engine, so the second derivative of the F is also less than zero
F is the only maximum value.
The overall energy efficiency ηt of the rocket is the only maximum value.
-
(2)
n = 3
The rocket has three variables, based on known conditions, we have
The F expression becomes
Assuming that θ3 is fixed and is an optimization point, only θ1 and θ2 are variables, we have
Based on the conclusion of n = 2 above, we have
is the optimal point.
Assuming that θ2 is fixed and is an optimization point, only θ1 and θ3 are variables, there are
According to the conclusion of n = 2 above, there are
is the optimal point.
Similarly, assuming that θ1 is fixed and is an optimization point, only θ2 and θ3 are variables, we have
According to the conclusion of n = 2 above, there are
is the optimal point.
So, we have the optimal point, and the optimal control method is to keep
The maximum total trust F is
The maximum overall energy efficiency ηt is
-
(3)
n = k
The rocket has k variables, the above conclusion can be extended to the case of n = k, the optimal point and the optimal control method is to keep
The maximum total trust F is
The maximum overall energy efficiency ηt is
25.4 Optimal Number of Operational Engines in a Rocket
-
1.
A rocket has m identical engines, if the following equations are satisfied
$$ \eta \left( {\frac{{m_{{\text{t}}} }}{n}} \right) \ge \eta \left( {\frac{{m_{{\text{t}}} }}{n - 1}} \right) $$(25.67)$$ \begin{aligned} & \eta \left( {\frac{{m_{{\text{t}}} }}{n}} \right) \ge \eta \left( {\frac{{m_{{\text{t}}} }}{n + 1}} \right) \\ & n \le m \\ \end{aligned} $$
Then the number n is the number of engines with optimal operation.
-
2.
A rocket has m energy efficiency similarity engines, if the following equations are satisfied
$$ \eta_{1} \left( {\frac{{P_{0} }}{{\mathop \sum \limits_{l = 1}^{n} \beta_{l} }}} \right) \ge \eta_{1} \left( {\frac{{P_{0} }}{{\mathop \sum \limits_{l = 1}^{n1} \beta_{l} }}} \right) $$(25.68)$$ \begin{aligned} n & \le m \\ n1 & \le m \\ \end{aligned} $$
n1 is any combination other than the optimal combination of n units this time, and also include other combinations of n units. The number n is the number of engines with optimal operation.
25.5 Optimal Switching Rule for Multiple Engines in a Rocket
-
1.
A rocket has m identical engines, and the number n is the number of engines currently in optimal operation. If mt increases to mt1, the following relationship holds:
$$ \eta \left( {\frac{{m_{{{\text{t}}1}} }}{n}} \right) = \eta \left( {\frac{{m_{{{\text{t}}1}} }}{n + 1}} \right) $$(25.69)$$ n \le m $$
Then mt1 is the optimal switching point between the operation of n engines and the operation of n + 1 engine. When the total required mt is greater than mt1, the optimal number of engines in operation is switched from n to n + 1. If mt increases until mt /n = m1m, there isn’t the point mt1, then mt/n = m1m is the switching point from n to n + 1.
If mt is reduced to mt2, the following relationship is established
Then mt2 is the optimal switching point between the operation of n engines and the operation of n-1 engines. When the total required power mt is less than mt2, the optimal number of engines in operation is switched from n to n-1. If mt reduces until mt /(n-1) = m1m, there isn’t the point mt2, then mt /(n-1) = m1m is the switching point from n to n-1.
The analysis process is shown in Fig. 25.4.
-
2.
A rocket has m energy efficiency similarity engines, and the number n is the number of engines currently in optimal operation. If mt increases mt1, the following relation holds:
$$ \begin{array}{*{20}c} {\eta_{1} \left( {\frac{{{\text{m}}_{t1} }}{{\mathop \sum \limits_{l = 1}^{n} \beta_{l} }}} \right) = \eta_{1} \left( {\frac{{{\text{m}}_{t1} }}{{\mathop \sum \limits_{l = 1}^{k1} \beta_{l} }}} \right)} \\ {n \le m} \\ \end{array} $$(25.71)
Then mt1 is the optimal switching point between the operation of n engines and the operation of k1 engines. When the total required power mt is greater than mt1, the optimal number of engines in operation is switched from n to k1. If mt increases until mt /\({\sum }_{l=1}^{n}{\beta }_{l}\)=m1m, there isn’t the point mt1, then mt /\({\sum }_{l=1}^{n}{\beta }_{l}\)=m1m is the switching point from n to k1.
If mt is reduced to mt2, the following relation is established
Then mt2 is the optimal switching point between the operation of n engines and the operation of k2 engines. When the total required power mt is less than mt2, the optimal number of engines in operation is switched from n to k2. If mt reduces until mt /\({\sum }_{l=1}^{k2}{\beta }_{l}\) =m1m, there isn’t the point mt2, then mt /\({\sum }_{l=1}^{k2}{\beta }_{l}\) =m1m is the switching point from n to k2.
The analysis process is shown in Fig. 25.5.
k1 and k2 are any combination other than the optimal combination of n units this time, and also include other combinations of n units. Point \({\text{m}}_{t}/{\sum }_{l=1}^{k1}{\beta }_{l}\) is the point closest to \({\text{m}}_{t}/{\sum }_{l=1}^{n}{\beta }_{l}\) to the left of point \({\text{m}}_{t}/{\sum }_{l=1}^{n}{\beta }_{l}\). Point \({\text{m}}_{t}/{\sum }_{l=1}^{k2}{\beta }_{l}\) is the point closest to \({\text{m}}_{t}/{\sum }_{l=1}^{n}{\beta }_{l}\) to the right of point \({\text{m}}_{t}/{\sum }_{l=1}^{n}{\beta }_{l}\). . If all engines are identical, we have k1 = n + 1 and k2 = n-1.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2024 The Author(s)
About this chapter
Cite this chapter
Yao, F., Yao, Y. (2024). Energy Efficiency Optimization of Multi-Engine Launch Vehicles. In: Efficient Energy-Saving Control and Optimization for Multi-Unit Systems. Springer, Singapore. https://doi.org/10.1007/978-981-97-4492-3_25
Download citation
DOI: https://doi.org/10.1007/978-981-97-4492-3_25
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-4491-6
Online ISBN: 978-981-97-4492-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)