32results about How to "Improve pathfinding efficiency" patented technology

The present invention provides a map pathfinding method, dividing plane map into one or more identical area, generating waypoint on area border; when finding path, processing path find based on the area to acquire area path; then generating final path based on the triangular facet Path finding according to the acquired area path. The invention also provides a mapping road finding system, adoptingmethod and system of the invention not only saves space occupation, but also improves road finding efficiency, also suitable for process of all kinds of maps.

The embodiment of the invention provides a map way-finding method and device based on secondary search. The method comprises the following steps: determining a start node and a termination node of way-finding; performing sub-optimal search path finding by adopting a preset first precedence function to obtain a first path-finding path; determining at least one target node based on the distances from the nodes in the first way-finding path to a target straight line, the distance from the target node to the target straight line being a maximum value in the distances from the nodes to the target straight line in a preset range; performing path division according to the start node, the target node and the termination node to obtain a plurality of segmented sub-paths; and carrying out sub-optimal search path finding by adopting a preset second optimization function to obtain a second path-finding path of each segmented sub-path, and sequentially splicing the second path-finding paths to obtain a final path-finding path. On the premise that high path finding quality is guaranteed, the number of nodes needing to be searched in path finding are reduced, and path finding efficiency is improved.

The invention relates to a path planning method based on a triangle inwardly guided RRT algorithm. In order to overcome the shortcomings of the RRT algorithm and the danger of falling into a local minimum if the target point appears in a random point with a certain probability, this method proposes a method to guide the random tree by using the innards of the triangle. By using the random point generated by the random function, the point closest to the random point in the random tree and the target point to form the three vertices of the triangle, then calculate the inner coordinates of the triangle, and use the inner coordinates as the growth direction of the random tree ; In addition, adjust the sampling method by recording the number of inner guides used and the growth of the random tree under a certain number of cycles. This not only guides the growth of the random tree, but also effectively avoids the risk of falling into a local minimum. The method of the invention improves planning efficiency, requires less time for path planning, fewer iterations and shorter paths.

The invention discloses a multi-unit pathfinding method and device, and belongs to the technical field of computers. The method includes the steps of conducting automatic pathfinding on a unit group, and generating a pathfinding guide capable of moving along a target path in a map, wherein the unit group comprises N units, and N is an integer equal to or larger than 1; controlling the units in the unit group to move by following the pathfinding guide; generating an avoidance guide when the distance between a unit in the unit group and an obstacle in the map is smaller than a preset distance, and controlling the units in the unit group to follow the avoidance guide to bypass the obstacles. The multi-unit pathfinding method and device solve the problem that in the related technology, the pathfinding efficiency is low when pathfinding is conducted on each unit, and achieve the effect of improving the pathfinding efficiency.

The invention discloses an efficient path-finding method and system based on the same cost grids. The system comprises an initiating module, a path-finding subsystem and a path combining and optimizing module. The initiating module is used for dividing a real map for path-finding into a plurality of grids which are the same in size, and determining the initial point position (x0, y0) and the target point position (xn, yn) in the form of coordinates. The path-finding subsystem is used for finding a path from the initial point to the target point. The path combining and optimizing module is used for calculating the length of a backtracking path, and selecting the shortest path as the final advancing path through comparison between the length of the backtracking path and the length of paths between every two adjacent inflection points in the path to be selected. The method includes the first step of initiation, the second step of path-finding and the third step of path optimization. By means of the method and system, the path-finding speed is increased, cost of a server or a client side is reduced, and path-finding efficiency is larger than A*.

The invention relates to a path planning method based on concentric circle sampling to guide the RRT algorithm, comprising the following steps: 1. Taking the starting point of path planning as the root node of a random tree; 2. Generating random points by concentric circle sampling; 3. Judging random Whether the point is within the range of the map, if so, go to step 4, otherwise return to step 2 to regenerate a random point; 4. Find the node closest to the random point as a neighboring point; 5. Extend the generation from the neighboring point to the random point with a step size New node; 6. Judging whether there is an obstacle between the new node and the adjacent point, if yes, return to step 2 for resampling, otherwise add the new node to the random tree; 7. Determine whether the new node is within the target point area, if yes, add The target point is added to the random tree, and the path point of the planned path is obtained by backtracking from the target point to the root node, otherwise, return to step 2; 8. Fit the path points to obtain the final path. This method is beneficial to improve the pathfinding efficiency and quickly find the planned path.

Embodiments of the present invention provide a method and device for generating a game scene graph. The method includes: receiving an object input by a user in a first area. The first area is divided according to the position of the object in the first area to obtain at least two first sub-areas. A game scene graph is generated according to at least two first sub-regions. This embodiment can ensure that the characters in the game can perform correct and efficient pathfinding according to the objects input by the user, and improve the user's game experience.

The invention discloses an optimal path algorithm of a topological graph with constraints, which includes generating topological nodes by telecommunication equipment and topological links by optical fiber connections to form a topological matrix; selecting source and sink topological nodes; and establishing the necessary topology according to the constraints List of nodes and topological links, and convert the necessary topological links into necessary topological nodes and add them to the list of necessary topological nodes; establish a list of avoiding topological nodes and topological links according to constraints, and update the topology matrix; set the current The starting and ending topological nodes of pathfinding are Nt and Ne; when Nt is connected to the topological link L <t，e>, the Nt, Ne and L <t，e>Add the overall path, otherwise find the optimal path between Nt and Ne and add it to the overall path; if Ne is the sink topology node, end, otherwise update the topology matrix according to the optimal path between Nt and Ne, and start the next iteration. The invention realizes finding the optimal path under constraint conditions, and improves the path-finding efficiency when the degree of the source topological node is large by improving the Dijkstra algorithm.< / t，e>

The present application relates to a method, device, computer equipment and storage medium for pathfinding in a map. The method includes: converting the pixel coordinates corresponding to the map image into grid coordinates corresponding to the virtual grid map; fitting the map image with the virtual grid map; grid coordinates and the target path area of ​​the grid coordinates of the end point; in the target path area, determine the target path for the first virtual object to move from the grid coordinates of the starting point to the grid coordinates of the end point; set the target path in Grid coordinates in the virtual grid map are mapped to corresponding target pixel coordinates in the map image; and a moving path of the first virtual object in the map image is determined according to the target pixel coordinates. By adopting the method, the pathfinding efficiency of the virtual object can be improved.

The invention discloses a way finding method. The way finding method is characterized by comprising the steps that geometric figures used for representing blocking features are configured to characters with blocking features in advance in a virtual application scenario achieving network element connection through a navigation model, wherein the positions of the geometric figures and the positions of the characters are the same; when linear way finding is needed, a navigation model algorithm is used for way finding, and if the way finding result is pass allowing, whether the geometric figure of any character exists on a path where way finding is conducted at present or not is judged, and whether the path can be passed or not is determined according to the judgment result. By means of the method, the way finding efficiency can be improved, and the character artificial intelligence needs can be met.