CN111061278B - Path planning method and device, computer equipment and storage medium - Google Patents
Path planning method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN111061278B CN111061278B CN201911423633.2A CN201911423633A CN111061278B CN 111061278 B CN111061278 B CN 111061278B CN 201911423633 A CN201911423633 A CN 201911423633A CN 111061278 B CN111061278 B CN 111061278B
- Authority
- CN
- China
- Prior art keywords
- target
- driving
- travel
- robot
- road section
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 52
- 238000004590 computer program Methods 0.000 claims description 10
- 238000001514 detection method Methods 0.000 claims description 9
- 230000008569 process Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 230000008901 benefit Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000013473 artificial intelligence Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- 230000002159 abnormal effect Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0212—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory
- G05D1/0223—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory involving speed control of the vehicle
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0276—Control of position or course in two dimensions specially adapted to land vehicles using signals provided by a source external to the vehicle
Landscapes
- Engineering & Computer Science (AREA)
- Aviation & Aerospace Engineering (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)
Abstract
The present disclosure provides a path planning method, apparatus, computer device and storage medium, wherein the method comprises: acquiring a driving path of a target robot; dividing a driving path into a plurality of driving road sections in sequence; taking the divided front preset number of driving road sections as a driving road section group special for the current distribution to the target robot; controlling the target robot to travel according to the travel sections included in the travel section group; and when the target robot is detected to reach a target driving road section in the driving road section group, taking a preset number of driving road sections from the target driving road section as the driving road section group which is currently allocated to the target robot and returning to the step of controlling the target robot to drive according to the driving road section information included in the driving road section group until the target robot reaches the last driving road section. By adopting the scheme, the driving road section group distributed at each time only occupies part of the driving road section of the whole driving path, and the utilization rate of the path is improved.
Description
Technical Field
The present disclosure relates to the field of intelligent control technologies, and in particular, to a path planning method and apparatus, a computer device, and a storage medium.
Background
With the continuous development of artificial intelligence and robot technology, robots are widely applied in various industries, such as office buildings, hotel buildings and other places for autonomous article transportation. At present, when a transportation task is allocated to a robot, a travel path corresponding to the transportation task needs to be indicated to the robot, so that the robot can complete the corresponding transportation task according to the indicated travel path.
In order to avoid an abnormal situation such as a collision that may occur when a plurality of robots complete a transportation task along a travel path, the travel path of one robot needs to be locked before the robot completes the transportation task. However, since the travel path is locked, other robots cannot use the corresponding path in synchronization, resulting in a low utilization rate of the path.
Disclosure of Invention
The embodiment of the disclosure provides at least one path planning scheme, and the result of path division ensures that the robot only uses a special part of the driving paths, and other driving paths can still be used, so that the utilization rate of the paths is improved.
Mainly comprises the following aspects:
in a first aspect, an embodiment of the present disclosure provides a path planning method, where the method includes:
acquiring a driving path of a target robot;
dividing the driving path into a plurality of driving road sections in sequence;
taking the divided traveling road sections with the preset number as a traveling road section group which is currently allocated to the target robot and is special for the target robot;
controlling the target robot to travel according to the travel sections included in the travel section group;
and when the target robot is detected to reach a target driving road section in the driving road section group, taking a preset number of driving road sections from the target driving road section as the driving road section group which is currently allocated to the target robot and returning to the step of controlling the target robot to drive according to the driving road section information included in the driving road section group until the target robot reaches the last driving road section.
In a second aspect, the present disclosure also provides a path planning apparatus, including:
the acquisition module is used for acquiring a running path of the target robot;
the dividing module is used for sequentially dividing the driving path into a plurality of driving road sections;
the generation module is used for taking the divided running road sections with the preset number as a running road section group which is currently allocated to the target robot and is specially used for the target robot;
the control module is used for controlling the target robot to run according to the running road sections included in the running road section group;
and the detection module is used for taking a preset number of driving sections from the target driving section as the driving section group which is currently allocated to the target robot and is specially used for the target robot when the target robot is detected to reach the target driving section in the driving section group, and returning to the step of controlling the target robot to drive according to the driving section information included in the driving section group until the target robot reaches the last driving section.
In a third aspect, the present disclosure also provides a computer device, including: a processor, a memory and a bus, the memory storing machine-readable instructions executable by the processor, the processor and the memory communicating over the bus when a computer device is run, the machine-readable instructions when executed by the processor performing the steps of the path planning method according to the first aspect.
In a fourth aspect, the present disclosure also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the path planning method according to the first aspect.
By adopting the scheme, after the server acquires the driving path of the target robot, the driving path can be sequentially divided into a plurality of driving sections, the divided driving sections with the preset number are taken as the driving section group which is currently allocated to the target robot, so that the target robot is controlled to drive according to the driving sections included in the driving section group, and therefore, once the target robot is detected to reach the target driving section in the driving section group, the driving sections with the preset number from the target driving section can be taken as the driving section group which is currently allocated to the target robot, and the step of controlling the target robot to drive according to the driving section information included in the driving section group is returned until the target robot reaches the last driving section. By adopting the scheme, the current running road section group allocated to the target robot is continuously updated along with the running of the target robot, so that the running road section group allocated at each time only occupies part of the running road section of the whole running path, and other unoccupied running road sections can be allocated to other robots to be used, thereby improving the utilization rate of the path.
In order to make the aforementioned objects, features and advantages of the present disclosure more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings required for use in the embodiments will be briefly described below, and the drawings herein incorporated in and forming a part of the specification illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the technical solutions of the present disclosure. It is appreciated that the following drawings depict only certain embodiments of the disclosure and are therefore not to be considered limiting of its scope, for those skilled in the art will be able to derive additional related drawings therefrom without the benefit of the inventive faculty.
Fig. 1 shows a flowchart of a path planning method provided in an embodiment of the present disclosure;
fig. 2 is a schematic diagram illustrating an application of a path planning method according to a first embodiment of the present disclosure;
fig. 3 is a flowchart illustrating a specific method for determining a target driving section in a path planning method according to a first embodiment of the disclosure;
fig. 4 is a schematic diagram illustrating a path planning apparatus according to a second embodiment of the disclosure;
fig. 5 shows a schematic diagram of a computer device provided in a third embodiment of the present disclosure.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present disclosure more clear, the technical solutions of the embodiments of the present disclosure will be described clearly and completely with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are only a part of the embodiments of the present disclosure, not all of the embodiments. The components of the embodiments of the present disclosure, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the disclosure, provided in the accompanying drawings, is not intended to limit the scope of the disclosure, as claimed, but is merely representative of selected embodiments of the disclosure. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the disclosure without making creative efforts, shall fall within the protection scope of the disclosure.
The following first explains the meanings of some terms involved in the embodiments of the present disclosure.
The robot, a machine device for automatically executing work, can receive commands, run pre-coded programs and perform actions according to principles formulated by artificial intelligence technology. The robot in the embodiments of the present disclosure may be a robot that performs a target task, such as a robot that performs delivery of flowers, food, documents, and the like.
A cell (also called a grid) for dividing the playing field of the robot to ensure that the robot can move freely therein, wherein the robot can travel along the middle line of the cell.
And a travel path for a path taken by the robot when the robot travels within the cell, and the travel path may include a travel starting point position and a travel ending point position, and a travel track point position between the travel starting point position and the travel ending point position. For example, a path from the current driving position of the robot to the target mission point position may be planned for the robot.
According to research, in a related path planning scheme, due to the fact that a driving path is locked, other robots cannot synchronously use the corresponding path, and therefore the utilization rate of the path is low.
Based on the research, the method and the system provide at least one path planning scheme, and ensure that the robot only uses a special part of driving paths through a path dividing result, and other driving paths can still be used, so that the utilization rate of the paths is improved.
The above-mentioned drawbacks are the results of the inventor after practical and careful study, and therefore, the discovery process of the above-mentioned problems and the solutions proposed by the present disclosure to the above-mentioned problems should be the contribution of the inventor in the process of the present disclosure.
The technical solutions in the present disclosure will be described clearly and completely with reference to the accompanying drawings in the present disclosure, and it is to be understood that the described embodiments are only a part of the embodiments of the present disclosure, and not all of the embodiments. The components of the present disclosure, as generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present disclosure, presented in the figures, is not intended to limit the scope of the claimed disclosure, but is merely representative of selected embodiments of the disclosure. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the disclosure without making any creative effort, shall fall within the protection scope of the disclosure.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures.
To facilitate understanding of this embodiment, first, a path planning method disclosed in the embodiment of the present disclosure is described in detail, where an execution subject of the path planning method provided in the embodiment of the present disclosure is generally a computer device with certain computing capability, and the computer device includes, for example: a terminal device, which may be a User Equipment (UE), a mobile device, a User terminal, a cellular phone, a cordless phone, a Personal Digital Assistant (PDA), a handheld device, a computing device, a vehicle mounted device, a wearable device, or a server or other processing device. In some possible implementations, the path planning method may be implemented by a processor calling computer readable instructions stored in a memory.
The path planning method provided by the embodiment of the disclosure is described below by taking the execution subject as a server.
Example one
Referring to fig. 1, which is a flowchart of a path planning method provided in an embodiment of the present disclosure, the method includes steps S101 to S105, where:
s101, acquiring a running path of a target robot;
s102, sequentially dividing a driving path into a plurality of driving road sections;
s103, taking the divided front preset number of driving road sections as a driving road section group which is currently allocated to a target robot;
s104, controlling the target robot to run according to the running road sections included in the running road section group;
and S105, when the target robot is detected to reach the target driving road section in the driving road section group, taking the preset number of driving road sections from the target driving road section as the driving road section group which is currently allocated to the target robot and returns to the step of controlling the target robot to drive according to the driving road section information included in the driving road section group until the target robot reaches the last driving road section.
Here, in order to facilitate understanding of the path planning method provided by the embodiment of the present disclosure, an application scenario of the path control planning method is briefly described first. When the target robot is controlled to execute the target task, the server needs to determine a driving path from the current driving position to the position of the target task, so that the robot can drive to the position of the target task based on the driving path to complete the corresponding target task.
Considering that the running path from the current running position of the robot to the position of the target task often occupies a plurality of cells, in this case, in order to avoid collision between the robots, occupation of the cells by other robots needs to be avoided. Therefore, when the corresponding travel path of the robot is longer, the utilization rate of the cells is lower. It is to solve this problem that the embodiments of the present disclosure provide a scheme for implementing dynamic allocation of travel segments based on a path division policy.
In the embodiment of the disclosure, the driving route may be divided based on the preset road segment length to obtain a plurality of driving road segments, wherein one driving road segment may occupy one or more cells, and then the driving process of the robot is described by taking one driving road segment occupying one cell as an example. As shown in fig. 2, the travel path has 9 travel sections (the rest are not shown) and 9 cells, and the robot can travel along 1-9 cells in sequence according to the dedicated travel section group dynamically allocated to the target robot by the server.
Here, when the dedicated travel link group is first assigned to the target robot, the previously preset number of travel links may be set as the dedicated travel link group currently assigned to the target robot. In the embodiment of the present disclosure, once it is detected that the target robot travels to the target travel section among the travel sections, a preset number of travel sections from which the target travel section starts may be taken as the dedicated travel section group currently allocated to the target robot, that is, the next allocation of the dedicated travel section group may be triggered based on the detection result of the target travel section. After the control robot drives according to the driving road section information included in the driving road section group allocated next time, whether the target robot reaches the target driving road section in the driving road section group allocated next time can be detected, if yes, the next allocation of the driving road section group can be triggered again based on the detection result of the target driving road section, and the like can be performed until the last driving road section after the driving path division is reached.
Still taking the traveling path shown in fig. 2 as an example, if the preset number is 5, the traveling path group corresponding to the 1 st to 5 th cells (corresponding to the first 5 traveling paths) can be assigned to the target robot for the first time. After being assigned to this travel segment group, the robot can start traveling from the 1 st cell. At this time, after the server transmits the coordinate position corresponding to the 5 th cell to the target robot, the robot takes the travel section corresponding to the 5 th cell as a scheduling destination, that is, the robot can travel toward the 5 th cell.
The path planning method provided by the embodiment of the disclosure allocates a next driving road section group to the target robot again when it is determined that the target robot reaches the 2 nd driving road section (corresponding to the target driving road section) in the driving road section group allocated for the first time, and the next driving road section group is obtained after the 2 nd driving road section in the driving road section group allocated for the first time is taken as the starting driving road section and 4 driving road sections are sequentially selected, that is, the 2 nd driving road section to the 6 th driving road section can be taken as the driving road section group allocated for the target robot again.
Considering that the server has first assigned the first 5 travel sections to the target robot, i.e., the target robot can specify the relevant position information of the first 5 travel sections, the server can then transmit the coordinate position corresponding to the 6 th cell to the target robot, which has the travel section corresponding to the 6 th cell as the scheduling destination, i.e., the robot can walk toward the 6 th cell. And the rest is done in sequence until the robot walks to the 9 th cell.
In the embodiment of the disclosure, the determination of the target driving road section is mainly related to the working principle of the robot driving. That is, the robot may first accelerate to a maximum travel speed after receiving a target task, and then may need to decelerate early near a corner location (e.g., cell 7 shown in fig. 2) or a destination location. In the embodiment of the present disclosure, in order to ensure that the robot can travel at a large travel speed in each allocated travel route group, the target travel route may be selected from the travel route group in combination with the maximum braking distance of the target robot and the route lengths of the travel routes in the travel route group.
For example, the maximum braking distance of the target robot is 400 meters, the travel section group includes 5 travel sections, and the section length of each travel section is 100 meters, and at this time, the target travel section may be selected as the 2 nd travel section, and if the maximum braking distance is 300 meters, the target travel section may be selected as the 3 rd travel section.
Like this, this disclosed embodiment can ensure that the target robot carries out the next distribution of the highway section group of traveling promptly before the speed reduction to make the robot remain throughout at best speed of traveling, when promoting the route utilization ratio, promote the work efficiency of robot.
In the embodiment of the disclosure, in the process of controlling the target robot to travel by the server, the robot navigation instruction may be generated based on the travel sections included in the travel section group, and then the generated robot navigation instruction is sent to the target robot, so that the robot travels according to the robot navigation instruction.
It should be noted that, each time a travel section group is allocated, a corresponding robot navigation instruction may be generated, so as to control the robot to travel by planning a robot segment path.
Considering that the determination result of whether the target robot reaches the target travel section in the travel section group directly results in the next assignment of the travel section group, the present disclosure provides a determination method of whether to reach the target travel section in the travel section group based on the positional relationship, as shown in fig. 3, specifically including the steps of:
s301, receiving the current driving position reported by the target robot;
s302, determining whether the current driving position falls into position range information of a target driving road section in the driving road section group;
and S303, if so, determining that the target robot reaches a target driving road section in the driving road section group.
Here, the server may first determine the current travel position reported by the target robot, and then may determine whether the current travel position falls within the position range information to which the target travel link in the travel link group belongs. The cell range where the target driving road section is located may be determined as the position range where the target driving road section belongs, as shown in fig. 2, the cell range where the 2 nd driving road section is located may be determined as the position range where the target driving road section belongs, and at this time, if it is determined that the current driving position of the robot falls within the range where the second cell is located, it may be determined that the robot reaches the target driving road section.
It will be understood by those of skill in the art that in the above method of the present embodiment, the order of writing the steps does not imply a strict order of execution and does not impose any limitations on the implementation, as the order of execution of the steps should be determined by their function and possibly inherent logic.
Based on the same inventive concept, a path planning device corresponding to the path planning method is also provided in the embodiments of the present disclosure, and as the principle of solving the problem of the device in the embodiments of the present disclosure is similar to the path planning method in the embodiments of the present disclosure, the implementation of the device may refer to the implementation of the method, and repeated details are not repeated.
Example two
Referring to fig. 4, which is a schematic diagram of a path planning apparatus provided in a second embodiment of the present disclosure, the apparatus includes:
an obtaining module 401, configured to obtain a driving path of a target robot;
a dividing module 402, configured to divide the driving route into a plurality of driving road segments in sequence;
a generating module 403, configured to use the divided preset number of driving road segments as a driving road segment group dedicated to the target robot;
a control module 404 for controlling the target robot to travel according to the travel sections included in the travel section group;
a detection module 405, configured to, when it is detected that the target robot reaches a target travel route in the travel route group, take a preset number of travel routes from the target travel route as a dedicated travel route group currently allocated to the target robot, and return to the step of controlling the target robot to travel according to travel route information included in the travel route group until the target robot reaches the last travel route.
In one embodiment, the control module 404 is configured to control the target robot to travel according to the travel section information included in the travel section group according to the following steps:
generating a robot navigation instruction based on the travel sections included in the travel section group;
and sending the generated robot navigation instruction to a target robot so that the robot can drive according to the robot navigation instruction.
In one embodiment, the detection module 405 is configured to determine a target travel segment from a set of travel segments according to the following steps:
and selecting the target driving road section from the driving road section group based on the maximum braking distance of the target robot and the road section length of each driving road section in the driving road section group.
In one embodiment, the detection module 405 is configured to determine that the target robot arrives at a target travel section of the set of travel sections according to the following steps:
receiving a current driving position reported by a target robot;
determining whether the current driving position falls into position range information to which a target driving road section in the driving road section group belongs;
if so, determining that the target robot reaches the target driving road section in the driving road section group.
The description of the processing flow of each module in the device and the interaction flow between the modules may refer to the related description in the above method embodiments, and will not be described in detail here.
EXAMPLE III
The embodiment of the present disclosure further provides a computer device, as shown in the figure, the schematic structural diagram of the computer device provided in the embodiment of the present disclosure includes: a processor 501, a memory 502, and a bus 503. The memory 502 stores machine-readable instructions executable by the processor 501 (for example, execution instructions corresponding to the obtaining module 401, the dividing module 402, the generating module 403, the controlling module 404, and the detecting module 405 in the path planning apparatus in fig. 5, and the like), when the computer device is operated, the processor 501 and the memory 502 communicate through the bus 503, and when the machine-readable instructions are executed by the processor 501, the following processes are performed:
acquiring a driving path of a target robot;
dividing a driving path into a plurality of driving road sections in sequence;
taking the divided front preset number of driving road sections as a driving road section group special for the current distribution to the target robot;
controlling the target robot to travel according to the travel sections included in the travel section group;
and when the target robot is detected to reach the target driving road section in the driving road section group, taking the preset number of driving road sections from the target driving road section as the driving road section group which is currently allocated to the target robot and returns to the step of controlling the target robot to drive according to the driving road section information included in the driving road section group until the target robot reaches the last driving road section.
In one embodiment, the processor 501 executes an execution in which the control target robot travels according to travel route information included in a travel route group, the execution including:
generating a robot navigation instruction based on the travel sections included in the travel section group;
and sending the generated robot navigation instruction to a target robot so that the robot can drive according to the robot navigation instruction.
In one embodiment, the processor 501 executes the following steps to determine a target travel section in the travel section group:
and selecting the target driving road section from the driving road section group based on the maximum braking distance of the target robot and the road section length of each driving road section in the driving road section group.
In one embodiment, the processor 501 executes the following steps to determine that the target robot reaches the target travel path in the travel path group:
receiving a current running position reported by a target robot;
determining whether the current driving position falls into position range information to which a target driving road section in the driving road section group belongs;
if so, determining that the target robot reaches the target driving road section in the driving road section group.
The embodiment of the present disclosure further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by the processor 501, the computer program performs the steps of the path planning method in the first embodiment of the foregoing method. The storage medium may be a volatile or non-volatile computer-readable storage medium.
The computer program product of the path planning method provided in the embodiments of the present disclosure includes a computer-readable storage medium storing a program code, where instructions included in the program code may be used to execute the steps of the path planning method described in the above method embodiments, which may be referred to specifically for the above method embodiments, and are not described herein again.
The embodiments of the present disclosure also provide a computer program, which when executed by a processor implements any one of the methods of the foregoing embodiments. The computer program product may be embodied in hardware, software or a combination thereof. In an alternative embodiment, the computer program product is embodied in a computer storage medium, and in another alternative embodiment, the computer program product is embodied in a Software product, such as a Software Development Kit (SDK), or the like.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the system and the apparatus described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again. In the several embodiments provided in the present disclosure, it should be understood that the disclosed system, apparatus, and method may be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and there may be other divisions when actually implemented, and for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or units through some communication interfaces, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present disclosure may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer-readable storage medium executable by a processor. Based on such understanding, the technical solution of the present disclosure may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present disclosure. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
Finally, it should be noted that: the above-mentioned embodiments are merely specific embodiments of the present disclosure, which are used for illustrating the technical solutions of the present disclosure and not for limiting the same, and the scope of the present disclosure is not limited thereto, and although the present disclosure is described in detail with reference to the foregoing embodiments, those skilled in the art should understand that: those skilled in the art can still make modifications or changes to the embodiments described in the foregoing embodiments, or make equivalent substitutions for some of the technical features, within the technical scope of the disclosure; such modifications, changes or substitutions do not depart from the spirit and scope of the embodiments of the present disclosure, and should be construed as being included therein. Therefore, the protection scope of the present disclosure shall be subject to the protection scope of the claims.
Claims (8)
1. A method of path planning, the method comprising:
acquiring a running path of a target robot;
dividing the driving path into a plurality of driving road sections in sequence;
taking the divided front preset number of driving road sections as a driving road section group which is currently allocated to the target robot and is special for the target robot;
controlling the target robot to travel according to the travel sections included in the travel section group;
when the target robot is detected to reach a target driving section in the driving section group, taking a preset number of driving sections from the target driving section as a driving section group which is allocated to the target robot and returns to the step of controlling the target robot to drive according to the driving section information included in the driving section group until the target robot reaches the last driving section, wherein the target driving section in the driving section group is determined according to the following steps: and selecting a target driving road section from the driving road section group based on the maximum braking distance of the target robot and the road section length of each driving road section in the driving road section group.
2. The method according to claim 1, wherein the controlling the target robot to travel according to travel section information included in the travel section group includes:
generating a robot navigation instruction based on the travel sections included in the travel section group;
and sending the generated robot navigation instruction to the target robot so that the robot can drive according to the robot navigation instruction.
3. The method of claim 1, wherein the target robot is determined to arrive at a target travel segment of the set of travel segments as follows:
receiving the current driving position reported by the target robot;
determining whether the current driving position falls into position range information to which a target driving road section in the driving road section group belongs;
if so, determining that the target robot reaches a target driving road section in the driving road section group.
4. A path planner, the device comprising:
the acquisition module is used for acquiring a driving path of the target robot;
the dividing module is used for sequentially dividing the driving path into a plurality of driving road sections;
the generation module is used for taking the divided front preset number of driving road sections as a driving road section group which is currently allocated to the target robot and is special for the target robot;
the control module is used for controlling the target robot to run according to the running road sections included in the running road section group;
a detection module, configured to, when it is detected that the target robot reaches a target travel route in the travel route group, take a preset number of travel routes from the target travel route as a dedicated travel route group currently allocated to the target robot, and return to a step of controlling the target robot to travel according to travel route information included in the travel route group until the target robot reaches a last travel route, wherein the detection module is configured to determine a target travel route in the travel route group according to the following steps: and selecting a target driving road section from the driving road section group based on the maximum braking distance of the target robot and the road section length of each driving road section in the driving road section group.
5. The apparatus of claim 4, wherein the control module is configured to control the target robot to travel according to travel section information included in the travel section group according to the following steps:
generating a robot navigation instruction based on the travel sections included in the travel section group;
and sending the generated robot navigation instruction to the target robot so that the robot can drive according to the robot navigation instruction.
6. The apparatus of claim 4, wherein the detection module is configured to determine that the target robot has reached a target travel segment of the set of travel segments by:
receiving the current driving position reported by the target robot;
determining whether the current driving position falls into position range information to which a target driving road section in the driving road section group belongs;
if so, determining that the target robot reaches a target driving section in the driving section group.
7. A computer device, comprising: a processor, a memory and a bus, the memory storing machine-readable instructions executable by the processor, the processor and the memory communicating over the bus when the computer apparatus is run, the machine-readable instructions, when executed by the processor, performing the steps of the path planning method according to any one of claims 1 to 3.
8. A computer-readable storage medium, having stored thereon a computer program which, when being executed by a processor, is adapted to carry out the steps of the path planning method according to any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911423633.2A CN111061278B (en) | 2019-12-31 | 2019-12-31 | Path planning method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911423633.2A CN111061278B (en) | 2019-12-31 | 2019-12-31 | Path planning method and device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111061278A CN111061278A (en) | 2020-04-24 |
| CN111061278B true CN111061278B (en) | 2022-12-30 |
Family
ID=70306155
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911423633.2A Active CN111061278B (en) | 2019-12-31 | 2019-12-31 | Path planning method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111061278B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002109678A (en) * | 2000-10-02 | 2002-04-12 | Toshiba Corp | Safety control method of road for exclusive use for automatically drivable vehicle, safety control device therefor, and vehicle traffic system |
| CN105446343A (en) * | 2016-01-04 | 2016-03-30 | 杭州亚美利嘉科技有限公司 | Robot scheduling method and apparatus |
| CN105652838A (en) * | 2016-01-29 | 2016-06-08 | 哈尔滨工大服务机器人有限公司 | Multi-robot path planning method based on time window |
| CN107678405A (en) * | 2017-08-22 | 2018-02-09 | 广东美的智能机器人有限公司 | Robot ride method and its device |
| CN107710236A (en) * | 2015-06-30 | 2018-02-16 | 高通股份有限公司 | Parallel confidence spatial movement planner |
| CN108292139A (en) * | 2015-12-02 | 2018-07-17 | 高通股份有限公司 | Map is carried out at the same time by robot to draw and plan |
| CN109928129A (en) * | 2019-04-01 | 2019-06-25 | 上海快仓智能科技有限公司 | Control method, automatic guide vehicle and the cargo movement system of automatic guide vehicle |
| CN110597247A (en) * | 2019-08-22 | 2019-12-20 | 广州智湾科技有限公司 | Multi-vehicle obstacle avoidance path planning method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160349754A1 (en) * | 2015-05-29 | 2016-12-01 | Clearpath Robotics, Inc. | Method, system and apparatus for controlling self-driving vehicles |
-
2019
- 2019-12-31 CN CN201911423633.2A patent/CN111061278B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002109678A (en) * | 2000-10-02 | 2002-04-12 | Toshiba Corp | Safety control method of road for exclusive use for automatically drivable vehicle, safety control device therefor, and vehicle traffic system |
| CN107710236A (en) * | 2015-06-30 | 2018-02-16 | 高通股份有限公司 | Parallel confidence spatial movement planner |
| CN108292139A (en) * | 2015-12-02 | 2018-07-17 | 高通股份有限公司 | Map is carried out at the same time by robot to draw and plan |
| EP3384360A1 (en) * | 2015-12-02 | 2018-10-10 | Qualcomm Incorporated | Simultaneous mapping and planning by a robot |
| CN105446343A (en) * | 2016-01-04 | 2016-03-30 | 杭州亚美利嘉科技有限公司 | Robot scheduling method and apparatus |
| CN105652838A (en) * | 2016-01-29 | 2016-06-08 | 哈尔滨工大服务机器人有限公司 | Multi-robot path planning method based on time window |
| CN107678405A (en) * | 2017-08-22 | 2018-02-09 | 广东美的智能机器人有限公司 | Robot ride method and its device |
| CN109928129A (en) * | 2019-04-01 | 2019-06-25 | 上海快仓智能科技有限公司 | Control method, automatic guide vehicle and the cargo movement system of automatic guide vehicle |
| CN110597247A (en) * | 2019-08-22 | 2019-12-20 | 广州智湾科技有限公司 | Multi-vehicle obstacle avoidance path planning method |
Non-Patent Citations (1)
| Title |
|---|
| 基于蚁群***的机器人全局最优路径规划的研究与仿真;周菁等;《计算机科学》;20100515(第05期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111061278A (en) | 2020-04-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108287545B (en) | Conflict management method and system for multiple mobile robots | |
| CN108267149B (en) | Conflict management method and system for multiple mobile robots | |
| CN107992060B (en) | Path planning method and system for multiple mobile robots | |
| CN110989633A (en) | Robot control method and device, computer equipment and storage medium | |
| WO2019141222A1 (en) | Conflict management method and system for multiple mobile robots | |
| CN106228302A (en) | A kind of method and apparatus for carrying out task scheduling in target area | |
| JP7453371B2 (en) | Multi-vehicle cooperative trajectory planning method, device, system, equipment, storage medium and computer program product | |
| CN108958235A (en) | robot motion planning | |
| CN109108973A (en) | One-way fashion path dispatching method and system | |
| CN108268038B (en) | Dispatching method and system for multiple mobile robots | |
| CN109059926A (en) | Across floor paths planning method and system | |
| WO2016135378A1 (en) | Resolution of route conflict | |
| AU2021215147B2 (en) | Parcel sorting platform, system and method, and data processing for item sorting system | |
| AU2015250085B2 (en) | Method and apparatus for incident task based allocation of service instances | |
| CN103914556A (en) | Large-scale graph data processing method | |
| CN108227716A (en) | The paths planning method and system of mobile robot | |
| CN105589748A (en) | Service request processing method and apparatus | |
| CN103729228A (en) | Method for compiling program, task mapping method and task scheduling method | |
| CN112053065A (en) | Local delivery method and device of robot and robot | |
| Trono et al. | Generating pedestrian maps of disaster areas through ad-hoc deployment of computing resources across a DTN | |
| CN111061278B (en) | Path planning method and device, computer equipment and storage medium | |
| CN105338074A (en) | Contract net task distribution method, obtaining method, intelligent proxy and MAS | |
| CN113521742A (en) | Virtual object moving method, device and storage medium | |
| CN103281784B (en) | A kind of resource allocation methods and device being total to community based on RRU | |
| CN109048910B (en) | Robot avoidance pre-judging method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |