Dynamic Allocation Method, System, Device and Medium for Shopping Guide Tasks

Abstract

The present application provides a method, system, device and medium for dynamically allocating shopping guide tasks. The method obtains the call requests of each shopping guide robot in the shopping guide robot cluster for shopping guide goods, then generates a call topology structure according to each call request, and configures the shopping guide diversion tasks of the corresponding shopping guide robots according to the call topology structure. Thus, by configuring the shopping guide diversion tasks, the dynamic adjustment of shopping guide tasks is realized, the call relationship in the shopping guide robot cluster is effectively diverted, and the overall performance of the system and the task execution efficiency are improved.

Description

Technical Field

[0001] This application relates to data processing technologies, and in particular to a method, system, device, and medium for dynamically allocating shopping guide tasks. Background Art

[0002] With the rapid development of artificial intelligence technologies, shopping guide robots have been widely used in many fields. Especially in large shopping malls, supermarkets, exhibition halls and other places, shopping guide robots, with their efficient and accurate service capabilities, have greatly improved the shopping experience of customers and the operation efficiency of merchants. However, in practical applications, the working efficiency and task allocation problems of shopping guide robot clusters have become increasingly prominent, becoming one of the key factors restricting their further development and application.

[0003] In traditional shopping guide robot systems, each robot usually works according to preset rules or fixed task allocation strategies. This static task allocation method may be able to meet basic needs in simple or single shopping guide scenarios, but in complex and changeable shopping guide environments, it often fails to achieve ideal results. For example, during peak hours or specific promotional activities, the demand for shopping guide goods by customers will increase sharply, resulting in multiple shopping guide robots may issue call requests for the same goods simultaneously or almost simultaneously. In this case, if there is no effective task allocation and scheduling mechanism, call conflicts are likely to occur, and even a call loop may be formed, causing each robot to enter a waiting state and unable to execute the call task smoothly.

[0004] In addition, traditional shopping guide robot systems often lack the ability to dynamically perceive and adjust the call relationships between robots. During the shopping guide process, the call relationships between robots may change with the changes in customer needs. If the system cannot capture these changes in real time and dynamically adjust the task allocation accordingly, problems such as resource waste and low efficiency may occur. Summary of the Invention

[0005] This application provides a method, system, device, and medium for dynamically allocating shopping guide tasks. By configuring the shopping guide and dredging tasks, the dynamic adjustment of shopping guide tasks is realized, effectively dredging the call relationships in the shopping guide robot cluster, and improving the overall performance of the system and the task execution efficiency.

[0006] In a first aspect, this application provides a method for dynamically allocating shopping guide tasks, including:

[0007] Obtaining call requests from each shopping guide robot in the shopping guide robot cluster for shopping guide goods;

[0008] Generating a call topology structure according to each call request, where the call topology structure includes a deployment vector for characterizing the call relationship;

[0009] Configure the shopping guide and diversion tasks of the corresponding shopping guide robots according to the call topology structure, where the shopping guide and diversion tasks are used to update at least one deployment vector in the call topology structure.

[0010] In the above solution, first, by obtaining the call requests of each shopping guide robot in the shopping guide robot cluster for shopping guide goods, the information collection of the shopping guide requirements of the robots is realized. On this basis, a call topology structure is generated according to each call request. This structure represents the call relationship between robots through deployment vectors, realizing the topological representation of the shopping guide task relationship. The generated call topology structure not only shows the call relationship between robots but also can reflect potential call conflicts. For example, in a complex shopping guide scenario, multiple robots may call shopping guide goods simultaneously or within the same time window, forming a call loop, and the priorities of each call request are the same, resulting in each robot entering a waiting state task and unable to execute the call smoothly. However, the above solution can dynamically adjust the shopping guide tasks by configuring the shopping guide and diversion tasks, effectively divert the call relationship in the shopping guide robot cluster, and improve the overall performance of the system and the task execution efficiency.

[0011] Optionally, before configuring the shopping guide and diversion tasks of the corresponding shopping guide robots according to the call topology structure, it further includes:

[0012] Determine that there is a characteristic deployment sequence in the call topology structure, where the characteristic deployment sequence is a call loop formed by at least two shopping guide robots in the shopping guide robot cluster in the call topology structure, and the call loop is a ring topology structure formed by the head-to-tail connection of multiple deployment vectors.

[0013] In the above solution, by determining the characteristic deployment sequence in the call topology structure, potential task conflicts and dependencies can be identified. For example, in a complex shopping guide task scenario, multiple shopping guide robots may form a call loop due to the call requirements for the same or related goods, resulting in mutual waiting and conflicts during the task execution process. By identifying these call loops, the system can pre-warn potential task conflicts and provide clear objects for subsequent task diversion and optimization. Thus, potential task conflicts can be discovered in advance to avoid sudden problems and delays during the task execution process.

[0014] Optionally, the call loop includes nodes corresponding to at least two shopping guide robots in the shopping guide robot cluster and the deployment vectors pointing from the previous node to the next node.

[0015] In the above solution, the formation of a call loop means that there is a mutually waiting task call relationship between at least two shopping guide robots, which often leads to conflicts and delays in task execution. By identifying the call loop, the system can identify these potential task conflicts and dependencies, and thus take measures to conduct dredging and optimization.

[0016] Optionally, the call loop includes a first node corresponding to a first shopping guide robot occupying a first target item and a second node corresponding to a second shopping guide robot occupying a second target item;

[0017] The call loop further includes a first deployment vector from the second node to the first node and a second deployment vector from the first node to the second node. The first deployment vector is used to represent a first call request for the first shopping guide robot to call the second target item, and the second deployment vector is used to represent a second call request for the second shopping guide robot to call the first target item.

[0018] In the above solution, when two or more shopping guide robots form a loop due to mutually calling items occupied by each other, it means that there is mutual waiting and dependence in task execution between them. This dependence may lead to delays and conflicts in task execution, and the formation of the call loop effectively indicates the existence of this dependence and conflict. Thus, it helps the system quickly identify the task dependence relationship between shopping guide robots and provides a clear goal for subsequent task dredging.

