Method for processing path of virtual object and related device

Abstract

The application provides a path processing method of a virtual object and a related device; the method comprises the following steps: determining a plurality of first virtual objects which can reach a first virtual carrier in a virtual scene, and a plurality of second virtual objects which cannot reach the first virtual carrier but can reach a second virtual carrier; when it is detected that the first virtual carrier triggers a position movement event, selecting a third virtual object corresponding to a planned path affected by the position movement event from the second virtual objects; for each target virtual object in the affected set, generating a target path re-planning request task, and determining a scheduling priority of the target virtual object based on multidimensional data of the target virtual object; based on the scheduling priority, performing descending order sorting on the path re-planning request tasks of the target virtual objects, and based on the order after the descending order sorting, performing a path re-planning operation on the target virtual objects. Through the application, the real-time performance of the virtual object path processing and the stability of the virtual scene operation can be improved.

Description

Technical Field

[0001] This application relates to the fields of computer technology and computer games, and in particular to methods and apparatus for handling virtual objects' paths. Background Technology

[0002] Virtual object control in virtual scenes is a crucial component of computer games. Dynamic path planning for non-player characters is a key technology for achieving realism and interactivity in virtual worlds, aiming to generate movement paths for virtual objects that adapt to scene changes. When dealing with dynamic scene changes, such as changes in traversable areas or target point locations caused by player actions, related technologies typically employ global path replanning. This involves recalculating the paths of all or a large number of virtual objects within the scene, which can easily lead to excessive instantaneous computational resource consumption, thus affecting the smoothness of the virtual scene's operation. Summary of the Invention

[0003] This application provides a method and related apparatus for processing virtual objects' paths, which can improve the real-time performance of virtual object path processing and the stability of virtual scene operation.

[0004] The technical solution of this application embodiment is implemented as follows: This application provides a method for processing the path of a virtual object, the method comprising: Among multiple virtual objects in a virtual scene, a plurality of first virtual objects that are reachable from a first virtual vehicle, and a plurality of second virtual objects that are not reachable from the first virtual vehicle but are reachable from a second virtual vehicle are identified; When the first virtual vehicle is detected to have triggered a location movement event, the planned paths of each second virtual object to the second virtual vehicle are detected to be affected by the location movement event, and the detection results are obtained. Based on the detection results, a third virtual object corresponding to the planned path affected by the location movement event is selected from the plurality of second virtual objects; The plurality of first virtual objects and the third virtual objects are added to the affected set. For each target virtual object in the affected set, a path replanning request task for the target virtual object is generated, and the scheduling priority of the target virtual object is determined based on the multi-dimensional data of the target virtual object. Based on the scheduling priority, the path replanning request tasks of each target virtual object are sorted in descending order, and based on the order after descending sorting, path replanning operation is performed on each target virtual object.

[0005] This application provides a path processing device for virtual objects, including: The object determination module is used to determine, among multiple virtual objects in a virtual scene, multiple first virtual objects that can reach the first virtual vehicle, and multiple second virtual objects that cannot reach the first virtual vehicle but can reach the second virtual vehicle; The impact detection module is used to detect whether the planned paths of each second virtual object to the second virtual vehicle are affected by the location movement event when the first virtual vehicle triggers a location movement event, and to obtain the detection result. An object filtering module is used to filter out, based on the detection results, a third virtual object corresponding to the planned path affected by the location movement event from the plurality of second virtual objects; The scheduling processing module is used to add the plurality of first virtual objects and the third virtual objects to the affected set, generate a path replanning request task for each target virtual object in the affected set, and determine the scheduling priority of the target virtual object based on the multi-dimensional data of the target virtual object. The path replanning module is used to sort the path replanning request tasks of each target virtual object in descending order based on the scheduling priority, and to perform path replanning operations on each target virtual object based on the descending order.

[0006] This application provides a method for processing the path of a virtual object, the method comprising: In a virtual scene, display the first movement path of multiple first virtual objects to reach the first virtual vehicle, and the second movement path of multiple second virtual objects to reach the second virtual vehicle; In response to the first virtual vehicle triggering a location movement event, a third movement path obtained by performing path replanning operations on the plurality of first virtual objects and third virtual objects is displayed sequentially based on scheduling priority. The third virtual object is the second virtual object corresponding to the second movement path affected by the location movement event.

[0007] This application provides a method for processing the path of a virtual object, the method further comprising: During the waiting process, the fourth virtual object among the plurality of first virtual objects and the plurality of second virtual objects that meets the emotional feedback conditions is highlighted in the target style; The target style includes at least one of the following: text prompt style, facial expression feedback style, action feedback style, and voice feedback style; The emotional feedback conditions include at least one of the following: the cumulative waiting time reaches the target duration, or the cumulative number of replanning attempts reaches the target number.

[0008] This application provides an electronic device, the electronic device comprising: Memory is used to store executable instructions or computer programs. The processor, when executing computer-executable instructions or computer programs stored in the memory, implements the path processing method for virtual objects provided in the embodiments of this application.

[0009] This application provides a computer-readable storage medium storing a computer program or computer-executable instructions for implementing the path processing method for virtual objects provided in this application when executed by a processor.

[0010] This application provides a computer program product, including a computer program or computer executable instructions. When the computer program or computer executable instructions are executed by a processor, they implement the path processing method for virtual objects provided in this application.

[0011] The embodiments of this application have the following beneficial effects: By applying the embodiments of this application, in a virtual scene, a precise classification of different virtual objects is achieved by distinguishing between a first virtual object that can reach a first virtual vehicle and a second virtual object that cannot reach the first virtual vehicle but can reach a second virtual vehicle. When the first virtual vehicle triggers a position movement event, by detecting whether the planned path of the second virtual object to the second virtual vehicle is affected by the event, the affected third virtual object can be accurately screened, avoiding invalid processing of unaffected virtual objects and improving the targeting of path processing. Then, the first and third virtual objects are grouped into the affected set, and a path replanning request task is generated for each target virtual object in the set. At the same time, the scheduling priority is determined based on the multi-dimensional data of the target virtual object, which can reasonably allocate processing resources according to the actual situation of the virtual object. Finally, the path replanning request tasks are sorted in descending order based on the scheduling priority and the replanning operation is performed. This can ensure that the target virtual objects with higher priority complete the path replanning first, effectively improving the efficiency and rationality of virtual object path replanning, ensuring the smoothness of interaction between virtual objects and virtual vehicles in the virtual scene, and optimizing the running effect of the virtual scene. Attached Figure Description

[0012] Figure 1 This is a schematic diagram illustrating the application mode of the virtual object path processing method provided in the embodiments of this application; Figure 2 This is a schematic diagram of the structure of the electronic device provided in the embodiments of this application; Figure 3 This is a first flowchart illustrating the path processing method for virtual objects provided in this application embodiment; Figure 4 This is a second flowchart illustrating the path processing method for virtual objects provided in this application embodiment; Figure 5 This is a schematic diagram of the third process of the virtual object path processing method provided in the embodiments of this application; Figure 6 This is a schematic diagram of the fourth process of the path processing method for virtual objects provided in the embodiments of this application; Figure 7 This is a fifth flowchart illustrating the path processing method for virtual objects provided in this application embodiment; Figure 8 This is a first schematic diagram of the virtual scene provided in the embodiments of this application; Figure 9 This is a second schematic diagram of the virtual scene provided in the embodiments of this application; Figure 10 This is a third schematic diagram of the virtual scene provided in the embodiments of this application.

[0013] It should be noted that the terms "first" and "second" mentioned above are only used to distinguish between different options and do not represent the degree of superiority or inferiority of the options or their priority in the implementation process. Detailed Implementation

[0014] To make the objectives, technical solutions, and advantages of this application clearer, the application will be further described in detail below with reference to the accompanying drawings. The described embodiments should not be regarded as limitations on this application. All other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0015] In the following description, references are made to “some embodiments,” which describe a subset of all possible embodiments. However, it is understood that “some embodiments” may be the same subset or different subsets of all possible embodiments and may be combined with each other without conflict.

[0016] In the following description, the terms "first, second, third" are used merely to distinguish similar objects and do not represent a specific ordering of objects. It is understood that "first, second, third" may be interchanged in a specific order or sequence where permitted, so that the embodiments of this application described herein can be implemented in an order other than that illustrated or described herein.

[0017] In the embodiments of this application, the terms "module" or "unit" refer to a computer program or part of a computer program that has a predetermined function and works with other related parts to achieve a predetermined goal, and can be implemented wholly or partially using software, hardware (such as processing circuitry or memory), or a combination thereof. Similarly, a processor (or multiple processors or memory) can be used to implement one or more modules or units. Furthermore, each module or unit can be part of an overall module or unit that includes the functionality of that module or unit.

[0018] Unless otherwise defined, all technical and scientific terms used in the embodiments of this application have the same meaning as commonly understood by one of ordinary skill in the art. The terminology used in the embodiments of this application is for the purpose of describing the embodiments of this application only and is not intended to limit this application.

[0019] In vehicle dragging and virtual object queuing interaction scenarios, during the path generation and failure identification stages, most technologies rely on fixed scripts or static pathfinding to generate movement paths for virtual objects. When faced with changes in target location, reachable area, and local obstacles caused by the player dragging the vehicle, path updates typically lack an event-driven dynamic response mechanism. This makes it difficult to promptly identify the truly affected virtual object paths, resulting in coarse-grained path failure judgments, unnecessary duplicate calculations, and impacting the real-time smoothness of the virtual scene. During the path update and queuing processing stages, these technologies often lack a differentiated scheduling mechanism that combines virtual object attributes, waiting status, target distance, and player behavior. This makes it difficult to establish a reasonable processing order when multiple objects are concurrently being processed, leading to a lack of strategy in path recalculation and boarding order, thus affecting overall scheduling efficiency and interaction performance.

