Blue Star Sea Diamond

Liu Hui always likes to solve problems by himself and doesn't like to trouble others, so when he was studying the cluster algorithm, he never called Dong Jiuyi to participate.

He began to think about other cluster problems mentioned by Dong Jiuyi. His memory was not bad, and he remembered all of them.

Liu Hui began to think about the first question, the uniform flow inside and outside the cluster.He believes that a vortex point can be randomly set, so that the outer layer of the cluster can fly along the vortex point, so that after all the outer layer enters the inner layer of the cluster, the second layer can be naturally exposed, the outermost layer. After the layer enters the vortex, it needs to focus on the center of the entire cluster. In order not to become too dense and cause collisions and other problems, the other parts of the cluster need to be slowly moved apart during the flow process to expand the entire cluster. The shape is similar to the original size, so that the first flow can be completed, and the second flow is the same as the first, and so on, until the firepower of all the clusters is completely launched.

Liu Hui began to think about the second question, the cluster stabilized into the array landing problem.In fact, the most important thing is the question of what kind of terrain to descend.Even the simplest flat ground cannot be descended directly, but needs to be arranged in a flat formation and then descend normally.Arranging into a plane shape is to calculate the minimum distance between the clusters when they descend, and then in the three-dimensional plane coordinates, ensure that there is no overlap in the vertical direction. If there is an overlap within the minimum distance, you can let the overlapping aircraft leave The original position reaches the outermost layer, or the vertical sparse part. If there are multiple overlaps, let the outermost circle expand, so that the vertical dense area also slowly expands in size. Proceed from outside to inside. After the sparse area is opened, the sparse area is determined to exist, the position is determined, and the dense cluster aircraft enters the center of the sparse area. There is always vertical overlap, and the algorithm continues to loop until normal.For the calculation of the sparse area, after the minimum distance is set, it can be determined whether the average value of the mutual distance of every two aircraft in an area is much greater than the set minimum distance.

Liu Hui began to think about the third problem. The cluster uses the most optimized method to transform the corresponding shape.For different wars, clusters may have different shapes.Relative to a narrow area, the cluster can be dense, and compared to a wide area, the cluster can expand into a huge plane, so that fire at one point at a time, the power is huge, and the enemy cannot destroy itself one by one with firepower .But it should not be too large. If it is too large, some aircraft will be too far away from the enemy, resulting in decreased shooting accuracy, and even cut off communication between each other.Sometimes the cluster needs to be shrunk into a ball, so that it will have a better stealth effect, and it is not easy to be found by the enemy. Generally, it is spherical, or a shape similar to a spherical shape.If you have special needs to transform into cubes and other shapes, you can arrange them by numbering. The arrangement can be arranged according to the Hilbert curve. Although it is a three-dimensional shape, it can be controlled in a one-dimensional manner.

Liu Hui began to think about the fourth question, the cluster itself cannot collide.If the clusters cannot collide, then the distance between the clusters must be maintained, and a reference is required to maintain the distance, so that the calculation will not be affected by the squeezing of different clusters.But they should not be too far apart from each other, which will affect communication.Then you need to set the minimum and maximum distances, and determine the number of cluster aircraft. If the average distance between the aircraft is less than the minimum set distance, the outermost layers must move away from each other and expand, followed by the second outer layer. To stay away, and so on, know that the mutual distance between the dense part of the aircraft is greater than the minimum set distance, this algorithm is automatic operation, if the mutual distance between the clusters is normal, the algorithm will automatically stop running.

Liu Hui began to think about the fifth question, the cluster itself needs to keep a certain distance.This is similar to the fourth question, but it’s not the same. This is not only to keep not too close to cause a collision, but also to keep not too far away and the aircraft cannot communicate with each other, and it cannot be due to the operation of various algorithms. As a result, the aircraft could not perform normal missions due to the random string of aircraft back and forth.This requires mutual stability between the clusters, after determining the maximum distance, stop the expansion of the cluster.For clusters that move back and forth, give a reference to let the moving aircraft stop relative to the reference object in any way, and also follow the movement of the reference object when the cluster moves.After each aircraft in the cluster has a minimum distance, it forms a spherical shape. When the cluster is lined up, the principle of spherical stacking can be used to stabilize the entire array.

Liu Hui began to think about the sixth question, the maximum calculation of the cluster formation.This question is very interesting, that is, to ensure that the cluster size is maximized, but also to ensure that there is no loss of contact, or temporary loss of contact within the controllable range.The biggest is nothing more than the largest linearity, the largest surface, and the largest volume.The maximum linearity is to arrange the clusters in a line, and then enlarge the distance between the clusters as much as possible, so that the head and the tail can be very far apart. This function is to allow two distant communications to use this There are multiple ways to connect, and for the largest surface shape and volume, there are multiple situations that can allow the cluster to increase the attack range.The final thing here is not to follow the maximum distance, because the communication connection is easily lost if you are not careful.

Liu Hui began to think about the seventh question, and re-arranged the lost clusters.In the process of performing cluster tasks, if one or more of them are lost, the formation will be destroyed if they are not adjusted in time.The cluster itself must determine the number, and it will update in real time whether all cluster aircraft are operating normally.If you find that the number is reduced, and you will not be able to determine where the missing one is for a while, if you need to continue to perform the task, you need to rearrange the comparison cluster formation. In order to prevent the cluster rearrangement from being too large, you can only use one-dimensional Chain control can be combined with the break.Even if there are multiple missing connections, just use this one-dimensional way to rearrange them.If a one-dimensional method is used, the space between the previous numbered aircraft and the next numbered aircraft must not be too far apart. To achieve this effect, the area or volume shape must be used, and the spiral can be used. Structure to stabilize the array of this cluster.

Liu Hui began to think about the eighth question. The lost cluster was automatically found after being lost.If you want to find the lost aircraft, you need to determine which aircraft it is, and then use the dialing method to scan and call the surroundings.In this case, first expand to the largest surface and increase the area scan.If you can’t find it, just display a word, just like the pointer of a watch, one end is the immovable center, and the word is rotated clockwise or counterclockwise along the center to maximize the dial call to the lost aircraft, regardless of Whether it is a failure or a success, the last one will automatically use a spiral structure to reduce its area or volume, so that the formation is stable, and it will not be confused by unstable communication.

Liu Hui began to think about the ninth question, the cluster is not interfered by other electric waves.Liu Hui believes that for this design to coding theory, the communication between these clusters must be updated in real time, so that other radio waves will not interfere with them and cause cluster loss.Liu Hui even believes that in some cases, that is, in the case of strong electromagnetic interference, the trunking radio is silent, and then escapes according to the pre-set procedures. The strong interference area will not continue to use communication until it reaches a safe area. Transceiver device.

Liu Hui began to think about the tenth question, the cluster adapts to a specific shape for flight.It is easy to keep the cluster in one shape, but if you let the cluster reach a special place and fly in a special shape in a special place, a ranging radar is needed. The cluster itself must be equipped with a radar device to detect surrounding obstacles. Then use the pile ball method to fly in this special place.For example, when dozens of cluster aircraft are recovered by large aircraft, those clusters first need to line up to fly into the door of the large aircraft, and then use the ranging radar to detect the internal structure of the large aircraft, and then the ball stacking method will appear for special purpose. The arrangement of the queue.