Path planning method, device, electronic device and storage medium

By receiving the target task list and obtaining building and floor identification, and determining the passing points and paths, the accuracy and efficiency of cross-building path planning in the existing technology are solved, and efficient robot cross-building transportation is achieved.

CN114459463BActive Publication Date: 2024-11-05TAMI INTELLIGENCE TECH (BEIJING) CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210198473.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-03-02
Publication Date
2024-11-05
Estimated Expiration
2042-03-02

AI Technical Summary

Technical Problem

The existing technology is difficult to efficiently and accurately plan robot paths in cross-building scenarios, resulting in low distribution efficiency and inability to complete cross-building distribution tasks.

Method used

By receiving the target task list, obtain the building and floor identification of the starting point and end point location, determine the passing points and paths, and calculate the target planning path and duration to achieve path planning across buildings.

Benefits of technology

It improves the accuracy and efficiency of path planning and can effectively complete the distribution tasks across buildings.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114459463B_ABST
    Figure CN114459463B_ABST
Patent Text Reader

Abstract

The embodiment of the present invention discloses a path planning method, device, electronic device and storage medium. The method comprises: receiving a target task list, obtaining the starting position and the end position stored in the target task list, and determining the position attributes of the starting position and the end position; according to the position attributes of the starting position and the end position, determining multiple waypoints from the starting position to the end position, obtaining the target planning path and the target planning duration, so as to move across buildings to the end position based on the target planning path. The method solves the problem in the prior art that the floor transportation path is planned based on merging the shortest paths between all floors, resulting in poor accuracy of path planning, low distribution efficiency, and inability to achieve cross-building transportation. While achieving the path planning of cross-building transportation, the accuracy of path planning is improved, thereby achieving the effect of improving the efficiency of cross-building transportation.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The embodiments of the present invention relate to computer processing technology, and more particularly to a path planning method, device, electronic device and storage medium. Background Art

[0002] With the rapid development of artificial intelligence and robot control technology, mobile robots are increasingly being used in the delivery field to perform some delivery tasks. However, during the delivery process, the robot usually needs to walk a long path and a complex environment, such as taking an elevator across floors or walking along corridors across buildings. Therefore, it is one of the urgent problems to reasonably plan the path that the robot needs to walk so that it can complete the delivery task accurately and efficiently.

[0003] In the prior art, the path planning method is usually to determine the floor where the starting point is located and the floor where the target point is located, and then determine the shortest path between the floors where the starting point is located and the floor where the target point is located as a sub-path, and then merge all the sub-paths to form a robot navigation path between the starting point and the target point. However, in actual application scenarios, the starting point and the target point may not belong to the same building. This method is difficult to adapt to cross-building delivery scenarios, resulting in the robot being unable to efficiently and flexibly complete cross-building tasks, affecting delivery efficiency. Summary of the invention

[0004] The embodiments of the present invention provide a path planning method, device, electronic device and storage medium to realize path planning for inter-building transportation while improving the accuracy of path planning, thereby achieving the technical effect of improving the efficiency of inter-building transportation.

[0005] In a first aspect, an embodiment of the present invention provides a path planning method, the method comprising:

[0006] Receive a target task list, obtain a starting point location and an end point location stored in the target task list, and determine location attributes of the starting point location and the end point location; wherein the location attributes include a building identifier and a floor identifier;

[0007] According to the position attributes of the starting position and the position attributes of the end position, multiple waypoints from the starting position to the end position are determined, and a target planning path and a target planning duration are obtained, so as to move across the building to the end position based on the target planning path.

[0008] In a second aspect, an embodiment of the present invention further provides a path planning device, the device comprising:

[0009] A location attribute determination module, used to receive a target task list, obtain a starting location and an end location stored in the target task list, and determine location attributes of the starting location and the end location; wherein the location attributes include a building identifier and a floor identifier;

[0010] The target planning path and duration acquisition module is used to determine multiple waypoints from the starting position to the end position according to the position attributes of the starting position and the position attributes of the end position, obtain the target planning path and the target planning duration, so as to move across the building to the end position based on the target planning path.

[0011] In a third aspect, an embodiment of the present invention further provides an electronic device, the device comprising:

[0012] one or more processors;

[0013] a storage device for storing one or more programs,

[0014] When the one or more programs are executed by the one or more processors, the one or more processors implement the path planning method as described in any one of the embodiments of the present invention.

[0015] In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements a path planning method as described in any one of the embodiments of the present invention.

[0016] The technical solution of the embodiment of the present invention receives a target task list, obtains the starting position and the end position stored in the target task list, and determines the position attributes of the starting position and the end position, wherein the position attributes include a building identifier and a floor identifier, and then determines multiple waypoints from the starting position to the end position based on the position attributes of the starting position and the end position, obtains a target planning path and a target planning duration, and moves across buildings to the end position based on the target planning path. This solves the problem in the prior art that a navigation path that cannot be dynamically adjusted is obtained by merging the shortest paths between all floors, resulting in poor accuracy of path planning, low delivery efficiency, and inability to complete cross-building delivery tasks. This realizes planning of cross-floor and cross-building paths based on comprehensive consideration of the building and floor to which the starting position and the end position belong, thereby improving the accuracy of path planning and achieving the technical effect of improving the cross-building transportation efficiency of robots. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] In order to more clearly illustrate the technical solutions of the exemplary embodiments of the present invention, the following briefly introduces the drawings required to describe the embodiments. Obviously, the drawings introduced are only drawings of a part of the embodiments to be described in the present invention, rather than all the drawings. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0018] Figure 1 A flow chart of a path planning method provided in Embodiment 1 of the present invention;

