Equipment scheduling method and device, electronic equipment and computer readable storage medium

By conducting path search and waiting point planning in multiple food delivery robot environments, collisions and road congestion problems between robots are solved, safety and efficiency of equipment scheduling are improved, and smooth and orderly scheduling of multiple equipment is ensured.

CN119090107APending Publication Date: 2024-12-06SHENZHEN YOUBIXING TECH CO LTD
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411206753.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-29
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

In multiple food delivery robot environments, simple navigation functions cannot effectively avoid collisions between robots and road congestion, resulting in insecure scheduling and inefficient efficiency.

Method used

By searching the path on the road network, we determine the conflict-free path and waiting point of each device, ensuring that the device scheduling path does not cross or overlap, and then control the device to move in the optimized order and path, realizing unified planning and security of device scheduling promote.

Benefits of technology

It effectively avoids collisions between equipment during the execution of tasks, improves the operating efficiency and security of the equipment scheduling system, and ensures smooth and orderly scheduling of multiple devices.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119090107A_ABST
    Figure CN119090107A_ABST
Patent Text Reader

Abstract

The invention provides an equipment scheduling method and device, electronic equipment and a computer readable storage medium. The method comprises the steps of performing path search on a road network based on task information of N devices; when the conflict-free path of the nth device is not searched, determining a waiting point of the nth device, and determining a scheduling path of the nth device based on the waiting point; determining a task execution sequence of the N devices based on the N scheduling paths; and based on the task execution sequence, controlling the N devices to move according to the N scheduling paths.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to computer technology, and in particular to a device scheduling method, apparatus, electronic device and computer-readable storage medium. Background Art

[0002] In the catering service industry, the use of food delivery robots (equipment) has become a key factor in improving customer experience and service efficiency. The robot takes the food from the pick-up point and delivers it to the customer's table quickly and accurately. In the relevant technology, in the case of a single robot, the basic navigation function can properly handle the food delivery task. However, with the increase in the number of robots in the restaurant, the simple navigation function can no longer meet the complex environmental requirements. For example, in a scenario where multiple food delivery robots are deployed, collisions between robots or congestion on the road are very common. Summary of the invention

[0003] The embodiments of the present application provide a device scheduling method, apparatus, electronic device and computer-readable storage medium, which can realize smooth and orderly scheduling of N devices and improve the security and stability of device scheduling.

[0004] The technical solution of the embodiment of the present application is implemented as follows:

[0005] The present application provides a device scheduling method, the method comprising:

[0006] Based on the task information of N devices, a path search is performed on the road network, where N is a positive integer greater than 1;

[0007] When a non-conflicting path for the nth device is not found, a waiting point for the nth device is determined, and a scheduling path for the nth device is determined based on the waiting point, wherein the non-conflicting path is a path that does not intersect with the scheduling paths of the first n-1 devices, the waiting point of the nth device does not overlap with the scheduling paths of the first n-1 devices, 1<n≤N, and n is a positive integer;

[0008] Determine the task execution order of the N devices based on the N scheduling paths;

[0009] Based on the task execution order, the N devices are controlled to move according to the N scheduling paths.

[0010] The present application provides a device scheduling apparatus, the apparatus comprising:

[0011] A scheduling path search module, used to perform path search on the road network based on task information of N devices, where N is a positive integer greater than 1;

[0012] The scheduling path search module is further used to determine a waiting point of the nth device when a non-conflicting path for the nth device is not found, and determine a scheduling path for the nth device based on the waiting point, wherein the non-conflicting path is a path that does not intersect with the scheduling paths of the first n-1 devices, the waiting point of the nth device does not overlap with the scheduling paths of the first n-1 devices, 1<n≤N, and n is a positive integer;

[0013] A scheduling order determination module, used to determine the task execution order of the N devices based on the N scheduling paths;

[0014] The device scheduling execution module is used to control the N devices to move according to the N scheduling paths based on the task execution order.

[0015] An embodiment of the present application provides an electronic device, the electronic device comprising:

[0016] A memory for storing computer executable instructions;

[0017] The processor is used to implement the device scheduling method provided in the embodiment of the present application when executing the computer executable instructions stored in the memory.

[0018] An embodiment of the present application provides a computer-readable storage medium storing a computer program or computer-executable instructions for implementing the device scheduling method provided in the embodiment of the present application when executed by a processor.

[0019] An embodiment of the present 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, the device scheduling method provided in the embodiment of the present application is implemented.

[0020] The embodiments of the present application have the following beneficial effects:

[0021] By performing path search for N devices, unified planning of the scheduling paths of N devices is achieved, thereby improving the operating efficiency of the entire device scheduling system. When a conflict-free path for the nth device cannot be found, the waiting point of the nth device is determined, and its scheduling path is determined based on this waiting point. This can effectively avoid collisions between devices during task execution. By predicting and reasonably arranging the operating path of the equipment in advance, smooth and orderly scheduling of N devices can be achieved, thereby improving the safety and stability of equipment scheduling. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] Figure 1 It is a structural diagram of the equipment scheduling system architecture provided in an embodiment of the present application;

[0023] Figure 2is a schematic diagram of the structure of an electronic device for device scheduling provided in an embodiment of the present application;

[0024] Figure 3A It is a first flow chart of the device scheduling method provided in an embodiment of the present application;

[0025] Figure 3B It is a second flow diagram of the device scheduling method provided in an embodiment of the present application;

[0026] Figure 3C It is a third flow chart of the device scheduling method provided in the embodiment of the present application;

[0027] Figure 3D It is a fourth flow chart of the device scheduling method provided in an embodiment of the present application;

[0028] Figure 3E It is a fifth flow chart of the device scheduling method provided in an embodiment of the present application;

[0029] Figure 3F It is a sixth flow chart of the device scheduling method provided in an embodiment of the present application;

[0030] Figure 4 It is a structural diagram of the device scheduling method provided in an embodiment of the present application;

[0031] Figure 5A It is a first structural schematic diagram of a road network of the device scheduling method provided in an embodiment of the present application;

[0032] Figure 5B It is a second structural schematic diagram of the road network of the equipment scheduling method provided in the embodiment of the present application;

[0033] Figure 5C It is a third structural schematic diagram of a road network of the device scheduling method provided in an embodiment of the present application;

[0034] Figure 5D It is a fourth structural schematic diagram of a road network of the device scheduling method provided in an embodiment of the present application;

[0035] Fig. 6A is a first principle diagram of the device scheduling method provided in an embodiment of the present application;

[0036] Figure 6B is a second principle diagram of the device scheduling method provided in an embodiment of the present application;

[0037] Figure 6C is a third principle diagram of the device scheduling method provided in an embodiment of the present application;

[0038] Fig.6D is a fourth principle diagram of the device scheduling method provided in an embodiment of the present application;

[0039] Fig. 6E is a fifth principle diagram of the device scheduling method provided in an embodiment of the present application;

[0040] Fig. 6F is a sixth principle diagram of the device scheduling method provided in an embodiment of the present application;

[0041] Fig. 7A It is a first principle diagram of the relative order of the device scheduling method provided in the embodiment of the present application;

[0042] Figure 7B is a second principle diagram of the relative order of the device scheduling method provided in an embodiment of the present application;

[0043] Figure 7C is a third principle diagram of the relative order of the device scheduling method provided in the embodiment of the present application;

[0044] Fig.7D is a fourth principle diagram of the relative order of the device scheduling method provided in the embodiment of the present application;

[0045] Fig. 8A This is a first schematic diagram of a security check of a device scheduling method provided in an embodiment of the present application;

[0046] Figure 8B is a second schematic diagram of the security check of the device scheduling method provided in an embodiment of the present application;

[0047] Figure 8C is a third schematic diagram of the security check of the device scheduling method provided in the embodiment of the present application;

[0048] Fig.8D is a fourth schematic diagram of the security check of the device scheduling method provided in an embodiment of the present application;

[0049] Fig. 8E is a fifth schematic diagram of the security check of the device scheduling method provided in the embodiment of the present application;

[0050] Fig.8F This is the sixth schematic diagram of the security check of the device scheduling method provided in the embodiment of the present application.

[0051] It should be pointed out that the above-mentioned "first" and "second" are only used to distinguish different solutions, and do not represent the degree of superiority or inferiority of the solutions or the priority in the implementation process. DETAILED DESCRIPTION

[0052] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application will be further described in detail below in conjunction with the accompanying drawings. The described embodiments should not be regarded as limiting the present application. All other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of this application.

[0053] In the following description, reference is made to “some embodiments”, which describe a subset of all possible embodiments, but it can be 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.

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

[0055] In the embodiments of the present application, the term "module" or "unit" refers to a computer program or a part of a computer program with a predetermined function, and works together with other related parts to achieve a predetermined goal, and can be implemented in whole or in part by using software, hardware (such as processing circuits or memories) or a combination thereof. Similarly, a processor (or multiple processors or memories) can be used to implement one or more modules or units. In addition, each module or unit can be part of an overall module or unit that includes the function of the module or unit.