[0020] In dynamic scenarios with continuously changing environments and a constantly increasing number of objects, related technologies typically employ a broad, uniform update approach when handling path recalculation tasks. This lacks the ability to handle localized incremental changes, easily leading to high computational burdens and increasing the risk of scene stuttering. Furthermore, these technologies suffer from deficiencies in feedback mechanisms and generation control. They struggle to translate waiting times and repeated path adjustments into interpretable interactive feedback, and they also find it difficult to dynamically adjust the generation density of virtual objects based on level progress and scene capacity. This results in a compounding effect of path congestion, frequent recalculation, and limited interactive feedback, restricting path processing efficiency, scheduling stability, and the consistency of the interactive experience within virtual scenes.

[0021] This application provides a method and related apparatus for processing virtual objects' paths, which can improve the real-time performance of virtual object path processing and the stability of virtual scene operation.

[0022] The following describes exemplary applications of the electronic devices provided in the embodiments of this application. These devices can be implemented as various types of terminals such as laptops, tablets, desktop computers, set-top boxes, smartphones, smart speakers, smartwatches, smart TVs, and in-vehicle terminals, or as servers. Exemplary applications when the device is implemented as a terminal or server will be described below.

[0023] See Figure 1 , Figure 1This is a schematic diagram illustrating the application mode of the path processing method for virtual objects provided in this application embodiment. To implement an application supporting path processing for a virtual object, an example is provided. Figure 1 The system involves server 200, network 300, and terminal device 400. Terminal device 400 is connected to server 200 through network 300. Network 300 can be a wide area network, a local area network, or a combination of both.

[0024] In some embodiments, the embodiments of this application can be implemented collaboratively by terminal device 400 and server 200. For example, the player can be the operating entity that triggers the location movement event, the server 200 can be a server 200 for virtual scene scheduling and path processing, and the terminal device 400 can be a terminal operated by the player. Terminal device 400 sends the location movement event corresponding to the first virtual vehicle to server 200. In response to the location movement event, server 200 identifies multiple first virtual objects reachable from the first virtual vehicle and multiple second virtual objects reachable from the second virtual vehicle but not the first virtual vehicle. It then detects whether the planned paths from each second virtual object to the second virtual vehicle are affected by the location movement event. Subsequently, based on the detection results, the server filters out the third virtual objects corresponding to the planned paths affected by the location movement event, adds multiple first and third virtual objects to the affected set, generates path replanning request tasks for the target virtual objects in the affected set, and determines the scheduling priority based on the multi-dimensional data of the target virtual objects. Finally, the server sorts each path replanning request task in descending order based on the scheduling priority, performs path replanning operation on each target virtual object based on the sorting result, and displays the virtual scene after path replanning operation to the user.

[0025] See Figure 2 , Figure 2 This is a schematic diagram of the structure of the electronic device provided in the embodiments of this application. Figure 2 The server 200 shown includes at least one processor 410, memory 450, and at least one network interface 420. Various components in the terminal device 400 are coupled together via a bus system 440. It is understood that the bus system 440 is used to implement communication between these components. In addition to a data bus, the bus system 440 also includes a power bus, a control bus, and a status signal bus. However, for clarity, in… Figure 2 The general labeled all buses as Bus System 440.

[0026] Processor 410 can be an integrated circuit chip with signal processing capabilities, such as a general-purpose processor, a digital signal processor (DSP), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor can be a microprocessor or any conventional processor, etc.

[0027] The memory 450 may be removable, non-removable, or a combination thereof. Exemplary hardware devices include solid-state storage, hard disk drives, optical disk drives, etc. The memory 450 may optionally include one or more storage devices physically located away from the processor 410.

[0028] The memory 450 may include volatile memory or non-volatile memory, or both. The non-volatile memory may be read-only memory (ROM), and the volatile memory may be random access memory (RAM). The memory 450 described in this application embodiment is intended to include any suitable type of memory.

[0029] In some embodiments, memory 450 is capable of storing data to support various operations, examples of which include programs, modules, and data structures or subsets or supersets thereof, as illustrated below.

[0030] Operating system 451 includes system programs for handling various basic system services and performing hardware-related tasks, such as the framework layer, core library layer, driver layer, etc., for implementing various basic business functions and handling hardware-based tasks; The network communication module 452 is used to reach other electronic devices via one or more (wired or wireless) network interfaces 420, exemplary network interfaces 420 including Bluetooth, WiFi, and Universal Serial Bus (USB).

[0031] In some embodiments, the apparatus provided in this application can be implemented in software. Figure 2 A path processing device 455 for virtual objects stored in memory 450 is shown. This device can be software in the form of programs and plug-ins, and includes the following software modules: object determination module 4551, impact detection module 4552, object filtering module 4553, scheduling processing module 4554, path replanning module 4555, and display module 4556. These modules are logically connected and can therefore be arbitrarily combined or further separated according to their implemented functions. The functions of each module will be described below.

[0032] In some embodiments, the terminal or server can implement the virtual object path processing method provided in this application embodiment by running various computer-executable instructions or computer programs. For example, computer-executable instructions can be microprogram-level commands, machine instructions, or software instructions. Computer programs can be native programs or software modules in an operating system; they can be native applications (APPs); or they can be applets that can be embedded in any APP, i.e., programs that only need to be downloaded to a browser environment to run. In summary, the aforementioned computer-executable instructions can be any form of instruction, and the aforementioned computer programs can be any form of application, module, or plugin.

[0033] The path processing method for virtual objects provided in this application will be described in conjunction with exemplary applications and implementations of the terminals provided in the embodiments of this application.

[0034] The following describes the path processing method for virtual objects provided in the embodiments of this application. As mentioned above, the electronic device implementing the path processing method for virtual objects in the embodiments of this application can be a terminal device, a server, or a combination of both. Therefore, the executing entity of each step will not be described again below.

[0035] See Figure 3 , Figure 3 This is a first flowchart illustrating the path processing method for virtual objects provided in this application embodiment, which will be combined with... Figure 3 The steps shown are explained below. Figure 3 The implementing body is Figure 1 Server 200.

[0036] In step 101, among multiple virtual objects in the virtual scene, multiple first virtual objects that are reachable from the first virtual vehicle and multiple second virtual objects that are not reachable from the first virtual vehicle but are reachable from the second virtual vehicle are identified.

[0037] Here, "definitely reachable" means that through path planning algorithms, a collision-free path can be calculated from the starting position of the virtual object to the target position of the target virtual vehicle in the navigation data structure representing the passable area of ​​the virtual scene.

[0038] In practical implementation, the reachability determination of multiple virtual objects in a virtual scene can be achieved by constructing a navigation mesh for the virtual scene and combining it with the spatial occupancy area of ​​virtual vehicles. First, based on the current position of the first virtual vehicle, the traversable access area of ​​the first virtual vehicle in the virtual scene is determined by its collision bounding box. Then, the current positions of all virtual objects in the virtual scene are traversed sequentially, and the shortest path length from each virtual object to the traversable access area of ​​the first virtual vehicle is calculated using a path search algorithm. The collision bounding box is the bounding area used to represent the physical space occupied by a virtual vehicle in the virtual scene; it can be an axis-aligned bounding box, and the collision bounding box corresponds to either the first virtual vehicle or the second virtual vehicle.

[0039] When a shortest path exists and its length is less than a preset path length threshold, the virtual object is identified as a first virtual object reachable from the first virtual vehicle. When a shortest path does not exist or its length is greater than or equal to the preset path length threshold, the accessible area of ​​the second virtual vehicle in the virtual scene is determined based on its current position and the collision bounding box. The shortest path from the virtual object to the accessible area of ​​the second virtual vehicle is then calculated using a path search algorithm. When a shortest path exists and its length is less than the preset path length threshold, the virtual object is identified as a second virtual object that cannot reach the first virtual vehicle but can reach the second virtual vehicle.

[0040] As an example, assume that the navigation grid resolution of the virtual scene is 0.5 meters, the collision bounding box size of the first virtual vehicle is 2 meters × 4 meters, the passable access area is the area formed by extending 1 meter outside the bounding box, the preset path length threshold is 15 meters, there are 100 virtual objects in the virtual scene, and the shortest path from 65 of these virtual objects to the passable access area of ​​the first virtual vehicle is calculated by the path search algorithm to be 8 meters to 12 meters. These 65 virtual objects are identified as the first virtual object.

[0041] There is no valid path from the remaining 35 virtual objects to the area accessible by the first virtual vehicle. The shortest path from these 35 virtual objects to the area accessible by the second virtual vehicle is calculated. The shortest path for 28 of these virtual objects is between 5 meters and 14 meters. These 28 virtual objects are identified as the second virtual objects.

[0042] In other embodiments, a dynamic reachability marking mechanism triggered by virtual vehicle movement events can also be used. When the first virtual vehicle moves, a path failure mark is generated for it. Reachability is re-evaluated only for virtual objects whose paths intersect with the obstruction area of ​​the new location of the first virtual vehicle. Virtual objects whose paths do not intersect retain their original reachability evaluation results, thereby reducing the computational overhead of reachability evaluation. This application does not limit the specific implementation of the path search algorithm; navigation mesh routing algorithms or dynamic path generation algorithms can be used to perform reachability calculations from virtual objects to virtual vehicles.

[0043] By using the above method, the reachability of virtual objects to the first virtual vehicle is first determined, and then the reachability of virtual objects that are not reachable from the first virtual vehicle to the second virtual vehicle is determined. This can accurately distinguish virtual objects with different reachability states, providing an accurate data basis for subsequent path recalculation and queuing scheduling of virtual objects. At the same time, the determination is based on a preset path length threshold and navigation grid, which can ensure the stability of the reachability results and the computational efficiency.

[0044] In step 102, when a location movement event is detected that the first virtual vehicle has triggered a location movement event, the planned paths of each second virtual object to the second virtual vehicle are detected to see if they are affected by the location movement event, and the detection results are obtained.

[0045] Here, a location movement event refers to event information that represents a change in the spatial position of the first virtual vehicle. The first position is the position of the first virtual vehicle before the location movement event is triggered, and the second position is the position of the first virtual vehicle after the location movement event is triggered.

[0046] In some embodiments, see Figure 4 , Figure 4 This is a second flowchart illustrating the path processing method for virtual objects provided in this application embodiment. Figure 3 Step 102 in the process can be achieved through Figure 4 Steps 1021 to 1024 are implemented, and the details are explained below.