[0019] Figure 2 A schematic diagram of a path planning method provided in Embodiment 2 of the present invention;

[0020] Figure 3 A schematic diagram of a path planning method provided in Embodiment 2 of the present invention;

[0021] Figure 4 This is a structural block diagram of a path planning device provided in Embodiment 3 of the present invention;

[0022] Figure 5 This is a schematic diagram of the structure of an electronic device provided in Embodiment 4 of the present invention. DETAILED DESCRIPTION

[0023] The present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the present invention, rather than to limit the present invention. It should also be noted that, for ease of description, only parts related to the present invention, rather than all structures, are shown in the accompanying drawings.

[0024] Embodiment 1

[0025] Figure 1 This is a flow chart of a path planning method provided in the first embodiment of the present invention. This embodiment is applicable to the case of planning a path. The method can be executed by the path planning device in the embodiment of the present invention. The device can be implemented in software and / or hardware. Optionally, it can be implemented by an electronic device. The electronic device can be a mobile terminal, a PC or a server. The device can be configured in a computing device. The path planning method provided in this embodiment specifically includes the following steps:

[0026] S110, receiving a target task list, obtaining a starting point position and an end point position stored in the target task list, and determining position attributes of the starting point position and the end point position.

[0027] Among them, the target task order can be understood as a work order for processing a certain task. For example, in a robot delivery scenario, the target task order can be a task order corresponding to the execution of the delivery items. The target task order may include but is not limited to the delivery items, placement location, departure location, item receiving location, receiving user, receiving requirements, etc. The location attributes include building identification and floor identification. The building identification can be used to characterize the uniqueness of the building. For example, the building identifications of the first building and the second building can be B1 and B2, respectively. The floor identification can be used to characterize the uniqueness of the building floor. For example, the floor identifications of the fifth and sixth floors of the first building B1 can be A5 and A6, respectively. The representation form of the building identification and floor identification is not limited and can be determined by technical personnel based on actual work conditions.

[0028] In actual applications, when the server detects an uploaded task order that needs to be executed, it can be considered that the target task order has been received, and then the starting point and end point required for planning the path can be obtained by analyzing the field data in the target task order. For example, in the distribution scenario, when the drug department uploads the drug delivery order to the robot server on the distribution platform, it can be considered that the delivery order, that is, the target task order, has been received, and the data information on the delivery order has been obtained, which includes the delivery starting point and the delivery end point. The location attributes corresponding to the starting point and the location attributes corresponding to the end point can be obtained using the preset map. Optionally, the building identification and floor identification corresponding to the two locations can be used. For example, the location attribute of the starting point is B1-A5, which can be represented as the 5th floor of the 1st building.

[0029] It should be noted that when obtaining the starting point and end point positions stored in the target task list, the data fields and corresponding field contents in the target task list can be processed to obtain the field content that matches the starting point position field as the starting point position, and the field content that matches the end point position field as the end point position, so that the subsequent starting point and end point positions can determine the planned path.

[0030] Optionally, a target task list is received, and the starting point location and the end point location stored in the target task list are obtained, and the location attributes of the starting point location and the end point location are determined, including: receiving a target task list generated based on a user trigger operation; parsing the content of at least one field in the target task list to obtain the starting point location and the end point location and corresponding location attributes.

[0031] The trigger operation may include at least one of clicking, sliding, and touching.

[0032] In this embodiment, the user can use the input device to input text data in an edit box in the client platform, such as inputting the delivery starting point and end point, thereby triggering a certain control to generate a corresponding task list, i.e., a target task list. The client may include but is not limited to mobile communication terminal devices, such as mobile phones, notebooks, desktop computers, iPads and other terminal devices. At this time, the target task list stores these text data, and the algorithm can be used to parse the data fields and the corresponding field contents in the target task list to obtain the starting point and end point. The location attributes corresponding to the starting point and end point can be found in the map based on the preset map.

[0033] S120. Determine a plurality of waypoints from the starting position to the end position according to the position attributes of the starting position and the position attributes of the end position, obtain a target planning path and a target planning duration, and move across buildings to the end position based on the target planning path.

[0034] The waypoints may be understood as locations passed along the way from the starting point to the end point.

[0035] It should be noted that if the building identifications of the starting position and the end position are the same, it means that the two positions belong to the same building, and the end position can be directly reached from the starting position by the elevator and / or stairs in the starting building. If the building identifications of the starting position and the end position are different, it means that the two positions belong to different buildings, that is, the end position cannot be directly reached from the starting position by the elevator and / or stairs in the starting building. In this case, it is necessary to pass through the building located between the two buildings. The adjacent buildings are connected by corridors, but the floors of each corridor may be different. Accordingly, moving from the starting position to the end position requires passing through multiple waypoints corresponding to the corridors and waypoints corresponding to the elevators.