[0056] Unless otherwise defined, all technical and scientific terms used in the embodiments of the present application have the same meanings as those commonly understood by those skilled in the art. The terms used in the embodiments of the present application are only for the purpose of describing the embodiments of the present application and are not intended to limit the present application.

[0057] The relevant data collection and processing in the embodiments of this application should be strictly in accordance with the requirements of relevant laws and regulations when applied in examples, obtain the informed consent or separate consent of the personal information subject, and carry out subsequent data use and processing within the scope of authorization of laws and regulations and the personal information subject.

[0058] Before further describing the embodiments of the present application in detail, the nouns and terms involved in the embodiments of the present application are explained. The nouns and terms involved in the embodiments of the present application are subject to the following interpretations.

[0059] 1) Road Network: A road network refers to a system of interconnected paths and vertices, which are places that robots (equipment) can visit and travel when performing tasks. That is, a road network is a network composed of a set of vertices and a set of edges. For example, in the field of catering services, a road network refers to a network composed of streets, roads, and intersections specially designed for automatic food delivery robots or equipment.

[0060] 2) Vertex: Vertex refers to the key position or node in the road network. These nodes are reference points or places that must be visited when the robot (equipment) performs tasks. For example, the vertex can be the intersection of the road network, the intersection, the end point of the channel, the target point or any other place that affects the robot's driving path. In the field of catering services, the vertex can be the food delivery point, the food delivery point, the return point, etc.

[0061] 3) Edge: An edge refers to a line segment connecting two vertices (nodes) in a road network. These line segments represent the actual path or possible movement of a robot from one location to another in the road network.

[0062] The embodiments of the present application provide a device scheduling method, apparatus, electronic device, computer-readable storage medium, and computer program product, which can achieve smooth and orderly scheduling of N devices and improve the security and stability of device scheduling.

[0063] The device scheduling method provided in the embodiment of the present application can be implemented by a terminal or a server alone, or can be implemented by a terminal and a server in collaboration. For example, the terminal alone undertakes the device scheduling method described below, or the terminal sends a device scheduling request containing task information of N devices to the server. The server executes the device scheduling method based on the received device scheduling request containing task information of N devices, performs path search for the N devices, obtains N scheduling paths, and determines the task execution order of the N devices. Based on the task execution order, the server controls the N devices to be scheduled according to the N scheduling paths.

[0064] Next, an exemplary application when the device is implemented as a server will be described.

[0065] See also Figure 1 , Figure 1 It is a structural diagram of the equipment scheduling system architecture provided in the embodiment of the present application. In the equipment scheduling system 10 provided in the embodiment of the present application, in order to support a equipment scheduling application, the terminal 400 is connected to the server 200 through the network 300. The network 300 can be a wide area network or a local area network, or a combination of the two.

[0066] Terminal 400 can be used to obtain a device scheduling request containing task information of N devices. For example, when a user inputs task information of N devices through terminal 400, terminal 400 obtains the task information of the N devices and automatically generates a device scheduling request containing the task information of the N devices.

[0067] In some embodiments, a device scheduling plug-in may be implanted in the client running in the terminal 400, which is used to execute the device scheduling method locally on the client. For example, after the terminal 400 obtains a device scheduling request containing task information of N devices, it calls the device scheduling plug-in, performs a path search for the N devices, obtains N scheduling paths, and determines the task execution order of the N devices. Based on the task execution order, the N devices are controlled to be scheduled according to the N scheduling paths.

[0068] In some embodiments, after the terminal 400 obtains a device scheduling request containing task information of N devices, the terminal 400 calls the device scheduling interface of the server 200 through the network 300. The server 200 executes a device scheduling method based on the received device scheduling request containing task information of N devices, performs a path search for the N devices, obtains N scheduling paths, and determines the task execution order of the N devices. The N scheduling paths and the task execution order of the N devices are sent to the terminal 400 through the network 300, and the terminal 400 controls the N devices to be scheduled according to the N scheduling paths based on the task execution order.

[0069] In some embodiments, the server 200 may be an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content distribution networks (CDNs), and big data and artificial intelligence platforms. The terminal and the server may be directly or indirectly connected via wired or wireless communication, which is not limited in the embodiments of the present application.

[0070] The terminal 400 may be a smart phone, a tablet computer, a laptop computer, a desktop computer, a smart speaker, a smart watch, an intelligent voice interaction device, a smart home appliance, a vehicle terminal, an aircraft, etc., but is not limited thereto. The terminal and the server may be directly or indirectly connected via wired or wireless communication, which is not limited in the embodiments of the present application.

[0071] See also Figure 2 , Figure 2 is a schematic diagram of the structure of an electronic device for device scheduling provided in an embodiment of the present application, Figure 2 The electronic device 500 shown may be Figure 1 The terminal 400 or the server 200 in the electronic device 500 includes: at least one processor 510, a memory 550, at least one network interface 520 and a user interface 530. The various components in the electronic device 500 are coupled together through a bus system 540. It can be understood that the bus system 540 is used to realize the connection and communication between these components. In addition to the data bus, the bus system 540 also includes a power bus, a control bus and a status signal bus. However, for the sake of clarity, in Figure 2 Various buses are labeled as bus system 540 .

[0072] The processor 510 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., where the general-purpose processor can be a microprocessor or any conventional processor, etc.

[0073] The memory 550 may be removable, non-removable, or a combination thereof. Exemplary hardware devices include solid-state memory, a hard disk drive, an optical disk drive, etc. The memory 550 may optionally include one or more storage devices that are physically located away from the processor 510.

[0074] The memory 550 includes a volatile memory or a non-volatile memory, and may also include both volatile and non-volatile memories. The non-volatile memory may be a read-only memory (ROM), and the volatile memory may be a random access memory (RAM). The memory 550 described in the embodiments of the present application is intended to include any suitable type of memory.

[0075] In some embodiments, the memory 550 can store data to support various operations, examples of which include programs, modules, and data structures, or a subset or superset thereof, as exemplarily described below.

[0076] Operating system 551, including system programs for processing various basic system services and performing hardware-related tasks, such as framework layer, core library layer, driver layer, etc., for implementing various basic services and processing hardware-based tasks;

[0077] A network communication module 552, for reaching other computing devices via one or more (wired or wireless) network interfaces 520, exemplary network interfaces 520 include: Bluetooth, Wireless Compatibility Certification (WiFi), and Universal Serial Bus (USB);

[0078] In some embodiments, the device provided in the embodiments of the present application can be implemented in software. Figure 2 The device scheduling device 555 stored in the memory 550 is shown, which can be software in the form of a program and a plug-in, etc., including the following software modules: a scheduling path search module 5551, a scheduling order determination module 5552, and a device scheduling execution module 5553. These modules are logical, so they can be arbitrarily combined or further split according to the functions implemented. The functions of each module will be explained below.

[0079] As mentioned above, the electronic device implementing the device scheduling method of the embodiment of the present application may be a terminal, a server, or a combination of the two, so the execution subject of each step will not be repeatedly described below, see Figure 3A , Figure 3A This is a first flow chart of the device scheduling method provided in the embodiment of the present application, which will be combined with Figure 3A The steps shown are explained.

[0080] In step 101, a path search is performed on a road network based on task information of N devices.

[0081] As an example, N devices are devices with mobility, and N devices may be wheeled devices running on a road network, such as an automatic guided vehicle (AGV), a food delivery robot, a building delivery robot, etc. N devices may also be non-wheeled devices running on a road network, such as a drone, etc. The embodiment of the present application does not limit the types of N devices, and N is a positive integer greater than 1. Task information includes a task start point, a task end point, and a task type. The road network includes multiple vertices and multiple edges. The task start points and task end points of the N devices are located on the vertices of the road network. Adjacent vertices in the road network are connected by edges, and the path of the device includes at least two vertices.

[0082] For example, for a road network G, which contains a vertex set V and an edge set E, a vertex v∈V represents a node on the road network, and an edge e∈E connects two different vertices. Figure 5A , Figure 5A is a first structural diagram of a road network of a device scheduling method provided in an embodiment of the present application. The path between vertex v0 and vertex v1 is connected by edge e0, indicating that the device at vertex v0 can move to vertex v1 along edge e0. Figure 5B , Figure 5B This is a second structural diagram of the road network of the device scheduling method provided in an embodiment of the present application. The path between vertex v0 and vertex v1 is connected by edge e0 and edge e1, indicating that the device located at vertex v0 can move to vertex v1 along edge e0, and the device located at vertex v1 can also move to vertex v0 along edge e1.

[0083] In some embodiments, the task information includes the task start point, task end point, and task type. Figure 3B , Figure 3B is a second flow chart of the device scheduling method provided in an embodiment of the present application, Figure 3A The illustrated step 101 may be implemented by following the steps 1011 to 1012, which are described in detail below.

[0084] In step 1011, task priorities of the N devices are determined based on the task start points, task end points, and task types of the N devices.

