Table 1

Problem types of multi-spacecraft mission sequence allocation planning

Fig.1

Two assemblies with same disassembly sequence

Fig.2

Assembly sequence assignment matrix T1

Fig.3

Assembly constraint graph with virtual vertice

Fig.4

Assembly depth graph with order-conserving constraint

Fig.5

Flowchart of parallel assembly planning algorithm for multi-spacecraft

Fig.6

Principle of DFS topological sorting algorithm

Fig.7

Non-order-conversing mutation operation

Table 2

Simulation settings and algorithm parameters

Fig.8

Simulation model and corresponding assembly constraint relationship graph

Table 3

Results of simulation

Fig.9

Number of task stages of order-conserving and non-order-conserving assumptions

Fig.10

Spacecraft utilization of order-conserving and non-order-conserving assumptions

Fig.11

Exploded view of LEGO Solar Panel model

Fig.12

Assembly states at each task step of DFS assembly sequence result

Fig.13

Assembly states at each task step of NTSA assembly sequence result

Table 4

Simulation results of four examples

Fig.14

Solution process of Gumbel-Sinkhorn

Fig.A1

X reparameterization of the sequence