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, adopting method 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 invention discloses a game agent training method. The method comprises the steps of receiving game scene information sent by a game server removing an NPC capable of generating a damage effect inthe game scene information, and modifying the game scene into a first path-finding following scene; controlling an intelligent agent to perform way-finding training according to a preset heuristic reward rule to obtain way-finding parameters; restoring an NPC capable of generating a damage effect in the game scene information, wherein the game scene is modified into an initial way-finding following scene; and controlling an intelligent agent to perform path-finding training according to the path-finding parameters until a preset training target is completed. The embodiment of the invention further discloses a game intelligent agent training device and equipment and a storage medium. By adopting the multiple embodiments, the problems that in the prior art, the reinforcement learning training efficiency is low, and the time period is long are effectively solved.

The invention discloses a multi-node path selection method and device, and a cloud platform resource scheduling method and device. The multi-node path selection method includes setting a searching main body in a source node; calculating the skip probability of each node according to the distance information between the searching main body and each adjacent node and the pheromone information carried by the nodes, and performing skipping on the nodes whose skip probability meets preset conditions; and returning the searching main body to the source node when the node to which the searching mainbody skips are determined to be a target node. The technical schemes can restrict the gap between the pheromones on the optimal path and other paths by utilizing the upper concentration limit of the pheromones on the paths and the maximum survival period of the searching main body, and therefore, the searching main body can be prevented from finding the paths to form local optimum to a certain extent, the paths found by the searching main body are more complete than the prior art, and higher path-finding efficiency can be achieved.

The embodiments of the invention provide a way-finding method and device of a virtual object. The way-finding method of the virtual object comprises the steps that whether a barrier exists in a presetstraight-line distance in the moving direction of the virtual object or not is judged by obtaining a current initial point and a first target point of the virtual object and according to the currentinitial point and the first target point of the virtual object, when the carrier exists, a first intermediate transit point according to the carrier is calculated, the virtual object moves to the first intermediate transit point and moves to the first target point from the first intermediate transit point, so that the virtual object reaches local shortest way-finding in the way-finding process bycalculating the intermediate transit point, shortest overall situation line is realized, and the way-finding efficiency is improved.

The invention relates to a path planning method based on a triangular inner center guided RRT algorithm. In order to overcome the defects of an RRT algorithm and avoid the risk of local minimum causedby the fact that a target point appears in a random point at a certain probability, the invention provides a method for guiding a random tree by utilizing the inner center of a triangle. Three vertexes of a triangle are formed by a random point generated by a random function, a point closest to the random point in a random tree and a target point, then an inner center coordinate of the triangle is calculated, and the inner center coordinate is used as a growth direction of the random tree; in addition, under a certain cycle index, the sampling mode is adjusted by recording the number of timesof using the inner core guidance and the growth condition of the random tree. Therefore, not only is the growth of the random tree guided, but also the local minimum risk is effectively avoided. According to the method, the planning efficiency is improved, the time required for planning the path is shorter, the number of iterations is smaller, and the path is shorter.

The invention provides a way-finding control method and device for a virtual object in a game, electronic equipment and a storage medium, wherein the method comprises the steps: obtaining virtual resource information in a preset range of a first route in a process that a target virtual object moves according to the first route; adjusting the first route according to the virtual resource information; and controlling the target virtual object to continuously advance according to the adjusted first route. By the adoption of the scheme, when the target virtual object advances according to the pre-planned first route, the route can be adjusted in real time according to the virtual resource information within the preset range of the first route to adapt to the current game environment, the problem that the path finding efficiency is low in a preset mode is solved, and the path finding efficiency is higher. And meanwhile, the setting of the first route is also related to the historical operation behaviors of players, so that corresponding way-finding routes can be provided for different players in a targeted manner, and the game experience is higher.

