Real-Time Collision Detection Optimization Algorithm Based on Snake Model in the Field of Big Data

Abstract

Big data processing includes multiple processing flows of data. But data quality is the most important part of the entire process. Every data processing link will have an impact on the quality of big data. Collision detection is an important research content in many fields such as computer graphics and computer virtual reality. In layman's terms, it means that the computer detects the signal voltage on the channel while sending data. When the signal voltage swing value detected by a station exceeds a certain threshold value, it will be considered that at least two stations on the bus are sending data at the same time, indicating that a collision has occurred. As the number of questions increases, the level becomes higher, the target information becomes more diverse, and the algorithm becomes more complex. The traditional evolutionary algorithm is far from being able to deal with this situation effectively, and the optimization target algorithm emerges as the times require. Evolutionary computing is a mature global optimization method with high robustness and wide applicability. It has the characteristics of self-organization, self-adaptation, and self-learning. It is not limited by the nature of the problem and can effectively deal with complex problems that are difficult to solve by traditional optimization algorithms. This paper aims to study the optimization algorithm of real-time collision detection based on Snake model in the field of big data. It is expected that, with the support of big data technology, the efficiency of real-time collision detection of Snake model will be improved and time will be saved. This paper proposes a multiline swarm particle swarm algorithm and combines it with the Snake model to improve the detection efficiency of the collision detection algorithm. It verifies the detection performance of traditional algorithms and tests their effectiveness in detection. The experimental results of this paper show that the frame rate of the Snake model algorithm is 15, the frame rate of the K-DOPs algorithm is 6.7, and the error of the algorithm is 1.04. It shows that the frame rate of Snake model algorithm is better.