[0085] As an example, N devices include a first device and a second device. When the task type of the first device and the task type of the second device are the same, the task path length of the first device is calculated based on the task starting point and task end point of the first device, and the task path length of the second device is calculated based on the task starting point and task end point of the second device. If the task path length of the first device is greater than the task path length of the second device, the task priority of the first device is higher than the task priority of the second device. When the task type of the first device and the task type of the second device are different, the priority of the first device and the second device is determined according to the task type. For example, in the catering service field, the device is a food delivery robot, and the task types of the device include food delivery tasks and food pickup tasks. The task priority of the food delivery task is higher than the task priority of the food pickup task. When the task type of the first device is a food delivery task and the task type of the second device is a food pickup task, the task priority of the first device is higher than the task priority of the second device.

[0086] In step 1012, based on the order of the task priorities of the N devices from high to low, the scheduling paths of the N devices are searched in sequence on the road network.

[0087] As an example, based on the order of their task priorities from high to low, the N devices are sorted to obtain a sequence of the sorted N devices, and based on the sequence of the sorted N devices, scheduling paths for the N devices are searched for in sequence on the road network.

[0088] For example, for N devices R, device r∈R, the N devices R are sorted according to the order of task priorities k based on the N devices from high to low, and the sequence of the sorted N devices [r1,r2…r N ], and perform path search for N devices such as device r1, device r2, etc. in turn.

[0089] The embodiment of the present application determines the scheduling paths of N devices in order of their task priorities from high to low, reduces unnecessary movement and waiting of high-priority devices, optimizes the entire device scheduling process, and improves the overall efficiency of device scheduling.

[0090] In some embodiments, Figure 3B The step 1012 shown can be implemented by the following steps: searching for the shortest path for the first device; and searching for a conflict-free path for the nth device.

[0091] As an example, in the sequence of N devices after sorting, the first device is the device with the highest task priority. The shortest path from the task starting point of the first device to the task end point of the first device is searched on the road network, and the above shortest path is used as the scheduling path for the first device.

[0092] For example, see Fig. 6A , Fig. 6A This is the first principle diagram of the device scheduling method provided in an embodiment of the present application. The shortest path search is performed on device A to obtain the shortest path of device A from the task starting point 601 (task starting point) to the task end point 602 (task end point), and the shortest path of device A from the task starting point 601 to the task end point 602 is used as the scheduling path of device A.

[0093] As an example, a conflict-free path search is performed on the second device in the sequence of N sorted devices, and a path from the task starting point of the second device to the task end point of the second device is searched on the road network, which has no conflict with the scheduling path of the first device, and the above path is used as the scheduling path of the second device; a conflict-free path search is performed on the nth device in the sequence of N sorted devices, and a path from the task starting point of the nth device to the task end point of the nth device is searched on the road network, which has no conflict with the scheduling paths of the first n-1 devices, and the above path is used as the scheduling path of the nth device, wherein no conflict between paths means that there is no intersection between paths, that is, the paths do not contain the same vertices except the task end point.

[0094] For example, see Figure 6B , Figure 6B This is the second schematic diagram of the device scheduling method provided in an embodiment of the present application. Based on a conflict-free path search algorithm, a path is searched that can completely bypass the scheduling path 603 of device A to obtain path 604, and path 604 is used as the scheduling path of device B. The scheduling path 603 of device A and the scheduling path 604 of device B contain the same vertices, but the above vertices are the task endpoints of device A and device B. Therefore, the scheduling path 603 of device A and the scheduling path 604 of device B do not conflict.

[0095] In the embodiment of the present application, the shortest path search and the conflict-free path search are used to ensure that the scheduling path of the device does not conflict in space, which helps to avoid collisions or other safety accidents between devices and improves the safety of the device scheduling environment.

[0096] In step 102, when a conflict-free path for the nth device is not found, a waiting point for the nth device is determined, and a scheduling path for the nth device is determined based on the waiting point.

[0097] As an example, when the conflict-free path search for the nth device fails (when the conflict-free path for the nth device is not found), it indicates that the scheduling path of the nth device must intersect with the scheduling paths of the first n-1 devices. For example, see Figure 6C , Figure 6C This is the third schematic diagram of the device scheduling method provided in an embodiment of the present application. When the task priority of device A is higher than the task priority of device B and the scheduling path 605 of device A has been determined, no matter how the path of device B from the task starting point 606 to the task end point 607 is planned, it will inevitably intersect with the scheduling path 605 of device A.

[0098] The waiting point of the nth device is determined by a waiting point generation algorithm, and the scheduling path of the nth device is determined based on the waiting point, wherein the conflict-free path of the nth device is a path that has no intersection with the scheduling paths of the first n-1 devices, and the waiting point of the nth device has no overlap with the scheduling paths of the first n-1 devices, 1<n≤N, and n is a positive integer.

[0099] In some embodiments, the road network includes multiple vertices, see Figure 3C , Figure 3C This is the third flow chart of the device scheduling method provided in the embodiment of the present application. "Determining the waiting point of the nth device" can be achieved through the following steps 201 to 202, which are described in detail below.

[0100] In step 201, the first vertex on the scheduling path of the first n-1 devices is determined.

[0101] The first vertex is a vertex on the scheduling path of the first n-1 devices on the road network.

[0102] As an example, obtain the vertex set on the scheduling path of the first n-1 devices, and take the above vertex set as the first vertex. For example, the scheduling path of the first device includes vertices v0, v1 and v2, and the scheduling path of the second device includes vertices v3 and v4. Then the first vertex on the scheduling path of the first two devices includes vertices v0, v1, v2, v3 and v4.

[0103] In step 201, based on the first vertex, a waiting point of the nth device is screened out from the vertices included in the road network.

[0104] In some embodiments, Figure 3CThe step 201 shown can be implemented by the following steps: determining the task start point and the task end point included in the task information as the second vertex; filtering out the first vertex and the second vertex from the multiple vertices included in the road network to obtain the waiting point of the nth device.

[0105] As an example, the N task starting points and N task end points included in the task information of N devices are determined as the second vertex, the first vertex and the second vertex are screened out from the multiple vertices included in the road network, and the remaining vertices in the road network after screening are used as waiting points for the nth device.

[0106] In some embodiments, Figure 3C The step 201 shown can be implemented by the following steps: determining a third vertex adjacent to the first vertex from a plurality of vertices included in the road network, and determining the third vertex as a waiting point for the nth device.

[0107] As an example, the adjacency between vertices refers to the connection between vertices through edges. From the multiple vertices included in the road network, a third vertex connected to the first vertex through an edge is determined, and the third vertex is determined as the waiting point of the nth device. Fig.6D , Fig.6D This is the fourth principle diagram of the device scheduling method provided in an embodiment of the present application. The first vertex is a plurality of vertices included in the scheduling path 609 of device A, and the third vertex connected to the first vertex through an edge is determined as the waiting point 608 of device B.

[0108] The embodiment of the present application proposes an innovative waiting point path planning strategy, which achieves spatial isolation between devices by utilizing waiting points in the path search of N devices, so that the devices can effectively avoid conflicts with each other in the process of executing tasks, thereby ensuring the safety of multi-device scheduling operation.

[0109] In some embodiments, the number of waiting points is M, where M is a positive integer greater than 0. Figure 3D , Figure 3D This is the fourth process diagram of the device scheduling method provided in an embodiment of the present application. "Determining the scheduling path of the nth device based on the waiting point" can be achieved through the following steps 301 to 303, which are described in detail below.

[0110] In step 301, based on M waiting points, M candidate scheduling paths for the nth device are determined.

[0111] As an example, each candidate scheduling path includes a waiting point, and based on the mth waiting point among the M waiting points, the mth candidate scheduling path for the nth device is constructed, and the mth candidate scheduling path for the nth device includes a path from the task starting point of the nth device to the mth waiting point, and a path from the mth waiting point to the task end point of the nth device, where m is a positive integer greater than or equal to 1 and less than or equal to M.

[0112] In step 302, path screening is performed on the M candidate scheduling paths to obtain K safe scheduling paths for the nth device.

[0113] As an example, by determining the relative order between M candidate scheduling paths and the scheduling paths of the first n-1 devices, the M candidate scheduling paths are screened to obtain K safe scheduling paths for the nth device, where the safe scheduling path for the nth device refers to a candidate scheduling path that will not conflict with the execution order of the scheduling paths of the first n-1 devices, and K is a positive integer less than or equal to M.

[0114] In some embodiments, the task information of the nth device includes a task start point and a task end point, and the candidate scheduling path includes a path from the task start point to the waiting point and a path from the waiting point to the task end point, see Figure 3E , Figure 3E This is the fifth process diagram of the device scheduling method provided in an embodiment of the present application. "Performing path screening processing on M candidate scheduling paths" can be achieved by executing the following steps 3021A to 3023A on any one path in each candidate scheduling path, which is described in detail below.

[0115] In step 3021A, when the path endpoint of the first scheduling path in the first n-1 devices overlaps with the path, and the path endpoint of the second scheduling path in the first n-1 devices overlaps with the path, a first relative order between the path and the target scheduling path is determined based on the overlapping relationship between the path and the target scheduling path.