[0036] In this embodiment, the building information to which the starting position belongs and the building information to which the end position belongs can be determined according to the location attributes of the starting position and the location attributes of the end position. For example, the starting position belongs to the first building and the end position belongs to the seventh building. Accordingly, the building information that needs to be passed between the two building information can be determined according to the preset building rules, and then the corridors that communicate between the adjacent building information can be determined to obtain the waypoints corresponding to the corridors. According to the number of floors to which the adjacent corridors belong, the elevators that need to be passed from one corridor to another are determined to obtain the waypoints corresponding to the elevators. Accordingly, multiple waypoints are obtained for moving from the starting position to the end position, and the waypoints can be connected to obtain a planned path as the target planned path, so that movement is performed based on the target planned path until the end position is reached. Accordingly, the duration of travel on the corridor can be calculated based on the determined waypoints corresponding to the corridor and the preset speed. Accordingly, the duration of travel on the elevator can be calculated based on the determined waypoints corresponding to the elevator and the elevator speed. Then, based on the two travel times, the target planned time is calculated and displayed on the display screen to provide the user with a time prompt to meet user needs.

[0037] In order to improve the accuracy of path planning, when determining multiple waypoints from the starting position to the end position according to the location attributes of the starting position and the location attributes of the end position, the intermediate building information passed through can also be accurately and quickly found from the preset building rules according to the building identification in the location attributes of the starting position and the end position. The corridor information and corresponding floor information between adjacent buildings can also be determined according to the building identification of the adjacent buildings, and then it can be determined whether the adjacent corridors are located on the same floor. If so, it is not necessary to pass through the elevator. If not, it is necessary to pass through the elevator. At this time, the waypoints corresponding to the elevator can be determined based on the floor information of the adjacent corridor.

[0038] Optionally, based on the position attributes of the starting position and the position attributes of the ending position, multiple waypoints moving from the starting position to the ending position are determined, including: based on the building identification of the starting position and the building identification of the ending position, at least one building identification moving from the starting position to the ending position is determined; based on each two adjacent building identifications, at least one corridor information and a waypoint corresponding to each corridor information is determined as a first type of waypoint; based on the floor identification of each two adjacent corridor information, at least one elevator information and a waypoint corresponding to each elevator information is determined as a second type of waypoint; based on the first type of waypoints and the second type of waypoints, multiple waypoints moving from the starting position to the ending position are determined.

[0039] The corridor information includes the floor identification, and the elevator information includes the floor identification.

[0040] In this embodiment, at least one building identification moving from the starting position to the end position can be determined from the preset building rules based on the building identification at the starting position and the building identification at the end position. For example, the starting position belongs to the first building B1 and the end position belongs to the fourth building B4. The intermediate buildings may include the second building B2 and the third building B3. The corridor information between the two buildings and the corresponding corridor waypoints can be determined based on the two adjacent building identifications. For example, there is a corridor between B2 and B3. Optionally, each position point on the corridor can be a waypoint. The waypoints on the corridor can be used as the first type of waypoints. Accordingly, all corridor information and the corresponding first type of waypoints can be obtained. It can be determined by judging whether the floor identifications of the two adjacent corridors are consistent. If so, it means that the two corridors belong to the same floor and can be directly passed without using elevators across floors. If not, it means that the two corridors belong to different floors and cannot be directly accessed. It is necessary to use the elevator across floors. For example, the corridor L1 between the 2nd building and the 3rd building is located on the 2nd floor A2, and the corridor L2 between the 3rd building and the 4th building is located on the 5th floor A5. At this time, to move from the corridor L1 to the corridor L2, it is necessary to move from the elevator position D2 on the floor A2 of the 3rd building to the elevator position D5 on the floor A5 of the 3rd building, and then from the elevator position D5, move to the corridor L2 to complete the path planning from the corridor L1 to the corridor L2. At this time, all the position points passing through the elevator can be used as waypoints and as second-type waypoints. Correspondingly, all the elevator information passing through and the corresponding first-type waypoints can be obtained. Both the first-type waypoints and the second-type waypoints can be used as waypoints from the starting position to the end position to plan the path based on each waypoint.

[0041] It should be noted that in order to improve the effectiveness and convenience of movement based on the planned path, when multiple waypoints from the starting position to the end position are determined according to the location attributes of the starting position and the location attributes of the end position, and the target planned path is obtained, the corresponding movement tool can be determined according to the type corresponding to each waypoint. For example, in actual application, if the waypoint is a first type waypoint, it means that it needs to run on the corridor at this time, and the waypoint can be marked as a corridor attribute. If the waypoint is a second type waypoint, it means that it needs to run on the elevator at this time, and the waypoint can be marked as an elevator attribute so that it can be operated based on the attribute in the future. For example, if there is less traffic on a corridor, the running speed can be increased accordingly. If it is detected that the waypoint to be passed is an elevator attribute, the elevator command can be triggered and wait, which greatly improves automation.

