Landing of global organizational structure control

Inge2022-06-23 18:04:23

1 mission (Mission)

A joint team of Marines and Marines was assigned to a military mission , These include Occupy a seaport and an airport , In order to introduce follow-up troops . Two suitable landing areas have been designated as North Beach and South Beach , There is a road leading to the harbor in Beitan , There is a road leading to the airport in Nantan . The general distribution of hostile forces can be known from intelligence sources , And there will be expected counterattacks .
Theoretical knowledge can be referred to :

2 Mission decomposition and task map

chart 1 The task diagram shown in shows the task flow 、 constraint , And preferences , The task process includes task execution logic , Constraints represent task dependencies , They prefer to specify the task permission structure . chart 2 It shows the resource matrix required by the task and the existing asset matrix .

chart 1: Task map after mission decomposition

chart 2:(a) Task requirements matrix ;(b) Asset resource capability matrix

3 Careful planning and central task allocation

chart 3 Shows the planning in operation level control Decision makers (DM) Designated central plan , It provides the following information :
1) The optimized Tactical unit (TU) Number M = 4 M=4 M=4, See the diagonally shaded square in the figure ;
2) Every TU Task assignment { g i , m } \{g_{i,m}\} { gi,m};
3) Every TU Resource allocation for { q j , m } \{q_{j,m}\} { qj,m};
4) Initial assignment of assets to tasks .

chart 3: Operation level control (OLC) The plan in the project DM Designated central plan

OLC Planning in DM be based on chart 4 The proposed algorithm decomposes the central plan and task priority graph into several sub plans and sub task priority graphs , Then distribute them over TU Between . chart 5 Shows the task priorities . chart 6 Shows every TU Next task execution sequence .

chart 4: Global scheduling algorithm

 Insert picture description here

chart 5: Task priority

chart 6: Every TU The sequence of tasks

4 Tactical level scheduling

Multi objective optimization algorithm (MOEA) Used to handle tactical level scheduling , When the optimization is complete , Every TU Will get N s , m N_{s,m} Ns,m individual Pareto Explain . Every TU Of N s , m N_{s,m} Ns,m Is different , It mainly depends on local assets and task allocation , Partly dependent on the diversity of the local population . chart 7 Shows every TU Of Pareto front. Every local Pareto The optimal solution corresponds to a task - The asset allocation matrix and a local itinerary . therefore , Tactical level scheduling provides a pool of local scheduling information , The operation level global scheduling construction process can build a global scheduling with multiple alternatives .

chart 7: Every TU Of Pareto front

5 Operation level travel build

The operation level trip building is responsible for assembling the local trip table to form a sequenced L a near neighbor Global schedule , Resolve conflicts and achieve OLC The goal is . chart 8 Shows the level of operation MOEA Generated Pareto Optimal solution , total 14 Two optimal cases . The value of the optimization objective includes the overall Task completion accuracy (TCA)、 Operation interval , as well as The broad sense is based on Pareto Scale independent fitness function (GPSIFF). surface 1 It shows Pareto The value of the optimization objective of the optimal solution . The results show that even if the mission changes from the optimal scheduling to the worst scheduling , The performance of the organization will not be too damaged .
 Insert picture description here

chart 8:L Nearest neighbor scheduling solution

surface 1: Value of optimization target

chart 9 The optimal scheduling , Each asset is assigned to one or more tasks in a specific time period . Scheduling can be divided into five stages :0–29、30–49、50–66、67–88, as well as 89–122. Between two successive periods of time , There are few or no interleaved tasks , Therefore, the boundary can be identified .

chart 9: Optimal scheduling

14 individual Pereto Optimality indicates that there is 14\ An optional global schedule table is available for OLC The coordination of DM choice , To adapt to the changing environment . chart 10 Shows the top ten schedulers , It shows that multiple schedules are very similar , This means that the cost of adaptation is very low . When the current plan needs to be adjusted , It can minimize the interference to task operation .

chart 10:L Nearest neighbor scheduling table

6 Rescheduling under disturbance

When disturbances such as asset damage or other emergencies occur , Missions based on optimal scheduling can be transferred to other scheduling . At the beginning of each phase , Operational level planning DM The status of each asset needs to be evaluated to determine whether the schedule needs to be changed . The following two examples illustrate how this process works :
1) assets 10 damage : Suppose the task is executed according to the best schedule , And assets 10 ( Near air support unit , CAS) Trying to defend the aircraft carrier group ( Mission 1) When meeting a powerful enemy , And suffered heavy casualties during the first phase of the mission . Due to large-scale damage ,CAS Have to quit , However, according to the current schedule ,CAS Need to be in time interval 51–58、68–76, as well as 111-120 During the execution of the North Beach looting ( Mission 7) And airport looting ( Mission 16). In the second phase , Scheduling needs to be done on assets 10 Change in case of failure . Search through nearest neighbors , The third schedule will be used as an alternative . For the rest of the mission, there are no assets 10 In the case of , Such as chart 11.

chart 11: Scheduling transition

2) Emergency : Assume that the current schedule is the first schedule . In time 51, Enemy troops launched a ground attack on the airport guarded by friendly forces . Need to send law enforcement infantry or special operations forces to the airport . This task is the same as task 17 Have similar resource requirements . By reviewing the first stage of similar tasks that have been completed , planning DM Discover assets 6、15、17、18, as well as 19 Coordination has been carried out on similar tasks . However , At the current time , assets 6 Will perform a new task ( Mission 8); therefore , Applying this set of assets may not be appropriate . then , planning DM From the alternative itinerary 4 and 5 Found in , Special operations forces ( assets 17), Or assets 17 And infantry units 2 ( assets 19) The combination of can complete the task . It was finally decided that the assets 17 and 19 All sent to the airport , Because it will shorten the task execution time , And for assets 17 The next task to perform ( Mission 13) The impact is small . The adjusted scheduling is as follows: chart 12.

chart 12: Scheduling adjustment

Similar articles