[0116] As an example, when the target scheduling path is the first scheduling path or the second scheduling path, and the path endpoint of the first scheduling path in the first n-1 devices overlaps with the path, and the path endpoint of the second scheduling path in the first n-1 devices overlaps with the path endpoint of the path, a first relative order between the first scheduling path and the path is determined based on the overlapping relationship between the path endpoint of the first scheduling path and the path; or, a first relative order between the second scheduling path and the path is determined based on the overlapping relationship between the path endpoint of the second scheduling path and the path.

[0117] Among them, the path endpoints include the task starting point, the task end point, or the waiting point. For the path from the task starting point to the task end point, the path starting point is the task starting point and the path end point is the task end point; for the path from the task starting point to the waiting point, the path starting point is the task starting point and the path end point is the waiting point; for the path from the waiting point to the task end point, the path starting point is the waiting point and the path end point is the task end point.

[0118] In some embodiments, "determining the first relative order between the first scheduling path and the path based on the overlapping relationship between the path endpoint of the first scheduling path and the path" can be achieved by the following steps: when the overlapping relationship is that the path starting point of the first scheduling path overlaps with the path, the order of the path after the first scheduling path is determined as the first relative order; when the overlapping relationship is that the path end point of the first scheduling path overlaps with the path, the order of the path before the first scheduling path is determined as the first relative order.

[0119] As an example, each path corresponds to a sequence score, and the magnitude relationship between the sequence scores of the paths represents the relative relationship between the execution orders of the paths.

[0120] See also Figure 7B , Figure 7B This is the second principle diagram of the relative order of the equipment scheduling method provided in an embodiment of the present application. When the overlapping relationship is that the path starting point of the first scheduling path py overlaps with the path px, the order score representing the first scheduling path py is less than the order score of the path px, and the order of the path px after the first scheduling path is determined as the first relative order.

[0121] See also Figure 7C , Figure 7C This is the third principle diagram of the relative order of the equipment scheduling method provided in an embodiment of the present application. When the overlapping relationship is that the path end point of the first scheduling path py overlaps with the path px, the order score representing the first scheduling path py is greater than the order score of the path px, and the order of the path px before the first scheduling path is determined as the first relative order.

[0122] In some embodiments, "determining the first relative order between the second scheduling path and the path based on the overlapping relationship between the second scheduling path and the path endpoint of the path" can be achieved by the following steps: when the overlapping relationship is that the second scheduling path overlaps with the path starting point of the path, the order of the path before the second scheduling path is determined as the first relative order; when the overlapping relationship is that the second scheduling path overlaps with the path endpoint of the path, the order of the path after the second scheduling path is determined as the first relative order.

[0123] As an example, reference may be made to the above related steps of “determining a first relative order between the first scheduling path and the path based on the overlapping relationship between the path endpoints of the first scheduling path and the path”, which will not be repeated here.

[0124] In step 3022A, a second relative order between the path and the target scheduling path is determined based on an overlapping relationship between the path and another scheduling path, and an overlapping relationship between the first scheduling path and the second scheduling path.

[0125] As an example, another scheduling path is a scheduling path other than the target scheduling path between the first scheduling path and the second scheduling path. When the target scheduling path is the first scheduling path and the other scheduling path is the second scheduling path, the second relative order between the path and the first scheduling path is determined based on the overlapping relationship between the path and the second scheduling path and the overlapping relationship between the first scheduling path and the second scheduling path; or, when the target scheduling path is the second scheduling path and the other scheduling path is the first scheduling path, the second relative order between the path and the second scheduling path is determined based on the overlapping relationship between the path and the first scheduling path and the overlapping relationship between the first scheduling path and the second scheduling path.

[0126] In some embodiments, Figure 3E Step 3022A shown can be implemented by the following steps: based on the overlapping relationship between the path and another scheduling path, determining the third relative order between the path and the other scheduling path; based on the overlapping relationship between the first scheduling path and the second scheduling path, determining the fourth relative order between the first scheduling path and the second scheduling path; based on the third relative order and the fourth relative order, deriving the second relative order between the path and the target scheduling path.

[0127] As an example, when the target scheduling path is the first scheduling path and the other scheduling path is the second scheduling path, the third relative order between the path and the second scheduling path is determined based on the overlapping relationship between the path and the second scheduling path; the fourth relative order between the first scheduling path and the second scheduling path is determined based on the overlapping relationship between the first scheduling path and the second scheduling path; and the second relative order between the path and the first scheduling path is derived based on the third relative order and the fourth relative order.

[0128] For example, see Fig.7D , Fig.7DThis is the fourth principle diagram of the relative order of the equipment scheduling method provided in an embodiment of the present application. Based on the overlapping relationship between the path pz and the second scheduling path py, it can be confirmed that the order score of the second scheduling path py is greater than the order score of the path pz, and the order of the path pz before the second scheduling path py is determined as the third relative order; based on the overlapping relationship between the first scheduling path px and the second scheduling path py, it can be confirmed that the order score of the second scheduling path py is less than the order score of the first scheduling path px, and the order of the first scheduling path px after the second scheduling path py is determined as the fourth relative order; based on the third relative order and the fourth relative order, it is deduced that the order score of the path pz is less than the order score of the first scheduling path px, and the order of the path pz before the first scheduling path px is determined as the second relative order.

[0129] In step 3023A, when the first relative order is different from the second relative order, the candidate scheduling path corresponding to the path is screened out.

[0130] As an example, the candidate scheduling path includes a path from the task starting point to the waiting point and a path from the waiting point to the task end point. When the first relative order of any one of the two paths included in the candidate scheduling path is different from the second relative order, the candidate scheduling path corresponding to any one of the paths is screened out.

[0131] For example, see Fig.7D , when the target scheduling path is the first scheduling path and the other scheduling path is the second scheduling path, the overlapping relationship between path pz and the first scheduling path px is that the path starting point of the first scheduling path px overlaps with path pz, indicating that the order score of the first scheduling path px is less than the order score of path pz, and the order of path pz after the first scheduling path px is determined as the first relative order; the second relative order is the order of path pz before the first scheduling path px, the first relative order is different from the second relative order, and the candidate scheduling path corresponding to the path is screened out.

[0132] In some embodiments, the task information of the nth device includes a task start point and a task end point, and the candidate scheduling path includes a path from the task start point to the waiting point and a path from the waiting point to the task end point, see Figure 3F , Figure 3F This is the sixth process diagram of the device scheduling method provided in an embodiment of the present application. "Performing path screening processing on M candidate scheduling paths" can be achieved by executing the following steps 3021B to 3023B on any one path in each candidate scheduling path, which is described in detail below.

[0133] In step 3021B, when a scheduling path among the current n-1 devices overlaps with a path endpoint of the path, a fifth relative order between the path and the scheduling path is determined based on the overlapping relationship between the scheduling path and the path endpoint of the path.

[0134] In some embodiments, the path endpoint is the path starting point or the path end point, and "determining the fifth relative order between a path and a scheduling path based on the overlapping relationship between a scheduling path and the path endpoint of the path" can be achieved by the following steps: when the overlapping relationship is that a scheduling path overlaps with the path starting point of the path, the order of the path before the scheduling path is determined as the fifth relative order; when the overlapping relationship is that a scheduling path overlaps with the path end point of the path, the order of the path after the scheduling path is determined as the fifth relative order.

[0135] As an example, reference may be made to the relevant steps of "determining a first relative order between the first scheduling path and the path based on the overlapping relationship between the path endpoints of the first scheduling path and the path" in step 3021A, which will not be repeated here.

[0136] In step 3022B, when a path endpoint of a scheduling path in the current n-1 devices overlaps with the path, a sixth relative order between the path and the scheduling path is determined based on the overlapping relationship between the path endpoint of the scheduling path and the path.

[0137] As an example, when a path starting point of a scheduling path among the current n-1 devices overlaps with the path, the order of the path after the scheduling path is determined as the sixth relative order based on the overlapping relationship between the path starting point of the scheduling path and the path; or, when a path end point of a scheduling path among the current n-1 devices overlaps with the path, the order of the path before the scheduling path is determined as the sixth relative order based on the overlapping relationship between the path end point of the scheduling path and the path.

[0138] In step 3023B, when the fifth relative order is different from the sixth relative order, the candidate scheduling path corresponding to the path is screened out.

[0139] As an example, when a scheduling path among the current n-1 devices overlaps with the path starting point of the path, and the path starting point of a scheduling path among the current n-1 devices overlaps with the path, the fifth relative order is the order of the path before the scheduling path, and the sixth relative order is the order of the path after the scheduling path; or, when a scheduling path among the current n-1 devices overlaps with the path end point of the path, and the path end point of a scheduling path among the current n-1 devices overlaps with the path, the fifth relative order is the order of the path after the scheduling path, and the sixth relative order is the order of the path before the scheduling path. The fifth relative order is different from the sixth relative order, and the candidate scheduling path corresponding to the path is screened out.

[0140] For example, see Fig. 6E , Fig. 6E It is the fifth principle diagram of the device scheduling method provided in an embodiment of the present application. The path 610 of device A overlaps with the path starting point (waiting point 612) of the path 611 of device B. The fifth relative order is the order in which the path 611 of device B is before the path 610 of device A. At the same time, the task starting point of the path 610 of device A overlaps with the path 611 of device B. The sixth relative order is the order in which the path 611 of device B is after the path 610 of device A. The fifth relative order is different from the sixth relative order.