The invention discloses an object control method and device, a storage medium and an electronic device. The method comprises the steps: determining a first area where a moving starting point of a to-be-moved object is located and a second area where a moving terminal point of the to-be-moved object is located; determining a first path in the first area and a second path in the second area, whereinthe first path is a path from the moving starting point to a first adjacent interface of the first area, and the second path is a path from a second adjacent interface of the second area to the moving terminal point; obtaining a third path from the moving starting point to the moving terminal point according to the first path, the second path and a pre-stored path between adjacent interfaces of each region; and controlling the to-be-moved object to move from the moving starting point to the moving terminal point according to the third path. According to the method and the device, the problemof low path finding efficiency caused by excessive polygonal nodes contained in a map in a map path finding mode in related technologies is solved.

The invention provides a path finding method and a device thereof, and the method comprises the steps: obtaining a grid map, determining an end point grid of a task group in the grid map, and enabling the task group to comprise at least one task individual; determining a target task individual in the task group according to the volume of each task individual in the task group; determining an accommodating volume corresponding to each grid in the grid map; according to the volume of the target task individual, the accommodating volume corresponding to each grid and the position information of the end point grid, determining the metric value of each grid, and wherein the metric value represents the minimum number of grids from the grid to the end point grid; and according to the metric value of each grid and the initial position information of each task individual in the grid map, determining a path-finding route from each task individual to the end point grid. Under the condition that a large number of task individuals move to the same end point grid, repeated path finding is avoided, and the path finding consumption is effectively reduced; and meanwhile, the path-finding route is reasonably planned, and the obstacle avoidance capability and the path-finding efficiency of the path-finding route are improved.

The invention provides a path finding method and device for a virtual object in a game and electronic equipment. The method comprises the steps: obtaining position information of a virtual object in a game, wherein the position information comprises the initial position and the target position of the virtual object in a game scene; generating a navigation grid map corresponding to the game scene in real time according to the position information and the game scene; and determining the target path from the initial position to the target position based on the navigation grid map. Compared with an existing two-dimensional grid-based path-finding method, the method has the advantages that the determination efficiency of the target path, namely the path-finding efficiency, is improved; and when the game scene is changed, the navigation grid map is generated in real time through the position information and the updated game scene, so that the accuracy of the target path is ensured, meanwhile, frequent scanning of the game map is avoided, the problem of excessive path finding consumption is relieved, and the method has a relatively good practical value.

The invention discloses a method and equipment for dynamically switching a rerouting service of a transport network, and the method comprises the following steps: analyzing a received equipment alarm command by a network manager, judging to obtain an alarm point network element, and performing analyzing to obtain a path-finding starting point and a path-finding ending point of a service fault; initiating a rerouting command by the network manager, and carrying out path-finding calculation between the path-finding starting point and the path-finding ending point to obtain a normal path; for the normal path obtained through calculation, deleting the original fault path configuration on the equipment, and activating and downloading the configuration of the normal path to the equipment; after configuration downloading succeeds, replacing the fault path to recover service communication, and completing service switching after rerouting replacement connection succeeds. In the way-finding process, when the normal path segment and the normal network element of the original path are reused, and the way-finding starting point and the way-finding ending point are used for way-finding, the number of network elements needing to be found in way-finding can be reduced, and the way-finding efficiency can be improved.

The invention discloses a global dynamic smooth path planning method based on an optimized A-STAR algorithm, and the method comprises the steps: carrying out the rectangular processing of an obstacle at an earlier stage, finding a path in a barrier-free region through employing a conventional A * algorithm, employing the optimized A * algorithm when the obstacle is encountered, adding the path to a path list for calculation according to a selected path point after the path planning is completed for the first time, and carrying out the calculation of the path point. And then path smoothing processing is carried out by using an artificial potential field method. According to the method, not only can the searched path be ensured to have smoothness and real-time obstacle avoidance capability, but also the path-finding efficiency is improved on the basis of ensuring global optimum.

The invention discloses an image processing method and device, a storage medium, a processor and an electronic device. The method comprises the steps that a target image is acquired, the target image comprises a first area and a second area, the first area is used for representing an area where a target object can walk, and the second area is used for representing other areas except the first area; determining a boundary between the first area and the second area in the target image; based on the boundary, the first area is segmented, a target polygon set is obtained, and multiple polygons in the target polygon set are not intersected; based on the target polygon set, a target map is generated, and the target map is used for achieving the path finding function of the target object. According to the invention, the technical problem of low path finding efficiency of a map in related technologies is solved.