[0019] Optionally, the call priorities of the first call request and the second call request are the same.

[0020] In the above solution, when the call priorities of the first call request and the second call request are the same, in the call loop, it is easy for each robot to enter a waiting state task and unable to execute the call smoothly.

[0021] Optionally, the call loop includes a first node corresponding to a first shopping guide robot occupying a first target item, a second node corresponding to a second shopping guide robot occupying a second target item, and a third node corresponding to a third shopping guide robot occupying a third target item;

[0022] The call closed loop further includes a first deployment vector from the second node to the first node, a second deployment vector from the third node to the second node, and a third deployment vector from the first node to the third node. The first deployment vector is used to represent the first call request of the first shopping guide robot to call the second target item, the second deployment vector is used to represent the second call request of the second shopping guide robot to call the third target item, and the third deployment vector is used to represent the third call request of the third shopping guide robot to call the first target item.

[0023] In the above solution, the composition of the three-node call closed loop reflects the task dependencies and conflict relationships among multiple shopping guide robots. When the three shopping guide robots form a closed loop due to mutually calling the items occupied by each other, it means that there are more complex task execution dependencies and potential conflicts among them. Such a dependency relationship will lead to delays and conflicts in task execution, and the composition of the call closed loop effectively indicates the existence of such dependencies and conflicts. Thus, it helps the system quickly identify the task dependency relationships among shopping guide robots and provides a clear goal for subsequent task guidance.

[0024] Optionally, at least two of the first call request, the second call request, and the third call request have the same call priority.

[0025] In the above solution, when the call priorities of the first call request, the second call request, and the third call request are the same, in the call closed loop, it is easy to cause each robot to enter a waiting state task and unable to execute the call smoothly.

[0026] In a second aspect, the present application provides a dynamic allocation system for shopping guide tasks, including: a scheduling platform and a shopping guide robot cluster communicatively connected to the scheduling platform;

[0027] The scheduling platform obtains call requests of each shopping guide robot in the shopping guide robot cluster for shopping guide items;

[0028] The scheduling platform generates a call topology structure according to each call request, and the call topology structure includes a deployment vector for representing a call relationship;

[0029] The scheduling platform configures a shopping guide guidance task for a corresponding shopping guide robot according to the call topology structure, and the shopping guide guidance task is used to at least partially update the call topology structure.

[0030] Optionally, before the scheduling platform configures a shopping guide guidance task for a corresponding shopping guide robot according to the call topology structure, it further includes:

[0031] The scheduling platform determines that there is a feature allocation sequence in the call topology. The feature allocation sequence is a call loop formed by at least two shopping guide robots in the shopping guide robot cluster, and the call loop is a ring topology structure formed by connecting the heads and tails of multiple allocation vectors.

[0032] Optionally, the call loop includes nodes corresponding to at least two shopping guide robots in the shopping guide robot cluster and the allocation vectors pointing from the previous node to the next node.

[0033] Optionally, the call loop includes a first node corresponding to a first shopping guide robot occupying a first target item and a second node corresponding to a second shopping guide robot occupying a second target item;

[0034] The call loop further includes a first allocation vector pointing from the second node to the first node and a second allocation vector pointing from the first node to the second node. The first allocation vector is used to represent a first call request for the first shopping guide robot to call the second target item, and the second allocation vector is used to represent a second call request for the second shopping guide robot to call the first target item.

[0035] Optionally, the call priorities of the first call request and the second call request are the same.

[0036] Optionally, the call loop includes a first node corresponding to a first shopping guide robot occupying a first target item, a second node corresponding to a second shopping guide robot occupying a second target item, and a third node corresponding to a third shopping guide robot occupying a third target item;

[0037] The call loop further includes a first allocation vector pointing from the second node to the first node, a second allocation vector pointing from the third node to the second node, and a third allocation vector pointing from the first node to the third node. The first allocation vector is used to represent a first call request for the first shopping guide robot to call the second target item, the second allocation vector is used to represent a second call request for the second shopping guide robot to call the third target item, and the third allocation vector is used to represent a third call request for the third shopping guide robot to call the first target item.

[0038] Optionally, at least two of the first call request, the second call request, and the third call request have the same call priority.

[0039] In a third aspect, the present application provides an electronic device, including:

[0040] A processor; and,

[0041] A memory for storing executable instructions of the processor;

[0042] Wherein, the processor is configured to execute any of the possible methods described in the first aspect by executing the executable instructions.

[0043] In a fourth aspect, the present application provides a computer-readable storage medium storing computer-executable instructions, which are used to implement any of the possible methods described in the first aspect when executed by a processor.

[0044] The shopping guide task dynamic allocation method, system, device and medium provided by the present application obtain the call requests of each shopping guide robot in the shopping guide robot cluster for shopping guide goods, and then generate a call topology structure according to each call request, and configure the shopping guide diversion tasks of the corresponding shopping guide robots according to the call topology structure. Thus, by configuring the shopping guide diversion tasks, the dynamic adjustment of the shopping guide tasks is realized, the call relationships in the shopping guide robot cluster are effectively diverted, and the overall performance of the system and the task execution efficiency are improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] The accompanying drawings herein are incorporated into the specification and constitute a part of the specification, showing embodiments consistent with the present application and used together with the specification to explain the principles of the present application.

[0046] Figure 1 is a flowchart of a shopping guide task dynamic allocation method shown according to an exemplary embodiment of the present application;

[0047] Figure 2 is a flowchart of a shopping guide task dynamic allocation method shown according to another exemplary embodiment of the present application;

[0048] Figure 3 is a schematic diagram of the topological structure of a call closed loop shown according to an exemplary embodiment of the present application;

[0049] Figure 4 is a schematic diagram of the topological structure of a call closed loop shown according to another exemplary embodiment of the present application;

[0050] Figure 5 is a schematic diagram of a shopping guide diversion task configuration method shown according to an exemplary embodiment of the present application;