[0141] The embodiment of the present application determines the relative order between the candidate path of the nth device and the scheduling paths of the first n-1 devices, eliminates those candidate paths that may cause deadlock or unreasonable scheduling order (devices wait for each other to complete the movement), and maintains the compatibility and smoothness of the scheduling of the first n devices.

[0142] In step 303, the safe scheduling path with the shortest path length among the K safe scheduling paths is used as the scheduling path for the nth device.

[0143] As an example, the path length of each path in the K safe scheduling paths is calculated respectively, and the path with the shortest path length is used as the scheduling path of the nth device, where the path length of each path is the sum of the path length from the task starting point of the nth device to the waiting point and the path length from the waiting point to the task end point of the nth device.

[0144] For example, for K secure scheduling paths PW = { <p a1 ,p b1 >… <p ak ,p bk >… <p aK ,p aK >}, where p ak is the path from the task starting point to the waiting point of the kth path among the K safe scheduling paths, pbk is the path from the waiting point to the task end point of the kth path among the K safe scheduling paths, k is a positive integer greater than 0 and less than K, calculate the length D of all paths in PW, and get PD = {D1…D k …D K}, where D k is the p of the kth path among the K safe scheduling paths ak and p bk The sum of the path lengths of PD is selected, and the path with the shortest path length in PD is selected. <p a ,p b > as the dispatch path for the nth device.

[0145] In step 103, based on the N scheduling paths, the task execution order of the N devices is determined.

[0146] As an example, the task execution sequence of N devices includes at least N device numbers, and the number of times the device number of each device is included in the task execution sequence is equal to the number of paths of the device, wherein the device number is a unique number that identifies the identity information of the device.

[0147] For example, the device number of device r0 is 0, and the scheduling path includes a path p0, which is the path from the task start point of r0 to the task end point of r0. The device number of device r1 is 1, and the scheduling path includes two paths <p a1 ,p b1 >, path p a1 is the path from the starting point of task r1 to the waiting point, p b1 is the path from the waiting point to the task end point of r1. The device number of device r2 is 2. The scheduling path includes two paths <p a2 ,p b2 >, the task execution order can be [0,1,2,1,2].

[0148] In some embodiments, Figure 3A Step 103 shown can be implemented by the following steps: arrange and combine N scheduling paths to obtain T candidate task execution orders; perform the following processing on the T candidate task execution orders in turn: based on the candidate task execution order, simulate N devices to be scheduled according to N scheduling paths; when it is simulated that no collision occurs between any two devices among the N devices, determine the candidate task execution order as the task execution order of the N devices.

[0149] As an example, based on the device numbers corresponding to N scheduling paths, the N scheduling paths are arranged and combined to obtain T candidate task execution orders, where the T candidate task execution orders are all possible execution orders of the N scheduling paths, and the t-th candidate task execution order among the T candidate task execution orders is simulated and scheduled. Based on the t-th candidate task execution order, N devices are simulated to move along the N scheduling paths. When it is simulated that any two of the N devices collide, the t+1-th candidate task execution order is simulated and scheduled; when it is simulated that no two of the N devices collide, the t-th candidate task execution order is determined as the task execution order of the N devices, where t is a positive integer greater than 0 and less than or equal to T.

[0150] In step 104, based on the task execution order, N devices are controlled to be scheduled according to N scheduling paths.

[0151] For example, device r0 has a device number of 0, and the dispatch path includes one path p0; device r1 has a device number of 1, and the dispatch path includes two paths <p a1 ,p b1 >, the device number of device r2 is 2, and the scheduling path includes two paths <p a2 ,p b2 >, the task execution order is [0,1,2,1,2], controlling device r0 to execute path p0 first, and then device r1 to execute path p a1 , then device r2 executes path p a2 , then device r1 executes path p b1 , and finally device r2 executes path p b2 .

[0152] Below, an exemplary application of the equipment scheduling method provided in an embodiment of the present application in a multi-machine scheduling application scenario of a food delivery robot will be described.

[0153] In the restaurant delivery scenario, a delivery robot (wheeled robot) is deployed to complete the delivery task. The robot needs to obtain dishes from the pick-up point and then deliver the dishes to the customer's table (delivery point) as quickly as possible along a certain path. Generally speaking, if only one robot is deployed in the restaurant, ordinary navigation functions can complete simple delivery tasks. However, when a restaurant deploys two or more delivery robots, collisions between robots or congestion on the road are very common. At this time, a multi-machine scheduling system is needed to coordinate the movement of multiple robots.

[0154] In order to solve the above problems, an embodiment of the present application proposes an equipment scheduling method, which uniformly plans the delivery paths and execution order of multiple wheeled robots (equivalent to the equipment mentioned above), thereby realizing the scheduling of multiple wheeled robots in a road network environment, so as to achieve the effect that there is no collision between the robots and the robots can complete their respective tasks smoothly.

[0155] See also Figure 4 , Figure 4 4 is a schematic diagram of the structure of the equipment scheduling method provided by the embodiment of the present application. The equipment scheduling method provided by the embodiment of the present application includes two main modules: a multi-machine path planning module 401 and a multi-machine execution sequence generation module 402, wherein the input of the multi-machine path planning module is the road network G and all robot attributes R, and the output is the multi-machine path P; the input of the multi-machine execution sequence generation module is the multi-machine path P, and the output is the execution sequence Q. Each robot executes its own path according to the multi-machine path P and the order of the execution sequence Q to achieve the effect of multi-machine scheduling.

[0156] The following will respectively Figure 4 The road network, robot properties, multi-machine paths (equivalent to the N scheduling paths mentioned above) and execution sequence (equivalent to the task execution order mentioned above) are described in detail.

[0157] Road network: Define the road network G to include a vertex set V and an edge set E. Vertex v∈V represents a node on the road network, which may be a food delivery point, a food delivery point, a return point, etc. Edge e∈E connects two different vertices, indicating that the two vertices are passable. Edges have directions, see Figure 5A , edge e0 connects v0 to v1, which means the robot can move directly from v0 to v1. If there is no edge connecting v1 to v0, then the robot cannot move directly from v1 to v0. See Figure 5B , edge e0 connects v0 to v1, which means the robot can move directly from v0 to v1, and edge e1 connects v1 to v0, which means the robot can move directly from v1 to v0.

[0158] Robot attributes: Define a robot r∈R. The robot attributes include the number id (equivalent to the device number above), the task starting point v s ∈V and the task endpoint v s∈V, task priority k. The number id is a preset attribute of each robot, and each robot has a different number id. Define the task priority k of the robot, where the higher the task priority, the smaller k. k is related to the task type and path length of the robot. For example, if the task types of two robots are different, one is a food delivery task and the other is a food pickup task, then the priority k0 of the food delivery task is higher than the priority k1 of the food pickup task, i.e., k0 < k1. If the task types are both food delivery tasks, but the path length of task k0 is shorter, then k0 < k1. According to the definition, since the task path lengths of each robot are different, the task priorities of each robot are different.

[0159] Multi-robot path: Define the path as consisting of vertices p = {v|v ∈ V}. Each robot can have 1 or 2 paths. If there is only one path p, see Figure 5C , Figure 5C which is the third structural diagram of the road network of the device scheduling method provided by the embodiment of the present application, representing that the path passes through v1 and v2 and directly connects from the starting point v s to the end point v g , if there are two paths <p a ,p b >, see Figure 5D , Figure 5D which is the fourth structural diagram of the road network of the device scheduling method provided by the embodiment of the present application. Then the last point of the first path p a is the same as the first point of the second path p b , and this point is denoted as the waiting point v w , meaning that the robot starts from the starting point v s moves through p a to the waiting point v w and then needs to stop and wait for other robots. After waiting is completed, it then moves from the waiting point v w through p b to the end point v g .

[0160] Execution sequence: Define the execution sequence as consisting of robot numbers Q = {id|id ∈ R}. The execution sequence means that as long as each robot executes in the order in the sequence, it can ensure that no collision occurs between any robots, and the number of times each robot appears in the sequence is equal to the number of paths of the robot. For example, robot r0 has only one path p0, robot r1 has two paths <p a1 ,p b1 >, and robot r2 also has two paths <p a2 ,p b2 >. If the execution sequence is [0,1,2,1,2], it means that robot r0 first executes path p0, and then robot r1 executes path pa1 , then robot r2 executes path p a2 , robot r1 executes path p b1 , finally robot r2 executes path p b2 .

[0161] See also Figure 4 , the following will respectively Figure 4 The multi-level path planning module and multi-machine execution sequence generation module are explained in detail.

[0162] 1. Multi-level path planning module: sort all robots R according to the task priority k. Since each robot has a different task priority, we can get a robot order [r0, r1, r2…r n ], and then calculate the paths of all robots in turn according to this order, and calculate the paths by searching on the road network G. Finally, the paths of all robots are combined into a multi-machine path P, where a robot can only have one task at a time, and generally completes one task before moving on to the next one.

