3results about How to "Optimize calculation time" patented technology

The present application relates to the technical field of three-dimensional mobile robot path automatic planning, and particularly relates to a robot three-dimensional global path planning method based on sunlight irradiation principle, comprising the following steps: dividing a search space into an obstacle region and a free region, determining a directed graph set and a dynamic update dataset of robot path nodes; setting a heuristic function to select a sunlight point from the dataset; using a circular conical tangent point search function to determine an obstacle edge path tangent point; using a grid restriction sampling mechanism to screen the path tangent point; repeating the above steps until a preset maximum number of sampling nodes is reached, generating several feasible paths; selecting the feasible path with the minimum path length for backend optimization processing, and outputting an optimal feasible path. The present application quickly searches for an obstacle edge tangent point to construct a feasible path by simulating the sunlight irradiation principle, screens nodes in combination with a grid restriction sampling mechanism, improves the algorithm convergence speed, and realizes rapid and smooth planning of the shortest path in a three-dimensional space.

The application is suitable for the technical field of three-dimensional model processing, and provides a three-dimensional model graphic matching method, which comprises the following steps: extracting sampling points, then measuring the matching probability of feature points between models by using Gromov-Wasserstein distance, and completing the matching of asymmetric point sets of the models; obtaining symmetric point grouping information after two-step constraint is performed on the remaining symmetric point sets, calculating two new auxiliary points by using the information of the sampling points, determining the up-down and left-right directions of the models by using vector knowledge, and completing the final matching. The application solves the symmetric confusion problem which is prone to occur in the process of matching the initial layer sampling points of a 3D symmetric graphic. Compared with the existing method based on Gromov-Wasserstein distance for solving the same problem, the application is applicable to more models, and the universality and accuracy are improved.

This invention discloses a parallel processing method, system, platform, and storage medium for particle contact search in a distributed memory architecture. The method generates and acquires first data corresponding to the particle computing region, and generates corresponding second data based on the first data. Based on the second data, at least four levels of particle container units corresponding to the particles are created. A first mechanism corresponding to particle contact is constructed. Based on the first mechanism, the migration and transfer states of particles are searched and processed in parallel within the particle container units in the computing domain. The first mechanism is a particle state mechanism. The system, platform, and storage medium corresponding to the method can reduce the time spent on contact search and the computer memory usage when discrete numerical computation methods such as discrete unit methods use distributed memory for computation.