[0042] Optionally, based on the position attributes of the starting position and the position attributes of the end position, multiple waypoints moving from the starting position to the end position are determined to obtain a target planned path, including: for each waypoint, if the current waypoint is a first type of waypoint, the corridor attribute corresponding to the first type of waypoint is used as the position attribute of the current waypoint; or, if the current waypoint is a second type of waypoint, the elevator attribute corresponding to the second type of waypoint is used as the position attribute of the current waypoint; based on the position attributes of the starting position, the position attributes of the end position and the position attributes corresponding to each waypoint, the target planned path is obtained.

[0043] In this embodiment, the type of each waypoint can be judged. If the current waypoint is a first-type waypoint, it means that the waypoint is a location point corresponding to the corridor, and the corridor attribute can be marked for the current waypoint as its location attribute. If the current waypoint is a second-type waypoint, it means that the waypoint is a location point corresponding to the elevator, and the elevator attribute can be marked for the current waypoint as its location attribute. Accordingly, the starting position, the end position, and the waypoints marked with the attributes can be connected to obtain a planned path, that is, a target planned path, so as to perform cross-building movement on the planned path based on the location attributes of each waypoint.

[0044] It should be noted that, based on the position attributes of the starting position and the position attributes of the end position, multiple waypoints from the starting position to the end position are determined to obtain the target planning duration. Based on the type of waypoints, the waypoints related to the corridor and the waypoints related to the elevator can be determined, and then the driving path on the corridor and the driving path on the elevator can be calculated. Each driving path and the corresponding speed can be processed to obtain the driving time on the corridor and the driving time on the elevator to obtain the target planning duration.

[0045] Optionally, based on the position attributes of the starting position and the position attributes of the ending position, multiple waypoints for moving from the starting position to the ending position are determined to obtain a target planning duration, including: determining a first driving path corresponding to each corridor information based on at least one first type waypoint among each waypoint; or determining a second driving path corresponding to each elevator information based on at least one second type waypoint among each waypoint; determining the target planning duration based on the first driving path, a preset robot movement speed, the second driving path, a preset elevator movement speed, each elevator information and a preset elevator waiting time.

[0046] The first driving path corresponds to the driving path on the corridor, and the second driving path corresponds to the driving path on the elevator. The preset elevator waiting time refers to the preset time for the robot to wait for a certain elevator. Optionally, the sum of the historical robot waiting time for the elevator and the number of times the robot waits for the elevator can be counted, and the sum of the waiting time for the elevator can be divided by the number of times the robot waits for the elevator to obtain the average elevator waiting time as the preset elevator waiting time.

[0047] In practical applications, after determining the information of all corridors that need to be passed through, the waypoints that are consistent with the first type of waypoints can be found in each waypoint, and then each waypoint found can be processed to calculate the path distances corresponding to all corridors passed through, which can all be used as the first driving path. It is understandable that when the robot moves on the corridor, each first driving path can be processed with the preset robot movement speed, and the total duration of movement on the corridor can be obtained. Correspondingly, after determining the information of all elevators that need to be passed through, the waypoints that are consistent with the second type of waypoints can be found in each waypoint, and then each waypoint found can be processed to calculate the path distances corresponding to all elevators passed through, which can all be used as the second driving path. It is understandable that when the robot takes the elevator, each second driving path can be processed with the preset elevator movement speed, and the total duration on the elevator can be obtained accordingly. It should be noted that in order to improve the accuracy of determining the target planning duration, before the robot takes the elevator, there needs to be a partial waiting time. Accordingly, the total duration can be calculated based on the number of elevators passed and the preset elevator waiting time. Accordingly, the final planned duration information, that is, the target planning duration, can be obtained based on the sum of the total durations. It should also be noted that in the process of calculating the target planning duration, if the floor where the starting position is located is inconsistent with the floor where the corridor of the adjacent building is located, the passing sub-duration can also be obtained based on the starting position and the elevator passing point closest to the starting position. Correspondingly, if the floor where the terminal position is located is inconsistent with the floor where the corridor of the adjacent building is located, the passing sub-duration can also be obtained based on the terminal position and the elevator passing point closest to the terminal position. Each passing sub-duration can be calculated in the target planning duration.

[0048] Optionally, based on the first driving path, the preset robot movement speed, the second driving path, the preset elevator movement speed, each elevator information and the preset elevator waiting time, the target planning duration is determined, including: based on the first driving path and the preset robot movement speed, obtaining the time passing through the corridor; and based on the second driving path and the preset elevator movement speed, obtaining the time passing through the elevator; and based on the each elevator information and the preset elevator waiting time, obtaining the total elevator waiting time; based on the time passing through the corridor, the time passing through the elevator and the total elevator waiting time, obtaining the target planning duration.

[0049] In this embodiment, the sum of the first driving paths corresponding to each corridor can be divided by the preset robot movement speed to obtain the required time for all corridors, that is, the corridor passage time. The sum of the second driving paths corresponding to each elevator can be divided by the preset elevator movement speed to obtain the required time for all elevators, that is, the elevator passage time. The sum of the number of elevators corresponding to each elevator information can be multiplied by the preset elevator waiting time to obtain the total elevator waiting time. Correspondingly, the corridor passage time, the elevator passage time and the total elevator waiting time can be summed to obtain the target planning time.