[0163] First, calculate the path of robot r0. At this time, since the paths of other robots have not been calculated, we only need to execute a single-machine path search algorithm on the road network to obtain the path of r0 from the starting point v s0 To the end v g0 The shortest path p0 of Fig. 6A , execute a single-machine path search algorithm to obtain the shortest path from the task starting point 601 to the task end point 602 of robot A. The single-machine path search algorithm searches for a path from the starting point v to the task end point 602 by traversing all the vertices in the road network G. s0 To the end v g0 The input of the single-machine path search algorithm is the road network G, the starting point v s0 To the end v g0 The output of the stand-alone path search algorithm is the shortest path p0. The stand-alone path search algorithm of the embodiment of the present application includes depth-first search (DFS), breadth-first search (BFS), ant colony algorithm, etc., which are not limited here.

[0164] Then, if there is a robot [r0, r1…r i-1 ], then among the remaining robots [r i ,r i+1 …r n ], r i It is the task with the highest priority, and r is calculated first in order. i Here we first iExecutes a conflict-free path search algorithm that aims to calculate a path that completely bypasses [r0,r1…r i-1 ] the shortest path p i , see for example Figure 6B , the path 603 of robot A has been calculated, and the conflict-free path search algorithm is executed to calculate a path 604 that can completely bypass the path 603. The end points of the paths 603 and 604 are the same. It is considered that there is no collision at the end points, and the conflict-free path search is successful. When the conflict-free path search algorithm searches for a path in the road network G, it traverses each vertex in the road network one by one, and at the same time detects whether the next vertex to be visited conflicts with the scheduling paths of other robots, and according to the detection results, the path search is appropriately adjusted until a path is found that all robots can move safely (the scheduling paths do not overlap each other). The input of the conflict-free path search algorithm is the road network G, r i Starting point v si To the end v gi , the output is r i The conflict-free path p i .

[0165] If r i The conflict-free path search algorithm is successful, then p i Add it to the multi-robot path P, and then return to the second step to continue calculating the paths of the remaining robots. If the conflict-free path search algorithm fails to find a path that can completely bypass [r0, r1…r i-1 ], then it means r i The path will definitely be [r0,r1…r i-1 ]The paths of some robots in ] cross.

[0166] For example, see Figure 6C , the path of robot B from the task starting point 606 to the task end point 607 will definitely intersect with the path 605 of robot A. The embodiment of the present application proposes a waiting point path planning strategy, and generates r by a waiting point generation algorithm. i Waiting point v wi , so i You can start from the starting point v si to v gi , and in v wi Wait until it is safe to go to the end point v gi , to avoid collisions with other robots when paths intersect, since it is impossible to directly select a unique waiting point v on the road network wi , first obtain a waiting point set W through the waiting point generation algorithm, for example, see Fig.6D, the waiting point 608 of robot B is generated by the waiting point generation algorithm, wherein the waiting point set includes multiple candidate waiting points, each candidate waiting point cannot be on the path of A, the candidate waiting point is connected to the scheduling path 609 of A, and the candidate waiting point cannot be at the starting point and end point of other robots, wherein the waiting point generation algorithm first screens out the path set P of other robots from the road network G ′ , and then determine the set of vertices adjacent to the scheduling paths of other robots from the remaining vertices of the road network G as the waiting point set W. The input of the waiting point generation algorithm is the road network G and the path set P′ of other robots, and the output of the waiting point generation algorithm is the waiting point set W.

[0167] The waiting point set W generated by the waiting point algorithm is W = {v w0 ,v w1 …v wm} includes m candidate waiting points, and then for each candidate waiting point v in the set wj , execute the multi-machine path search algorithm, and the search starts at the starting point v si , the search end point is the candidate waiting point v wj , for the starting point v si To the candidate waiting point v wj Perform path search and get the path from the starting point v si To the candidate waiting point v wj The path p aj , execute the multi-machine path search algorithm again, and the search starting point is the candidate waiting point v wj , the search end point is the end point v gi , for the candidate waiting point v wj To the end v gi Perform path search and obtain the path from the candidate waiting point v wj To the end v gi The path p bj , see for example Fig. 6F , Fig. 6F This is the sixth schematic diagram of the equipment scheduling method provided in an embodiment of the present application. For the candidate waiting point 615 of robot B, a multi-machine path search algorithm is executed, a path search is performed from the starting point 613 to the candidate waiting point 615, and a path 616 is obtained. The multi-machine path search algorithm is executed again, and a path search is performed from the candidate waiting point 615 to the end point 614, and a path 617 from the candidate waiting point 615 to the end point 614 is obtained.

[0168] In order to ensure that there is no collision between robots, the embodiment of the present application proposes a relative order evaluation strategy, which defines a relative order rsp, which is used to evaluate whether the paths of each robot are safe. i Each path corresponds to an rsp i, represents the relative relationship between the robot's execution paths. If the robot has two paths, there will be two rsps.

[0169] See also Fig. 7A , Fig. 7A This is the first schematic diagram of the relative order of the equipment scheduling method provided in the embodiment of the present application. If the path of robot r0 is [v0, v1, v2] and the path of robot r1 is [v1, v3], then it is obvious that only robot r1 can execute the path [v1, v3] first, and then robot r0 can execute the path [v0, v1, v2] to complete collision-free scheduling, that is, robot r1 must execute earlier than robot r0, and rsp0>rsp1 is defined.

[0170] From the above definition of relative order, we can know that the robot r i The path p aj and p bj Check the following: whether the path start point is on the path of the other robot, and whether the path end point is on the path of the other robot, see Figure 7B , if path p y The starting point is on path p x Then according to the definition rsp x >rsp y , see Figure 7C , if path p y The end point is on path p x On the path, then according to the definition rsp x <rsp y .

[0171] The path rsp of each robot is initialized only once, and then compared with the rsp of other robots. If the relative relationship is not satisfied, the path is considered not a feasible path.

[0172] See also Fig.7D , there are three robots r x , r y , r z , the paths are p x , p y , p z Set the pathp x RSP x , then according to p x and p y The relationship can get rsp y <rsp x , similarly, we can get rsp z <rsp y , then rsp x and rsp zFor comparison, rsp y <rsp x and rsp z <rsp y , we get the conclusion rsp z <rsp x , that is, p x The end point is p z On the path or p z The starting point is p x On the path, but in fact it needs to satisfy rsp z >rsp x , which is contrary to the conclusion, so path p z is inappropriate.

[0173] When performing path search in the road network G through the multi-machine path search algorithm, each vertex in the road network is traversed one by one. When the currently visited vertex is the path endpoint of path A, based on the rsp of path A, the rsp of the currently constructed path relative to path A is determined, and all the rsps of the remaining robots are obtained to determine whether there is a contradiction between the currently constructed path and all the rsps of the remaining robots. When there is a contradiction, the path search is appropriately adjusted. The input of the multi-machine path search algorithm is the road network G, the search start point vx, the search end point vy and the path set P′ of other robots. The output of the multi-machine path search algorithm: path p, the relative order rsp of the current path.

[0174] Finally, we get the path set PW = { <p a0 ,p b0 >, <p a1 ,p b1 >… <p am ,p bm >}, calculate all the path lengths D in the set and get PD = {D0, D1…D m}, select the path with the smallest length D <p a ,p b > as r i The scheduling path and r i The scheduling path is added to the multi-machine path P, and the rsp of the current path is recorded. Then the paths of the remaining robots are calculated until the paths of all robots are added to the multi-machine path P.

[0175] 2. Multi-machine execution sequence generation module

[0176] The multi-machine path P is obtained through the multi-machine path planning module. At this time, if each robot directly executes according to the path in P, a collision may occur. Therefore, the multi-machine execution sequence generation module needs to calculate an execution sequence Q, and use Q to schedule different robots to execute the multi-machine path P in a safe order.

[0177] Here, the permutation sequence search algorithm is used to generate an initial execution sequence Q0 based on the multi-machine path P. The number of times each robot appears in Q0 is equal to the number of paths of the robot, which is 1 or 2. According to this principle, Q0 is constructed, and then the permutation sequence search algorithm is used to generate all possible execution sequences of the multi-machine path P. Perform security checks on each sequence Q in turn. Specifically, define the set V r = {v r0 ,v r1 …v rn} is the vertex position of n robots, traverse Q in order i ={id0, id1…id m} j , check the execution id j Is the robot's path consistent with V r If a collision occurs, continue to check the next sequence Q i+1 ; If there is no collision, then V r Update id by path j The robot's position (the end point of the path) and continue to traverse the next id j+1 , until a completely collision-free sequence is found, where the input of the permutation sequence search algorithm is the multi-machine path P and the output is the execution sequence Q.

[0178] For example, for robot A, robot B and robot C, the multi-machine planning path includes the path of robot A: task starting point 4 to task end point 1, the path of robot B: task starting point 1 to waiting point 7 and waiting point 7 to task end point 5, and the path of robot C: task starting point 0 to waiting point 6, waiting point 6 to task end point 5.

[0179] A specific example of security check for the execution sequence Q{B,C,A,B,C} is as follows:

[0180] See also Fig. 8A , Fig. 8A This is the first schematic diagram of the safety check of the equipment scheduling method provided in the embodiment of the present application. In the initial state, robot A is located at vertex 4, robot B is located at vertex 1, and robot C is located at vertex 0.

[0181] See also Figure 8B , Figure 8B This is the second schematic diagram of the safety check of the equipment scheduling method provided in an embodiment of the present application. Robot B executes the first scheduling path (task starting point 1 to waiting point 7), checks that the vertices [1, 2, 7] of the first scheduling path of robot B have no collision with robot A and robot C, and updates the position of robot B to vertex 7.

[0182] See also Figure 8C , Figure 8C This is the third schematic diagram of the safety check of the equipment scheduling method provided in an embodiment of the present application. Robot C executes the first scheduling path (task starting point 0 to waiting point 6) and executes path 0->6. It is checked that the vertices [0,1,2,3,6] of the first scheduling path of robot C have no collision with robots A and B, and the position of robot C is updated to vertex 6.

[0183] See also Fig.8D , Fig.8D This is the fourth schematic diagram of the safety check of the equipment scheduling method provided in an embodiment of the present application. Robot A executes the scheduling path (task starting point 4 to task end point 1), checks that the vertices [4, 3, 2, 1] of the scheduling path of robot A have no collision with robots B and C, and updates the position of robot A to vertex 1.

[0184] See also Fig. 8E , Fig. 8E This is the fifth schematic diagram of the safety check of the equipment scheduling method provided in an embodiment of the present application. Robot B executes the second scheduling path (waiting point vertex 7 to task end vertex 5). It is checked that the vertices [7, 2, 3, 4, 5] of the second scheduling path of robot B have no collision with robots A and C, and the position of robot B is updated to vertex 5.

[0185] See also Fig.8F , Fig.8F This is the sixth schematic diagram of the safety check of the equipment scheduling method provided in the embodiment of the present application. Robot C executes the second scheduling path (waiting point vertex 6 to task end vertex 5), and checks whether the vertices [6, 3, 4, 5] of the second scheduling path of robot C collide with robots A and B. Since robot B is already at the task end at this time, even if the task end points of robots B and C are the same, it is considered that there is no collision.

[0186] In summary, the scheduling algorithm of the embodiment of the present application is calculated based on the road network information, which limits the range of motion of the robot from leaving the road network too far, making the scheduling process safer. The road network information can also simplify the road information through vertex numbering to avoid detours and thus improve the efficiency of the robot in completing tasks. The scheduling algorithm proposed in the embodiment of the present application is based on spatial avoidance in principle. By proposing an innovative waiting point path planning strategy, all robots are isolated in space by using waiting points during path planning and sequence generation to ensure the safety of multi-machine scheduling during operation. At the same time, the strategy of sequential scheduling is adopted so that only one robot is scheduled at the same time, which improves the fault tolerance of the overall scheduling system, and directly outputs the position of the waiting point to ensure that the waiting process of the robot is stable. The path planning algorithms proposed in the embodiments of the present application are all search algorithms on the road network, and the advantage is that the optimal path can be calculated to improve the operating efficiency of the robot. And different search algorithms are realized through different multiple search strategies, among which an innovative relative order evaluation strategy is also proposed to ensure the safety between multi-machine path searches, and a smaller amount of calculation is also guaranteed by the comparison of relative order, and the performance requirements for the deployed machine are relatively low. The algorithm proposed in the embodiment of the present application is applicable to any wheeled robot, such as automatic guided vehicles (AGVs), food delivery robots, building delivery robots, etc. As long as it is a wheeled robot operating based on a road network, the equipment scheduling method of the embodiment of the present application can be used for multi-machine scheduling.

[0187] The following further describes an exemplary structure of the device scheduling device 555 provided in the embodiment of the present application implemented as a software module. In some embodiments, Figure 2 As shown, the software modules stored in the device scheduling apparatus 555 of the memory 550 include the following software modules: a scheduling path search module 5551 , a scheduling order determination module 5552 , and a device scheduling execution module 5553 .

[0188] The scheduling path search module 5551 is used to perform path search on the road network based on the task information of N devices, where N is a positive integer greater than 1.

[0189] The scheduling path search module 5551 is also used to determine the waiting point of the nth device when a conflict-free path for the nth device is not found, and determine the scheduling path of the nth device based on the waiting point, wherein the conflict-free path is a path that has no intersection with the scheduling paths of the first n-1 devices, the waiting point of the nth device has no overlap with the scheduling paths of the first n-1 devices, 1<n≤N, and n is a positive integer.

[0190] The scheduling order determination module 5552 is used to determine the task execution order of the N devices based on the N scheduling paths.

[0191] The device scheduling execution module 5553 is used to control the N devices to move according to the N scheduling paths based on the task execution order.

[0192] In some embodiments, the number of waiting points is M, where M is a positive integer greater than 0. The scheduling path search module 5551 is also used to determine M candidate scheduling paths for the nth device based on the M waiting points, wherein each candidate scheduling path includes one waiting point; perform path screening on the M candidate scheduling paths to obtain K safe scheduling paths for the nth device, wherein K is a positive integer less than or equal to M; and use the safe scheduling path with the shortest path length among the K safe scheduling paths as the scheduling path for the nth device.

[0193] In some embodiments, the task information of the nth device includes a task start point and a task end point, and the candidate scheduling paths include a path from the task start point to the waiting point and a path from the waiting point to the task end point. The scheduling path search module 5551 is further used to perform the following processing on any one of the candidate scheduling paths: when the path endpoint of the first scheduling path in the first n-1 devices overlaps with the path, and the second scheduling path in the first n-1 devices overlaps with the path endpoint of the path, based on the overlapping relationship between the path and the target scheduling path, determine a first relative order between the path and the target scheduling path, wherein the target scheduling path is the first scheduling path or the second scheduling path; based on the overlapping relationship between the path and another scheduling path, and the overlapping relationship between the first scheduling path and the second scheduling path, determine a second relative order between the path and the target scheduling path, wherein the other scheduling path is a scheduling path other than the target scheduling path in the first scheduling path and the second scheduling path; when the first relative order is different from the second relative order, filter out the candidate scheduling paths corresponding to the path.

[0194] In some embodiments, the scheduling path search module 5551 is also used to determine a third relative order between the path and another scheduling path based on the overlapping relationship between the path and the other scheduling path; determine a fourth relative order between the first scheduling path and the second scheduling path based on the overlapping relationship between the first scheduling path and the second scheduling path; and derive a second relative order between the path and the target scheduling path based on the third relative order and the fourth relative order.

[0195] In some embodiments, the task information of the nth device includes a task start point and a task end point, and the candidate scheduling paths include a path from the task start point to the waiting point and a path from the waiting point to the task end point. The scheduling path search module 5551 is also used to perform the following processing on any one of the candidate scheduling paths: when a scheduling path among the first n-1 devices overlaps with a path endpoint of the path, based on the overlapping relationship between the scheduling path and the path endpoint of the path, determine the fifth relative order between the path and the scheduling path; when a path endpoint of a scheduling path among the first n-1 devices overlaps with the path, based on the overlapping relationship between the path endpoint of the scheduling path and the path, determine the sixth relative order between the path and the scheduling path; when the fifth relative order is different from the sixth relative order, filter out the candidate scheduling path corresponding to the path.

[0196] In some embodiments, the path endpoint is a path starting point or a path end point, and the scheduling path search module 5551 is also used to determine the order of the path before the scheduling path as the fifth relative order when the overlapping relationship is that the scheduling path overlaps with the path starting point of the path; when the overlapping relationship is that the scheduling path overlaps with the path end point of the path, determine the order of the path after the scheduling path as the fifth relative order.

[0197] In some embodiments, the road network includes multiple vertices, and the scheduling path search module 5551 is also used to determine the first vertex on the scheduling path of the first n-1 devices, wherein the first vertex is the vertex located on the scheduling path of the first n-1 devices; based on the first vertex, the waiting point of the nth device is filtered out from the vertices included in the road network.

[0198] In some embodiments, the scheduling path search module 5551 is also used to determine the task starting point and the task end point included in the task information as the second vertex; filter out the first vertex and the second vertex from the multiple vertices included in the road network to obtain the waiting point of the nth device.

[0199] In some embodiments, the scheduling path search module 5551 is further used to determine a third vertex adjacent to the first vertex from a plurality of vertices included in the road network, and determine the third vertex as a waiting point for the nth device.

[0200] In some embodiments, the scheduling order determination module 5552 is also used to arrange and combine the N scheduling paths to obtain T candidate task execution orders, where L is a positive integer greater than 0; the T candidate task execution orders are sequentially processed as follows: based on the candidate task execution order, the N devices are simulated to move along the N scheduling paths; when it is simulated that no collision occurs between any two of the N devices, the candidate task execution order is determined as the task execution order of the N devices.

[0201] In some embodiments, the task information includes a task start point, a task end point and a task type. The scheduling path search module 5551 is also used to determine the task priority of the N devices based on the task start point, task end point and task type of the N devices; based on the order of the task priority of the N devices from high to low, search the scheduling paths of the N devices in sequence on the road network.