[0051] Figure 6 is a schematic diagram of a shopping guide diversion task configuration method shown according to another exemplary embodiment of the present application;

[0052] Figure 7 is a schematic diagram of the structure of a shopping guide task dynamic allocation system shown according to an exemplary embodiment of the present application;

[0053] Figure 8 It is a schematic structural diagram of an electronic device shown according to an exemplary embodiment of the present application.

[0054] Through the above-mentioned drawings, specific embodiments of the present application have been shown, and there will be more detailed descriptions hereinafter. These drawings and textual descriptions are not intended to limit the scope of the concept of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments. Detailed implementation manners

[0055] Here, the exemplary embodiments will be described in detail, and the examples are shown in the drawings. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The implementation manners described in the following exemplary embodiments do not represent all implementation manners consistent with the present application. On the contrary, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0056] To solve the above problems, the embodiments provided by the present application first establish a communication connection with the shopping guide robot cluster and receive and process the call requests of each robot in real time. The request information is usually sent to the central control system in the form of data packets, including key information such as request type, target product ID, request initiation time, robot ID, etc. The central control system parses and stores the data packets for subsequent processing. According to the received call requests, the system generates a call topology structure. This structure represents the call relationship between robots in a topological manner, where nodes represent shopping guide robots and edges (or deployment vectors) represent call requests. Each deployment vector includes a source node (the robot initiating the call), a target node (the robot being called), and the specific content of the call. The system assigns a unique node ID to each robot and generates corresponding deployment vectors according to the call requests, connecting them into a graph to form a call topology structure. The system analyzes the call topology structure to identify the call closed loops. The call closed loops are formed by multiple deployment vectors connected end to end to form a ring topology structure, indicating the task dependencies and potential conflicts between robots. Identifying call closed loops can be achieved through loop detection algorithms in graph theory, such as depth-first search or union-find combined with path compression, etc.

[0057] Once a call closed loop is identified, the system records its detailed information, including the robot nodes in the closed loop, the specific direction of the deployment vector, etc. Based on the identified call closed loop and call topology, the system configures corresponding shopping guide diversion tasks. The diversion tasks aim to break the call closed loop and eliminate the mutual waiting and conflicts in task execution. The diversion strategies can include reducing the call priority, transferring the call request, or reassigning shopping guide tasks, etc. For example, in the call closed loop, the system can reduce the call priority of a certain robot so that it executes its own request after completing the call requests of other robots; or transfer the call request of a certain robot to other available robots for execution.

[0058] After receiving the diversion task, the shopping guide robot executes the adjusted call behavior according to the instructions. At the same time, the system continuously monitors the changes in the call topology and the execution status of the shopping guide tasks. If a new call closed loop or a decrease in task execution efficiency is found, the system adjusts the diversion strategy in a timely manner to ensure the stability and efficiency of the entire system.

[0059] In addition, in order to understand the relevant terms in the embodiments of the present application, the specific explanations are as follows:

[0060] Shopping guide robot cluster: It refers to a system composed of multiple shopping guide robots. These robots are interconnected through wireless communication or wired networks to collaboratively complete shopping guide tasks. The shopping guide robot cluster can utilize the cluster effect of the robots to improve the coverage and efficiency of shopping guide services. In large shopping malls, supermarkets, exhibition halls and other places, the shopping guide robot cluster can provide more comprehensive and convenient shopping guide services for customers.

[0061] Call request: It refers to a request sent by a shopping guide robot to other robots or systems during the execution of shopping guide tasks, used to obtain information, locations of specific shopping guide goods, or perform specific operations. The call request is the basis for information interaction and task collaboration among shopping guide robots. Through the call request, the robot can obtain the required information or resources to support it in completing the shopping guide task.

[0062] Call topology: It refers to a topology graph constructed by graph theory methods and used to represent the call relationships among shopping guide robots. This structure uses nodes to represent shopping guide robots and edges (or deployment vectors) to represent call requests. The direction and weight of the edges represent the direction and priority of the call relationships. The call topology can intuitively display the call relationships among shopping guide robots, which helps the system identify and solve call conflicts. Through the analysis of the call topology, the system can formulate more reasonable shopping guide task allocation strategies.

[0063] The dispatch vector is an edge in the call topology structure, which is used to represent the call relationship between shopping guide robots. It contains the source node (the robot that initiates the call), the target node (the robot that is called), and the specific content of the call. The dispatch vector is the basic component of the call topology structure, through which the call relationship and call content between robots can be clarified. The system can dynamically adjust the shopping guide task by adjusting the direction and weight of the dispatch vector.

[0064] Call loop: refers to a ring topology formed by connecting multiple deployment vectors end to end in the call topology. It indicates that there is a task call relationship between shopping guide robots, which is easy to cause delays and conflicts in task execution. Call loop is an issue that needs special attention in the dynamic allocation of shopping guide tasks. By identifying and resolving call loops, the system can avoid mutual waiting and conflicts between robots and improve task execution efficiency.

[0065] Shopping guide task: refers to the shopping guide task configured to break the call loop and eliminate mutual waiting and conflicts in task execution. It aims to achieve dynamic adjustment of shopping guide tasks by adjusting the calling relationship or priority of shopping guide robots. Shopping guide task is the core part of the dynamic allocation method of shopping guide tasks. By configuring shopping guide task, the system can realize flexible scheduling and optimization of shopping guide tasks, and improve the overall performance of the system and task execution efficiency.

[0066] Feature deployment sequence: refers to a deployment vector sequence with specific features (such as forming a call closed loop) in the call topology. It is used to represent the specific call relationship and dependency relationship between shopping guide robots. Feature deployment sequence is an important basis for identifying and resolving call closed loops. By identifying feature deployment sequence, the system can quickly locate potential call conflicts and dependencies and adopt corresponding guidance strategies.

[0067] Figure 1 FIG. 1 is a flow chart of a method for dynamically allocating shopping guide tasks according to an exemplary embodiment of the present application. Figure 1 As shown, the shopping guide task dynamic allocation method provided in this embodiment includes:

[0068] S101. Obtain a call request for shopping guide products from each shopping guide robot in a shopping guide robot cluster.

[0069] In a shopping environment, each robot in the shopping guide robot cluster will generate a call request for a specific shopping guide item based on the customer's needs or the system's preset tasks. These requests may include but are not limited to: querying the inventory of a certain product, obtaining detailed information about a certain product, adding a certain product to the customer's shopping cart, guiding the customer to the location of a certain product, and directly delivering a specific shopping guide sample to the customer's location.

[0070] To achieve this step, the system first needs to establish a communication connection with the shopping guide robot cluster to ensure that it can receive and process the call requests of each robot in real time. These requests are usually sent to the central control system in the form of data packets, which contain key information such as request type, target product ID, request initiation time, robot ID, etc. Specifically, a protocol applicable to the communication between the shopping guide robot and the central control system can be set to ensure the accurate transmission and parsing of data. After receiving the data packet, the central control system parses it according to its format and extracts key information such as request type, target product ID, and robot ID. The parsed request information is stored in the database, and an effective management mechanism is established for subsequent step calls and processing.

[0071] S102. Generate a call topology structure according to each call request.

[0072] In this step, a call topology structure can be generated according to each call request. The call topology structure includes a deployment vector for characterizing the call relationship.

[0073] Specifically, after obtaining the call requests of the shopping guide robot cluster, the system can generate a call topology structure according to these requests. This structure represents the call relationship between robots in a topological manner, where nodes represent shopping guide robots and edges (or deployment vectors) represent call requests. Each deployment vector contains a source node (the robot initiating the call), a target node (the robot being called), and the specific content of the call.

[0074] A unique node ID can be assigned to each robot in the shopping guide robot cluster and represented as a node in the call topology structure. According to the information of each call request, the corresponding deployment vector is generated. These vectors connect the source node and the target node in the form of directed edges and mark the specific content of the call. The generated deployment vectors are connected into a graph according to their logical relationships to form a call topology structure. This structure can be dynamically updated to reflect the real-time changes in the call relationship in the robot cluster.

[0075] S103. Configure the shopping guide and guidance tasks of the corresponding shopping guide robots according to the call topology structure.

[0076] In this step, the shopping guide and guidance tasks of the corresponding shopping guide robots are configured according to the call topology structure. The shopping guide and guidance tasks are used to update at least one deployment vector in the call topology structure.

[0077] After generating the call topology, the system can analyze this structure to identify potential conflicts or bottlenecks. For example, when multiple robots form a closed loop due to mutually calling the goods occupied by each other, it will lead to mutual waiting and conflicts in task execution. To solve this problem, the system needs to configure corresponding shopping guide diversion tasks according to the call topology to dynamically adjust the call relationships of the robots.

[0078] Specifically, it can be to traverse the call topology and detect whether there are call closed loops formed by multiple deployment vectors connected end to end. These closed loops usually represent the task dependencies and potential conflicts between robots. For the detected call closed loops, formulate effective diversion strategies. These strategies may include: reducing the priority of certain call requests, transferring certain call requests to other available shopping guide robots, or reallocating shopping guide tasks, etc. According to the formulated diversion strategies, configure corresponding shopping guide diversion tasks for the affected shopping guide robots. These tasks are sent to the robots in the form of instructions to guide them on how to adjust their call behaviors to eliminate conflicts or improve task execution efficiency. After receiving the diversion tasks, the shopping guide robots execute the adjusted call behaviors according to the instructions. At the same time, the system continuously monitors the changes in the call topology and the execution of shopping guide tasks to ensure the stability and efficiency of the entire system.

[0079] In this embodiment, by obtaining the call requests of each shopping guide robot in the shopping guide robot cluster for shopping guide goods, then generating a call topology according to each call request, and configuring corresponding shopping guide diversion tasks for the shopping guide robots according to the call topology, thus, in the way of configuring shopping guide diversion tasks, the dynamic adjustment of shopping guide tasks is realized, effectively diverting the call relationships in the shopping guide robot cluster, and improving the overall performance and task execution efficiency of the system.

[0080] Figure 2 It is a schematic flowchart of a method for dynamically allocating shopping guide tasks according to another exemplary embodiment of the present application. As Figure 2 shown, the method for dynamically allocating shopping guide tasks provided in this embodiment includes:

[0081] S201. Obtain the call requests of each shopping guide robot in the shopping guide robot cluster for shopping guide goods.

[0082] In a shopping environment, each robot in the shopping guide robot cluster will generate a call request for specific shopping guide goods according to the needs of customers or the tasks preset by the system, that is, transporting specific shopping guide samples to the customer's location through the shopping guide robot.

[0083] S202. Generate a call topology according to each call request.

[0084] In this step, a call topology structure can be generated according to each call request, and the call topology structure includes a deployment vector for characterizing the call relationship.

[0085] Specifically, after obtaining the call requests of the shopping guide robot cluster, the system can generate a call topology structure according to these requests. This structure represents the call relationship between the robots in a topological manner, where the nodes represent the shopping guide robots and the edges (or deployment vectors) represent the call requests. Each deployment vector contains a source node (the robot initiating the call), a target node (the robot being called), and the specific content of the call.

[0086] S203. Determine that there is a characteristic deployment sequence in the call topology structure.

[0087] In this step, it is determined that there is a characteristic deployment sequence in the call topology structure, where the characteristic deployment sequence is a call loop formed by at least two shopping guide robots in the shopping guide robot cluster in the call topology structure, and the call loop is a circular topology structure formed by multiple deployment vectors connected end to end. Optionally, the call loop includes the nodes corresponding to at least two shopping guide robots in the shopping guide robot cluster and the deployment vectors pointing from the previous node to the next node.