[0050] The technical solution of this embodiment receives a target task list, obtains the starting position and the end position stored in the target task list, and determines the position attributes of the starting position and the end position, wherein the position attributes include a building identifier and a floor identifier, and then determines multiple waypoints from the starting position to the end position based on the position attributes of the starting position and the end position, obtains a target planning path and a target planning duration, and moves across buildings to the end position based on the target planning path. This solves the problem in the prior art that a navigation path that cannot be dynamically adjusted is obtained by merging the shortest paths between all floors, resulting in poor accuracy of path planning, low delivery efficiency, and inability to complete cross-building delivery tasks. This realizes planning of cross-floor and cross-building paths based on comprehensive consideration of the building and floor to which the starting position and the end position belong, thereby improving the accuracy of path planning and achieving the technical effect of improving the cross-building transportation efficiency of robots.

[0051] Embodiment 2

[0052] As an alternative embodiment of the above embodiment, Figure 2 This is a schematic diagram of a path planning method provided by Embodiment 2 of the present invention. For details, please refer to the following specific content.

[0053] See also Figure 2 , when the delivery robot receives the task from the starting point position B1-X1-P1 to the end position B2-X2-P8, the starting point position and the end position are in two adjacent buildings, building B1 and building B2. The starting point position can be used as the starting position to plan the path from the starting position 1 to the end position 8. For example, each position point can be represented by building-floor-positioning information. The point of the starting position 1 is B1-X1-P1, where B1 represents the building identification, X1 represents the floor identification, and P1 represents the positioning information. The point of the end position 8 is B2-X3-P8. The corridor between buildings B1 and B2 is LY(1,2), Figure 2 In the middle, 4 and 5 are location points on the corridor, i.e., first type location points. The point location of location 4 is B1-X2-P4, and the point location of location 5 is B2-X2-P5. Figure 2 2, 3, 6 and 7 are the positions of the elevators on both sides of the corridor, that is, the second type of position points. The position of position 2 is B1-X1-P2, the position of position 3 is B1-X2-P3, the position of position 6 is B2-X2-P6, and the position of position 7 is B2-X3-P7. Therefore, if B1≠B2, it is determined that the goods need to be transported across the corridor. Figure 2 The floors (X1, X2, X3) at positions 1, 4, and 8 are all inconsistent, so the robot needs to go to the elevator point on the X1 floor in B1 first, that is, Figure 2 1 to 2, that is, B1-X1-P1 to B1-X1-P1. Take the elevator to the floor where the corridor is located, that is, from B1-X1-P1 to B1-X2-P3, move from the elevator to the corridor LY(1,2), that is, from B1-X2-P3 to B1-X2-P4, and then go to building B2 through the corridor LY(1,2), that is, from B1-X2-P4 to B2-X2-P5, and then reach the elevator point on the floor from the corridor, that is, from B2-X2-P5 to B2-X2-P6, and then take the elevator to the target floor of building 2, that is, B2-X2-P6 to B2-X3-P7, and then go to the terminal position, that is, B2-X3-P7 to B2-X3-P8. Correspondingly, it can be calculated Figure 2 The distance between 5 and 6 in the figure can be calculated as the first driving path. Figure 2 The distance between 2 and 3 and the distance between 6 and 7 are both used as the second driving path. The first driving path can be divided by the preset robot movement speed to obtain the time of passing the corridor. The sum of the second driving paths can be divided by the preset robot movement speed to obtain the time of passing the elevator. The number of elevators passed can be multiplied by the preset elevator waiting time to obtain the total elevator waiting time. Furthermore, the time of passing the corridor, the time of passing the elevator and the total elevator waiting time can be summed to obtain the target planning time. Exemplarily, the target planning duration is denoted as T, the path distance is denoted as S, and V is denoted as the speed, T = (S(B1-X1-P1, B1-X1-P2)+S(B1-X2-P4, B2-X2-P5)+S(B2-X3-P7, B2-X2-P8))÷V(preset robot movement speed)+(S(B1-X1-P2, B1-X2-P3)+S(B2-X2-P6, B2-X3-P7))÷V(preset elevator movement speed)+2×t(preset elevator waiting time), where S(B1-X1-P1, B1-X1-P2) can be expressed as the distance of the path between B1-X1-P1 and B1-X1-P2.

[0054] Based on the above scheme, see Figure 3When the delivery robot receives the task from the point Bm-Xm-P1 corresponding to the starting position 1 to the point Bn-Xn-Pn corresponding to the end position n, because Bm≠Bn, it is determined that it needs to be transported across the building through the corridor. From building Bm to building Bn, it needs to pass through multiple corridors such as LY(m,m+1), LY(m+1,m+2), ..., LY(n-1,n). The floors where each corridor is located are X(m,m+1), X(m+1,m+2), ..., X(n-1,n). The robot route is to go to the point of the elevator position 2 on the current floor, that is, from Bm-Xm-P1 to Bm-Xm-P2, take the elevator to the B(m+1) floor, that is, Bm-Xm-P2 to Bm-X(m,m+1)-P3, until it is transported to the point Bn-Xn-Pn at the end position n.

[0055] For example, when delivering in the same building, the starting point is Bm-Xm-Pm, and the end point is Bm-Xm'-Pm'. Since Bm=Bm, it is determined to be transported in the same building, and it is OK to go directly to the floor where the end point of the Bm building is located, that is, from the Xm floor to the Xm' floor. The robot route is: move to the elevator point on the Xm floor, take the elevator to the Xm' floor, and then move to the end point Bm-Xm'-Pm'.

[0056] The technical solution of this embodiment receives a target task list, obtains the starting position and the end position stored in the target task list, and determines the position attributes of the starting position and the end position, wherein the position attributes include a building identifier and a floor identifier, and then determines multiple waypoints from the starting position to the end position based on the position attributes of the starting position and the end position, obtains a target planning path and a target planning duration, and moves across buildings to the end position based on the target planning path. This solves the problem in the prior art that a navigation path that cannot be dynamically adjusted is obtained by merging the shortest paths between all floors, resulting in poor accuracy of path planning, low delivery efficiency, and inability to complete cross-building delivery tasks. This realizes planning of cross-floor and cross-building paths based on comprehensive consideration of the building and floor to which the starting position and the end position belong, thereby improving the accuracy of path planning and achieving the technical effect of improving the cross-building transportation efficiency of robots.

[0057] Embodiment 3

[0058] Figure 4 This is a structural block diagram of a path planning device provided by Embodiment 3 of the present invention. The device comprises: a location attribute determination module 410 and a target planning path and duration acquisition module 420.

[0059] Among them, the position attribute determination module 410 is used to receive the target task list, and obtain the starting position and the end position stored in the target task list, and determine the position attributes of the starting position and the end position; wherein the position attributes include building identification and floor identification; the target planning path and duration acquisition module 420 is used to determine multiple waypoints from the starting position to the end position according to the position attributes of the starting position and the position attributes of the end position, and obtain the target planning path and target planning duration, so as to move across the building to the end position based on the target planning path.

[0060] The technical solution of this embodiment receives a target task list, obtains the starting position and the end position stored in the target task list, and determines the position attributes of the starting position and the end position, wherein the position attributes include a building identifier and a floor identifier, and then determines multiple waypoints from the starting position to the end position based on the position attributes of the starting position and the end position, obtains a target planning path and a target planning duration, and moves across buildings to the end position based on the target planning path. This solves the problem in the prior art that a navigation path that cannot be dynamically adjusted is obtained by merging the shortest paths between all floors, resulting in poor accuracy of path planning, low delivery efficiency, and inability to complete cross-building delivery tasks. This realizes planning of cross-floor and cross-building paths based on comprehensive consideration of the building and floor to which the starting position and the end position belong, thereby improving the accuracy of path planning and achieving the technical effect of improving the cross-building transportation efficiency of robots.

[0061] On the basis of the above device, optionally, the location attribute determination module 410 includes: a target task list receiving unit and a location attribute acquiring unit.

[0062] A target task order receiving unit, used for receiving a target task order generated based on a user trigger operation;

[0063] The location attribute acquisition unit is used to parse the content of at least one field in the target task list to obtain the starting location and the end location and the corresponding location attributes.

[0064] On the basis of the above device, optionally, the to-be-updated planned path acquisition module 420 includes a building identification determination unit, a first type of waypoint determination unit, a second type of waypoint determination unit and a waypoint movement unit.

[0065] A building mark determining unit, based on the building mark at the starting position and the building mark at the ending position, determines at least one building mark moving from the starting position to the ending position;

[0066] A first-type waypoint determination unit, configured to determine at least one piece of corridor information and a waypoint corresponding to each piece of corridor information as a first-type waypoint based on each of two adjacent building identifiers; wherein the corridor information includes a floor identifier;

[0067] A second type waypoint determination unit, configured to determine at least one piece of elevator information and a waypoint corresponding to each piece of elevator information as a second type waypoint based on the floor identifiers of each pair of adjacent corridor information; wherein the elevator information includes the floor identifier;

[0068] A waypoint movement unit is used to determine a plurality of waypoints moving from the starting position to the end position based on the first type of waypoints and the second type of waypoints.

[0069] On the basis of the above device, optionally, the target planning path and duration acquisition module 420 further includes a location attribute labeling unit and a target planning path acquisition unit.

[0070] a position attribute labeling unit, for each waypoint, if the current waypoint is a first type waypoint, then use the corridor attribute corresponding to the first type waypoint as the position attribute of the current waypoint; or, if the current waypoint is a second type waypoint, then use the elevator attribute corresponding to the second type waypoint as the position attribute of the current waypoint;

[0071] The target planning path acquisition unit is used to obtain the target planning path based on the position attributes of the starting point position, the position attributes of the end point position and the position attributes corresponding to each waypoint.

[0072] On the basis of the above-mentioned device, optionally, the target planning path and duration acquisition module 420 includes a driving path determination unit and a target planning duration determination unit.

[0073] A driving path determination unit, configured to determine a first driving path corresponding to each corridor information based on at least one first type of waypoint among each waypoint; or to determine a second driving path corresponding to each elevator information based on at least one second type of waypoint among each waypoint;

[0074] The target planning duration determination unit is used to determine the target planning duration based on the first driving path, the preset robot movement speed, the second driving path, the preset elevator movement speed, each elevator information and the preset elevator waiting time.

[0075] On the basis of the above-mentioned device, optionally, the target planning duration determination unit includes a sub-duration determination sub-unit and a target planning duration determination sub-unit.

[0076] The sub-duration determination sub-unit is used to obtain the corridor passing time based on the first driving path and the preset robot movement speed; and to obtain the elevator passing time based on the second driving path and the preset elevator movement speed; and to obtain the total elevator waiting time based on the information of each elevator and the preset elevator waiting time;

[0077] The target planning duration determination subunit is used to obtain the target planning duration based on the duration of passing the corridor, the duration of passing the elevator and the total elevator waiting time.

[0078] The path planning device provided in the embodiment of the present invention can execute the path planning method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

[0079] It is worth noting that the various units and modules included in the above-mentioned device are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the protection scope of the embodiments of the present invention.

[0080] Embodiment 4

[0081] Figure 5 This is a schematic diagram of the structure of an electronic device provided in Embodiment 4 of the present invention. Figure 5 A block diagram of an exemplary electronic device 50 suitable for implementing exemplary embodiments of the present invention is shown. Figure 5 The electronic device 50 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0082] like Figure 5 As shown, the electronic device 50 is in the form of a general computing device. The components of the electronic device 50 may include but are not limited to: one or more processors or processing units 501, a system memory 502, and a bus 503 connecting different system components (including the system memory 502 and the processing unit 601).

[0083] Bus 503 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor or a local bus using any of a variety of bus structures. For example, these architectures include but are not limited to Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MAC) bus, Enhanced ISA bus, Video Electronics Standards Association (VESA) local bus and Peripheral Component Interconnect (PCI) bus.

[0084] The electronic device 50 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by the electronic device 50, including volatile and non-volatile media, removable and non-removable media.

[0085] System memory 502 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 504 and / or cache memory 505. Electronic device 50 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, storage system 506 may be used to read and write non-removable, non-volatile magnetic media ( Figure 5 not shown, usually called a "hard drive"). Although Figure 5 Not shown in the figure, a disk drive for reading and writing to a removable non-volatile disk (e.g., a "floppy disk"), and an optical disk drive for reading and writing to a removable non-volatile optical disk (e.g., a CD-ROM, a DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to the bus 503 via one or more data medium interfaces. The memory 502 may include at least one program product having a set (e.g., at least one) of program modules that are configured to perform the functions of the embodiments of the present invention.

[0086] A program / utility 508 having a set (at least one) of program modules 507 may be stored, for example, in the memory 502, such program modules 507 including but not limited to an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment. The program modules 507 generally perform the functions and / or methods of the embodiments described herein.

[0087] The electronic device 50 may also communicate with one or more external devices 509 (e.g., keyboards, pointing devices, displays 510, etc.), may communicate with one or more devices that enable a user to interact with the electronic device 50, and / or may communicate with any device that enables the electronic device 50 to communicate with one or more other computing devices (e.g., a network card, a modem, etc.). Such communication may be performed through an input / output (I / O) interface 511. Furthermore, the electronic device 50 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter 512. As shown, the network adapter 612 communicates with other modules of the electronic device 50 through the bus 503. It should be understood that although Figure 5Not shown, other hardware and / or software modules may be used in conjunction with the electronic device 50, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0088] The processing unit 501 executes various functional applications and data processing by running the programs stored in the system memory 502, such as implementing the path planning method provided in the embodiment of the present invention.

[0089] Embodiment 5

[0090] Embodiment 5 of the present invention further provides a storage medium containing computer executable instructions, wherein the computer executable instructions are used to execute a path planning method when executed by a computer processor. The method includes:

[0091] Receive a target task list, obtain a starting point location and an end point location stored in the target task list, and determine location attributes of the starting point location and the end point location; wherein the location attributes include a building identifier and a floor identifier;

[0092] According to the position attributes of the starting position and the position attributes of the end position, multiple waypoints from the starting position to the end position are determined, and a target planning path and a target planning duration are obtained, so as to move across the building to the end position based on the target planning path.

[0093] The computer storage medium of the embodiment of the present invention can adopt any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can 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 computer-readable storage media include: an electrical connection with one or more wires, a portable computer 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. In this document, a computer-readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, device or device or used in combination with it.

[0094] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, which carry computer-readable program code. 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. Computer-readable signal media may also be any computer-readable medium other than a computer-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.

[0095] Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0096] Computer program code for performing the operation of embodiments of the present invention may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on a user's computer, partially on a user's computer, as an independent software package, partially on a user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0097] Note that the above are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art will understand that the present invention is not limited to the specific embodiments described herein, and that various obvious changes, readjustments and substitutions can be made by those skilled in the art without departing from the scope of protection of the present invention. Therefore, although the present invention has been described in more detail through the above embodiments, the present invention is not limited to the above embodiments, and may include more other equivalent embodiments without departing from the concept of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

Claims