[0047] In step 1021, when a location movement event indicates that the first virtual vehicle has moved from the first location to the second location, the area to be detected is determined based on the first location and the second location.

[0048] In practical implementation, when a location movement event indicates that the first virtual vehicle moves from a first position to a second position, the detection area is a spatial region constructed based on the first and second positions to detect whether the planned path may be affected by the location movement event. By constructing collision bounding boxes corresponding to the first and second positions of the first virtual vehicle, merging the two collision bounding boxes, and extending them outward by a preset safety distance, a closed region covering the space occupied and potentially obstructed by the first virtual vehicle throughout its movement is formed. This closed region is the detection area. First, the outline dimensions of the first virtual vehicle can be obtained, including length, width, and orientation. Then, the outline of the first virtual vehicle is projected onto the virtual scene coordinate system based on the first position to obtain the first occupied area. Next, the outline of the first virtual vehicle is projected onto the virtual scene coordinate system based on the second position to obtain the second occupied area. Finally, the detection area is constructed based on the first and second occupied areas. Here, the construction of the detection area can be achieved using a union, envelope, or expansion method.

[0049] As an example, assuming the length of the first virtual vehicle is 8 scene units and the width is 3 scene units, the center coordinates of the first position are (20, 10) and the center coordinates of the second position are (32, 10), then the first occupied area and the second occupied area can be obtained respectively, and the smallest bounding rectangle of the two can be used as the area to be detected. If the first occupied area covers [16, 24] in the horizontal coordinate range, the second occupied area covers [28, 36] in the horizontal coordinate range, and both cover [8.5, 11.5] in the vertical coordinate range, then the horizontal coordinate range of the area to be detected can be determined as [16, 36] and the vertical coordinate range can be determined as [8.5, 11.5].

[0050] In other embodiments, a fixed safety extension distance can be added outward based on the first and second occupied areas to obtain the area to be detected, so that subsequent detection not only covers the actual occupied area of ​​the first virtual vehicle, but also the adjacent area that may be compressed due to the movement of the first virtual vehicle.

[0051] In other embodiments, the boundary division precision of the area to be detected can be adaptively adjusted according to the navigation grid precision of the virtual scene. The higher the navigation grid precision, the more refined the spatial definition of the area to be detected. The embodiments of this application do not limit the specific construction method of the area to be detected, and can be flexibly determined by combining virtual vehicle parameters and scene space parameters.

[0052] By first determining the area to be detected in the above manner, the impact of position movement events on the virtual scene can be reduced from the entire scene to a local spatial area. This provides a basis for subsequent analysis of planned paths only in the vicinity of this area, which helps to reduce the detection range of irrelevant paths and improve the targeting of detection processing.

[0053] In step 1022, for each second virtual object to the second virtual vehicle, the planned path is checked to see if it passes through the area to be detected.

[0054] In some embodiments, step 1022 can be implemented by the following method: obtaining multiple path points corresponding to the planned path, connecting adjacent path points in sequence to generate multiple path segments corresponding to the planned path; detecting whether each path segment intersects with the area to be detected; if there is a path segment that intersects with the area to be detected, determining that the planned path passes through the area to be detected; if there is no path segment that intersects with the area to be detected, determining that the planned path does not pass through the area to be detected.

[0055] Here, path points are discrete location points used to describe the geometry of a planned path. Path segments are linear segments formed by connecting adjacent path points in sequence. Whether a path segment intersects with the area to be detected is determined by judging whether there is a common part between the path segment and the area to be detected in two-dimensional or three-dimensional space.

[0056] In practice, the coordinates of multiple path points corresponding to the planned path are obtained. Adjacent path points are connected sequentially according to the generation order to generate multiple continuous path segments corresponding to the planned path. Then, a spatial geometric intersection algorithm is used to check whether each path segment intersects with the area to be detected, determining whether the planned path passes through the area to be detected. If a path segment intersects with the area to be detected, the area to be detected intersects with the path segment, confirming that the planned path passes through the area to be detected. If no path segment intersects with the area to be detected, the area to be detected does not intersect with the path segment, confirming that the planned path does not pass through the area to be detected.

[0057] As an example, suppose a planned path contains 5 path points, with coordinates of the first path point (5, 5), the second path point (10, 8), the third path point (18, 9), the fourth path point (26, 10), and the fifth path point (35, 10). Then, 4 path segments can be generated: the first path segment formed by the first and second path points, the second path segment formed by the second and third path points, the third path segment formed by the third and fourth path points, and the fourth path segment formed by the fourth and fifth path points. If the horizontal coordinate range of the area to be detected determined in step 1021 is [16, 36] and the vertical coordinate range is [8.5, 11.5], then both the second and third path segments may intersect with the area to be detected.

[0058] In some embodiments, when detecting whether a path segment intersects with the area to be detected, the starting and ending coordinates of each path segment can be obtained separately. Combined with the boundary parameters of the area to be detected, it can be determined whether the path segment enters the interior of the area to be detected or whether it intersects with the boundary of the area to be detected. If any path segment meets the conditions of entering the interior or intersecting the boundary, it can be determined that the planned path passes through the area to be detected.

[0059] In other embodiments, the circumscribed rectangle of the path segment can be constructed first, and then the path segments that are obviously impossible to intersect can be filtered out by quickly judging the overlap between the circumscribed rectangle of the path segment and the area to be detected. Then, more refined intersection calculations are performed on the remaining path segments. The embodiments of this application do not limit the specific implementation of the intersection detection between the path segment and the area to be detected.

[0060] By using the above method to detect whether a planned path passes through the area to be detected, planned paths that have a direct intersection with the area affected by the location movement event can be identified first, thus providing a basis for obtaining detection results quickly in the future.

[0061] In step 1023, if the planned path passes through the area to be detected, a detection result indicating that the planned path is affected by a location movement event is obtained.

[0062] Here, the detection result indicating that the planned path is affected by the location movement event is either marked as the affected state of the current planned path, or the corresponding affected determination information is generated.

[0063] In practice, a path status field is maintained for each planned path. When step 1022 determines that a planned path passes through the area to be detected, the path status field is updated to be affected by the location movement event. Simultaneously, a detection result record associated with the planned path can also be generated. The detection result record includes the path identifier, the second virtual object identifier, and the detection conclusion.

[0064] As an example, if the third path segment of a planned path intersects with the area to be detected, a detection result record can be directly generated. In this record, the path identifier is the identifier information of the currently planned path, the second virtual object identifier is the identifier information of the second virtual object to which the planned path belongs, and the detection result is affected by the location movement event.

[0065] In other embodiments, after obtaining the detection result indicating that the planned path is affected by the location movement event, the second virtual object can be immediately written into the object cache area to be processed for subsequent object filtering process. The embodiments of this application do not limit the recording format of the detection result.

[0066] By using the above method, the detection results affected by the position movement event can be obtained directly when the planned path passes through the area to be detected. This avoids continuing to perform the subsequent minimum spacing calculation on the path that has been clearly affected, thereby reducing repeated judgments and improving the execution efficiency of the detection process.

[0067] In step 1024, if the planned path does not pass through the detection area, the minimum distance between the detection area and the planned path is obtained. If the minimum distance is less than a preset distance threshold, a detection result indicating that the planned path is affected by a position movement event is obtained. If the minimum distance is greater than or equal to the preset distance threshold, a detection result indicating that the planned path is not affected by a position movement event is obtained.

[0068] Here, the minimum spacing is the minimum geometric distance between the planned path and the boundary of the area to be detected; when the planned path intersects with the area to be detected, the minimum spacing is zero. The preset distance threshold is a threshold parameter used to determine the spatial proximity relationship between the planned path and the area to be detected, and its value can be set according to the size of the virtual vehicle, the passage safety boundary, or the scene congestion.

[0069] In actual implementation, based on the multiple path segments generated in step 1022, the geometric distance between each path segment and the area to be detected is calculated, and the minimum value among the distance values ​​is taken as the minimum spacing between the area to be detected and the planned path.

[0070] As an example, suppose a planned path does not intersect with the area to be detected, and the planned path contains 3 path segments. The shortest distance between the first path segment and the area to be detected is 4.2 scene units, the shortest distance between the second path segment and the area to be detected is 1.6 scene units, and the shortest distance between the third path segment and the area to be detected is 2.8 scene units. Then the minimum spacing can be determined to be 1.6 scene units.

[0071] If the preset distance threshold is set to 2.0 scene units, since 1.6 < 2.0, the detection result indicates that the planned path is affected by the location movement event. If the preset distance threshold is set to 1.0 scene units, since 1.6 > 1.0, the detection result indicates that the planned path is not affected by the location movement event.

[0072] In some embodiments, the preset distance threshold can be set according to the size of the first virtual vehicle, the passage width requirement of the virtual object, or the congestion level in the virtual scene. For example, if the width of the first virtual vehicle is 3 scene units and the passage safety boundary of the second virtual object is 0.8 scene units, the preset distance threshold can be set to a range of 1.5 scene units to 2.0 scene units to balance detection accuracy and stability.

[0073] In other embodiments, different preset distance thresholds can be configured according to different types of second virtual objects, so that second virtual objects with wider paths or larger turning radii can use larger preset distance thresholds. The embodiments of this application do not limit the specific calculation method of the minimum spacing, nor do they limit the specific value of the preset distance threshold.

[0074] By introducing minimum spacing determination when the planned path does not pass through the area to be detected, the planned path can be further identified even if it does not directly intersect with the area to be detected, but is still within the high-risk proximity range, thereby improving the completeness and accuracy of the detection results.

[0075] In step 103, based on the detection results, a third virtual object corresponding to the planned path affected by the location movement event is selected from multiple second virtual objects.

[0076] In practical implementation, an association is established between the second virtual object and the planned path. This association is a data relationship used to identify the mapping relationship between a certain second virtual object and its planned path whose current target is the second virtual vehicle. A path record table can be maintained in advance, which includes the second virtual object identifier, the planned path identifier, and the detection result field corresponding to the planned path.

[0077] After generating the detection results, the path records corresponding to multiple second virtual objects are traversed. If the detection result of a certain second virtual object indicates that the planned path is affected by the location movement event, then the second virtual object is written into the third virtual object set; if the detection result of a certain second virtual object indicates that the planned path is not affected by the location movement event, then the second virtual object is not written into the third virtual object set.