[0202] In some embodiments, the device scheduling execution module 5553 is further used to perform a shortest path search for a first device, where the first device is a device with the highest task priority; and perform a conflict-free path search for the nth device.

[0203] An embodiment of the present application provides a computer program product, which includes computer executable instructions. The computer executable instructions are stored in a computer-readable storage medium. A processor of an electronic device reads the computer executable instructions from the computer-readable storage medium, and the processor executes the computer executable instructions, so that the electronic device executes the device scheduling method described above in the embodiment of the present application.

[0204] The embodiment of the present application provides a computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions or computer programs are stored. When the computer-executable instructions or computer programs are executed by a processor, the processor will be caused to execute the device scheduling method provided by the embodiment of the present application, for example, FIG. 3A to FIG. 3F The device scheduling method is shown.

[0205] 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 may be various devices including one or any combination of the above memories.

[0206] In some embodiments, computer executable instructions may be in the form of a program, software, software module, script 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 a stand-alone program or as a module, component, subroutine or other unit suitable for use in a computing environment.

[0207] As an example, computer-executable instructions may, but need not, correspond to a file in a file system, may be stored as part of a file that stores other programs or data, such as in one or more scripts in a HyperText Markup Language (HTML) document, in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files storing one or more modules, subroutines, or code portions).

[0208] As an example, computer executable instructions may be deployed to be executed on one electronic device, or on multiple electronic devices located at one site, or on multiple electronic devices distributed at multiple sites and interconnected by a communication network.

[0209] The above is only an embodiment of the present application and is not intended to limit the protection scope of the present application. Any modifications, equivalent substitutions and improvements made within the spirit and scope of the present application are included in the protection scope of the present application.

Claims

1. A device scheduling method, characterized in that: The method comprises: Based on the task information of N devices, a path search is performed on the road network, where N is a positive integer greater than 1; When a non-conflicting path for the nth device is not found, a waiting point for the nth device is determined, and a scheduling path for the nth device is determined based on the waiting point, wherein the non-conflicting path is a path that does not intersect with the scheduling paths of the first n-1 devices, the waiting point of the nth device does not overlap with the scheduling paths of the first n-1 devices, 1<n≤N, and n is a positive integer; Determine the task execution order of the N devices based on the N scheduling paths; Based on the task execution order, the N devices are controlled to move according to the N scheduling paths.

2. The method according to claim 1, characterized in that The number of the waiting points is M, where M is a positive integer greater than 0; The determining the scheduling path of the nth device based on the waiting point includes: Based on the M waiting points, determine M candidate scheduling paths for the nth device, wherein each of the candidate scheduling paths includes one of the waiting points; Performing path screening processing on the M candidate scheduling paths to obtain K safe scheduling paths for the n-th device, where K is a positive integer less than or equal to M; The safe scheduling path with the shortest path length among the K safe scheduling paths is used as the scheduling path of the nth device.

3. The method according to claim 2, characterized in that The task information of the nth device includes a task start point and a task end point, and the candidate scheduling path includes a path from the task start point to the waiting point and a path from the waiting point to the task end point; The performing path screening processing on the M candidate scheduling paths includes: The following processing is performed on any one of the candidate scheduling paths: When a path endpoint of a first scheduling path in the first n-1 devices overlaps with the path, and a second scheduling path in the first n-1 devices overlaps with the path endpoint of the path, determining a first relative order between the path and the target scheduling path based on an overlapping relationship between the path and the target scheduling path, wherein the target scheduling path is the first scheduling path or the second scheduling path; Determining a second relative order between the path and the target scheduling path based on an overlapping relationship between the path and another scheduling path, and an overlapping relationship between the first scheduling path and the second scheduling path, wherein the another scheduling path is a scheduling path other than the target scheduling path among the first scheduling path and the second scheduling path; When the first relative order is different from the second relative order, the candidate scheduling paths corresponding to the paths are screened out.

4. The method according to claim 3, characterized in that The determining, based on an overlapping relationship between the path and another scheduling path, and an overlapping relationship between the first scheduling path and the second scheduling path, a second relative order between the path and the target scheduling path comprises: Determining a third relative order between the path and another scheduled path based on an overlapping relationship between the path and the another scheduled path; determining a fourth relative order between the first scheduling path and the second scheduling path based on an overlapping relationship between the first scheduling path and the second scheduling path; Based on the third relative order and the fourth relative order, a second relative order between the path and the target scheduling path is derived.

5. The method according to claim 2, characterized in that: The task information of the nth device includes a task start point and a task end point, and the candidate scheduling path includes a path from the task start point to the waiting point and a path from the waiting point to the task end point; The performing path screening processing on the M candidate scheduling paths includes: The following processing is performed on any one of the candidate scheduling paths: When a scheduling path of the first n-1 devices overlaps with a path endpoint of the path, determining a fifth relative order between the path and the scheduling path based on an overlapping relationship between the scheduling path and the path endpoint of the path; When a path endpoint of a scheduling path among the first n-1 devices overlaps with the path, determining a sixth relative order between the path and the scheduling path based on an overlapping relationship between the path endpoint of the scheduling path and the path; When the fifth relative order is different from the sixth relative order, the candidate scheduling path corresponding to the path is screened out.

6. The method according to claim 5, characterized in that The path endpoint is the path starting point or the path end point; The determining, based on the overlapping relationship between the one scheduling path and the path endpoint of the path, a fifth relative order between the path and the one scheduling path comprises: When the overlapping relationship is that the one scheduled path overlaps with the path starting point of the path, the order of the path before the one scheduled path is determined as the fifth relative order; When the overlapping relationship is that the one scheduled path overlaps with the path end point of the path, the order of the path after the one scheduled path is determined as the fifth relative order.

7. The method according to any one of claims 1 to 6, characterized in that: The road network includes a plurality of vertices; The determining the waiting point of the nth device includes: Determine a first vertex on the scheduling path of the first n-1 devices, wherein the first vertex is the vertex located on the scheduling path of the first n-1 devices; Based on the first vertex, the waiting point of the nth device is screened out from the vertices included in the road network.

8. The method according to claim 7, characterized in that The step of selecting the waiting point of the nth device from the vertices included in the road network based on the first vertex includes: Determine the task starting point and the task end point included in the task information as the second vertex; The first vertex and the second vertex are screened out from a plurality of vertices included in the road network to obtain a waiting point for the nth device.

9. The method according to claim 7, characterized in that: The step of selecting the waiting point of the nth device from the vertices included in the road network based on the first vertex includes: A third vertex adjacent to the first vertex is determined from a plurality of vertices included in the road network, and the third vertex is determined as a waiting point for the nth device.

10. The method according to any one of claims 1 to 6, characterized in that: The determining the task execution order of the N devices based on the N scheduling paths includes: Arrange and combine the N scheduling paths to obtain T candidate task execution orders, where L is a positive integer greater than 0; The following processing is performed on the T candidate tasks in order: Based on the candidate task execution order, simulating the N devices to move according to the N scheduling paths; When it is simulated that no collision occurs between any two devices among the N devices, the candidate task execution order is determined as the task execution order of the N devices.

11. The method according to any one of claims 1 to 6, characterized in that: The task information includes the task starting point, task end point and task type; The path search on the road network based on the task information of N devices includes: Determine the task priorities of the N devices based on the task start points, task end points, and task types of the N devices; Based on the order of the task priorities of the N devices from high to low, the scheduling paths of the N devices are searched in sequence on the road network.

12. The method according to claim 11, characterized in that The step of sequentially searching for scheduling paths for the N devices on the road network based on the order of the task priorities of the N devices from high to low includes: Performing a shortest path search for a first device, wherein the first device is a device with the highest task priority; A conflict-free path search is performed on the nth device.

13. A device scheduling device, characterized in that: The device comprises: A scheduling path search module, used to perform path search on the road network based on task information of N devices, where N is a positive integer greater than 1; The scheduling path search module is further used to determine a waiting point of the nth device when a non-conflicting path for the nth device is not found, and determine a scheduling path for the nth device based on the waiting point, wherein the non-conflicting path is a path that does not intersect with the scheduling paths of the first n-1 devices, the waiting point of the nth device does not overlap with the scheduling paths of the first n-1 devices, 1<n≤N, and n is a positive integer; A scheduling order determination module, used to determine the task execution order of the N devices based on the N scheduling paths; The device scheduling execution module is used to control the N devices to move according to the N scheduling paths based on the task execution order.

14. An electronic device, characterized in that: The electronic device comprises: A memory for storing computer executable instructions; The processor is used to implement the device scheduling method described in any one of claims 1 to 12 when executing the computer executable instructions or computer programs stored in the memory.

15. A computer-readable storage medium storing computer-executable instructions or a computer program, characterized in that: When the computer executable instructions or computer program are executed by a processor, the device scheduling method according to any one of claims 1 to 12 is implemented.

16. A computer program product comprising computer executable instructions or a computer program, characterized in that When the computer executable instructions or computer program are executed by a processor, the device scheduling method according to any one of claims 1 to 12 is implemented.

Citation Information

Cited By

  • High-throughput-oriented periodic scheduling method

    CN120996440A