[0088] Specifically, the system needs to analyze the already constructed call topology structure. The call topology structure is a directed graph, where the nodes represent the shopping guide robots and the edges (i.e., deployment vectors) represent the call relationship or task transfer direction between the shopping guide robots. The system traverses all the nodes and edges of the call topology structure to identify whether there is a circular structure formed by at least two shopping guide robots connected end to end through a series of deployment vectors, that is, a call loop. Among them, the identification of the call loop can be achieved through loop detection algorithms in graph theory, such as depth - first search or union - find combined with path compression, etc., so as to find all possible call loops.

[0089] It is worth noting that the characteristic deployment sequence refers to a specific call path formed by at least two shopping guide robots in the shopping guide robot cluster in the call topology structure, and this path finally forms a circular topology structure, that is, a call loop. Each call loop consists of a series of ordered deployment vectors, and these deployment vectors represent the transfer order and direction of the shopping guide tasks within the loop. The system needs to record the detailed information of each call loop, including the shopping guide robot nodes in the loop, the specific pointing of the deployment vectors, and the start and end nodes of the loop (in the circular structure, the start and end nodes are relative and can be selected arbitrarily).

[0090] Moreover, the call loop consists of at least two shopping guide robot nodes, which are connected by deployment vectors in the call topology to form a closed loop. Each node represents a shopping guide robot, and the edges (deployment vectors) between the nodes represent the transfer direction of shopping guide tasks or information. For example, if shopping guide robot A needs to transfer a task to shopping guide robot B, then B transfers it to C, and finally C indirectly or directly back to A by request, thus forming a simple call loop. Among them, the deployment vector is a key element in the call loop, which represents the transfer direction and order of shopping guide tasks or information within the loop. Each deployment vector has a clear starting point and ending point. The starting point is the previous shopping guide robot node, and the ending point is the next shopping guide robot node. Moreover, the direction of the deployment vector is unidirectional, that is, from one node to another node, which ensures the orderly transfer of shopping guide tasks or information within the loop. At this time, the system needs to maintain a deployment vector table to record the detailed information of all deployment vectors, including the starting node, ending node, transferred task type or information content, etc.

[0091] Once the call loop is identified, the system can optimize these loops to improve the allocation efficiency and accuracy of shopping guide tasks. For example, by adjusting the deployment vectors within the loop, the task transfer path can be made shorter and more efficient; or by introducing new shopping guide robot nodes or deployment vectors, the original loop structure can be broken to form a more flexible and scalable call topology. The system can also monitor and analyze the call loop to promptly discover and solve possible task transfer bottlenecks or deadlock problems.

[0092] In a specific implementation manner, Figure 3 is a schematic diagram of the topology structure of the call loop shown according to an exemplary embodiment of the present application. As Figure 3 shown, the call loop 300 includes a first node 311 corresponding to the first shopping guide robot occupying the first target item and a second node 312 corresponding to the second shopping guide robot occupying the second target item.

[0093] In addition, the call loop 300 further includes a first deployment vector 321 pointing from the second node 312 to the first node 311 and a second deployment vector 322 pointing from the first node 311 to the second node 312. The first deployment vector 321 is used to represent the first call request for the second target item by the first shopping guide robot, and the second deployment vector 322 is used to represent the second call request for the first target item by the second shopping guide robot. Moreover, the call priorities of the first call request and the second call request are the same.

[0094] Specifically, in the call topology, each node represents a shopping guide robot, and each shopping guide robot may be associated with one or more goods. In this embodiment, special attention is paid to the shopping guide robot occupying a specific target good and its corresponding node. For example, if the first shopping guide robot occupies the first target good, then its corresponding node in the call topology is the first node 311. Similarly, if the second shopping guide robot occupies the second target good, its corresponding node is the second node 312.

[0095] The deployment vector is a key element in the call closed-loop, used to represent the call requests and directions between shopping guide robots. The first deployment vector 321 points from the second node 312 to the first node 311, indicating that the first shopping guide robot hopes to call (or obtain) the first call request for the second target good. This request may be generated based on factors such as user needs, inventory status, or shopping guide strategies. The second deployment vector 322 points from the first node 311 to the second node 312, indicating that the second shopping guide robot hopes to call (or obtain) the second call request for the first target good. When the first shopping guide robot issues the first call request and the second shopping guide robot issues the second call request, these two requests form a closed-loop in the call topology. This closed-loop is jointly composed of the first node 311, the second node 312, the first deployment vector 321, and the second deployment vector 322. The formation of the call closed-loop means that there is a mutual dependence or mutual call relationship between the two shopping guide robots, and this relationship can be clarified and quantified through the deployment vector.

[0096] In addition, the call priority is an indicator used to measure and compare the importance and urgency of different call requests. In the embodiment, the first call request and the second call request are given the same call priority, which means that they have the same status and weight in the task allocation and execution process. When the system receives the first call request and the second call request, due to their same call priority, the system needs to adopt a fair and reasonable mechanism to handle these two requests. Among them, the situation where the call priorities are the same is very common in practical applications. For example, when both shopping guide robots need to call the goods occupied by the other to meet user needs, their call requests may have the same priority.

[0097] In another specific implementation Figure 4 is a schematic diagram of the topology of the call closed-loop shown by the present application according to another exemplary embodiment. As Figure 4 shown, the call closed-loop 300 includes the first node 311 corresponding to the first shopping guide robot occupying the first target good, the second node 312 corresponding to the second shopping guide robot occupying the second target good, and the third node 313 corresponding to the third shopping guide robot occupying the third target good.

[0098] In addition, the invocation of the closed loop 300 further includes a first deployment vector 321 from the second node 312 to the first node 311, a second deployment vector 322 from the third node 313 to the second node 312, and a third deployment vector 323 from the first node 311 to the third node 313. The first deployment vector 321 is used to represent a first invocation request of the first shopping guide robot to invoke the second target item. The second deployment vector 322 is used to represent a second invocation request of the second shopping guide robot to invoke the third target item. The third deployment vector 323 is used to represent a third invocation request of the third shopping guide robot to invoke the first target item. Moreover, at least two of the first invocation request, the second invocation request, and the third invocation request have the same invocation priority. Preferably, the first invocation request, the second invocation request, and the third invocation request all have the same invocation priority.

