WO2024103974A1 - 路径规划方法及系统、装置、电子设备和存储介质 - Google Patents

路径规划方法及系统、装置、电子设备和存储介质 Download PDF

Info

Publication number
WO2024103974A1
WO2024103974A1 PCT/CN2023/121761 CN2023121761W WO2024103974A1 WO 2024103974 A1 WO2024103974 A1 WO 2024103974A1 CN 2023121761 W CN2023121761 W CN 2023121761W WO 2024103974 A1 WO2024103974 A1 WO 2024103974A1
Authority
WO
WIPO (PCT)
Prior art keywords
task
path
point
task execution
execution path
Prior art date
Application number
PCT/CN2023/121761
Other languages
English (en)
French (fr)
Other versions
WO2024103974A9 (zh
Inventor
岳兴忠
Original Assignee
北京京东振世信息技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 北京京东振世信息技术有限公司 filed Critical 北京京东振世信息技术有限公司
Publication of WO2024103974A1 publication Critical patent/WO2024103974A1/zh
Publication of WO2024103974A9 publication Critical patent/WO2024103974A9/zh

Links

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3407—Route searching; Route guidance specially adapted for specific applications
    • G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/20—Instruments for performing navigational calculations

Definitions

  • the present disclosure relates to the field of computer technology, and in particular to a path planning method, a path planning system, a path planning device, an electronic device, and a computer-readable storage medium.
  • AGVs automated guided vehicles
  • multiple AGVs may have similar task points in the same aisle at the same time and need to pick up and place goods.
  • the picking and placing time is relatively long, which will lead to long waiting time and congestion during the picking and placing process, affecting the efficiency of picking and placing goods.
  • a path planning method which is applied to a device side, and includes: determining a first task point, obtaining a first task execution path corresponding to the first task point, and traveling to the first task point via the first task execution path; in response to detecting a path congestion event on the first task execution path, obtaining an updated task execution path corresponding to the first task point, wherein the updated task execution path is obtained by updating a current connection path between a real-time location point of the device side and the first task point; if a second task point exists in the updated task execution path, obtaining a second task execution path corresponding to the second task point; and traveling to the second task point via the second task execution path to trigger a task execution operation of the second task point.
  • a path planning method which is applied to a path planning end, and includes: acquiring a first task point, determining and sending a first task execution path corresponding to the first task point; in response to a received path update instruction, performing a path update operation to obtain an updated task execution path corresponding to the first task point; the path update instruction is generated based on a path congestion event of the first task execution path; and sending the updated task execution path.
  • a path planning system comprising: a task scheduling end, for generating and sending a set of tasks to be executed to a device end; the set of tasks to be executed includes a plurality of task points to be executed; the device end is used to determine a first task point from the plurality of task points to be executed, obtain a first task execution path corresponding to the first task point, and go to the first task point via the first task execution path; in response to detecting a path congestion event on the first task execution path, obtain an updated task execution path corresponding to the first task point; if the updated task execution path If there is a second task point in the task execution path, the second task execution path corresponding to the second task point is obtained, and the second task point is traveled to through the second task execution path to trigger the task execution operation of the second task point; the path planning end is used to generate the first task execution path, the second task execution path and the updated task execution path.
  • a path planning device which is applied to a device end, and includes: a first path acquisition module, which is used to determine a first task point, obtain a first task execution path corresponding to the first task point, and go to the first task point through the first task execution path; an update path acquisition module, which is used to obtain an updated task execution path corresponding to the first task point in response to detecting a path congestion event of the first task execution path, wherein the updated task execution path is obtained by updating the current connection path between the real-time location point of the device end and the first task point; a second path acquisition module, which is used to obtain a second task execution path corresponding to the second task point if there is a second task point in the updated task execution path; and a task execution module, which is used to go to the second task point through the second task execution path and trigger the task execution operation of the second task point.
  • a path planning device which is applied to a path planning end, and includes: a first path determination module, which is used to obtain a first task point, determine and send a first task execution path corresponding to the first task point; a path update module, which is used to respond to a received path update instruction, perform a path update operation, and obtain an updated task execution path corresponding to the first task point; the path update instruction is generated based on a path congestion event of the first task execution path; and a path sending module is used to send the updated task execution path.
  • an electronic device comprising: a processor; and a memory, wherein the memory stores computer-readable instructions, and when the computer-readable instructions are executed by the processor, the path planning method according to any one of the above items is implemented.
  • a computer-readable storage medium on which a computer program is stored.
  • the path planning method according to any one of the above items is implemented.
  • FIG1 schematically shows a schematic diagram of a multi-layered container robot in a logistics warehouse taking goods from a shelf through a warehouse passage;
  • FIG2 schematically shows a flow chart of a path planning method according to an exemplary embodiment of the present disclosure
  • FIG3 schematically shows an example diagram of a task scheduling end sending a task to be executed to a task execution device according to an exemplary embodiment of the present disclosure
  • FIG4 schematically shows an example diagram of a device terminal performing a transportation task in a warehouse according to an exemplary embodiment of the present disclosure
  • FIG5 schematically shows a flow chart of a path planning method according to another exemplary embodiment of the present disclosure
  • FIG6 schematically shows an example diagram of updating a task point according to a distance between a current position point and a task point according to an exemplary embodiment of the present disclosure
  • FIG7 schematically shows a data flow diagram of a path planning system according to an exemplary embodiment of the present disclosure
  • FIG8 schematically shows a block diagram of a path planning device according to an exemplary embodiment of the present disclosure
  • FIG9 schematically shows a block diagram of a path planning device according to another exemplary embodiment of the present disclosure.
  • FIG10 schematically shows a block diagram of an electronic device according to an exemplary embodiment of the present disclosure
  • FIG. 11 schematically shows a schematic diagram of a computer-readable storage medium according to an exemplary embodiment of the present disclosure.
  • Figure 1 schematically shows a schematic diagram of a multi-layer material box robot in a logistics warehouse picking up goods from the shelf through a warehouse aisle.
  • mobile devices 101-105 can all be task execution devices that perform transportation tasks, such as a multi-layer material box robot, and the multi-layer material grid 110 in Figure 1 can be a task point where goods need to be stored and retrieved.
  • the locations of the task points to be executed in Figure 1 are relatively scattered in the warehouse, and the multi-layer material box robot needs to go to many task points to pick up goods.
  • the multi-layer material box robot may have similar task points in the same aisle where it needs to pick up and place goods.
  • the picking and placing time of the multi-layer material box robot is relatively long, which may lead to long waiting time and congestion, affecting the efficiency of picking up goods.
  • a path planning method is first provided, and a mobile device implements the method described in the present disclosure, wherein the terminal described in the present disclosure may include a mobile terminal such as a mobile phone, a tablet computer, a laptop computer, a personal digital assistant (PDA), etc.
  • the terminal described in the present disclosure may include a mobile terminal such as a mobile phone, a tablet computer, a laptop computer, a personal digital assistant (PDA), etc.
  • FIG2 schematically shows a schematic diagram of the path planning method process according to some embodiments of the present disclosure. Referring to FIG2, the path planning method may include the following steps:
  • Step S210 determining a first task point, obtaining a first task execution path corresponding to the first task point, and going to the first task point through the first task execution path.
  • the first task point may be the item location point corresponding to the current task execution operation performed by the device end.
  • the device end may be a device for performing the task operation.
  • the device end may be a cargo transportation device, and the number of device ends may be multiple.
  • the first task execution path may be the current location.
  • the real-time location point of the device end can be the real-time location coordinates of the device end.
  • the device Before executing a task, the device can select a task point from multiple task points to be executed as the first task point. For example, the first task point can be determined based on the initial task execution order corresponding to the multiple task points to be executed, or the first task point can be a task point randomly determined from the multiple task points to be executed.
  • the current position coordinates of the device can be located as the real-time position point of the device.
  • the first task execution path can be obtained by the path planning end based on the path map corresponding to the item warehouse, and the path planning end can send the first task execution path to the device end, so that the device end goes to the first task point based on the first task execution path to perform related task operations.
  • the device side when it performs a picking task at a task point in a cargo warehouse, it can first locate the current position of the device side in real time as the real-time position point, and send the first task point to the path planning side.
  • the path planning side returns the first task execution path corresponding to the first task point, and then the device side can go from the current position point to the first task point based on the first task execution path to perform the cargo picking operation.
  • Step S220 in response to detecting a path congestion event of the first task execution path, obtaining an updated task execution path corresponding to the first task point, the updated task execution path being obtained by updating a current connection path between the real-time location point of the device end and the first task point.
  • the path congestion event may be an event that the task execution path currently being traveled by the device is congested.
  • the updated task execution path may be a connection path between the current position point and the first task point determined after the path update operation.
  • a path congestion event is generated.
  • there are other task execution devices in the first task execution path to perform tasks for example, the shelf storing goods collapses, causing congestion on the first task execution path, etc. If a path congestion event of the first task execution path is detected, the path congestion event is responded to, and an updated task execution path corresponding to the first task point is obtained.
  • the updated task execution path can be obtained by performing a path update operation on the path planning end.
  • the path planning end can perform a path update operation based on the real-time position point of the device end and the first task point.
  • a storage warehouse may include multiple lanes, and the device end can reach the first task point through different lanes of the warehouse. Therefore, there may be multiple connected paths between the current position point and the first task point. At this time, a connected path can be selected from the multiple connected paths obtained as the updated task execution path between the real-time position point of the device end and the first task point.
  • Step S230 If there is a second task point in the update task execution path, obtain a second task execution path corresponding to the second task point.
  • the second task point may be a task point associated with the device end in the update task execution path, that is, a task point that the device end needs to trigger execution.
  • the second task execution path may be a connection path between the real-time location point of the device end and the second task point.
  • the device end After determining the update task execution path, the device end can go to the first task point through the update task execution path. During the operation of the device end, it can be detected whether there is a second task point in the update task execution path.
  • the second task point can be a task point that is in the update task execution path and has not been executed by this device end. The distance between the second task point and the current position point of the device end is less than the distance between the first task point and the current position point. If the second task point exists in the update task execution path, the task point that the device end currently needs to execute is changed from the first task point to the second task point.
  • Step S240 Go to the second task point through the second task execution path to trigger the task execution operation of the second task point.
  • the task execution operation may be a related operation performed by the device based on the task point to be executed.
  • the second task point can be sent to the path planning end, and the path planning end determines the second task execution path between the second task point and the real-time location point of the device. Then, the device goes to the second task point through the second task execution path and triggers the task execution operation of the second task point.
  • the trigger device side takes the cargo from the second task point.
  • the trigger device side places the cargo to be stored in the shelf corresponding to the second task point to complete the cargo placement operation.
  • the path planning method in this example embodiment on the one hand, if there is congestion in the first task execution path, the first task execution path is changed to an updated task execution path, which can solve the problem of low task execution efficiency caused by the inability of the device end to pass due to congestion or other factors.
  • the task execution operation of the second task point can be triggered first. Since the distance between the second task point and the current position point is closer than the first task point, the operating cost of the device end can be effectively saved.
  • a set of tasks to be executed is obtained; the set of tasks to be executed includes multiple task points to be executed; an initial execution order corresponding to the multiple task points to be executed is determined; and based on the initial execution order, a first task point is determined from the multiple task points to be executed.
  • the set of tasks to be executed can be a data set consisting of multiple task points to be executed and their related information.
  • the task point to be executed can be a location point waiting for a task execution operation.
  • the task execution path can be the shortest connected path between the current location point of the device end and multiple different task points to be executed.
  • the initial execution order can be the execution order corresponding to multiple tasks to be executed when the device end receives the set of tasks to be executed.
  • the initial execution order can be determined according to factors such as the task point location corresponding to the task point, the task level, and the path cost.
  • a set of tasks to be executed Before executing the transportation task on the device side, you can first obtain a set of tasks to be executed. For example, in a warehouse pickup scenario, when the buyer submits an item purchase order through the shopping platform, the purchase order will be sent to the task scheduling end of the warehouse logistics.
  • the task scheduling end determines the location information of each item in the warehouse based on the received purchase order, generates a set of tasks to be executed based on the location information of the above items, and sends the generated set of tasks to be executed to the device side. Since the items in the purchase order may be scattered in different locations in the warehouse, based on the location information of each item in the purchase order, Each piece of information can generate a corresponding task point to be executed.
  • FIG3 schematically shows an example diagram of a task scheduling end sending tasks to be executed to a device end according to an exemplary embodiment of the present disclosure.
  • the task scheduling end can send the set of tasks to be executed to the device end.
  • the set of tasks to be executed generated this time includes 6 task points to be executed, namely, task point 1 to task point 6.
  • the device end (such as a multi-layer material box robot) will reach the above-mentioned task points one by one and trigger the task execution operation of each task point.
  • the device side can first determine a first task point before executing the task.
  • the first task point can be determined by the following steps: the path planning side can perform path planning based on the warehouse map to obtain the connection path between the current location point of the device side and each task point to be executed, that is, to determine multiple task execution paths. After determining multiple task execution paths, the path cost corresponding to each task execution path can be determined, and then a first task point can be selected from multiple task points to be executed based on the multiple path costs obtained. For example, after obtaining multiple path costs, the multiple path costs obtained can be sorted, and a task point to be executed with the smallest path cost can be selected as the first task point.
  • the task priorities corresponding to multiple task points to be executed can also be determined.
  • the task priority of each task point to be executed can be determined based on the volume and weight of the cargo, and the initial task execution order corresponding to the multiple task points to be executed can be generated based on the task priority. For example, if the acquisition priority of item 1 is higher than the acquisition priority of item 2, then in the initial task execution order, the task execution order of item 1 is arranged before item 2.
  • the device end can determine the first task point from multiple task points to be executed based on the task priority.
  • a task point can be randomly selected from multiple task points to be executed as the first task point.
  • the path planning method in the present disclosure is not only applicable to the scenario of packing goods, but also to the scenario of placing goods in boxes.
  • the present disclosure does not impose any limitation on the specific scenarios of the path planning method.
  • the updated task execution path is obtained based on multiple candidate task execution paths determined by the path planning end; the updated task execution path is the candidate task execution path with the smallest path cost or the smallest task point distance.
  • the candidate task execution path may be all connected paths between the first task point and the real-time location point of the device.
  • the path cost may be the path cost corresponding to each candidate task execution path.
  • the task point distance may be the distance between the current location point of the device and the task point to be executed.
  • the route planning end determines all the connected paths between the real-time location point of the device end and the first task point, the determined connected paths can be used as candidate task execution paths. Further, an updated task execution path is determined from multiple candidate task paths according to the path cost or the task point distance.
  • the device can go to the first task point based on the first task execution path, and then perform the task execution operation.
  • the first task execution path may be congested.
  • other task execution devices may also go to the corresponding task point through the first task execution path, which may cause congestion in the first task execution path.
  • FIG. 4 schematically shows a device terminal performing operation in a warehouse according to an exemplary embodiment of the present disclosure.
  • Example diagram of a task In the same material warehouse, there may be multiple task execution devices. In this embodiment, one of the task execution devices (i.e., the device end) is taken as an example for explanation.
  • Car No. 1 in Figure 4 may be the device end in the present disclosure.
  • the first task point When Car No. 1 is performing a task operation, the first task point may be Task Point 1.
  • the current position of Car No. 1 in Figure 4 is in the lane to the right of Task Point 1.
  • Car No. 1 can reach Task Point 1 by moving forward.
  • Car No. 2 is in front of Car No. 1, blocking the driving path of Car No. 1 and causing congestion.
  • vehicle 1 can obtain other connected paths between the task point 1, that is, all candidate task execution paths. After obtaining the candidate task execution paths, the path cost corresponding to each candidate task execution path can be determined, and a candidate task execution path with the smallest path cost can be selected as the updated task execution path, so that the device can go to the first task point through the updated task execution path.
  • the distance between the task point to be executed and the device location point in each candidate task execution path can be determined, and a candidate task execution path with the minimum task point distance can be selected as the updated task execution path.
  • the current task point can be re-determined as the first task point, and the path planning end can re-determine the connection path between the real-time location point of the device end and the first task point.
  • the current task point can be updated to other task points that are closer to the task point, so as to request the path planning end to return the task execution path corresponding to the other task points to trigger the corresponding task execution operation.
  • a path planning method is also provided, which is applied to the path planning end.
  • the path planning method of the present disclosure can be implemented by using a server, or by using a terminal device, wherein the terminal described in the present disclosure may include mobile terminals such as mobile phones, tablet computers, laptops, PDAs, and personal digital assistants (PDAs), as well as fixed terminals such as desktop computers.
  • FIG5 schematically shows a schematic diagram of the path planning method flow according to some embodiments of the present disclosure. Referring to FIG5, the path planning method may include the following steps:
  • Step S510 acquiring a first task point, determining and sending a first task execution path corresponding to the first task point.
  • the device end can simultaneously send the position point located in real time by the device end to the path planning end.
  • the path planning end can determine all the connected paths between the real-time position point and the first task point based on the warehouse path map of the storage warehouse, and determine a connected path as the first task execution path corresponding to the first task point.
  • Step S520 in response to the received path update instruction, executing a path update operation to obtain an updated task execution path corresponding to the first task point; the path update instruction is generated based on a path congestion event of the first task execution path.
  • the path update instruction may be an instruction generated based on a path congestion event trigger.
  • the path planning end may trigger a corresponding path update operation.
  • the path update operation may be a process of replanning a connection path between the current location point and the task point to be executed.
  • the path planning end When receiving the path update instruction, the path planning end responds to the path update instruction and performs a path update operation based on the first task point and the real-time position point to obtain an updated task execution path corresponding to the first task point.
  • Step S530 sending the update task execution path.
  • the path planning end may send the determined update task execution path to the device end, so that the device end goes to the first task point through the update task execution path.
  • the path planning method in the exemplary embodiment of the present disclosure changes the first task execution path to an updated task execution path if congestion is detected on the first task execution path, thereby solving the problem of low task execution efficiency caused by the inability of the device side to pass due to congestion or other factors.
  • determining and sending a first task execution path corresponding to a first task point includes: obtaining a device location point corresponding to a device end; determining a plurality of candidate task execution paths corresponding to the first task point based on the device location point; respectively determining a path cost corresponding to each of the plurality of candidate task execution paths; determining a first task execution path from the plurality of candidate task execution paths based on each path cost, and sending the first task execution path.
  • the device location point may be the location coordinates of the device terminal located in real time.
  • the path planning operation can be performed based on the first task point, and all connected paths between the equipment location point and the first task point can be determined from the warehouse path map as multiple candidate task execution paths corresponding to the first task point.
  • the path costs corresponding to each of the multiple candidate task execution paths can be determined respectively. For example, the path distance of the candidate task execution path can be used as the path cost. Then, based on the multiple determined path costs, one of the multiple candidate task execution paths is selected as the first task execution path.
  • the path costs corresponding to each of a plurality of candidate task execution paths are determined respectively, including: determining at least one segmented path included in the candidate task execution path; determining the path cost weight corresponding to each segmented path; and determining the path cost based on at least one segmented path and the corresponding path cost weight.
  • the segmented path may be a plurality of different segmented paths on the connected path, and the path cost weight may be the calculation weight corresponding to different segmented paths when calculating the connected cost.
  • the path cost corresponding to each candidate task execution path can be determined.
  • all segmented paths included in each candidate task execution path can be determined, and the path cost weight corresponding to each segmented path can be determined, and then the multiple segmented paths can be summed according to the path cost weight to obtain the path cost of the candidate task execution path.
  • the candidate task execution path 420 in Figure 4 includes 5 segmented paths, namely segmented path 421, segmented path 422, segmented path 423, segmented path 424 and segmented path 425.
  • Different segmented paths can represent different types of road types.
  • the path cost weights of segmented paths 421 to segmented path 425 are k1, k2, ..., k5 respectively.
  • the path cost corresponding to the candidate task execution path can be obtained, so that the update task execution path can be selected from multiple candidate task execution paths according to the path cost.
  • the candidate task execution path with the smallest path cost can be selected as the update task execution path so that the device The terminal goes to the first task point to perform the task based on the updated task execution path.
  • a path update operation in response to a received path update instruction, is performed to obtain an updated task execution path corresponding to a first task point, including: in response to the received path update instruction, obtaining an updated device location point; determining at least one updated candidate task path between the updated device location point and the first task point; obtaining an updated path cost for each updated candidate task path; and determining an updated task execution path from a plurality of updated candidate task paths based on the obtained update path cost.
  • the updated path cost may be a path cost corresponding to the updated task execution path.
  • the device side can generate a corresponding path update instruction and send the path update instruction to the path planning side. Since the position of the device side in the storage warehouse may change in real time, after receiving the path update instruction, the path planning side can obtain the updated device position point of the device side, and then perform a path update operation based on the updated device position point and the first task point to determine the updated candidate task path.
  • the update path cost corresponding to each update candidate task path can be determined.
  • the update task execution path can be determined from multiple update candidate task paths based on the update path cost. For example, the update candidate task path with the smallest update path cost can be selected as the update task execution path. Accordingly, the update path cost is determined in the same way as the path cost corresponding to the candidate task execution path, and this disclosure will not elaborate on this.
  • a task point switching operation can be performed to switch the current task point of the device from the first task point to the second task point, and trigger the task execution operation of the second task point.
  • Figure 6 schematically shows an example diagram of updating the task point according to the distance between the current position point and the task point according to an exemplary embodiment of the present disclosure.
  • the distance between the current position point and task point 402 is 21.58
  • the distance between the current position point and task point 1 is 196.58. Since the distance between the current position point and task point 2 is less than the distance between the current position point and task point 1, the connectivity cost between the current position point and task point 2 is less than the connectivity cost of the first task execution path, and task point 2 can be used as the target task point.
  • the device continues to move to task point 1 by updating task execution path 420. At this time, it is detected that the distance between task point 3 and the device is closer than task point 1. At this time, the device will first move to task point 3 to trigger the task execution operation.
  • a second task point is received; and a second task execution path corresponding to the second task point is determined and sent.
  • the second task point may be a task point obtained by performing a task point update operation on the first task point.
  • the second task execution path may be an execution path between the second task point and the device location point.
  • the path planning end can determine the connection path between the device location point based on the path planning map of the storage warehouse as the second task execution path.
  • the method for determining the second task execution path is the same as the method for determining the first task execution path, and the comparison in this disclosure will not be repeated.
  • the path planning method disclosed in the present invention determines the first task point, obtains the first task execution path corresponding to the first task point, and goes to the first task point through the first task execution path; in response to detecting a path congestion event of the first task execution path, obtains the updated task execution path corresponding to the first task point, and the updated task execution path is obtained by updating the current connection path between the real-time position point of the device end and the first task point; if there is a second task point in the updated task execution path, obtain the second task execution path corresponding to the second task point; go to the second task point through the second task execution path, and trigger the task execution operation of the second task point.
  • the first task execution path is changed to the updated task execution path, which can solve the problem of low task execution efficiency caused by the inability of the device end to pass due to congestion or other factors.
  • the second task execution path is determined. Since the distance between the second task point and the current position point is closer than the first task point, the operating cost of the device end can be effectively saved.
  • the path planning system 700 may include: a task scheduling end 710 , a device end 720 , and a path planning end 730 .
  • the task scheduling end 710 is used to generate and send a set of tasks to be executed to the device end; the set of tasks to be executed includes multiple task points to be executed; the device end 720 is used to determine a first task point from multiple task points to be executed, obtain a first task execution path corresponding to the first task point, and go to the first task point through the first task execution path; in response to detecting a path congestion event on the first task execution path, obtain an updated task execution path corresponding to the first task point; if there is a second task point in the updated task execution path, obtain a second task execution path corresponding to the second task point, go to the second task point through the second task execution path, and trigger the task execution operation of the second task point; the path planning end 730 is used to generate a first task execution path, a second task execution path and an updated task execution path.
  • the task scheduling terminal 710 can obtain multiple items in the purchase list of items as items to be transported, and generate a collection of items to be transported based on the multiple items to be transported.
  • the transportation information corresponding to each item to be transported in the collection of items to be transported can be determined, for example, the transportation information can include the location of the item to be transported in the material warehouse, that is, the item location; and the transportation priority of each item to be transported.
  • the transportation order of these items to be transported can be determined according to their corresponding item locations and transportation priorities.
  • the transportation order can be determined as ⁇ item 1, item 2, item 6, item 3, item 5, item 4 ⁇ .
  • multiple task points to be executed can be generated based on the multiple item locations.
  • the transportation order of the multiple items to be transported is used as the initial task execution order corresponding to the multiple items to be transported.
  • a set of tasks to be executed is issued.
  • the task scheduling end 710 generates a set of tasks to be executed according to the points of the tasks to be executed and the initial task execution order, and sends the set to the device end 720 .
  • the device end 720 can select the first task point (such as task point 1) to perform the task; and in step S703, the first task point is asynchronously notified to the path planning end 730 to request path planning.
  • the path planning end 730 can generate a first task execution path corresponding to the first task point.
  • the first task execution path can be obtained based on the warehouse path map, and the first task execution path can be the connection path with the lowest connection cost between the current location point and the first task point.
  • the device end can go to the first task point based on the first task execution path to complete the task execution operation of the first task point.
  • step S704 the path planning end 730 can detect whether congestion or impassability occurs, and then re-plan the path to generate an updated task execution path corresponding to the first task point.
  • step S705 if the device end determines that there is a second task point, the task point is replaced and the updated second task point is sent to the path planning end.
  • step S706 the path planning end 730 is notified that the task point has been modified, and the task execution operation of the changed task point is triggered, and the path planning end 730 generates a second task execution path corresponding to the second task point.
  • a path planning device is also provided, which is applied to a device end.
  • the path planning device 800 may include: a first path acquisition module 810 , an update path acquisition module 820 , a second path acquisition module 830 and a task execution module 840 .
  • the first path acquisition module 810 is used to determine the first task point, obtain the first task execution path corresponding to the first task point, and go to the first task point through the first task execution path;
  • the update path acquisition module 820 is used to obtain the updated task execution path corresponding to the first task point in response to detecting a path congestion event of the first task execution path, and the updated task execution path is obtained by updating the current connection path between the real-time location point of the device end and the first task point;
  • the second path acquisition module 830 is used to obtain the second task execution path corresponding to the second task point if there is a second task point in the updated task execution path;
  • the task execution module 840 is used to go to the second task point through the second task execution path to trigger the task execution operation of the second task point.
  • the first path acquisition module includes a task point determination module, which is used to obtain a set of tasks to be executed; the set of tasks to be executed includes multiple task points to be executed; determine the initial execution order corresponding to the multiple task points to be executed; and determine the first task point from the multiple task points to be executed based on the initial execution order.
  • a task point determination module which is used to obtain a set of tasks to be executed; the set of tasks to be executed includes multiple task points to be executed; determine the initial execution order corresponding to the multiple task points to be executed; and determine the first task point from the multiple task points to be executed based on the initial execution order.
  • a path planning device is also provided, which is applied to a path planning terminal.
  • the path planning device 900 may include: a first path determining module 910 , a path updating module 920 , and a path sending module 930 .
  • the first path determination module 910 is used to obtain the first task point, determine and send the first task execution path corresponding to the first task point; the path update module 920 is used to respond to the received path update instruction, perform the path update operation, and obtain the updated task execution path corresponding to the first task point; the path update instruction is generated based on the path congestion event of the first task execution path; the path sending module 930 is used to send the updated task execution path.
  • the first path determination module 910 includes a first path determination unit, which is used to obtain a device location point corresponding to the device end; determine a plurality of candidate paths corresponding to the first task point according to the device location point; task execution path; respectively determine the path costs corresponding to the plurality of candidate task execution paths; determine the first task execution path from the plurality of candidate task execution paths according to the path costs, and send the first task execution path.
  • a first path determination unit which is used to obtain a device location point corresponding to the device end; determine a plurality of candidate paths corresponding to the first task point according to the device location point; task execution path; respectively determine the path costs corresponding to the plurality of candidate task execution paths; determine the first task execution path from the plurality of candidate task execution paths according to the path costs, and send the first task execution path.
  • the first path determination unit includes a path cost determination subunit, which is used to determine at least one segmented path included in the candidate task execution path; determine the path cost weight corresponding to each segmented path; and determine the path cost based on at least one segmented path and the corresponding path cost weight.
  • the path update module 930 includes a path update unit for obtaining an updated device location point in response to a received path update instruction; determining at least one updated candidate task path between the updated device location point and the first task point; obtaining an updated path cost for each updated candidate task path; and determining an updated task execution path from multiple updated candidate task paths based on the obtained update path cost.
  • the path planning device includes a second path determination module, which is used to receive a second task point; determine and send a second task execution path corresponding to the second task point.
  • an electronic device capable of implementing the above method is also provided.
  • the electronic device 1000 according to this embodiment of the present disclosure is described below with reference to Fig. 10.
  • the electronic device 1000 shown in Fig. 10 is only an example and should not bring any limitation to the functions and scope of use of the embodiment of the present disclosure.
  • the electronic device 1000 is presented in the form of a general-purpose computing device.
  • the components of the electronic device 1000 may include, but are not limited to: the at least one processing unit 1010, the at least one storage unit 1020, a bus 1030 connecting different system components (including the storage unit 1020 and the processing unit 1010), and a display unit 1040.
  • the storage unit stores program codes, which can be executed by the processing unit 1010, so that the processing unit 1010 executes the steps described in the above “exemplary method” section of this specification according to various exemplary embodiments of the present disclosure.
  • the storage unit 1020 may include a readable medium in the form of a volatile storage unit, such as a random access memory unit (RAM) 1021 and/or a cache memory unit 1022 , and may further include a read-only memory unit (ROM) 1023 .
  • RAM random access memory
  • ROM read-only memory
  • the storage unit 1020 may also include a program/utility 1024 having a set (at least one) of program modules 1025, such program modules 1025 including but not limited to: an operating system, one or more application programs, other program modules and program data, each or some combination of these examples may include an implementation of a network environment.
  • program modules 1025 including but not limited to: an operating system, one or more application programs, other program modules and program data, each or some combination of these examples may include an implementation of a network environment.
  • Bus 1030 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
  • the electronic device 1000 may also communicate with one or more external devices 1070 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 1000, and/or communicate with any device that enables the electronic device 1000 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input/output (I/O) interface 1050.
  • the electronic device 1000 may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and/or public networks, such as the Internet) via a network adapter 1060.
  • LANs local area networks
  • WANs wide area networks
  • public networks such as the Internet
  • the network adapter 1060 communicates with other modules of the electronic device 1000 via a bus 1030.
  • other hardware and/or software modules may be used in conjunction with the electronic device 1000, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.
  • the technical solution according to the embodiment of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiment of the present disclosure.
  • a non-volatile storage medium which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.
  • a computing device which can be a personal computer, a server, a terminal device, or a network device, etc.
  • a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of the present specification is stored.
  • various aspects of the present disclosure can also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to perform the steps according to various exemplary embodiments of the present disclosure described in the above "Exemplary Method" section of the present specification.
  • a program product 1100 for implementing the above method according to an embodiment of the present disclosure is described, which may adopt a portable compact disk read-only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer.
  • a readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, apparatus, or device.
  • the program product may use any combination of one or more readable media.
  • the readable medium may be a readable signal medium or a readable storage medium.
  • the readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.
  • Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.
  • the program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.
  • Program code for performing the operations of the present disclosure may be written in any combination of one or more programming languages, including object-oriented programming languages such as Java, C++, etc., and conventional procedural programming languages such as "C" or similar programming languages.
  • the program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server.
  • the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).
  • LAN local area network
  • WAN wide area network
  • Internet service provider e.g., AT&T, MCI, Sprint, EarthLink, etc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