1. A path planning method, characterized in that: Applied to intelligent robots, including: Receive a target task list, obtain a starting point location and an end point location stored in the target task list, and determine location attributes of the starting point location and the end point location; wherein the location attributes include a building identifier and a floor identifier; According to the position attribute of the starting position and the position attribute of the end position, a plurality of waypoints for moving from the starting position to the end position are determined, and a target planning path and a target planning duration are obtained, so as to move across the building to the end position based on the target planning path; The step of determining a plurality of waypoints from the starting position to the end position according to the position attribute of the starting position and the position attribute of the end position comprises: Based on the building identifier at the starting position and the building identifier at the ending position, determining at least one building identifier moving from the starting position to the ending position; Based on the identifications of two adjacent buildings, at least one piece of corridor information and a waypoint corresponding to each piece of corridor information are determined as a first type of waypoint; wherein the corridor information includes a floor identification; Based on the floor identifiers of the information of two adjacent corridors, at least one elevator information and a waypoint corresponding to each elevator information are determined as a second type of waypoint; wherein the elevator information includes the floor identifier; Based on the first type of waypoints and the second type of waypoints, determining a plurality of waypoints moving from the starting position to the end position; The step of determining a plurality of waypoints from the starting position to the end position according to the position attribute of the starting position and the position attribute of the end position, and obtaining the target planning duration, comprises: Determine a first driving path corresponding to each corridor information based on at least one first type waypoint among each waypoint; or determine a second driving path corresponding to each elevator information based on at least one second type waypoint among each waypoint; The target planning duration is determined based on the first driving path, the preset robot movement speed, the second driving path, the preset elevator movement speed, each elevator information and the preset elevator waiting time.

2. The method according to claim 1, characterized in that The receiving of the target task list, obtaining the starting position and the ending position stored in the target task list, and determining the position attributes of the starting position and the ending position include: Receive target task orders generated based on user-triggered operations; The content of at least one field in the target task list is parsed to obtain the starting position and the ending position and corresponding position attributes.

3. The method according to claim 1, characterized in that The step of determining a plurality of waypoints from the starting position to the end position according to the position attribute of the starting position and the position attribute of the end position to obtain a target planning path includes: For each waypoint, if the current waypoint is a first type waypoint, the corridor attribute corresponding to the first type waypoint is used as the location attribute of the current waypoint; or, If the current viapoint is a second type viapoint, the elevator attribute corresponding to the second type viapoint is used as the position attribute of the current viapoint; Based on the position attributes of the starting point, the position attributes of the end point and the position attributes corresponding to each waypoint, a target planning path is obtained.

4. The method according to claim 1, characterized in that The determining of the target planning duration based on the first driving path, the preset robot movement speed, the second driving path, the preset elevator movement speed, each elevator information and the preset elevator waiting time includes: Based on the first driving path and the preset robot movement speed, the duration of passing the corridor is obtained; and based on the second driving path and the preset elevator movement speed, the duration of passing the elevator is obtained; and based on the information of each elevator and the preset elevator waiting time, the total elevator waiting time is obtained; Based on the time of passing through the corridor, the time of passing through the elevator and the total elevator waiting time, the target planning time is obtained.

5. A path planning device, characterized in that: include: A location attribute determination module, used to receive a target task list, obtain a starting location and an end location stored in the target task list, and determine location attributes of the starting location and the end location; wherein the location attributes include a building identifier and a floor identifier; A target planning path and duration acquisition module, used to determine a plurality of waypoints from the starting position to the end position according to the position attributes of the starting position and the position attributes of the end position, obtain a target planning path and a target planning duration, so as to move across buildings to the end position based on the target planning path; A building identification determination unit, configured to determine at least one building identification moving from the starting position to the ending position based on the building identification at the starting position and the building identification at the ending position; A first-type waypoint determination unit, configured to determine at least one piece of corridor information and a waypoint corresponding to each piece of corridor information as a first-type waypoint based on each of two adjacent building identifiers; wherein the corridor information includes a floor identifier; A second type waypoint determination unit, configured to determine at least one piece of elevator information and a waypoint corresponding to each piece of elevator information as a second type waypoint based on the floor identifiers of each pair of adjacent corridor information; wherein the elevator information includes the floor identifier; A waypoint movement unit, configured to determine a plurality of waypoints moving from the starting position to the end position based on the first type of waypoints and the second type of waypoints; The target planning path and duration acquisition module includes a driving path determination unit and a target planning duration determination unit; The driving path determination unit is used to determine a first driving path corresponding to each corridor information based on at least one first type of waypoint among each waypoint; or to determine a second driving path corresponding to each elevator information based on at least one second type of waypoint among each waypoint; The target planning duration determination unit is used to determine the target planning duration based on the first driving path, the preset robot movement speed, the second driving path, the preset elevator movement speed, each elevator information and the preset elevator waiting time.

6. The device according to claim 5, characterized in that The location attribute determination module comprises: A target task order receiving unit, used for receiving a target task order generated based on a user trigger operation; The location attribute acquisition unit is used to parse the content of at least one field in the target task list to obtain the starting location and the end location and the corresponding location attributes.

7. An electronic device, characterized in that: The device comprises: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the path planning method as described in any one of claims 1-4.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the path planning method as described in any one of claims 1 to 4 is implemented.