[0099] Specifically, when the first shopping guide robot occupies the first target item, the corresponding node in the invocation topology is marked as the first node 311. Similarly, when the second shopping guide robot occupies the second target item, its corresponding node is marked as the second node 312; when the third shopping guide robot occupies the third target item, its corresponding node is marked as the third node 313. The first deployment vector 321 points from the second node 312 (i.e., the second shopping guide robot) to the first node 311 (i.e., the first shopping guide robot), indicating the first invocation request of the first shopping guide robot to invoke (or obtain) the second target item. The second deployment vector 322 points from the third node 313 to the second node 312, indicating the second invocation request of the second shopping guide robot to invoke (or obtain) the third target item. The third deployment vector 323 points from the first node 311 to the third node 313, indicating the third invocation request of the third shopping guide robot to invoke (or obtain) the first target item. When the first deployment vector 321, the second deployment vector 322, and the third deployment vector 323 form a ring structure that connects end to end in the invocation topology, a call closed loop is formed.

[0100] S204. Configure the shopping guide guidance tasks of the corresponding shopping guide robots according to the invocation topology.

[0101] In this step, configure the shopping guide guidance tasks of the corresponding shopping guide robots according to the invocation topology. The shopping guide guidance tasks are used to update at least one deployment vector in the invocation topology. After generating the invocation topology, the system can analyze this structure to identify potential conflicts or bottlenecks. For example, when multiple robots form a closed loop due to mutually invoking the items occupied by each other, it will lead to mutual waiting and conflicts in task execution. To solve this problem, the system needs to configure the corresponding shopping guide guidance tasks according to the invocation topology to dynamically adjust the invocation relationships of the robots.

[0102] In a possible implementation, a feature shopping guide robot is determined from a cluster of shopping guide robots according to a feature deployment sequence, where the feature shopping guide robot is the shopping guide robot corresponding to each node on the call closed loop. Then, the call priority of the call request corresponding to the target feature shopping guide robot is reduced through a shopping guide diversion task, so as to reduce the priority of at least one deployment vector related to the target feature shopping guide robot, so as to detach the deployment vector with the reduced priority from the call closed loop, where the target feature shopping guide robot is at least one robot among the feature shopping guide robots.

[0103] Specifically, through the feature deployment sequence, the feature shopping guide robots can be identified and determined from the cluster of shopping guide robots. These feature shopping guide robots are the shopping guide robots corresponding to each node on the call closed loop. Then, the call priority of the call request corresponding to the target feature shopping guide robot is reduced through a shopping guide diversion task, so as to detach the deployment vector with the reduced priority from the call closed loop. This step optimizes and adjusts the call closed loop, so that at least one deployment vector is removed from the call closed loop, thus relieving the waiting of each shopping guide robot in the call closed loop, and improving the operation efficiency of the system.

[0104] Further, after reducing the call priority of the call request corresponding to the target feature shopping guide robot through the shopping guide diversion task, it is also possible to make the target feature shopping guide robot complete the shopping guide product call corresponding to the corresponding call request after all other feature shopping guide robots except the target feature shopping guide robot among the feature shopping guide robots have completed the shopping guide product calls corresponding to their respective call requests.

[0105] Specifically, after reducing the call priority of the call request of the target feature shopping guide robot through the shopping guide diversion task, all other feature shopping guide robots except the target feature shopping guide robot need to first complete the shopping guide product calls corresponding to their respective call requests. This step ensures that in the case of resource conflicts, the system can preferentially process those shopping guide tasks whose priorities have not been reduced, that is, the tasks executed by other feature shopping guide robots. This helps to maintain the smoothness and efficiency of the overall shopping guide service and avoid affecting the entire service process due to the delay of some tasks. After all other feature shopping guide robots have completed their shopping guide product calls, then make the target feature shopping guide robot complete the shopping guide product call corresponding to its corresponding call request. This orderly task arrangement method not only considers the possible task conflicts faced by the target feature shopping guide robot currently, but also ensures the orderliness and integrity of the overall task execution. It avoids the chaos or interruption of the entire shopping guide service process caused by the delayed execution of the target feature shopping guide robot.

[0106] Among them, Figure 5 is a schematic diagram of a shopping guide diversion task configuration method shown according to an exemplary embodiment of the present application. AsFigure 5 As shown, through the feature deployment sequence, the feature shopping guide robots can be identified and determined from the shopping guide robot cluster. Among them, the first node 311 corresponds to the first shopping guide robot, the second node 312 corresponds to the second shopping guide robot, and the third node 313 corresponds to the third shopping guide robot. The first deployment vector 321 points from the second node 312 (i.e., the second shopping guide robot) to the first node 311 (i.e., the first shopping guide robot), indicating that the first shopping guide robot hopes to call (or obtain) the first call request for the second target item. The second deployment vector 322 points from the third node 313 to the second node 312, indicating that the second shopping guide robot hopes to call (or obtain) the second call request for the third target item. The third deployment vector 323 points from the first node 311 to the third node 313, indicating that the third shopping guide robot hopes to call (or obtain) the third call request for the first target item. When the first deployment vector 321, the second deployment vector 322, and the third deployment vector 323 form a ring structure that connects end to end in the call topology, a call closed loop 300 is formed. In this embodiment, the priority of the first deployment vector 321 corresponding to the first node 311 (i.e., the first shopping guide robot) can be reduced through the shopping guide diversion task, so that the first deployment vector 321 detaches from the call closed loop. Furthermore, the formed call closed loop 300 is released, and after the call requests corresponding to the second deployment vector 322 and the third deployment vector 323 are completed, the call request corresponding to the first deployment vector 321 can be executed. Among them, the object whose priority is determined to be reduced as described above can be randomly selected or selected according to one or more measurement dimensions in the call request.