[0078] As an example, suppose multiple second virtual objects include second virtual object A, second virtual object B, second virtual object C, and second virtual object D, and each of them corresponds to one of four planned paths. In step 102, the planned paths corresponding to second virtual objects A and C are determined to be affected by location movement events, while the planned paths corresponding to second virtual objects B and D are determined to be unaffected by location movement events. Therefore, in step 103, second virtual objects A and C can be filtered out and identified as third virtual objects, while second virtual objects B and D can not be identified as third virtual objects.

[0079] Using the above method, object screening can be completed directly based on the test results, reducing intermediate conversion steps and improving the certainty of the object screening process.

[0080] In some embodiments, step 103 can also organize the filtering order of multiple second virtual objects to improve the processing efficiency of object filtering. Specifically, multiple second virtual objects can be traversed first according to their object identifier order, path identifier order, or the time order of the detection results obtained in step 102, and then it can be determined whether to filter them as third virtual objects based on the corresponding detection results.

[0081] Here, the object identification order is processed according to the identification information of the second virtual object from smallest to largest or from largest to smallest, the path identification order is processed according to the preset arrangement rule of the planned path identification information, the arrangement rule can be ascending or descending, and the time order of the detection results is processed according to the order in which the detection results of each planned path are generated.

[0082] As an example, suppose there are fifty second virtual objects participating in the detection in a certain processing cycle. The first twenty second virtual objects complete the detection result generation first, and the last thirty second virtual objects complete the detection result generation later. Then, the first twenty second virtual objects can be selected first, and the second virtual objects that meet the conditions can be written into the third virtual object cache first, and then the last thirty second virtual objects can be selected.

[0083] By organizing the screening process sequentially in the above manner, the object screening step can form a continuous data processing link with the preceding detection step, reducing the pauses caused by waiting for all detections to be completed before unified processing.

[0084] In some embodiments, step 103 may also retain the association between the third virtual object and the corresponding detection result while filtering out the third virtual object, so that it can be used directly in subsequent processing.

[0085] Here, preserving the association means that when a second virtual object is determined to be a third virtual object, the third virtual object and its corresponding detection result, planned path identifier or path status mark are written into the object record structure.

[0086] As an example, suppose a planned path corresponding to a second virtual object is determined to be affected by a location movement event because it crosses the detection area. When the second virtual object is selected as a third virtual object, the cause field for the third virtual object can be recorded as "path crosses the detection area." Alternatively, if a planned path corresponding to another second virtual object is determined to be affected by a location movement event because its minimum distance is less than a preset distance threshold, when that object is selected as a third virtual object, its cause field can be recorded as "minimum distance less than the preset distance threshold." By retaining this type of association, subsequent processing around the third virtual object can directly inherit the results of previous detections, avoiding duplicate queries and judgments.

[0087] In other embodiments, the filtering of the third virtual object can also be achieved through an event-driven incremental filtering method. Specifically, when step 1023 or step 1024 obtains a detection result indicating that the planned path is affected by a location movement event, it is not necessary to wait for all second virtual objects to complete the detection. Instead, the corresponding second virtual object can be directly incrementally written into the third virtual object set. When all second virtual objects have completed the detection, the construction of the third virtual object set is completed. The embodiments of this application do not limit the specific implementation method of filtering the third virtual object.

[0088] As an example, if there are sixty second virtual objects, and four of them have already been determined to be affected by the position movement event when the first ten second virtual objects have been detected, then these four second virtual objects can be written into the third virtual object set immediately, without having to wait for the remaining fifty second virtual objects to be detected before filtering them all at once.

[0089] The above method allows the screening and testing processes to be carried out in parallel, shortening the waiting time for subsequent steps.

[0090] In step 104, multiple first virtual objects and third virtual objects are added to the affected set. For each target virtual object in the affected set, a path replanning request task for the target virtual object is generated, and the scheduling priority of the target virtual object is determined based on the multi-dimensional data of the target virtual object.

[0091] In some embodiments, after adding multiple first virtual objects and third virtual objects to the affected set, for each target virtual object in the affected set, a path replanning request task for the target virtual object can be generated by the following method: obtaining the object identifier of the target virtual object, the vehicle identifier of the target virtual vehicle that the target virtual object can reach after the location movement event is triggered, and the request version number; generating a path replanning request task corresponding to the target virtual object based on the object identifier, vehicle identifier, and request version number, and adding the path replanning request task to the task queue.

[0092] Here, the affected set is a collection of objects consisting of multiple first virtual objects and third virtual objects, and the target virtual object is any virtual object in the affected set.

[0093] In practice, the process can be executed in the order of object collection, task generation, and priority calculation. First, multiple first virtual objects and third virtual objects are written into the same affected set. Then, path replanning request tasks are generated for each target virtual object in the affected set. Finally, the corresponding scheduling priority is determined based on the multi-dimensional data of each target virtual object.

[0094] Specifically, adding multiple first and third virtual objects to the affected set can be achieved by constructing a unified object cache structure. Here, the object cache structure is a cached data structure, such as a list, set, or mapping table, used to temporarily store the identifiers of virtual objects to be processed and their associated fields. First, an empty affected set is initialized. Then, multiple first virtual objects are written to the affected set sequentially, followed by multiple third virtual objects. If an object belongs to multiple first and third virtual objects simultaneously, deduplication is performed during the writing process to ensure that the same target virtual object is recorded only once in the affected set.

[0095] In other embodiments, a first object subset and a third object subset can be established separately, and then the affected set can be obtained through a set union operation. This application does not limit the specific construction method of the affected set. By first uniformly aggregating multiple first and third virtual objects, the scope of objects generated for subsequent path replanning request tasks can be clarified, and the generation of duplicate tasks can be reduced.

[0096] After adding multiple first and third virtual objects to the affected set, for each target virtual object in the affected set, obtain the object identifier of the target virtual object, the vehicle identifier of the target virtual vehicle that the target virtual object can reach after the location movement event is triggered, and the request version number.

[0097] Here, the object identifier is a data identifier used to uniquely represent the target virtual object, the vehicle identifier is a data identifier used to uniquely represent the target virtual vehicle, the request version number is used to identify the scene state snapshot version corresponding to the path replanning request, so as to distinguish the request batches triggered by different location movement events, and the task queue is a task data structure used to cache multiple path replanning request tasks and support sorting and scheduling processing.

[0098] In some embodiments, for each target virtual object in the affected set, the object identifier of the target virtual object can be read first, and then the target virtual vehicle that the target virtual object can reach can be determined according to the scene connectivity after the location movement event is triggered. The vehicle identifier of the target virtual vehicle can be obtained, and then the path replanning request task record corresponding to the target virtual object can be constructed by combining the request version number corresponding to the current scene state.

[0099] In other embodiments, task generation time, task status field, or detection source field may be added to the path replanning request task to facilitate subsequent task tracking and status management. This application embodiment does not limit the specific field composition of the path replanning request task.

[0100] By generating path replanning request tasks based on object identifiers, vehicle identifiers, and request version numbers in the above manner, the path replanning requirements of each target virtual object can be entered into the task queue in a structured form, which facilitates subsequent unified sorting and scheduling.

[0101] In some embodiments, see Figure 5 , Figure 5 This is a schematic diagram of the third process of the path processing method for virtual objects provided in this application embodiment. Step 104, "determining the scheduling priority of the target virtual object based on multi-dimensional data of the target virtual object," can be executed... Figure 5 Steps 1041 to 1043 are implemented, and the details are explained below.

[0102] In step 1041, multi-dimensional data of the target virtual object is obtained.

[0103] Here, the multi-dimensional data includes at least two of the following: the object type of the target virtual object, the cumulative waiting time, the remaining path cost to the target virtual vehicle, the associated priority parameters, and the cumulative number of replanning attempts. The target virtual vehicle is the virtual vehicle that the target virtual object can reach after the location movement event is triggered.

[0104] In practice, the corresponding status record can be read based on the object identifier of the target virtual object, and the object type can be extracted from the status record. The object type is a classification identifier (e.g., ordinary passenger, VIP passenger, staff, etc.) representing the business category or scheduling category of the target virtual object, the cumulative waiting time, the associated priority parameters, and the cumulative number of replanning attempts. Simultaneously, the remaining path cost to the target virtual vehicle is calculated based on the path result between the current location of the target virtual object and the current location of the target virtual vehicle. The cumulative waiting time is the cumulative timing result from when the target virtual object entered the waiting state to the current moment, and the remaining path cost is a numerical parameter representing the remaining path cost between the current location of the target virtual object and the current location of the target virtual vehicle; it can be path length, estimated travel time, or a comprehensive weight value.

[0105] As an example, suppose a target virtual object is of type 2, has a cumulative waiting time of 18 seconds, a remaining path cost to the target virtual vehicle of 14, a gain value of 1.0 for the associated priority parameter, and a cumulative number of replanning attempts of 3.

[0106] In other embodiments, the aforementioned multi-dimensional data can also be extracted directly from the task cache structure or object image structure. This application does not limit the specific method of obtaining the multi-dimensional data. By uniformly obtaining the multi-dimensional data in step 1041, repeated queries in subsequent calculations can be reduced, improving the continuity of scheduling priority calculation.

[0107] In step 1042, the basic weight parameters are determined based on the object type, the time gain parameters are determined based on the cumulative waiting time, the distance gain parameters are determined based on the remaining path cost, and the penalty conversion parameters are determined based on the cumulative number of replanning attempts.

[0108] In practical implementation, the basic weight parameters can be expressed as follows: The time gain parameter can be expressed as The range gain parameter can be expressed as The penalty conversion parameter can be expressed as The priority parameter can be expressed as First, determine the basic weight parameters based on the mapping relationship between object type and basic weight parameters. The value is then determined based on the cumulative waiting time and the time weighting coefficient. The time gain parameter is calculated based on the product relationship. Then, it is determined according to the remaining path cost and distance weight coefficient. and preset smoothing parameters The distance gain parameter is calculated based on the relationship between the cumulative number of replanning iterations and the replanning suppression coefficient. The product relationship is used to calculate the penalty conversion parameter.

[0109] As an example, if the basic weight parameter corresponding to the object type of a certain target virtual object The cumulative waiting time is 0.8. It is 18 seconds, with a time weighting coefficient. If the value is 0.05, then the time gain parameter is 0.9; if the remaining path cost to the target virtual vehicle is... The distance weighting coefficient is 14. The preset smoothing parameter is 1.0. If it is 1.0, then the range gain parameter is That is, approximately 0.067; if the cumulative number of replanning times The reprogramming inhibition coefficient is 3. If the value is 0.2, then the penalty conversion parameter is 0.6; if the priority weight coefficient is... The gain value is 0.6, corresponding to the associated priority parameter. If the value is 1.0, then the priority parameter is 0.6.

[0110] In other embodiments, the cumulative waiting time and remaining path cost can be normalized before performing the above mapping to reduce the impact of data with different dimensions on the calculation results. The embodiments of this application do not limit the specific form of the parameter mapping function.

[0111] The above method can transform object type, cumulative waiting time, remaining path cost, associated priority parameters, and cumulative replanning times into unified numerical parameters, providing a foundation for subsequent comprehensive calculations.

[0112] In step 1043, the basic weight parameter, time gain parameter, distance gain parameter and priority parameter are summed, and the penalty conversion parameter is subtracted from the summation result to obtain the scheduling priority of the target virtual object.

[0113] In practice, the basic weight parameters, time gain parameters, distance gain parameters, and priority parameters are summed, and the penalty conversion parameter is subtracted from the summation result. This can be done using the formula... The calculation yielded that, Indicates the scheduling priority of the target virtual object. This represents the basic weight parameters determined based on the object type. This represents the time gain parameter determined based on the cumulative waiting time. This represents the distance gain parameter determined based on the remaining path cost. This indicates the priority parameters determined based on the association priority parameters. This represents the result calculated based on the penalty reduction parameter determined by the cumulative number of replanning iterations. This refers to the scheduling priority of the target virtual object. The scheduling priority is a numerical result used to characterize the execution order of path replanning request tasks corresponding to multiple target virtual objects.

[0114] here, It is the object type of the target virtual object. It is the cumulative waiting time. It is the remaining path cost to the target virtual vehicle. It is the preset smoothing parameter. It is the gain value corresponding to the associated priority parameter. It is the cumulative number of replanning attempts. , , and These are the time weight coefficient, distance weight coefficient, priority weight coefficient, and replanning inhibition coefficient.

[0115] By aggregating the first and third virtual objects into an affected set, the processing scope of path replanning can be effectively narrowed, avoiding recalculation operations triggered by all virtual objects. Path replanning request tasks are generated based on object identifiers, vehicle identifiers, and request version numbers, ensuring the uniqueness and traceability of tasks. Scheduling priorities are obtained through multi-dimensional data collection, parameter quantization conversion, and combined calculations, enabling differentiated and orderly scheduling of path replanning tasks. Overall, this reduces the instantaneous computational overhead of the virtual scene, minimizes jitter and congestion during path replanning, and improves the smoothness and stability of virtual scene operation.

[0116] See also Figure 3 In step 105, the path replanning request tasks of each target virtual object are sorted in descending order based on scheduling priority, and the path replanning operation is performed on each target virtual object based on the descending order.

[0117] In some embodiments, see Figure 6 , Figure 6 This is a schematic diagram of the fourth process of the virtual object path processing method provided in the embodiments of this application. Figure 3 Step 105 in the process can be executed Figure 6 Steps 1051 to 1053 are implemented, and the details are explained below.

[0118] In step 1051, the path replanning request tasks corresponding to each target virtual object are added to the task queue.

[0119] In practice, path replanning request tasks corresponding to each target virtual object are added to a task queue, and the scattered path replanning request tasks are aggregated into a unified data management structure for subsequent sorting processing. The task queue is a data structure used to cache path replanning request tasks corresponding to each target virtual object. The path replanning request task can include fields such as the object identifier of the target virtual object, the vehicle identifier of the target virtual vehicle, the request version number, and the scheduling priority. The task queue can be a sequential list, a linked list, or other caching structure that supports sequential traversal and reordering.

[0120] In some embodiments, the corresponding path replanning request tasks can be read one by one according to the traversal order of each target virtual object in the affected set, and the path replanning request tasks can be inserted into the tail of the task queue to obtain an initial task queue containing all tasks to be processed.

[0121] In step 1052, the path replanning request tasks in the task queue are sorted in descending order according to the scheduling priority corresponding to each target virtual object.

[0122] In practice, the path replanning requests in the task queue are sorted in descending order to ensure that path replanning requests with higher scheduling priority are processed first. The scheduling priority field of each path replanning request in the task queue is read, and the path replanning requests in the task queue are rearranged based on a comparison sorting method, so that the scheduling priority of any path replanning request at the front of the queue is not lower than that of any path replanning request at the back of the queue.

[0123] In some embodiments, if two path replanning request tasks have the same scheduling priority, their order can be further determined according to the order in which they entered the task queue, the order of request version numbers, or the order of object identifiers. As an example, if both path replanning request tasks have a scheduling priority of 1.9, the path replanning request task that joined the task queue earlier can be placed first.

[0124] In other embodiments, a hierarchical sorting method can also be adopted, that is, first divide the task into multiple task groups according to the interval where the scheduling priority is located, and then continue to perform fine sorting within the group. The embodiments of this application do not limit the specific implementation method of descending sorting.

[0125] In this way, the scheduling priority of the target virtual object can be directly mapped to the task execution order, so that the target virtual objects with higher waiting levels, closer to the target virtual vehicle, or with higher priority needs will get the path replanning processing opportunity first.

[0126] In step 1053, path replanning operations are performed on each target virtual object in descending order.

[0127] In some embodiments, step 1053 can be implemented by the following method: for each target virtual object, obtain the third position of the target virtual object and the fourth position of the target virtual vehicle that the target virtual object can reach; in the navigation grid corresponding to the virtual scene, determine the starting navigation grid corresponding to the third position and the target navigation grid corresponding to the fourth position; in the navigation grid, search for the connecting path between the starting navigation grid and the target navigation grid to obtain the navigation grid sequence of the connecting path; extract multiple path points from the navigation grid sequence, and generate the replanning path corresponding to the target virtual object based on the multiple path points.

[0128] In practice, sequential execution involves retrieving path replanning request tasks one by one from the task queue in order of their order, and then performing path replanning processing on the target virtual object corresponding to each path replanning request task. Specifically, starting from the head of the task queue after descending order, each path replanning request task is read one by one, the corresponding target virtual object is located, and the path replanning operation for that target virtual object is triggered; after the path replanning operation for the current target virtual object is completed, the next path replanning request task is processed.

[0129] A navigation mesh is a path search structure formed by discretizing traversable areas in a virtual scene. The starting navigation mesh contains the third position, and the target navigation mesh contains the fourth position. The navigation mesh sequence is a sequence of navigation meshes traversed by the connected path from the starting to the target navigation mesh. Path points are key location points extracted from the navigation mesh sequence to describe the geometry of the replanned path. Based on the coordinates of the third and fourth positions in the virtual scene coordinate system, their respective navigation meshes are located. Then, a connected path between the starting and target navigation meshes is searched in the connected graph formed by the navigation meshes.

[0130] Here, the search for a connected path involves progressively expanding on the adjacency relationships between navigation grids until a traversable path is found from the starting navigation grid to the target navigation grid.

[0131] As an example, suppose the third position is located in navigation grid number 12, the fourth position is located in navigation grid number 36, and the navigation grid sequence obtained from the search results is 12, 15, 19, 24, 30 and 36, then the system can extract multiple waypoints based on this navigation grid sequence.

[0132] For example, the access points and endpoints of each adjacent navigation grid boundary are extracted and then connected to form a replanning path corresponding to the target virtual object. For instance, if the extracted path points are (10, 20), (18, 24), (25, 30), (33, 35), and (40, 40), a replanning path consisting of four path segments can be generated according to the order of the path points, allowing the target virtual object to move along the replanning path to the fourth position of the target virtual vehicle.

[0133] In other embodiments, smoothing can be performed on multiple waypoints after generating the replanned path to reduce unnecessary sharp turns. This application does not limit the specific division of the navigation grid, nor does it limit the specific search method for connected paths. By generating the replanned path in the navigation grid based on the third and fourth positions, the path replanning operation can be kept consistent with the passable areas in the virtual scene, thereby improving the effectiveness and executability of the generated path.

[0134] In some embodiments, steps 1051 to 1053 can also form a continuous data transfer relationship, that is, the path replanning request task written into the task queue in step 1051 can be directly read and sorted according to the scheduling priority in step 1052, and the sorted task order in step 1052 can be directly used as the execution order of the path replanning operation in step 1053.

[0135] As an example, if a path replanning request task already contains object identifier, vehicle identifier, request version number, and scheduling priority when added to the task queue in step 1051, then step 1052 only needs to read the scheduling priority field to complete the sorting, and step 1053 only needs to read the object identifier and vehicle identifier to locate the target virtual object and target virtual vehicle, thereby performing the path replanning operation. This continuous data transmission method reduces redundant queries and constructions between different steps, improving the integrity of the processing chain.

[0136] The above method first adds the path replanning request tasks corresponding to each target virtual object to the task queue. Then, it sorts the path replanning request tasks in the task queue in descending order according to the scheduling priority of each target virtual object. Finally, it performs path replanning operations on each target virtual object in descending order, ensuring that the path processing strictly revolves around the quantified scheduling results. Furthermore, by searching for connected paths in the navigation mesh based on the third and fourth positions and generating replanned paths during the path replanning operation, the task sorting results can be further implemented in the specific path generation process, thereby improving the rationality of the execution order of the path replanning operation, the executability of the path generation results, and the continuity of the entire task processing flow.

[0137] In some embodiments, see Figure 7 , Figure 7 This is a fifth flowchart of the virtual object path processing method provided in this application embodiment; the virtual object path processing method provided in this application embodiment can be displayed in a virtual scene, and can be implemented through steps 201 to 202, as described in detail below.

[0138] In step 201, a first movement path for multiple first virtual objects to reach a first virtual vehicle and a second movement path for multiple second virtual objects to reach a second virtual vehicle are displayed in the virtual scene.

[0139] In practice, a first movement path can be generated based on the path point sequences corresponding to multiple first virtual objects, and a second movement path can be generated based on the path point sequences corresponding to multiple second virtual objects. The first and second movement paths are then drawn onto the virtual scene. Here, the path point sequence refers to a set of multiple path points arranged in the order of movement, and drawing refers to presenting the path direction in the virtual scene's display interface using line connections, trajectory overlays, or guide markers. Different display styles can be used for the first and second movement paths to distinguish the path affiliation of different virtual vehicles.

[0140] As an example, the first movement path can be displayed in a first color, and the second movement path can be displayed in a second color. The first color and the second color are different colors. Alternatively, the first movement path can be displayed in a solid line style, and the second movement path can be displayed in a dashed line style. In this embodiment, the form of distinguishing movement paths is not limited.

[0141] In some embodiments, see Figure 8 , Figure 8 This is a first schematic diagram of a virtual scene provided in the embodiments of this application; a first virtual vehicle 801 and a second virtual vehicle 802 are displayed in the virtual scene. The virtual scene can be fixed as a parking lot. A first movement path (red line) 8011 and a first movement path (blue line) 8012 are generated according to the path point sequence corresponding to each of the multiple first virtual objects 803. At the same time, the second movement path (green line) 8021 of multiple second virtual objects 804 to reach the second virtual vehicle 802 is displayed. Different movement paths can be distinguished by different colors.

[0142] Using the above method, the original movement relationships of multiple first virtual objects and multiple second virtual objects can be clearly displayed in the virtual scene before the location movement event occurs.

[0143] See also Figure 7In step 202, in response to the location movement event triggered by the first virtual vehicle, the third movement path obtained by performing path replanning operations on multiple first virtual objects and third virtual objects is displayed sequentially based on scheduling priority.

[0144] Here, the third virtual object is the second virtual object corresponding to the second movement path affected by the position movement event.

[0145] In practical applications, in response to a location movement event triggered by the first virtual vehicle, after detecting that the first virtual vehicle has moved from its original position, the path display content on the interface is updated based on the completed path processing results. Specifically, the current display states of the first and second movement paths can be maintained firstly, while a corresponding third movement path is generated based on the path replanning results of multiple first and third virtual objects. Subsequently, the third movement paths obtained by performing path replanning operations on multiple first and third virtual objects are displayed sequentially based on scheduling priority.

[0146] Here, the order of display based on scheduling priority means that the updated movement paths of multiple first and third virtual objects are presented one by one or in batches in the virtual scene according to their scheduling priority.

[0147] By using the above method, the display order can be kept consistent with the path processing order, thereby synchronously reflecting the path update sequence of each target virtual object at the display level.

[0148] When displaying the third movement path sequentially based on scheduling priority, the third movement path corresponding to the target virtual object with the highest scheduling priority is determined first and displayed in the virtual scene first. After the current third movement path is displayed, the third movement path corresponding to the target virtual object with the second highest scheduling priority is displayed, until the third movement paths corresponding to all target virtual objects are displayed.

[0149] As an example, suppose there are four target virtual objects among multiple first and third virtual objects, with scheduling priorities of 2.6, 2.1, 1.8, and 1.4 respectively. Then, the four third movement paths can be displayed sequentially in the order of 2.6, 2.1, 1.8, and 1.4. In this way, users can observe the path update process in the virtual scene that is consistent with the task scheduling order.

[0150] Path replacement display hides the first or second movement path of the target virtual object before displaying the third movement path, which corresponds to the current target virtual object. Path overlay display displays the third movement path while retaining the original path display, creating a comparison between the paths before and after the update. Progressive path update display gradually presents path segments along the extension direction of the third movement path to reflect the path replanning generation process.

[0151] If the target virtual object belongs to multiple first virtual objects, the original first movement path can be switched to the third movement path. If the target virtual object belongs to a third virtual object, the original second movement path can be switched to the third movement path.

[0152] The display of the third movement path can be achieved based on multiple path points corresponding to the replanned path. Specifically, multiple path points in the replanned path can be obtained, and the third movement path can be drawn in the virtual scene according to the connection order of the multiple path points.

[0153] Here, multiple path points can be key location points generated during path replanning, and the connection order can be the travel order from the current position of the target virtual object to the current position of the target virtual vehicle. In other embodiments, multiple path points can be smoothed before display to reduce irregular turns in the displayed path. This application does not limit the specific drawing method of the third movement path. By displaying the third movement path based on multiple path points, the path replanning result can have a clear geometric expression at the display level.

[0154] For a second movement path that is not affected by the position movement event, its corresponding second movement path can continue to be displayed in the virtual scene without switching to the third movement path. Thus, the path display in the virtual scene will simultaneously include both the unchanged second movement path and the updated third movement path.

[0155] In some embodiments, see Figure 9 , Figure 9This is a second schematic diagram of a virtual scene provided in an embodiment of this application. The virtual scene is fixed as a parking lot. There are reachable first virtual paths 9012 between multiple first virtual objects 9011 and first virtual vehicles 901, and reachable second virtual paths 9022 between multiple second virtual objects 9021 and second virtual vehicles 902. After a location movement event is triggered, the first virtual vehicle 901 is moved to a new location. At this time, the originally reachable second virtual path 9022 is occupied by the first virtual vehicle 901, becoming an unreachable original second virtual path 9023 for the multiple second virtual objects 9021. At this time, through the virtual object path processing method of this application, multiple path points in the path are replanned, generating a new reachable first virtual path 9013 between the multiple first virtual objects 9011 and the moved first virtual vehicle 901, and generating a new reachable third virtual path 9024 between the multiple second virtual objects 9021 and second virtual vehicles 902, thus maintaining the stability of the virtual scene.

[0156] In some embodiments, the path processing method for virtual objects provided in this application can also be combined with the waiting state of virtual objects for auxiliary display, as described below: During the waiting process, a fourth virtual object among a plurality of first virtual objects and a plurality of second virtual objects that meets the emotional feedback conditions is highlighted in a target style; wherein, the target style includes at least one of the following: text prompt style, facial expression feedback style, action feedback style, and voice feedback style; the emotional feedback conditions include at least one of the following: the cumulative waiting time reaches the target time, and the cumulative number of replanning times reaches the target number.

[0157] In actual implementation, if a virtual object is the fourth virtual object among multiple first virtual objects and multiple second virtual objects that meets the emotional feedback conditions, and the cumulative waiting time of the fourth virtual object reaches the target time, text prompts or facial feedback information can be displayed near the fourth virtual object; if the cumulative number of replanning times of a certain fourth virtual object reaches the target number, the fourth virtual object can be highlighted through action feedback style or voice feedback style.

[0158] As an example, if the cumulative waiting time of a first virtual object reaches ten seconds, a prompt text can be displayed above its head; if the cumulative replanning count of a second virtual object reaches three, corresponding voice feedback can be played at its current location. In this way, the displayed content in the virtual scene can not only reflect the path change result, but also the state changes of the virtual objects during the waiting process.

[0159] In practice, the text prompt style is a display style that presents status text or identification information in a preset display area. Here, the prompt text can be directly displayed in the top area of ​​the fourth virtual object's head, the side area of ​​its body, or in the interface overlay bound to the fourth virtual object.

[0160] For example, when the cumulative waiting time of a certain fourth virtual object reaches the target time, text content such as "Waiting", "Please prioritize processing" or "Path update in progress" can be displayed above the fourth virtual object; when the cumulative number of replanning attempts of a certain fourth virtual object reaches the target number, prompts such as "Replanning in progress", "Route changes ahead" or "Please wait" can be displayed in its corresponding position.

[0161] In some embodiments, the text prompt style may also include color changes, font size changes, or blinking. For example, when the cumulative waiting time first reaches the target time, the text may be displayed in a first color; as the cumulative waiting time continues to increase and exceeds a higher threshold, the text may be switched to a second color or the font size may be increased to enhance distinguishability.

[0162] Graphical feedback styles can manifest as switching preset graphic resources or displaying graphic symbols. Here, facial expression resources can include neutral expressions, waiting expressions, anxious expressions, dissatisfied expressions, etc.

[0163] As an example, when the cumulative waiting time of the fourth virtual object reaches the target time, the default neutral expression of the fourth virtual object can be switched to a frowning expression or an open-mouth waiting expression; when the cumulative number of replanning attempts reaches the target number, an exclamation mark icon, a question mark icon, or a symbol bubble indicating a path change can be displayed above the fourth virtual object.

[0164] In some embodiments, see Figure 10 , Figure 10 This is a third schematic diagram of a virtual scene provided in the embodiments of this application. The virtual scene is fixed as a parking lot. After the location movement event is triggered, there is still a reachable first movement path (black line) 1011 between the moved first virtual vehicle 1001 and multiple first virtual objects 1003. However, the original reachable virtual path between multiple second virtual objects 1004 and second virtual vehicle 1002 is blocked by the moved first virtual vehicle 1001, resulting in an unreachable second movement path (yellow line) 1021. Assuming that there is a fourth virtual object among the multiple second virtual objects 1004 that meets the emotional feedback conditions, and the cumulative waiting time of the fourth virtual object reaches the target time, an expression feedback 1005 is displayed near the fourth virtual object. For example, the expression feedback 1005 is displayed as an angry expression to reflect the current emotional state of the fourth virtual object.

[0165] In some embodiments, the facial expression feedback style can also change in stages according to the duration. For example, a mild waiting expression can be displayed when the cumulative waiting time reaches a first target duration, and a more obvious anxious expression can be displayed when the cumulative waiting time reaches a second target duration, so as to reflect the progressive change in the waiting state.

[0166] The motion feedback style can be expressed as changes in the fourth virtual object's limb movements, standing posture, or local animation effects.

[0167] Here, the motion feedback style does not require the fourth virtual object to leave its original position, but rather reflects its current state through local motion changes.

[0168] As an example, when the cumulative waiting time of a certain fourth virtual object reaches the target time, it can trigger the pacing action, the raising of the hand action, the looking left and right action, or the turning back action after a brief pause; when the cumulative number of replannings of a certain fourth virtual object reaches the target number, it can trigger the turning back action, the half-step back action, the looking up action, or the repeated probing forward action.

[0169] In some embodiments, the motion feedback style can also be associated with the current orientation and path state of the fourth virtual object. For example, when the path has just changed, the fourth virtual object can first perform a rotation action towards the new path direction, and then return to the state of waiting to move, so that the motion feedback matches the path change process.

[0170] The voice feedback style can be represented by the fourth virtual object playing a voice segment or voice prompt corresponding to the current state.

[0171] Here, voice feedback can be implemented using short voice messages, prompts, or continuous voice segments.

[0172] As an example, when the cumulative waiting time of the fourth virtual object reaches the target time, voice messages such as "Waiting", "Please arrange as soon as possible" or "When can we depart" can be played; when the cumulative number of replanning attempts of the fourth virtual object reaches the target number, voice messages such as "Route changed", "Need to go again" or "Cannot pass ahead" can be played.

[0173] In some embodiments, the voice feedback style can also switch between different voice resources according to the object type of the fourth virtual object. For example, different object types correspond to voice segments with different timbres, different speaking speeds, or different tone intensities, in order to enhance the consistency of the display results.

[0174] Status feedback conditions include the cumulative waiting time reaching the target duration and / or the cumulative number of replannings reaching the target number, and one or more feedback patterns can be triggered accordingly.

[0175] The cumulative waiting time reaching the target time can be understood as the cumulative waiting time of the fourth virtual object since entering the waiting state reaching or exceeding the preset time threshold.

[0176] Here, the target duration is a preset time threshold, or a time threshold updated according to preset rules based on scenario load parameters.

[0177] As an example, if the target duration is set to 8 seconds, then the emotional feedback condition is met when a certain fourth virtual object has been waiting continuously for 8 seconds since entering the waiting state; if the target duration is set to 12 seconds, then the corresponding feedback will only be triggered after the waiting time reaches 12 seconds.

[0178] In some embodiments, the cumulative waiting time can be set in layers with multiple target durations. For example, the first target duration is 5 seconds, the second target duration is 10 seconds, and the third target duration is 15 seconds. When the cumulative waiting time reaches 5 seconds, only the text prompt style is triggered; when the cumulative waiting time reaches 10 seconds, the facial expression feedback style is also triggered; when the cumulative waiting time reaches 15 seconds, the action feedback style or voice feedback style is further triggered.

[0179] For example, a fourth virtual object enters a waiting state at second 0, displays the text "Waiting" above its head at second 5, changes its facial expression to an anxious expression at second 10, and performs a pacing action and plays a prompt voice at second 15, thus forming a feedback process that progresses with the waiting time.

[0180] The cumulative number of replanning attempts reaching the target number can be understood as the number of times the path corresponding to the fourth virtual object is repeatedly replanned within the current processing cycle, reaching or exceeding a pre-set threshold number of attempts.

[0181] Here, the target number of times can be 2, 3, 4 or other preset values.

[0182] As an example, if the target number of times is set to 2, then when a path replanning occurs again after the first path update of a certain fourth virtual object, the emotional feedback condition is met; if the target number of times is set to 3, then feedback will only be triggered after the third path replanning occurs.

[0183] In some embodiments, the cumulative number of replanning attempts can also be set in layers. For example, when the cumulative number of replanning attempts reaches 2, an emoji feedback style is triggered, and when the cumulative number of replanning attempts reaches 3, a text prompt style and an action feedback style are triggered.

[0184] For example, a fourth virtual object does not trigger any highlighting after the first route replanning. During the second route replanning, a route change symbol bubble appears above its head. During the third route replanning, a "Replanning in progress" text prompt is added, and a brief back-turn action is performed. During the fourth route replanning, a "Route changed" voice prompt is played, reflecting the continuous changes in the path status of the fourth virtual object.

[0185] The cumulative waiting time reaching the target duration and the cumulative number of replanning attempts reaching the target number can also be used in combination to improve the accuracy of the emotional feedback conditions in expressing the current state of the fourth virtual object.

[0186] For example, if the cumulative waiting time of a certain fourth virtual object reaches 10 seconds but the cumulative replanning count is only 1, then only the text prompt style and the mild facial expression feedback style are triggered; if the cumulative waiting time of another fourth virtual object reaches 10 seconds and the cumulative replanning count reaches 3, then the text prompt style, facial expression feedback style, action feedback style and voice feedback style are triggered simultaneously.

[0187] This combination method allows the target style to be matched with the waiting level and path change level of the fourth virtual object, thereby more accurately displaying the state of the fourth virtual object in the virtual scene.

[0188] The following description continues to illustrate the exemplary structure of the virtual object path processing device 455 provided in the embodiments of this application as a software module. In some embodiments, such as Figure 2 As shown, the software modules in the path processing device 455 storing virtual objects in the memory 450 may include: an object determination module 4551, used to determine, among multiple virtual objects in the virtual scene, multiple first virtual objects that can reach the first virtual vehicle, and multiple second virtual objects that cannot reach the first virtual vehicle but can reach the second virtual vehicle; an impact detection module 4552, used to detect whether the planned paths of each second virtual object to the second virtual vehicle are affected by the position movement event when the first virtual vehicle is detected to have triggered a position movement event, and obtain a detection result; and an object filtering module 4553, used to filter objects based on the detection result from multiple virtual objects. The third virtual object corresponding to the planned path affected by the location movement event is selected from the second virtual objects; the scheduling processing module 4554 is used to add multiple first virtual objects and third virtual objects to the affected set, generate a path replanning request task for each target virtual object in the affected set, and determine the scheduling priority of the target virtual object based on the multi-dimensional data of the target virtual object; the path replanning module 4555 is used to sort the path replanning request tasks of each target virtual object in descending order based on the scheduling priority, and perform path replanning operation on each target virtual object based on the descending order.

[0189] In some embodiments, the impact detection module 4552 is further configured to: determine a detection area based on the first and second positions when a location movement event indicates that the first virtual vehicle has moved from the first position to the second position; detect whether the planned path of each second virtual object to the second virtual vehicle passes through the detection area; if the planned path passes through the detection area, obtain a detection result indicating that the planned path is affected by the location movement event; if the planned path does not pass through the detection area, obtain the minimum distance between the detection area and the planned path, and if the minimum distance is less than a preset distance threshold, obtain a detection result indicating that the planned path is affected by the location movement event; if the minimum distance is greater than or equal to the preset distance threshold, obtain a detection result indicating that the planned path is not affected by the location movement event.

[0190] In some embodiments, the impact detection module 4552 is further configured to acquire multiple path points corresponding to the planned path, connect adjacent path points in sequence to generate multiple path segments corresponding to the planned path, detect whether each path segment intersects with the area to be detected, determine that the planned path passes through the area to be detected if there is a path segment intersecting with the area to be detected, and determine that the planned path does not pass through the area to be detected if there is no path segment intersecting with the area to be detected.

[0191] In some embodiments, the scheduling processing module 4554 is further configured to obtain the object identifier of the target virtual object, the vehicle identifier of the target virtual vehicle that the target virtual object can reach after the location movement event is triggered, and the request version number; based on the object identifier, vehicle identifier, and request version number, generate a path replanning request task corresponding to the target virtual object, and add the path replanning request task to the task queue.

[0192] In some embodiments, the scheduling processing module 4554 is further configured to acquire multi-dimensional data of the target virtual object, the multi-dimensional data including at least two of the following: the object type of the target virtual object, the cumulative waiting time, the remaining path cost to the target virtual vehicle, the associated priority parameter, and the cumulative number of replanning attempts, wherein the target virtual vehicle is a virtual vehicle that the target virtual object can reach after the location movement event is triggered; determine the basic weight parameter based on the object type, the time gain parameter based on the cumulative waiting time, the distance gain parameter based on the remaining path cost, and the penalty conversion parameter based on the cumulative number of replanning attempts; sum the basic weight parameter, the time gain parameter, the distance gain parameter, and the priority parameter, and subtract the penalty conversion parameter from the summation result to obtain the scheduling priority of the target virtual object.

[0193] In some embodiments, the path replanning module 4555 is further configured to add the path replanning request tasks corresponding to each target virtual object to the task queue; sort the path replanning request tasks in the task queue in descending order according to the scheduling priority corresponding to each target virtual object; and perform path replanning operations on each target virtual object in sequence according to the order after descending sorting.

[0194] In some embodiments, the path replanning module 4555 is further configured to: obtain, for each target virtual object, the third position of the target virtual object and the fourth position of the target virtual vehicle that the target virtual object can reach; determine, in the navigation grid corresponding to the third position and the target navigation grid corresponding to the fourth position; search for a connecting path between the starting navigation grid and the target navigation grid in the navigation grid to obtain a navigation grid sequence of the connecting path; extract multiple path points from the navigation grid sequence, and generate a replanning path corresponding to the target virtual object based on the multiple path points.

[0195] In some embodiments, the display module 4556 is used to display in a virtual scene a first movement path of multiple first virtual objects to a first virtual vehicle, and a second movement path of multiple second virtual objects to a second virtual vehicle; in response to the first virtual vehicle triggering a location movement event, the third movement path obtained by performing path replanning operations on multiple first virtual objects and third virtual objects is displayed sequentially based on scheduling priority, wherein the third virtual object is the second virtual object corresponding to the second movement path affected by the location movement event.

[0196] In some embodiments, the display module 4556 is further configured to highlight, during the waiting process, a fourth virtual object among a plurality of first virtual objects and a plurality of second virtual objects that meets the emotional feedback conditions in a target style; wherein the target style includes at least one of the following: text prompt style, facial expression feedback style, action feedback style, and voice feedback style; and the emotional feedback conditions include at least one of the following: the cumulative waiting time reaches the target time, and the cumulative number of replanning reaches the target number.

[0197] This application provides a computer program product including a computer program or computer-executable instructions stored in a computer-readable storage medium. The processor of an electronic device reads the computer-executable instructions from the computer-readable storage medium and executes the computer-executable instructions, causing the electronic device to perform the virtual object path processing method described above in this application.

