# Precise Mission Process Control Based on a Novel Dual-Code Group Network Plan Diagram
## 5 Mission Process Control Strategy
### Control Strategy Solution
#### 5.2.4 Solving of Control Strategy
\[\chi_{\text{max}}(t_{c})=\sum_{m^{*}_{i}\in\tilde{\mathcal{K}}^{*}(t_{c}),m^{* }_{i}\
eq m^{*}}\chi^{\text{max}}_{m^{*}_{i}}(t_{c}) \tag{60}\]  
Therefore, based on the error at the current moment, the maximum anti-disturbance capability of each effective controllable mission can be assigned the error for each effective controllable mission. Thus, the control quantity is obtained. The whole control strategy is divided into two steps, the first step is to assign the eliminated error to each effective controllable mission; the second step is to calculate the required amount of control based on the eliminated error assigned to the effective controllable mission. Figure 14: Diagram of the maximum of the plan start time advance for each mission, assuming that the critical path remains unchanged. (**a**) shows a single mission system. (**b**) shows the threshold state of critical path switching is reached. (**c**) shows the critical path changes. For the problem of assigning the eliminated errors to each effective controllable mission, we designed the error assignment algorithm. In Algorithm 5, the eliminated errors are assigned to each valid controllable mission in the order in which they are found in the core path, i.e., an early assignment strategy is used. The purpose of such allocation is to ensure that the errors are eliminated as early as possible to avoid the continuous accumulation of errors. ```
0:\(\text{system error}(t_{c})\), critical path \(\hat{\mathcal{K}}^{*}(t_{c})\)
0: the maximum anti-disturbance capability \(\chi^{\text{max}}_{m_{i}^{*}}(t_{c})\) of effective controllable mission \(m_{i}^{*}\in\hat{\mathcal{K}}^{*}(t_{c})\)
0: the assigned eliminated error \(e_{m_{i}^{*}}(t_{c})\) of \(m_{i}^{*}\) at \(t_{c}\) moment
1 Initialize:\(\epsilon_{1}=0,\epsilon_{2}=0\)for\(m_{i}^{*}\)in \(\hat{\mathcal{K}}^{*}(t_{c})\)do
2 if\(s_{m_{i}^{*}}(t_{c})=2\)and\(m_{i}^{*}!=m^{*}\)and\(c_{m_{i}^{*}}(t_{c})=1\)then
3:\(\epsilon_{1}\leftarrow\epsilon_{1}+\chi^{\text{max}}_{m_{i}^{*}}(t_{c})\)if\(\epsilon_{1}=\epsilon_{1}+\chi^{\text{max}}_{m_{i}^{*}}(t_{c})\)then
4:\(e_{m_{i}^{*}}(t_{c})\gets e(t_{c})-\epsilon_{2}\)
5:else
6:\(e_{m_{i}^{*}}(t_{c})\gets\chi^{\text{max}}_{m_{i}^{*}}(t_{c})\)\(\epsilon_{2}\leftarrow\epsilon_{2}+\chi^{\text{max}}_{m_{i}^{*}}(t_{c})\)
7:endif
8:endif
9:endfor
10:return\(e_{m_{i}^{*}}(t_{c})\)
```  
**Algorithm 5** Assignment of Eliminated Errors for Effectively Controllable Missions  
The eliminated error assigned to each valid controllable mission on the critical path obtained by Algorithm 5 can be converted into the required plan start time advance of each mission on the critical path. The purpose of the control strategy is to achieve the above advance by adjusting the controllable mission durations. Therefore, to solve for the control quantity, we design a sale algorithm. The mission that proposes the advance is defined as a seller, and the advance required by the seller is regarded as a demand, and the control quantity is solved based on the demand. We denote the demand quantity of mission \(m_{i}^{*}\) on the critical path at the moment of \(t_{c}\) as \(N_{m_{i}^{*}}(t_{c})\). The demand, as the required advance of the mission \(m_{i}^{*}\) at the \(t_{c}\)-moment plan start time, is essentially the sum of the eliminated errors of all valid controllable missions that precede it on the critical path, i.e.,  
\[\left\{ \begin{array}{l}N_{m_{i}^{*}}(t_{c})=\sum_{k=1}^{i-1}e_{m_{k}^{*}}(t_ {c})\\ N_{m_{1}^{*}}(t_{c})=0\end{array} \right. \tag{61}\]  
Next, we calculate the required control quantity based on the demand of the critical path mission at the current controllable moment. The sale algorithm is a recursive algorithm, as shown below. Algorithm 6 is a recursive algorithm in which the filter \(m_{i}^{*}\) acquires the demand \(N_{m_{i}^{*}}(t_{c})\) and then sales it to its all prior-missions \(m_{j}\in\mathcal{FM}_{m_{i}^{*}}\).