[0107] In another possible implementation, at least one other shopping guide robot outside the shopping guide robot cluster can be determined according to the call topology. Then, the feature shopping guide robots are determined from the shopping guide robot cluster according to the feature deployment sequence, where the feature shopping guide robots are the shopping guide robots corresponding to each node on the call closed loop. The target call request corresponding to the target feature shopping guide robot is transferred to other shopping guide robots through the shopping guide diversion task, so as to detach the target call vector corresponding to the target call request from the call closed loop, where the target feature shopping guide robot is at least one of the feature shopping guide robots, and the target call vector corresponding to the target call request is the call vector pointing to the node corresponding to the target feature shopping guide robot in the call topology.

[0108] Specifically, at least one other shopping guide robot outside the shopping guide robot cluster is determined according to the call topology structure. This step actually expands the scope of robot resources available for performing shopping guide tasks, no longer limited to the original shopping guide robot cluster, thereby improving the flexibility and scalability of shopping guide task allocation. Then, according to the feature deployment sequence, feature shopping guide robots are determined from the shopping guide robot cluster, and these robots are the shopping guide robots corresponding to each node on the call closed-loop.

[0109] The target call request corresponding to the target feature shopping guide robot is transferred to other shopping guide robots through the shopping guide diversion task. This mechanism allows the system to flexibly transfer the call request to other shopping guide robots with processing capabilities when the target feature shopping guide robot is unable to process or is locked. This transfer of call requests not only improves the execution efficiency of shopping guide tasks but also enhances the fault tolerance and robustness of the system, ensuring the continuity and stability of shopping guide services.

[0110] By detaching the target call vector corresponding to the target call request from the call closed-loop, it is actually an optimization of the call topology structure. This optimization makes the call topology structure more in line with the current shopping guide task requirements and resource status, improving the overall task allocation efficiency and resource utilization rate. It is worth noting that, compared with the previous possible implementation method, in this embodiment, there is no need to reduce the priority of each call request, and thus the overall system can have higher execution efficiency.

[0111] Among them, Figure 6 is a schematic diagram of the shopping guide diversion task configuration method shown according to another exemplary embodiment of the present application. As Figure 6 shown, when the first deployment vector 321, the second deployment vector 322, and the third deployment vector 323 form a ring structure connected end to end in the call topology structure, a call closed-loop 300 is formed. In this embodiment, the target call request corresponding to the target feature shopping guide robot can be transferred to other shopping guide robots 314 through the shopping guide diversion task, so as to detach the target call vector (i.e., the first deployment vector 321) corresponding to the target call request from the call closed-loop. Thus, other shopping guide robots 314 are used to execute the call request for calling the first target goods from the second node 312 (i.e., the second shopping guide robot), and then, other shopping guide robots 314 continue to execute the subsequent shopping guide tasks of the first node 311 (i.e., the first shopping guide robot).

[0112] Figure 7 is a schematic diagram of the structure of the shopping guide task dynamic allocation system shown according to an exemplary embodiment of the present application. As Figure 7 shown, the shopping guide task dynamic allocation system 500 provided in this embodiment includes:

[0113] A scheduling platform 510 and a shopping guide robot cluster 520 that is in communication with the scheduling platform 510;

[0114] The scheduling platform 510 obtains the call request for shopping guide products from each shopping guide robot in the shopping guide robot cluster 520;

[0115] The scheduling platform 510 generates a call topology structure according to each call request, and the call topology structure includes a deployment vector for representing the call relationship;

[0116] The scheduling platform 510 configures the shopping guide task of the corresponding shopping guide robot according to the calling topology structure, and the shopping guide task is used to at least partially update the calling topology structure.

[0117] Optionally, before the scheduling platform 510 configures the shopping guide task of the corresponding shopping guide robot according to the calling topology structure, the method further includes:

[0118] The scheduling platform 510 determines that there is a feature deployment sequence in the calling topology structure, and the feature deployment sequence is a calling loop formed by at least two shopping guide robots in the shopping guide robot cluster 520 in the calling topology structure, and the calling loop is a ring topology structure formed by connecting multiple deployment vectors end to end.

[0119] Optionally, the calling closed loop includes nodes corresponding to at least two shopping guide robots in the shopping guide robot cluster 520 and the deployment vector pointing from the previous node to the next node.

[0120] Optionally, the calling closed loop includes a first node corresponding to the first shopping guide robot 521 occupying the first target product and a second node corresponding to the second shopping guide robot 522 occupying the second target product;

[0121] The calling closed loop also includes a first deployment vector from the second node pointing to the first node and a second deployment vector from the first node pointing to the second node, the first deployment vector is used to represent a first call request of the first shopping guide robot 521 to call the second target product, and the second deployment vector is used to represent a second call request of the second shopping guide robot 522 to call the first target product.

[0122] Optionally, the first call request and the second call request have the same call priority.

[0123] Optionally, the call closed-loop includes a first node corresponding to the first shopping guide robot 521 occupying the first target item, a second node corresponding to the second shopping guide robot 522 occupying the second target item, and a third node corresponding to the third shopping guide robot 523 occupying the third target item;

[0124] The call closed-loop further includes a first deployment vector pointing from the second node to the first node, a second deployment vector pointing from the third node to the second node, and a third deployment vector pointing from the first node to the third node. The first deployment vector is used to represent a first call request for the first shopping guide robot 521 to call the second target item, the second deployment vector is used to represent a second call request for the second shopping guide robot 522 to call the third target item, and the third deployment vector is used to represent a third call request for the third shopping guide robot 523 to call the first target item.

[0125] Optionally, at least two of the first call request, the second call request, and the third call request have the same call priority.

[0126] Figure 8 It is a schematic structural diagram of an electronic device shown according to an exemplary embodiment of the present application. As Figure 8 shown, an electronic device 600 provided in this embodiment includes: a processor 601 and a memory 602; where:

[0127] The memory 602 is used to store a computer program, and this memory can also be a flash (flash memory).

[0128] The processor 601 is used to execute the execution instructions stored in the memory to implement each step in the above method. For specific reference, please refer to the relevant descriptions in the previous method embodiments.

[0129] Optionally, the memory 602 can be either independent or integrated with the processor 601.

[0130] When the memory 602 is a device independent of the processor 601, the electronic device 600 may further include:

[0131] A bus 603 for connecting the memory 602 and the processor 601.

[0132] This embodiment also provides a readable storage medium. A computer program is stored in the readable storage medium. When at least one processor of the electronic device executes this computer program, the electronic device executes the methods provided by the above various embodiments.

[0133] This embodiment also provides a program product, which includes a computer program stored in a readable storage medium. At least one processor of the electronic device can read the computer program from the readable storage medium, and the execution of the computer program by the at least one processor enables the electronic device to implement the methods provided by the above various embodiments.

[0134] Those skilled in the art will readily conceive of other embodiments of the present application after considering the specification and practicing the invention disclosed herein. The present application is intended to cover any variations, uses, or adaptations of the present application, which follow the general principles of the present application and include known common general knowledge or conventional technical means in the technical field not disclosed in the present application. The specification and embodiments are only regarded as exemplary, and the true scope and spirit of the present application are pointed out by the claims.

[0135] It should be understood that the present application is not limited to the exact structures described above and shown in the drawings, and various modifications and changes can be made without departing from its scope. The scope of the present application is only limited by the appended claims.

Claims

1. A method for dynamically allocating shopping guide tasks, characterized in that Including: Obtaining call requests of each shopping guide robot in the shopping guide robot cluster for shopping guide goods; Generating a call topology structure according to each call request, where the call topology structure includes a deployment vector for characterizing the call relationship; Determining that there is a characteristic deployment sequence in the call topology structure, where the characteristic deployment sequence is a call closed loop formed by at least two shopping guide robots in the shopping guide robot cluster in the call topology structure, and the call closed loop is a circular topology structure formed by connecting the heads and tails of multiple deployment vectors; Configuring the shopping guide guidance task of the corresponding shopping guide robot according to the call topology structure, where the shopping guide guidance task is used to update at least one deployment vector in the call topology structure; The configuring the shopping guide guidance task of the corresponding shopping guide robot according to the call topology structure includes: Determining characteristic shopping guide robots from the shopping guide robot cluster according to the characteristic deployment sequence, where the characteristic shopping guide robots are the shopping guide robots corresponding to each node on the call closed loop; Reducing the call priority of the call request corresponding to the target characteristic shopping guide robot through the shopping guide guidance task, so as to reduce the priority of at least one deployment vector related to the target characteristic shopping guide robot, so as to detach the deployment vector with the reduced priority from the call closed loop, where the target characteristic shopping guide robot is at least one of the characteristic shopping guide robots.

2. The dynamic allocation method of shopping guide tasks according to claim 1, characterized in that The call closed loop includes nodes corresponding to at least two shopping guide robots in the shopping guide robot cluster and the deployment vectors pointing from the previous node to the next node.

3. The dynamic allocation method for shopping guide tasks according to claim 1, wherein, The call closed loop includes a first node corresponding to a first shopping guide robot occupying a first target good and a second node corresponding to a second shopping guide robot occupying a second target good; The call closed loop further includes a first deployment vector pointing from the second node to the first node and a second deployment vector pointing from the first node to the second node. The first deployment vector is used to characterize a first call request for the first shopping guide robot to call the second target good, and the second deployment vector is used to characterize a second call request for the second shopping guide robot to call the first target good.

4. The shopping guide task dynamic allocation method according to claim 3, wherein, The call priorities of the first call request and the second call request are the same.

5. The shopping guide task dynamic allocation method according to claim 1, wherein The call closed loop includes a first node corresponding to a first shopping guide robot occupying a first target good, a second node corresponding to a second shopping guide robot occupying a second target good, and a third node corresponding to a third shopping guide robot occupying a third target good; The call loop further includes a first deployment vector from the second node to the first node, a second deployment vector from the third node to the second node, and a third deployment vector from the first node to the third node. The first deployment vector is used to represent a first call request of the first shopping guide robot to call the second target item. The second deployment vector is used to represent a second call request of the second shopping guide robot to call the third target item. The third deployment vector is used to represent a third call request of the third shopping guide robot to call the first target item.

6. The shopping guide task dynamic allocation method according to claim 5, wherein, At least two of the first call request, the second call request, and the third call request have the same call priority.

7. A shopping guide task dynamic allocation system, characterized in that, It includes: A scheduling platform and a shopping guide robot cluster communicatively connected to the scheduling platform; The scheduling platform obtains call requests of each shopping guide robot in the shopping guide robot cluster for shopping guide items; The scheduling platform generates a call topology structure according to each call request. The call topology structure includes a deployment vector for representing a call relationship; Determine that there is a characteristic deployment sequence in the call topology structure. The characteristic deployment sequence is a call loop formed by at least two shopping guide robots in the shopping guide robot cluster in the call topology structure. The call loop is a circular topology structure formed by connecting the heads and tails of multiple deployment vectors; The scheduling platform configures a shopping guide guidance task for a corresponding shopping guide robot according to the call topology structure. The shopping guide guidance task is used to at least partially update the call topology structure; The configuring a shopping guide guidance task for a corresponding shopping guide robot according to the call topology structure includes: Determining characteristic shopping guide robots from the shopping guide robot cluster according to the characteristic deployment sequence. The characteristic shopping guide robots are the shopping guide robots corresponding to each node on the call loop; Lowering the call priority of the call request corresponding to the target characteristic shopping guide robot through the shopping guide guidance task, so as to lower the priority of at least one deployment vector related to the target characteristic shopping guide robot, so as to detach the deployment vector with the lowered priority from the call loop, where the target characteristic shopping guide robot is at least one of the characteristic shopping guide robots.

8. An electronic device, characterized in that, It includes: A processor; And, A memory for storing executable instructions of the processor; Wherein, the processor is configured to execute the method according to any one of claims 1 to 6 by executing the executable instructions.

9. A computer-readable storage medium, characterized in that, Computer-executable instructions are stored in the computer-readable storage medium. When the computer-executable instructions are executed by a processor, they are used to implement the method according to any one of claims 1 to 6.

Images