[0198] This application provides a computer-readable storage medium storing computer-executable instructions or a computer program. When the computer-executable instructions or the computer program are executed by a processor, the processor will execute the path processing method for virtual objects provided in this application. For example, ... Figure 3 The path handling method for virtual objects is shown.

[0199] In some embodiments, the computer-readable storage medium may be a memory such as RAM, ROM, flash memory, magnetic surface memory, optical disk, or CD-ROM; or it may be a variety of devices including one or any combination of the above-mentioned memories.

[0200] In some embodiments, computer-executable instructions may take the form of programs, software, software modules, scripts, or code, written in any form of programming language (including compiled or interpreted languages, or declarative or procedural languages), and may be deployed in any form, including as stand-alone programs or as modules, components, subroutines, or other units suitable for use in a computing environment.

[0201] As an example, computer-executable instructions may, but do not necessarily, correspond to files in a file system. They may be stored as part of a file that holds other programs or data, for example, in one or more scripts in a Hyper Text Markup Language (HTML) document, in a single file dedicated to the program in question, or in multiple co-located files (e.g., files that store one or more modules, subroutines, or code sections).

[0202] As an example, computer-executable instructions can be deployed to execute on a single electronic device, or on multiple electronic devices located in one location, or on multiple electronic devices distributed across multiple locations and interconnected via a communication network.

[0203] In summary, this application's embodiments divide virtual objects within a virtual scene into first virtual objects that can reach a first virtual vehicle and second virtual objects that cannot reach the first virtual vehicle but can reach a second virtual vehicle. After the first virtual vehicle triggers a location movement event, the impact on the planned paths of the second virtual objects is uniformly detected, and a third virtual object is identified. Both types of objects are grouped into the affected set, and a unified path replanning request task is initiated. The scheduling priority is determined based on multi-dimensional data of the target virtual objects, and the path replanning operation is completed sequentially in descending order of priority. This can accurately pinpoint the entire range of virtual objects affected by the location movement event, avoid redundant detection and replanning processes for unrelated virtual objects, effectively reduce the computational overhead and system resource consumption of path processing, and ensure that the processing order of path replanning for each target virtual object is reasonable and orderly by coordinating multi-dimensional data to determine the scheduling priority. Defining the affected boundary of the path according to the standardized detection logic further improves the accuracy of the impact judgment. Standardized generation of request tasks and completion of path reconstruction based on the navigation grid can ensure the standardization and execution stability of the path processing process, and improve the overall operating efficiency and processing accuracy of virtual object path scheduling within the virtual scene.

[0204] The above description is merely an embodiment of this application and is not intended to limit the scope of protection of this application. Any modifications, equivalent substitutions, and improvements made within the spirit and scope of this application are included within the scope of protection of this application.

Claims

1. A method for processing the path of a virtual object, characterized in that, The method includes: Among multiple virtual objects in a virtual scene, a plurality of first virtual objects that are reachable from a first virtual vehicle, and a plurality of second virtual objects that are not reachable from the first virtual vehicle but are reachable from a second virtual vehicle are identified; When the first virtual vehicle is detected to have triggered a location movement event, the planned paths of each second virtual object to the second virtual vehicle are detected to be affected by the location movement event, and the detection results are obtained. Based on the detection results, a third virtual object corresponding to the planned path affected by the location movement event is selected from the plurality of second virtual objects; The plurality of first virtual objects and the third virtual objects are added to the affected set. For each target virtual object in the affected set, a path replanning request task is generated for the target virtual object. Multi-dimensional data of the target virtual object is obtained. The multi-dimensional data includes: the object type of the target virtual object, the cumulative waiting time, the remaining path cost to the target virtual vehicle, the associated priority parameters, and the cumulative number of replanning attempts. The target virtual vehicle is the virtual vehicle that the target virtual object can reach after the location movement event is triggered. The basic weight parameters are determined based on the object type, the time gain parameters are determined based on the cumulative waiting time, the distance gain parameters are determined based on the remaining path cost, and the penalty conversion parameters are determined based on the cumulative number of replanning attempts. The basic weight parameter, the time gain parameter, the distance gain parameter, and the priority parameter are summed, and the penalty conversion parameter is subtracted from the summation result to obtain the scheduling priority of the target virtual object; Based on the scheduling priority, the path replanning request tasks of each target virtual object are sorted in descending order, and based on the order after descending sorting, path replanning operation is performed on each target virtual object.

2. The method according to claim 1, characterized in that, The detection of whether the planned path from each of the second virtual objects to the second virtual vehicle is affected by the location movement event, and the resulting detection, includes: When the location movement event indicates that the first virtual vehicle has moved from the first location to the second location, the area to be detected is determined based on the first location and the second location; For each planned path from the second virtual object to the second virtual vehicle, detect whether the planned path passes through the area to be detected; If the planned path passes through the area to be detected, a detection result indicating that the planned path is affected by the location movement event is obtained; If the planned path does not pass through the area to be detected, the minimum distance between the area to be detected and the planned path is obtained. If the minimum distance is less than a preset distance threshold, a detection result indicating that the planned path is affected by the location movement event is obtained. If the minimum distance is greater than or equal to the preset distance threshold, a detection result indicating that the planned path is not affected by the location movement event is obtained.

3. The method according to claim 2, characterized in that, The step of detecting whether the planned path passes through the area to be detected includes: Obtain multiple path points corresponding to the planned path, and connect adjacent path points in sequence to generate multiple path segments corresponding to the planned path. The system detects whether each path segment intersects with the area to be detected. If there exists a path segment that intersects with the area to be detected, it is determined that the planned path passes through the area to be detected; If there is no path segment that intersects with the area to be detected, it is determined that the planned path does not pass through the area to be detected.

4. The method according to claim 1, characterized in that, The path replanning request task for generating the target virtual object includes: Obtain the object identifier of the target virtual object, the vehicle identifier of the target virtual vehicle that the target virtual object can reach after the location movement event is triggered, and the request version number; Based on the object identifier, the vehicle identifier, and the request version number, a path replanning request task corresponding to the target virtual object is generated, and the path replanning request task is added to the task queue.

5. The method according to claim 1, characterized in that, The step of sorting the path replanning request tasks of each target virtual object in descending order based on the scheduling priority, and performing path replanning operation on each target virtual object based on the descending order, includes: Add the path replanning request tasks corresponding to each of the target virtual objects to the task queue; Based on the scheduling priority corresponding to each target virtual object, the path replanning request tasks in the task queue are sorted in descending order. Based on the descending sort order, path replanning operations are performed on each of the target virtual objects in sequence.

6. The method according to claim 5, characterized in that, The sequential execution of path replanning operations on each of the target virtual objects includes: For each of the target virtual objects, obtain the third position of the target virtual object and the fourth position of the target virtual vehicle that the target virtual object can reach; In the navigation grid corresponding to the virtual scene, determine the starting navigation grid corresponding to the third position and the target navigation grid corresponding to the fourth position; Within the navigation grid, a connecting path is searched between the starting navigation grid and the target navigation grid to obtain a sequence of navigation grids along the connecting path; Multiple path points are extracted from the navigation grid sequence, and a replanning path corresponding to the target virtual object is generated based on the multiple path points.

7. A method for processing the path of a virtual object, characterized in that, The method includes: Among multiple virtual objects in a virtual scene, a plurality of first virtual objects that are reachable from a first virtual vehicle, and a plurality of second virtual objects that are not reachable from the first virtual vehicle but are reachable from a second virtual vehicle are identified; The virtual scene displays a first movement path for multiple first virtual objects to reach the first virtual vehicle, and a second movement path for multiple second virtual objects to reach the second virtual vehicle; In response to the first virtual vehicle triggering a location movement event, a third movement path obtained by performing path replanning operations on the plurality of first virtual objects and third virtual objects is displayed sequentially based on the obtained scheduling priority. The third virtual object is the second virtual object corresponding to the second movement path affected by the location movement event.

8. The method according to claim 7, characterized in that, The method further includes: During the auxiliary display process that combines the waiting state of virtual objects, the fourth virtual object among the plurality of first virtual objects and the plurality of second virtual objects that meets the emotional feedback conditions is highlighted in the target style. The target style includes at least one of the following: text prompt style, facial expression feedback style, action feedback style, and voice feedback style; The emotional feedback conditions include at least one of the following: the cumulative waiting time reaches the target duration, or the cumulative number of replanning attempts reaches the target number.

9. A path processing device for virtual objects, characterized in that, The device includes: The object determination module is used to determine, among multiple virtual objects in a virtual scene, multiple first virtual objects that can reach the first virtual vehicle, and multiple second virtual objects that cannot reach the first virtual vehicle but can reach the second virtual vehicle; The impact detection module is used to detect whether the planned paths of each second virtual object to the second virtual vehicle are affected by the location movement event when the first virtual vehicle triggers a location movement event, and to obtain the detection result. An object filtering module is used to filter out, based on the detection results, a third virtual object corresponding to the planned path affected by the location movement event from the plurality of second virtual objects; The scheduling processing module is used to add the plurality of first virtual objects and the third virtual objects to the affected set; for each target virtual object in the affected set, it generates a path replanning request task for the target virtual object; it obtains multi-dimensional data of the target virtual object, including: the object type of the target virtual object, the cumulative waiting time, the remaining path cost to the target virtual vehicle, the associated priority parameter, and the cumulative number of replanning attempts; the target virtual vehicle is the virtual vehicle that the target virtual object can reach after the location movement event is triggered; it determines a basic weight parameter based on the object type, a time gain parameter based on the cumulative waiting time, a distance gain parameter based on the remaining path cost, and a penalty conversion parameter based on the cumulative number of replanning attempts; it sums the basic weight parameter, the time gain parameter, the distance gain parameter, and the priority parameter, and subtracts the penalty conversion parameter from the summation result to obtain the scheduling priority of the target virtual object; The path replanning module is used to sort the path replanning request tasks of each target virtual object in descending order based on the scheduling priority, and to perform path replanning operations on each target virtual object based on the descending order.

Images