一种路径规划方法及装置、系统、电子设备以及计算机可读存储介质，该方法包括：确定第一任务点，获取第一任务点对应的第一任务执行路径，通过第一任务执行路径前往第一任务点(S210)；响应于检测到第一任务执行路径的路径拥堵事件，获取与第一任务点对应的更新任务执行路径，更新任务执行路径通过更新设备端的实时位置点与第一任务点之间的当前连通路径得到(S220)；如果更新任务执行路径中存在第二任务点，则获取与第二任务点对应的第二任务执行路径(S230)；通过第二任务执行路径前往第二任务点，触发第二任务点的任务执行操作(S240)。

Description

路径规划方法及系统、装置、电子设备和存储介质
相关申请的交叉引用
本申请要求于2022年11月17日提交的申请号为202211441200.1、名称为“路径规划方法及系统、装置、电子设备和存储介质”的中国专利申请的优先权，该中国专利申请的全部内容通过引用全部并入本文。
技术领域
本公开涉及计算机技术领域，具体而言，涉及一种路径规划方法、路径规划系统、路径规划装置、电子设备以及计算机可读存储介质。
背景技术
近年来，电商业的不断发展为物流注入了新的活力，自动引导运输车(Automated Guided Vehicle，简称AGV)可以应用的场景也越来越多。例如，在仓库配货时，多层料箱机器人执行任务需要操作多个料箱得搬入搬出，并在仓库中多个位置进行取放箱，在取放箱时针对于这些位置进行规划路线，确定任务点以及路径后，行驶到任务点进行取放箱。
然而，在AGV小车取放获取货物的过程中，多个AGV小车可能同时在同一个巷道中有相近的任务点需要进行取放货，同时取放货时间比较长，这样将导致货物取放过程中等待时间过长和拥堵问题，影响货物取放效率。
发明内容
根据本公开的第一方面，提供一种路径规划方法，应用于设备端，包括：确定第一任务点，获取所述第一任务点对应的第一任务执行路径，通过第一任务执行路径前往第一任务点；响应于检测到所述第一任务执行路径的路径拥堵事件，获取与所述第一任务点对应的更新任务执行路径，所述更新任务执行路径通过更新所述设备端的实时位置点与所述第一任务点之间的当前连通路径得到；如果所述更新任务执行路径中存在第二任务点，则获取与所述第二任务点对应的第二任务执行路径；通过所述第二任务执行路径前往所述第二任务点，触发所述第二任务点的任务执行操作。
根据本公开的第二方面，提供一种路径规划方法，应用于路径规划端，包括：获取第一任务点，确定并发送所述第一任务点对应的第一任务执行路径；响应于接收到的路径更新指令，执行路径更新操作，得到与所述第一任务点对应的更新任务执行路径；所述路径更新指令基于所述第一任务执行路径的路径拥堵事件生成；发送所述更新任务执行路径。
根据本公开的第三方面，提供一种路径规划系统，包括：任务调度端，用于生成并向设备端发送待执行任务集合；所述待执行任务集合包括多个待执行任务点；所述设备端，用于从所述多个待执行任务点中确定第一任务点，获取所述第一任务点对应的第一任务执行路径，通过所述第一任务执行路径前往所述第一任务点；响应于检测到所述第一任务执行路径的路径拥堵事件，获取与所述第一任务点对应的更新任务执行路径；如果所述更新 任务执行路径中存在第二任务点，则获取与所述第二任务点对应的第二任务执行路径，通过所述第二任务执行路径前往所述第二任务点，触发所述第二任务点的任务执行操作；路径规划端，用于生成所述第一任务执行路径、第二任务执行路径与所述更新任务执行路径。
根据本公开的第四方面，提供一种路径规划装置，应用于设备端，包括：第一路径获取模块，用于确定第一任务点，获取所述第一任务点对应的第一任务执行路径，通过第一任务执行路径前往第一任务点；更新路径获取模块，用于响应于检测到所述第一任务执行路径的路径拥堵事件，获取与所述第一任务点对应的更新任务执行路径，所述更新任务执行路径通过更新所述设备端的实时位置点与所述第一任务点之间的当前连通路径得到；第二路径获取模块，用于如果所述更新任务执行路径中存在第二任务点，则获取与所述第二任务点对应的第二任务执行路径；任务执行模块，用于通过所述第二任务执行路径前往所述第二任务点，触发所述第二任务点的任务执行操作。
根据本公开的第五方面，提供一种路径规划装置，应用于路径规划端，包括：第一路径确定模块，用于获取第一任务点，确定并发送所述第一任务点对应的第一任务执行路径；路径更新模块，用于响应于接收到的路径更新指令，执行路径更新操作，得到与所述第一任务点对应的更新任务执行路径；所述路径更新指令基于所述第一任务执行路径的路径拥堵事件生成；路径发送模块，用于发送所述更新任务执行路径。
根据本公开的第六方面，提供一种电子设备，包括：处理器；以及存储器，所述存储器上存储有计算机可读指令，所述计算机可读指令被所述处理器执行时实现根据上述任意一项所述的路径规划方法。
根据本公开的第七方面，提供一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现根据上述任意一项所述的路径规划方法。
附图说明
图1示意性示出了物流仓库中多层料箱机器人通过仓库通道从货架上拿取货物的示意图；
图2示意性示出了根据本公开的一种示例性实施方式的路径规划方法的流程图；
图3示意性示出了根据本公开的示例性实施方式的任务调度端向任务执行设备下发待执行任务的示例图；
图4示意性示出了根据本公开的示例性实施方式的设备端在仓库中执行运输任务的示例图；
图5示意性示出了根据本公开的另一示例性实施方式的路径规划方法的流程图；
图6示意性示出了根据本公开的示例性实施方式的根据当前位置点与任务点之间的距离更新任务点的示例图；
图7示意性示出了根据本公开的示例性实施方式的路径规划系统的数据流向图；
图8示意性示出了根据本公开的一种示例性实施方式的路径规划装置的方框图；
图9示意性示出了根据本公开的另一示例性实施方式的路径规划装置的方框图；
图10示意性示出了根据本公开一示例性实施例的电子设备的框图；
图11示意性示出了根据本公开一示例性实施例的计算机可读存储介质的示意图。
具体实施方式
现在将参考附图更全面地描述示例实施方式。然而，示例实施例能够以多种形式实施，且不应被理解为限于在此阐述的实施例；相反，提供这些实施例使得本公开将全面和完整，并将示例实施例的构思全面地传达给本领域的技术人员。在图中相同的附图标记表示相同或类似的部分，因而将省略对它们的重复描述。
此外，所描述的特征、结构或特性可以以任何合适的方式结合在一个或更多实施例中。在下面的描述中，提供许多具体细节从而给出对本公开的实施例的充分理解。然而，本领域技术人员将意识到，可以实践本公开的技术方案而没有所述特定细节中的一个或更多，或者可以采用其它的方法、组元、装置、步骤等。在其它情况下，不详细示出或描述公知结构、方法、装置、实现、材料或者操作以避免模糊本公开的各方面。
附图中所示的方框图仅仅是功能实体，不一定必须与物理上独立的实体相对应。即，可以采用软件形式来实现这些功能实体，或在一个或多个软件硬化的模块中实现这些功能实体或功能实体的一部分，或在不同网络和/或处理器装置和/或微控制器装置中实现这些功能实体。
在物流仓库取放货物的场景中，AGV小车或多层料箱机器人将根据待取货物清单从货架中获取相应的货物。参考图1，图1示意性示出了物流仓库中多层料箱机器人通过仓库通道从货架上拿取货物的示意图。图1中，移动设备101-105均可以是执行运输任务的任务执行设备，如多层料箱机器人，图1中的多层物料格110可以是需要存取货物的任务点。图1中待执行任务点在仓库的位置点都比较分散，多层料箱机器人需要去很多任务点拿取货物。
多层料箱机器人在货物拿取的过程中，可能同时在一个巷道中有相近的任务点需要进行取放货，同时多层料箱机器人的取放货时间比较长，这样就可能导致等待时间过长和拥堵问题，影响货物的拿取效率。
基于此，在本示例实施例中，首先提供了一种路径规划方法，移动设备端来实现本公开所述的方法，其中，本公开中描述的终端可以包括诸如手机、平板电脑、笔记本电脑、个人数字助理(Personal Digital Assistant，PDA)等移动终端。图2示意性示出了根据本公开的一些实施例的路径规划方法流程的示意图。参考图2，该路径规划方法可以包括以下步骤：
步骤S210，确定第一任务点，获取第一任务点对应的第一任务执行路径，通过第一任务执行路径前往第一任务点。
在本公开的一种示例性实施方案中，第一任务点可以是设备端进行当前任务执行操作所对应的物品位置点。设备端可以是用于执行任务操作的设备。例如，在仓储系统中，设备端可以是货物运输设备，且设备端的数量可以是多个。第一任务执行路径可以是当前位 置点与第一任务点之间的当前连通路径。设备端的实时位置点可以是设备端的实时位置坐标。
设备端在执行任务之前，可以从多个待执行任务点中选取一个任务点作为第一任务点。例如，第一任务点可以是基于多个待执行任务点对应的初始任务执行顺序确定出来的，第一任务点还可以是从多个待执行任务点随机确定出的一个任务点。当从多个待执行任务点中确定出第一任务点时，可以定位出设备端当前的位置坐标，作为设备端的实时位置点。
在确定出当前位置点与第一任务点后，可以获取两者之间的其中一条连通路径，作为第一任务执行路径。第一任务执行路径可以是路径规划端基于物品仓库对应的路径地图得到的，路径规划端可以将第一任务执行路径发送至设备端，以便设备端基于第一任务执行路径前往第一任务点执行相关的任务操作。
举例而言，当设备端在货物仓库中的某一任务点执行取货任务时，可以先实时定位出设备端当前位置点，作为实时位置点，并将第一任务点发送至路径规划端，由路径规划端返回与第一任务点对应的第一任务执行路径，进而设备端可以基于第一任务执行路径从当前位置点去往第一任务点，执行货物拿取操作。
步骤S220，响应于检测到第一任务执行路径的路径拥堵事件，获取与第一任务点对应的更新任务执行路径，更新任务执行路径通过更新设备端的实时位置点与第一任务点之间的当前连通路径得到。
在本公开的一种示例性实施方案中，路径拥堵事件可以是设备端当前行进的任务执行路径产生拥堵的事件。更新任务执行路径可以是经过路径更新操作后所确定出的当前位置点与第一任务点之间的连接路径。
设备端在通过第一任务执行路径去往第一任务点时，可能存在第一任务执行路径出现拥堵的情况，即产生路径拥堵事件。例如，有其他的任务执行设备处于第一任务执行路径中执行任务；还例如，存储货物的货架倾倒导致第一任务执行路径出现拥堵，等等。如果检测到第一任务执行路径的路径拥堵事件，则响应于路径拥堵事件，并获取与第一任务点对应的更新任务执行路径。
具体的，更新任务执行路径可以是由路径规划端进行路径更新操作得到，路径规划端可以基于设备端的实时位置点与第一任务点进行路径更新操作，例如，仓储仓库中可以包括多个巷道，设备端可以通过仓库的不同巷道到达第一任务点，因此，当前位置点与第一任务点之间可能存在多条连通路径，此时，可以从获取到的多个连通路径中选取一条连通路径，作为设备端的实时位置点到第一任务点之间的更新任务执行路径。
步骤S230，如果更新任务执行路径中存在第二任务点，则获取与第二任务点对应的第二任务执行路径。
在本公开的一种示例性实施方案中，第二任务点可以是更新任务执行路径中与设备端相关联的任务点，即设备端需要触发执行的任务点。第二任务执行路径可以是设备端的实时位置点与第二任务点之间的连通路径。
在确定出更新任务执行路径后，设备端可以通过更新任务执行路径去往第一任务点。在设备端的运行过程中，可以检测更新任务执行路径中是否存在第二任务点，第二任务点可以是处于更新任务执行路径中，且此设备端还未执行的任务点，第二任务点与设备端的当前位置点之间的距离小于第一任务点与当前位置点之间的距离。如果更新任务执行路径中存在第二任务点，则将设备端的当前所需执行的任务点由第一任务点变更为第二任务点。
步骤S240，通过第二任务执行路径前往第二任务点，触发第二任务点的任务执行操作。
在本公开的一种示例性实施方案中，任务执行操作可以是设备端基于待执行任务点进行的相关操作。
当设备端的当前任务点由第一任务点更改为第二任务点后，可以将第二任务点发送至路径规划端，由路径规划端确定出第二任务点与设备端实时位置点之间的第二任务执行路径。进而，设备端通过第二任务执行路径前往第二任务点，并触发第二任务点的任务执行操作。
例如，当待执行任务是货物获取操作时，触发设备端从第二任务点中拿取获取的操作。当待执行任务是货物放置操作时，触发设备端将待存放的货物放置在第二任务点对应的货架中，以完成货物的放置操作。
根据本示例实施例中的路径规划方法，一方面，如果第一任务执行路径存在拥堵，则将第一任务执行路径更改为更新任务执行路径，可以解决由于拥堵或其他因素导致设备端无法通过所造成的任务执行效率低下的问题。另一方面，如果更新任务执行路径存在第二任务点，可以先触发第二任务点的任务执行操作，由于第二任务点与当前位置点的距离比第一任务点更近，可以有效节省设备端的运行成本。
下面，将对本示例实施例中的路径规划方法进行进一步的说明。
在本公开的一种示例性实施方案中，获取待执行任务集合；待执行任务集合中包括多个待执行任务点；确定多个所述待执行任务点对应的初始执行顺序；根据所述初始执行顺序，从多个所述待执行任务点中确定第一任务点。
其中，待执行任务集合可以是由多个待执行任务点及其相关信息构成的数据集合。待执行任务点可以是等待进行任务执行操作的位置点。任务执行路径可以是设备端的当前位置点与多个不同待执行任务点之间路径最短的连通路径。初始执行顺序可以是设备端接收到待执行任务集合时多个待执行任务对应的执行顺序，初始执行顺序可以是按照任务点对应的任务点位置、任务等级、路径代价等因素确定。
在设备端执行运输任务之前，可以先获取待执行任务集合。举例而言，在仓库取货场景中，当物品购买者通过购物平台提交物品购买订单后，购买订单将发送至仓库物流的任务调度端。任务调度端根据接收到的购买订单确定每个物品在仓库中的位置信息，基于上述物品的位置信息生成待执行任务集合，并将生成的待执行任务集合发送至设备端中。由于购买订单中的物品可能分散在仓库的不同位置，因此，基于购买订单中每个物品的位置 信息均可以生成一个对应的待执行任务点。
参考图3，图3示意性示出了根据本公开的示例性实施方式的任务调度端向设备端下发待执行任务的示例图。任务调度端在生成待执行任务集合后，可以将待执行任务集合发送至设备端，例如，本次生成的待执行任务集合中包括6个待执行任务点，即任务点1～任务点6。设备端(如多层料箱机器人)在接收到上述待执行任务点后，将逐一到达上述任务点并触发各个任务点的任务执行操作。
由于待执行任务集合中的多个待执行任务点需要逐一执行，设备端在执行任务之前，可以先确定出一个第一任务点。第一任务点的确定方式可以通过下述步骤进行：路径规划端可以根据仓库地图进行路径规划，得到设备端的当前位置点与各个待执行任务点之间的连通路径，即确定出多个任务执行路径。在确定出多个任务执行路径后，可以确定出每个任务执行路径各自对应的路径代价，进而根据得到的多个路径代价，从多个待执行任务点中选取一个第一任务点。例如，在得到多个路径代价后，可以对得到多个路径代价进行排序，并选取一个路径代价最小的待执行任务点作为第一任务点。
在本公开的一些其他实施方式中，还可以确定多个待执行任务点对应的任务优先级，例如，在货物拿取场景，可以根据货物的体积和重量确定各个待执行任务点的任务优先级，根据任务优先级生成多个待执行任务点对应的初始任务执行顺序。例如，物品1的获取优先级高于物品2的获取优先级，则初始任务执行顺序中，物品1的任务执行顺序排列在物品2之前。通过上述方式，设备端可以根据任务优先级从多个待执行任务点中确定出第一任务点。另外，还可以从多个待执行任务点中随机选取一个任务点作为第一任务点。
需要说明的是，本公开中的路径规划方法不仅适用于货物的装箱场景，还适用于货物的放箱场景，本公开对路径规划方法的具体场景不作任何限定。
在本公开的一种示例性实施方案中，更新任务执行路径基于路径规划端确定出的多个候选任务执行路径得到；更新任务执行路径为路径代价最小或任务点距离最小的候选任务执行路径。
其中，候选任务执行路径可以是第一任务点与设备端实时位置点之间的所有连通路径。路径代价可以是每个候选任务执行路径各自对应的路径代价。任务点距离可以是设备端的当前位置点与待执行任务点之间的距离。
路经规划端在确定出设备端的实时位置点与第一任务点之间的所有连通路径时，可以将确定出的连通路径作为候选任务执行路径。进而，根据路径代价或任务点距离从多个候选任务路径确定出更新任务执行路径。
在获取到第一任务执行路径后，设备端可以基于第一任务执行路径去往第一任务点，进而进行任务执行操作。在设备端去往第一任务点的过程中，第一任务执行路径可能存在路径拥堵的情况，例如，其他任务执行设备可能也通过第一任务执行路径去往相应的任务点，此时，可能造成第一任务执行路径发生拥堵。
参考图4，图4示意性示出了根据本公开的示例性实施方式的设备端在仓库中执行运 输任务的示例图。在同一个物料仓库中，可能存在多个任务执行设备，本实施例中对其中一个任务执行设备(即设备端)为例进行说明。图4中的1号车可以是本公开中的设备端，1号车在执行任务操作时，第一任务点可以是任务点1，图4中1号车的当前位置点在任务点1右侧的巷道中，1号车向前行进即可到达任务点1，此时，2号车处于1号车的前方位置，阻挡了1号车的行车路径，造成拥堵。
由于2号车在执行任务操作时，需要一定的时间，此时为了避免拥堵产生的时间消耗，1号车可以获取与任务点1之间的其他连通路径，即全部的候选任务执行路径。在获取到候选任务执行路径后，可以确定出每个候选任务执行路径各自对应的路径代价，选取一条路径代价最小的候选任务执行路径作为更新任务执行路径，以便设备端可以通过更新任务执行路径去往第一任务点。
进一步地，如果确定出的候选任务执行路径中均包含有待执行任务节点，则可以确定每条候选任务执行路径中待执行任务点与设备位置点的距离，选取一个具有最小任务点距离的候选任务执行路径作为更新任务执行路径。
本领域技术人员容易理解的是，待第二任务点的任务执行操作执行完毕后，可以重新将当前任务点确定为第一任务点，并由路径规划端重新确定设备端的实时位置点与第一任务点之间的连通路径。另外，如果仓储仓库中还存在比第一任务点距离更近的其他任务点时，可以将当前任务点更新为任务点距离更近的其他任务点，以请求路径规划端返回其他任务点对应的任务执行路径，以触发对应的任务执行操作。
基于此，在本示例实施例中，还提供了一种路径规划方法，应用于路径规划端，可以利用服务器来实现本公开的路径规划方法，也可以利用终端设备来实现本公开所述的方法，其中，本公开中描述的终端可以包括诸如手机、平板电脑、笔记本电脑、掌上电脑、个人数字助理(Personal Digital Assistant，PDA)等移动终端，以及诸如台式计算机等固定终端。图5示意性示出了根据本公开的一些实施例的路径规划方法流程的示意图。参考图5，该路径规划方法可以包括以下步骤：
步骤S510，获取第一任务点，确定并发送第一任务点对应的第一任务执行路径。
在本公开的一种示例性实施方案中，由于在仓储仓库中，设备端的位置在实时发生变化，设备端在向路径规划端发送第一任务点时，可以同时将设备端的实时定位出的位置点发送至路径规划端。路径规划端在接收到设备端发送的第一任务点以及设备端的实时位置点后，可以基于仓储仓库的仓库路径地图确定出实时位置点与第一任务点之间的所有连通路径，并从中确定出一条连通路径作为第一任务点对应的第一任务执行路径。
步骤S520，响应于接收到的路径更新指令，执行路径更新操作，得到与第一任务点对应的更新任务执行路径；路径更新指令基于第一任务执行路径的路径拥堵事件生成。
在本公开的一种示例性实施方案中，路径更新指令可以是基于路径拥堵事件触发生成的指令。路径规划端在接收到路径更新指令后，可以触发相应的路径更新操作。路径更新操作可以是重新规划当前位置点与待执行任务点之间的连通路径的处理过程。
路径规划端在接收到路径更新指令时，响应于路径更新指令，并基于第一任务点与实时位置点执行路径更新操作，得到与第一任务点对应的更新任务执行路径。
步骤S530，发送更新任务执行路径。
在本公开的一种示例性实施方案中，路径规划端可以将确定出的更新任务执行路径发送至设备端，以便设备端通过更新任务执行路径前往第一任务点。
本公开的示例性实施例中的路径规划方法，如果检测到第一任务执行路径存在拥堵，则将第一任务执行路径更改为更新任务执行路径，可以解决由于拥堵或其他因素导致设备端无法通过所造成的任务执行效率低下的问题。
在本公开的一种示例性实施方案中，确定并发送第一任务点对应的第一任务执行路径，包括：获取设备端对应的设备位置点；根据设备位置点，确定与第一任务点对应的多个候选任务执行路径；分别确定多个候选任务执行路径各自对应的路径代价；根据各路径代价，从多个候选任务执行路径中确定第一任务执行路径，并发送第一任务执行路径。
其中，设备位置点可以是实时定位出的设备端的位置坐标。
当路径规划端接收到设备位置点与第一任务点后，可以基于第一任务点执行路径规划操作，从仓库路径地图中确定出设备位置点与第一任务点之间的所有连通路径，作为第一任务点对应的多个候选任务执行路径。在确定出多个候选任务执行路径后，可以分别确定多个候选任务执行路径各自对应的路径代价，例如，可以将候选任务执行路径的路径距离作为路径代价。进而，根据确定出的多个路径代价，从多个候选任务执行路径中选取一条作为第一任务执行路径。
在本公开的一种示例性实施方案中，分别确定多个候选任务执行路径各自对应的路径代价，包括：确定候选任务执行路径包括的至少一分段路径；确定每个分段路径各自对应的路径代价权重；根据至少一分段路径与各自对应的路径代价权重，确定路径代价。
其中，分段路径可以是由组成连通路径上的多个不同的分段路径。路径代价权重可以是计算连通代价时，不同分段路径对应的计算权重。
在获取到多个候选任务执行路径时，可以确定每个候选任务执行路径对应的路径代价。在计算路径代价的过程中，可以确定每个候选任务执行路径包含的所有分段路径，并确定每个分段路径对应的路径代价权重，进而根据路径代价权重对多个分段路径进行求和，得到该候选任务执行路径的路径代价。
继续参考图4，以图4中候选任务执行路径420的路径代价计算过程为例。图4中的候选任务执行路径420包括5个分段路径，分别为分段路径421、分段路径422、分段路径423、分段路径424与分段路径425。不同的分段路径可以表示不同类型的道路类型，例如，分段路径421～分段路径425的路径代价权重分别为k1，k2，…，k5。根据不同分段路径的路径代价权重以及每个分段路径的长度进行求和计算，可以得到候选任务执行路径对应的路径代价，以便根据路径代价从多个候选任务执行路径中选取出更新任务执行路径。例如，可以选取路径代价最小的候选任务执行路径作为更新任务执行路径，以便设备 端基于更新任务执行路径前往第一任务点执行任务。
在本公开的一种示例性实施方案中，响应于接收到的路径更新指令，执行路径更新操作，得到与第一任务点对应的更新任务执行路径，包括：响应于接收到的路径更新指令，获取更新后的设备位置点；确定更新后的设备位置点与第一任务点之间的至少一更新候选任务路径；获取每个更新候选任务路径的更新路径代价；根据得到的更新路径代价，从多个更新候选任务路径中确定更新任务执行路径。
其中，更新路径代价可以是更新任务执行路径对应的路径代价。
如果第一任务执行路径产生路径拥堵事件，则设备端可以生成对应的路径更新指令，并将路径更新指令发送至路径规划端。由于设备端在仓储仓库中的位置可能实时发生变化，路径规划端在接收到路径更新指令后，可以获取设备端更新后的设备位置点，进而基于更新后的设备位置点与第一任务点执行路径更新操作，确定出更新候选任务路径。
在得到更新候选任务路径，可以确定出每个更新候选任务路径各自对应的更新路径代价。在得到更新路径代价后，可以根据更新路径代价从多个更新候选任务路径中确定更新任务执行路径。例如，可以选取更新路径代价最小的更新候选任务路径作为更新任务执行路径。相应地，更新路径代价与候选任务执行路径对应的路径代价的确定方式相同，本公开对此不再进行赘述。
进一步地，设备端在通过更新任务执行路径前往第一任务点的过程中，如果检测到更新任务执行路径存在距离第一任务点更近的第二任务点，则可以进行任务点切换操作，将设备端的当前任务点由第一任务点切换为第二任务点，并触发第二任务点的任务执行操作。
参考图6，图6示意性示出了根据本公开的示例性实施方式的根据当前位置点与任务点之间的距离更新任务点的示例图。例如，设备端通过更新任务执行路径420前往任务点1时，当前位置点与任务点402(任务点2)之间的距离为21.58，当前位置点与任务点1之间的距离为196.58，由于当前位置点与任务点2之间的距离小于当前位置点与任务点1之间的距离，因此，当前位置点与任务点2之间的连通代价小于第一任务执行路径的连通代价，可以将任务点2作为目标任务点。
又例如，当任务点2执行完毕后，设备端继续通过更新任务执行路径420前往任务点1，此时检测到任务点3与设备端的距离比任务点1更近，此时，设备端将先前往任务点3触发任务执行操作。
在本公开的一种示例性实施方案中，接收第二任务点；确定并发送所述第二任务点对应的第二任务执行路径。
其中，第二任务点可以是对第一任务点进行任务点更新操作后得到的任务点。第二任务执行路径可以是第二任务点与设备位置点之间的执行路径。
路径规划端在接收到第二任务点后，可以基于仓储仓库的路径规划地图确定出与设备位置点之间的连通路径，作为第二任务执行路径。第二任务执行路径的确定方式与第一任务执行路径确定方式相同，本公开对比不再进行赘述。
需要说明的是，本公开所适用的场景不仅包括货物运输场景，还可以用于其他任务调度场景，例如实际路况中的车辆调度等，上述应用场景均属于本公开的保护范围。
综上所述，本公开的路径规划方法，确定第一任务点，获取第一任务点对应的第一任务执行路径，通过第一任务执行路径前往第一任务点；响应于检测到第一任务执行路径的路径拥堵事件，获取与第一任务点对应的更新任务执行路径，更新任务执行路径通过更新设备端的实时位置点与第一任务点之间的当前连通路径得到；如果更新任务执行路径中存在第二任务点，则获取与第二任务点对应的第二任务执行路径；通过第二任务执行路径前往第二任务点，触发第二任务点的任务执行操作。一方面，如果第一任务执行路径存在拥堵，则将第一任务执行路径更改为更新任务执行路径，可以解决由于拥堵或其他因素导致设备端无法通过所造成的任务执行效率低下的问题。另一方面，如果更新任务执行路径存在第二任务点，则确定第二任务执行路径，由于第二任务点与当前位置点的距离比第一任务点更近，可以有效节省设备端的运行成本。
需要说明的是，尽管在附图中以特定顺序描述了本公开中方法的各个步骤，但是，这并非要求或者暗示必须按照该特定顺序来执行这些步骤，或是必须执行全部所示的步骤才能实现期望的结果。附加的或备选的，可以省略某些步骤，将多个步骤合并为一个步骤执行，以及/或者将一个步骤分解为多个步骤执行等。
此外，在本示例实施例中，还提供了一种路径规划系统，参考图7，该路径规划系统700可以包括：任务调度端710、设备端720以及路径规划端730。
具体的，任务调度端710，用于生成并向设备端发送待执行任务集合；待执行任务集合包括多个待执行任务点；设备端720，用于从多个待执行任务点中确定第一任务点，获取第一任务点对应的第一任务执行路径，通过第一任务执行路径前往第一任务点；响应于检测到第一任务执行路径的路径拥堵事件，获取与第一任务点对应的更新任务执行路径；如果所述更新任务执行路径中存在第二任务点，则获取与第二任务点对应的第二任务执行路径，通过第二任务执行路径前往第二任务点，触发第二任务点的任务执行操作；路径规划端730，用于生成第一任务执行路径、第二任务执行路径与更新任务执行路径。
举例而言，在货物运输场景中，任务调度端710在接收到用户通过订单平台提交的物品购买清单后，可以获取物品购买清单中的多个物品，作为待运输物品，根据多个待运输物品生成待运输物品集合。在获取到待运输物品集合后，可以确定出待运输物品集合中每个待运输物品对应的运输信息，例如运输信息可以包括待运输物品在物料仓库中所处的位置，即物品位置；以及每个待运输物品的运输优先级。
在确定出待运输物品集合中每个待运输物品的物品位置和运输优先级后，可以根据各自对应的物品位置和运输优先级确定出这些待运输物品的运输顺序。待运输物品集合中包含6个待运输物品时，运输顺序可以确定为{物品1，物品2，物品6，物品3，物品5，物品4}。在确定出多个待运输物品的物品位置后，可以基于多个物品位置生成多个待执行任务点。将多个待运输物品的运输顺序作为多个待运输物品对应的初始任务执行顺序， 在步骤S701中，下发待执行任务集合。任务调度端710根据待执行任务点和初始任务执行顺序生成待执行任务集合，并发送至设备端720中。
在步骤S702中，设备端720可以选择第一任务点(如任务点1)执行任务；并在步骤S703中，异步将第一任务点通知给路径规划端730，请求路径规划。路径规划端730，在接收到设备端720的路径规划请求时，可以生成第一任务点对应的第一任务执行路径。具体的，第一任务执行路径可以基于仓库路径地图获取，第一任务执行路径可以是当前位置点与第一任务点之间连通代价最小的连通路径。在获取到第一任务执行路径后，设备端可以基于第一任务执行路径前往第一任务点，以完成第一任务点的任务执行操作。
在步骤S704中，路径规划端730可以检测是否发生拥堵或无法通行，则重新进行路径规划，生成第一任务点对应的更新任务执行路径。在步骤S705中，如果设备端确定有第二任务点，则更换任务点，并将更新后的第二任务点发送至路径规划端。在步骤S706中，通知路径规划端730修改了任务点，并触发更改后的任务点的任务执行操作，路径规划端730生成第二任务点对应的第二任务执行路径。
此外，在本示例实施例中，还提供了一种路径规划装置，应用于设备端。参考图8，该路径规划装置800可以包括：第一路径获取模块810，更新路径获取模块820，第二路径获取模块830以及任务执行模块840。
具体的，第一路径获取模块810，用于确定第一任务点，获取第一任务点对应的第一任务执行路径，通过第一任务执行路径前往第一任务点；更新路径获取模块820，用于响应于检测到第一任务执行路径的路径拥堵事件，获取与第一任务点对应的更新任务执行路径，更新任务执行路径通过更新设备端的实时位置点与第一任务点之间的当前连通路径得到；第二路径获取模块830，用于如果更新任务执行路径中存在第二任务点，则获取与第二任务点对应的第二任务执行路径；任务执行模块840，用于通过第二任务执行路径前往第二任务点，触发第二任务点的任务执行操作。
在本公开的一种示例性实施方案中，第一路径获取模块包括任务点确定模块，用于获取待执行任务集合；待执行任务集合中包括多个待执行任务点；确定多个待执行任务点对应的初始执行顺序；根据初始执行顺序，从多个待执行任务点中确定第一任务点。
另外，在本示例实施例中，还提供了一种路径规划装置，应用于路径规划端。参考图9，该路径规划装置900可以包括：第一路径确定模块910，路径更新模块920以及路径发送模块930。
具体的，第一路径确定模块910，用于获取第一任务点，确定并发送第一任务点对应的第一任务执行路径；路径更新模块920，用于响应于接收到的路径更新指令，执行路径更新操作，得到与第一任务点对应的更新任务执行路径；路径更新指令基于第一任务执行路径的路径拥堵事件生成；路径发送模块930，用于发送更新任务执行路径。
在本公开的一种示例性实施方案中，第一路径确定模块910包括第一路径确定单元，用于获取设备端对应的设备位置点；根据设备位置点，确定与第一任务点对应的多个候选 任务执行路径；分别确定多个候选任务执行路径各自对应的路径代价；根据各路径代价，从多个候选任务执行路径中确定第一任务执行路径，并发送第一任务执行路径。
在本公开的一种示例性实施方案中，第一路径确定单元包括路径代价确定子单元，用于确定候选任务执行路径包括的至少一分段路径；确定每个分段路径各自对应的路径代价权重；根据至少一分段路径与各自对应的路径代价权重，确定路径代价。
在本公开的一种示例性实施方案中，路径更新模块930包括路径更新单元，用于响应于接收到的路径更新指令，获取更新后的设备位置点；确定更新后的设备位置点与第一任务点之间的至少一更新候选任务路径；获取每个更新候选任务路径的更新路径代价；根据得到的更新路径代价，从多个更新候选任务路径中确定更新任务执行路径。
在本公开的一种示例性实施方案中，路径规划装置包括第二路径确定模块，用于接收第二任务点；确定并发送所述第二任务点对应的第二任务执行路径。
上述中各路径规划装置的虚拟模块的具体细节已经在对应的路径规划方法中进行了详细的描述，因此此处不再赘述。
应当注意，尽管在上文详细描述中提及了路径规划装置的若干模块或者单元，但是这种划分并非强制性的。实际上，根据本公开的实施方式，上文描述的两个或更多模块或者单元的特征和功能可以在一个模块或者单元中具体化。反之，上文描述的一个模块或者单元的特征和功能可以进一步划分为由多个模块或者单元来具体化。
此外，在本公开的示例性实施例中，还提供了一种能够实现上述方法的电子设备。
所属技术领域的技术人员能够理解，本公开的各个方面可以实现为系统、方法或程序产品。因此，本公开的各个方面可以具体实现为以下形式，即：完全的硬件实施例、完全的软件实施例(包括固件、微代码等)，或硬件和软件方面结合的实施例，这里可以统称为“电路”、“模块”或“系统”。
下面参照图10来描述根据本公开的这种实施例的电子设备1000。图10显示的电子设备1000仅仅是一个示例，不应对本公开实施例的功能和使用范围带来任何限制。
如图10所示，电子设备1000以通用计算设备的形式表现。电子设备1000的组件可以包括但不限于：上述至少一个处理单元1010、上述至少一个存储单元1020、连接不同系统组件(包括存储单元1020和处理单元1010)的总线1030、显示单元1040。
其中，所述存储单元存储有程序代码，所述程序代码可以被所述处理单元1010执行，使得所述处理单元1010执行本说明书上述“示例性方法”部分中描述的根据本公开各种示例性实施例的步骤。
存储单元1020可以包括易失性存储单元形式的可读介质，例如随机存取存储单元(RAM)1021和/或高速缓存存储单元1022，还可以进一步包括只读存储单元(ROM)1023。
存储单元1020还可以包括具有一组(至少一个)程序模块1025的程序/实用工具1024，这样的程序模块1025包括但不限于：操作系统、一个或者多个应用程序、其它程序模块 以及程序数据，这些示例中的每一个或某种组合中可能包括网络环境的实现。
总线1030可以表示几类总线结构中的一种或多种，包括存储单元总线或者存储单元控制器、外围总线、图形加速端口、处理单元或者使用多种总线结构中的任意总线结构的局域总线。
电子设备1000也可以与一个或多个外部设备1070(例如键盘、指向设备、蓝牙设备等)通信，还可与一个或者多个使得用户能与该电子设备1000交互的设备通信，和/或与使得该电子设备1000能与一个或多个其它计算设备进行通信的任何设备(例如路由器、调制解调器等等)通信。这种通信可以通过输入/输出(I/O)接口1050进行。并且，电子设备1000还可以通过网络适配器1060与一个或者多个网络(例如局域网(LAN)，广域网(WAN)和/或公共网络，例如因特网)通信。如图所示，网络适配器1060通过总线1030与电子设备1000的其它模块通信。应当明白，尽管图中未示出，可以结合电子设备1000使用其它硬件和/或软件模块，包括但不限于：微代码、设备驱动器、冗余处理单元、外部磁盘驱动阵列、RAID系统、磁带驱动器以及数据备份存储系统等。
通过以上的实施例的描述，本领域的技术人员易于理解，这里描述的示例实施例可以通过软件实现，也可以通过软件结合必要的硬件的方式来实现。因此，根据本公开实施例的技术方案可以以软件产品的形式体现出来，该软件产品可以存储在一个非易失性存储介质(可以是CD-ROM，U盘，移动硬盘等)中或网络上，包括若干指令以使得一台计算设备(可以是个人计算机、服务器、终端装置、或者网络设备等)执行根据本公开实施例的方法。
在本公开的示例性实施例中，还提供了一种计算机可读存储介质，其上存储有能够实现本说明书上述方法的程序产品。在一些可能的实施例中，本公开的各个方面还可以实现为一种程序产品的形式，其包括程序代码，当所述程序产品在终端设备上运行时，所述程序代码用于使所述终端设备执行本说明书上述“示例性方法”部分中描述的根据本公开各种示例性实施例的步骤。
参考图11所示，描述了根据本公开的实施例的用于实现上述方法的程序产品1100，其可以采用便携式紧凑盘只读存储器(CD-ROM)并包括程序代码，并可以在终端设备，例如个人电脑上运行。然而，本公开的程序产品不限于此，在本文件中，可读存储介质可以是任何包含或存储程序的有形介质，该程序可以被指令执行系统、装置或者器件使用或者与其结合使用。
所述程序产品可以采用一个或多个可读介质的任意组合。可读介质可以是可读信号介质或者可读存储介质。可读存储介质例如可以为但不限于电、磁、光、电磁、红外线、或半导体的系统、装置或器件，或者任意以上的组合。可读存储介质的更具体的例子(非穷举的列表)包括：具有一个或多个导线的电连接、便携式盘、硬盘、随机存取存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、光纤、便携式紧凑盘只读存储器(CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。
计算机可读信号介质可以包括在基带中或者作为载波一部分传播的数据信号，其中承载了可读程序代码。这种传播的数据信号可以采用多种形式，包括但不限于电磁信号、光信号或上述的任意合适的组合。可读信号介质还可以是可读存储介质以外的任何可读介质，该可读介质可以发送、传播或者传输用于由指令执行系统、装置或者器件使用或者与其结合使用的程序。
可读介质上包含的程序代码可以用任何适当的介质传输，包括但不限于无线、有线、光缆、RF等等，或者上述的任意合适的组合。
可以以一种或多种程序设计语言的任意组合来编写用于执行本公开操作的程序代码，所述程序设计语言包括面向对象的程序设计语言—诸如Java、C++等，还包括常规的过程式程序设计语言—诸如“C”语言或类似的程序设计语言。程序代码可以完全地在用户计算设备上执行、部分地在用户设备上执行、作为一个独立的软件包执行、部分在用户计算设备上部分在远程计算设备上执行、或者完全在远程计算设备或服务器上执行。在涉及远程计算设备的情形中，远程计算设备可以通过任意种类的网络，包括局域网(LAN)或广域网(WAN)，连接到用户计算设备，或者，可以连接到外部计算设备(例如利用因特网服务提供商来通过因特网连接)。
此外，上述附图仅是根据本公开示例性实施例的方法所包括的处理的示意性说明，而不是限制目的。易于理解，上述附图所示的处理并不表明或限制这些处理的时间顺序。另外，也易于理解，这些处理可以是例如在多个模块中同步或异步执行的。
本领域技术人员在考虑说明书及实践这里的公开后，将容易想到本公开的其他实施例。本申请旨在涵盖本公开的任何变型、用途或者适应性变化，这些变型、用途或者适应性变化遵循本公开的一般性原理并包括本公开未公开的本技术领域中的公知常识或惯用技术手段。说明书和实施例仅被视为示例性的，本公开的真正范围和精神由权利要求指出。
应当理解的是，本公开并不局限于上面已经描述并在附图中示出的精确结构，并且可以在不脱离其范围进行各种修改和改变。本公开的范围仅由所附的权利要求来限。

Claims (13)

  1. 一种路径规划方法，其中，应用于设备端，所述方法包括：
    确定第一任务点，获取所述第一任务点对应的第一任务执行路径，通过所述第一任务执行路径前往所述第一任务点；
    响应于检测到所述第一任务执行路径的路径拥堵事件，获取与所述第一任务点对应的更新任务执行路径，所述更新任务执行路径通过更新所述设备端的实时位置点与所述第一任务点之间的当前连通路径得到；
    如果所述更新任务执行路径中存在第二任务点，则获取与所述第二任务点对应的第二任务执行路径；
    通过所述第二任务执行路径前往所述第二任务点，触发所述第二任务点的任务执行操作。
  2. 根据权利要求1所述的方法，其中，所述确定第一任务点，包括：
    获取待执行任务集合；所述待执行任务集合中包括多个待执行任务点；
    确定多个所述待执行任务点对应的初始执行顺序；
    根据所述初始执行顺序，从多个所述待执行任务点中确定第一任务点。
  3. 根据权利要求1所述的方法，其中，所述更新任务执行路径基于路径规划端确定出的多个候选任务执行路径得到；所述更新任务执行路径为路径代价最小或任务点距离最小的候选任务执行路径。
  4. 一种路径规划方法，其中，应用于路径规划端，所述方法包括：
    获取第一任务点，确定并发送所述第一任务点对应的第一任务执行路径；
    响应于接收到的路径更新指令，执行路径更新操作，得到与所述第一任务点对应的更新任务执行路径；所述路径更新指令基于所述第一任务执行路径的路径拥堵事件生成；
    发送所述更新任务执行路径。
  5. 根据权利要求4所述的方法，其中，所述确定并发送所述第一任务点对应的第一任务执行路径，包括：
    获取设备端对应的设备位置点；
    根据所述设备位置点，确定与所述第一任务点对应的多个候选任务执行路径；
    分别确定多个所述候选任务执行路径各自对应的路径代价；
    根据各所述路径代价，从多个所述候选任务执行路径中确定所述第一任务执行路径，并发送所述第一任务执行路径。
  6. 根据权利要求5所述的方法，其中，所述分别确定多个所述候选任务执行路径各自对应的路径代价，包括：
    确定所述候选任务执行路径包括的至少一分段路径；
    确定每个所述分段路径各自对应的路径代价权重；
    根据至少一所述分段路径与各自对应的路径代价权重，确定所述路径代价。
  7. 根据权利要求4所述的方法，其中，所述响应于接收到的路径更新指令，执行路径更新操作，得到与所述第一任务点对应的更新任务执行路径，包括：
    响应于接收到的路径更新指令，获取更新后的设备位置点；
    确定更新后的设备位置点与所述第一任务点之间的至少一更新候选任务路径；
    获取每个所述更新候选任务路径的更新路径代价；
    根据得到的更新路径代价，从多个所述更新候选任务路径中确定所述更新任务执行路径。
  8. 根据权利要求4-7任意一项所述的方法，其中，所述方法还包括：
    接收第二任务点；
    确定并发送所述第二任务点对应的第二任务执行路径。
  9. 一种路径规划系统，其中，包括：
    任务调度端，用于生成并向设备端发送待执行任务集合；所述待执行任务集合包括多个待执行任务点；
    所述设备端，用于从所述多个待执行任务点中确定第一任务点，获取所述第一任务点对应的第一任务执行路径，通过所述第一任务执行路径前往所述第一任务点；响应于检测到所述第一任务执行路径的路径拥堵事件，获取与所述第一任务点对应的更新任务执行路径；如果所述更新任务执行路径中存在第二任务点，则获取与所述第二任务点对应的第二任务执行路径，通过所述第二任务执行路径前往所述第二任务点，触发所述第二任务点的任务执行操作；
    路径规划端，用于生成所述第一任务执行路径、第二任务执行路径与所述更新任务执行路径。
  10. 一种路径规划装置，其中，应用于设备端，所述装置包括：
    第一路径获取模块，用于确定第一任务点，获取所述第一任务点对应的第一任务执行路径，通过所述第一任务执行路径前往所述第一任务点；
    更新路径获取模块，用于响应于检测到所述第一任务执行路径的路径拥堵事件，获取与所述第一任务点对应的更新任务执行路径，所述更新任务执行路径通过更新所述设备端的实时位置点与所述第一任务点之间的当前连通路径得到；
    第二路径获取模块，用于如果所述更新任务执行路径中存在第二任务点，则获取与所述第二任务点对应的第二任务执行路径；
    任务执行模块，用于通过所述第二任务执行路径前往所述第二任务点，触发所述第二任务点的任务执行操作。
  11. 一种路径规划装置，其中，应用于路径规划端，所述装置包括：
    第一路径确定模块，用于获取第一任务点，确定并发送所述第一任务点对应的第一任务执行路径；
    路径更新模块，用于响应于接收到的路径更新指令，执行路径更新操作，得到与所述 第一任务点对应的更新任务执行路径；所述路径更新指令基于所述第一任务执行路径的路径拥堵事件生成；
    路径发送模块，用于发送所述更新任务执行路径。
  12. 一种电子设备，其中，包括：
    处理器；以及
    存储器，所述存储器上存储有计算机可读指令，所述计算机可读指令被所述处理器执行时实现根据权利要求1至8中任一项所述的路径规划方法。
  13. 一种计算机可读存储介质，其上存储有计算机程序，其中，所述计算机程序被处理器执行时实现根据权利要求1至8中任一项所述的路径规划方法。
PCT/CN2023/121761 2022-11-17 2023-09-26 路径规划方法及系统、装置、电子设备和存储介质 WO2024103974A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211441200.1A CN116046000A (zh) 2022-11-17 2022-11-17 路径规划方法及系统、装置、电子设备和存储介质
CN202211441200.1 2022-11-17

Publications (2)

Publication Number Publication Date
WO2024103974A1 true WO2024103974A1 (zh) 2024-05-23
WO2024103974A9 WO2024103974A9 (zh) 2024-07-25

Family

ID=86124611

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/121761 WO2024103974A1 (zh) 2022-11-17 2023-09-26 路径规划方法及系统、装置、电子设备和存储介质

Country Status (2)

Country Link
CN (1) CN116046000A (zh)
WO (1) WO2024103974A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116046000A (zh) * 2022-11-17 2023-05-02 北京京东振世信息技术有限公司 路径规划方法及系统、装置、电子设备和存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110110995A (zh) * 2019-05-05 2019-08-09 拉扎斯网络科技（上海）有限公司 生产任务调度方法、装置、电子设备及计算机存储介质
CN112344945A (zh) * 2020-11-24 2021-02-09 山东大学 室内配送机器人路径规划方法、系统及室内配送机器人
CN113689021A (zh) * 2020-05-19 2021-11-23 百度在线网络技术（北京）有限公司 用于输出信息的方法和装置
WO2022127150A1 (zh) * 2020-12-17 2022-06-23 珠海格力电器股份有限公司 无人搬运车的调度方法和装置
CN116046000A (zh) * 2022-11-17 2023-05-02 北京京东振世信息技术有限公司 路径规划方法及系统、装置、电子设备和存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110110995A (zh) * 2019-05-05 2019-08-09 拉扎斯网络科技（上海）有限公司 生产任务调度方法、装置、电子设备及计算机存储介质
CN113689021A (zh) * 2020-05-19 2021-11-23 百度在线网络技术（北京）有限公司 用于输出信息的方法和装置
CN112344945A (zh) * 2020-11-24 2021-02-09 山东大学 室内配送机器人路径规划方法、系统及室内配送机器人
WO2022127150A1 (zh) * 2020-12-17 2022-06-23 珠海格力电器股份有限公司 无人搬运车的调度方法和装置
CN116046000A (zh) * 2022-11-17 2023-05-02 北京京东振世信息技术有限公司 路径规划方法及系统、装置、电子设备和存储介质

Also Published As

Publication number Publication date
CN116046000A (zh) 2023-05-02
WO2024103974A9 (zh) 2024-07-25

Similar Documents

Publication Publication Date Title
Merschformann et al. Decision rules for robotic mobile fulfillment systems
US11270256B2 (en) Material organization task generation method and device, and material organization method and device
US11597082B2 (en) Dispatching method and device, and non-transitory readable storage medium
US10683173B2 (en) Method of managing resources in a warehouse
US9395198B2 (en) Dynamic routing via intelligent mapping system
US20220374018A1 (en) Method and apparatus for controlling automated guided vehicle
WO2024103974A1 (zh) 路径规划方法及系统、装置、电子设备和存储介质
CN111553548B (zh) 一种拣货方法和装置
CN103250031A (zh) 路线选择系统、路线选择方法和路线选择程序
CN112785215B (zh) 一种生成拣货路径的方法和装置
CN112925308B (zh) 路径规划方法、装置及计算机存储介质
CN111401822A (zh) 商品配送方法及装置、存储介质及电子设备
CN114415610A (zh) 机器人的调度方法、装置、电子设备及存储介质
CN110807612A (zh) 确定剩余产能的方法和装置
CN113128743A (zh) 一种拣货路径规划方法和装置
CN113011672B (zh) 物流时效预测方法、装置、电子设备及存储介质
CN111553637B (zh) 提货路径生成方法、装置、电子设备及存储介质
CN113361739A (zh) 一种生成拣货路径的方法和装置
CN113723890B (zh) 信息处理方法、装置、设备及存储介质
CN113689021A (zh) 用于输出信息的方法和装置
CN113780647A (zh) 取货位置配置方法、装置、设备和存储介质
CN112474368A (zh) 货物拣选方法、装置、设备和计算机可读介质
CN113780936A (zh) 延时收货方法、装置、设备和存储介质
CN117288220A (zh) 一种基于经停点的路径规划方法及装置
CN114548881A (zh) 货运订单匹配方法、系统、设备及存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23890411

Country of ref document: EP

Kind code of ref document: A1