WO2018188200A1 - 机器人的路径规划***、方法、机器人及存储介质 - Google Patents
机器人的路径规划***、方法、机器人及存储介质 Download PDFInfo
- Publication number
- WO2018188200A1 WO2018188200A1 PCT/CN2017/091370 CN2017091370W WO2018188200A1 WO 2018188200 A1 WO2018188200 A1 WO 2018188200A1 CN 2017091370 W CN2017091370 W CN 2017091370W WO 2018188200 A1 WO2018188200 A1 WO 2018188200A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- path
- point
- robot
- planning
- reference positioning
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 67
- 238000004364 calculation method Methods 0.000 claims abstract description 33
- 238000004458 analytical method Methods 0.000 claims abstract description 29
- 238000013507 mapping Methods 0.000 claims description 13
- 238000012545 processing Methods 0.000 claims description 9
- 230000008569 process Effects 0.000 abstract description 26
- 238000010586 diagram Methods 0.000 description 17
- 238000004422 calculation algorithm Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000012216 screening Methods 0.000 description 4
- 238000009825 accumulation Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 2
- 238000007796 conventional method Methods 0.000 description 2
- 238000012937 correction Methods 0.000 description 2
- 238000006073 displacement reaction Methods 0.000 description 2
- 238000001914 filtration Methods 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 238000003672 processing method Methods 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 238000004590 computer program Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 235000012054 meals Nutrition 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
-
- 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/0088—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots characterized by the autonomous decision making process, e.g. artificial intelligence, predefined behaviours
-
- 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
-
- 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/0214—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory in accordance with safety or protection criteria, e.g. avoiding hazardous areas
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B60—VEHICLES IN GENERAL
- B60W—CONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
- B60W2530/00—Input parameters relating to vehicle conditions or values, not covered by groups B60W2510/00 or B60W2520/00
- B60W2530/18—Distance travelled
Definitions
- the present invention relates to the field of computer technologies, and in particular, to a path planning system, method, robot, and computer readable storage medium for a robot.
- autonomous mobile robots can be widely used in many scenes, such as guiding the exhibition hall, leading visitors from one exhibition area to another; the service of the restaurant, actively welcome guests, and lead guests to vacant meals. ; guidance and patrol work in public places, moving along the route set by the program, someone needs help to stop answering questions and so on.
- the autonomous mobile robot is required to move to one or more designated locations to achieve certain specific functions.
- the path planning problem of the autonomous mobile robot is involved.
- the autonomous mobile robot In the prior art, in the path calculation problem, the autonomous mobile robot generally starts to calculate the path of how to move to the target point in real time when receiving the movement instruction. This real-time calculation process needs to consider many factors and is time consuming.
- the main object of the present invention is to provide a path planning system, method, robot and storage medium for a robot, which aims to improve the efficiency of autonomous mobile robot path planning.
- a first aspect of the present application provides a path planning system for a robot, where the path planning system includes:
- a selection module configured to pre-select one or more position points on the path for the robot to move in the predetermined area map as the reference positioning point;
- a path planning module configured to: if receiving an instruction to move the robot from the first location point to the second location point, analyze the first from the first according to the set reference positioning point and according to a predetermined path analysis rule Positioning a path to the second location point and controlling movement of the robot to the second location point based on the analyzed path.
- a second aspect of the present application provides a path planning method for a robot, the method comprising the following steps:
- the path planning system of the robot pre-selects one or more position points on the path for the robot to move in the predetermined area map as the reference positioning point;
- a third aspect of the present application provides a robot, including a processing device, a storage device, in which a path planning system for a robot is stored, the path planning system of the robot includes at least one computer readable instruction, the at least one computer readable instruction Can be executed by the processing device to:
- a fourth aspect of the present application provides a computer readable storage medium having stored thereon at least one executable device Computer-readable instructions to implement the following operations:
- the path planning system, method, robot and storage medium of the robot proposed by the present invention preselect one or more position points as reference positioning points on a path for the robot to move in a predetermined area map; After the robot moves from the first position point to the second position point, the path from the first position point to the second position point is analyzed according to the set reference positioning point and according to a predetermined path analysis rule. And controlling the movement of the robot to the second position point based on the analyzed path. It is not necessary for the robot to calculate the moving path in real time during path planning, but to make corresponding selection from the previously planned path, that is, the path planning process is changed from “calculation” to “selection”, which effectively reduces the real-time calculation amount and improves the path planning. s efficiency.
- FIG. 1 is a schematic diagram of an operating environment of a preferred embodiment of a path planning system for a robot of the present invention
- FIG. 2 is a schematic flow chart of an embodiment of a path planning method for a robot according to the present invention
- FIG. 3 is a schematic diagram of each reference positioning point selected in a public library area map in an embodiment of a path planning method for a robot according to the present invention
- FIG. 4 is a schematic diagram of a path planning of a point P to a point in a public library area map in an embodiment of a path planning method for a robot according to the present invention
- FIG. 5 is a schematic diagram of path planning from point A to point B in an embodiment of a path planning method for a robot according to the present invention
- FIG. 6 is a schematic diagram of quantitative calculation of an obstacle influencing factor in an actual index in an embodiment of a path planning method for a robot according to the present invention
- FIG. 7 is a schematic diagram of obstacle avoidance of a robot in an embodiment of a path planning method for a robot according to the present invention.
- FIG. 8 is a schematic diagram showing a division and trigger radius of a reference positioning point in an embodiment of a path planning method for a robot according to the present invention.
- FIG. 9 is a schematic diagram of functional modules of an embodiment of a path planning system for a robot according to the present invention.
- FIG. 1 it is a schematic diagram of an operating environment of a preferred embodiment of a road strength planning system for a robot of the present invention.
- the path planning system 10 of the robot is installed and operated in the robot 1.
- the robot 1 may include, but is not limited to, a memory 11, a processor 12, and a display 13 that are communicatively coupled to each other through a system bus.
- Figure 1 shows only the robot 1 with components 11-13, but it should be understood that not all illustrated components may be implemented, and more or fewer components may be implemented instead.
- the memory 11 includes a memory and at least one type of readable storage medium.
- the memory provides a cache for the operation of the robot 1;
- the readable storage medium may be a non-volatile storage medium such as a flash memory, a hard disk, a multimedia card, a card type memory, or the like.
- the readable storage medium may be an internal storage unit of the robot 1, such as the hard disk of the robot 1; in other embodiments, the non-volatile storage medium may also be an external storage device of the robot 1, For example, a plug-in hard disk equipped with the robot 1, a smart memory card (SMC), a Secure Digital (SD) card, a flash card, and the like.
- the readable storage medium of the memory 11 is generally used for storage.
- the memory 11 can also be used to temporarily store various types of data that have been output or are to be output.
- Processor 12 may, in some embodiments, include one or more microprocessors, microcontrollers, digital processors, and the like. This processor 12 is typically used to control the operation of the robot 1. In the present embodiment, the processor 12 is configured to run program code or process data stored in the memory 11, such as a path planning system 10 that runs a robot, and the like.
- the display 13 may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode) touch sensor, or the like in some embodiments.
- the display 13 is used to display information processed in the robot 1 and a user interface for displaying visualizations, such as an application menu interface, an application icon interface, and the like.
- the components 11-13 of the robot 1 communicate with each other through a system bus.
- the path planning system 10 of the robot includes at least one computer readable instructions stored in the memory 11, the at least one computer readable instructions being executable by the processor 12 to implement the path planning method of the robot of the various embodiments of the present application.
- the at least one computer readable instruction can be classified into different logic modules depending on the functions implemented by its various parts.
- the path planning system 10 of the robot when executed by the processor 12, the following operations are performed: first, one or more position points are preselected as a reference position on a path for the robot 1 to move in a predetermined area map. Point; then, if an instruction to move the robot 1 from the first position point to the second position point is received, analyzing from the first position point to the second position according to the set reference positioning point and according to a predetermined path analysis rule The path of the point, and based on the analyzed path, controls the movement of the robot 1 to the second position point.
- the path planning system 10 of the robot is stored in the memory 11 and includes at least one computer readable instruction stored in the storage device 11, the at least one computer readable instruction being executable by the processor 12 to implement the present The path planning method of the robot of each embodiment is applied.
- the invention provides a path planning method for a robot.
- FIG. 2 is a schematic flowchart diagram of an embodiment of a path planning method for a robot according to the present invention.
- the path planning method of the robot includes:
- step S10 the path planning system of the robot preselects one or more position points as reference positioning points on the path for the robot to move in the predetermined area map.
- one or more position points are preselected on the predetermined area map as the reference positioning points.
- one or more position points may be selected as reference positioning points on each path that is connected to each other and movable by the robot, as shown in FIG. 3, some small blacks in FIG. Dots are the various datum points selected in the public library area map. Each datum point is located on the path of the public library area map for the robot to move. The larger black dot in Figure 3 is a public book. Obstacle in the museum area map that the robot cannot pass.
- Step S20 if an instruction to move the robot from the first position point to the second position point is received, analyzing the point from the first position point according to the set reference positioning point and according to a predetermined path analysis rule a path of the second location point and controlling movement of the robot to the second location point based on the analyzed path.
- the robot needs to move from the first position point (for example, the P point shown in FIGS. 3 and 4) to the second position point.
- the path planning system of the robot analyzes the path from the first position point to the second position according to the set reference positioning point and according to the predetermined path analysis rule. And controlling the movement of the robot to the second position point based on the analyzed path. For example, for each of the selected reference positioning points in the area map, a plurality of movable paths y1, y2, and y3 between different reference positioning points may be determined in advance, as shown in FIG. 4, the reference positioning point A and the reference positioning point.
- a plurality of movable paths can be predetermined between B, and a plurality of determined movable paths can bypass a large black dot, that is, an obstacle that cannot be passed by the robot, so that the robot can move normally.
- the path planning system of the robot can select one of a plurality of predetermined movable paths between the reference positioning point A and the reference positioning point B as needed, and can be used as the moving path of the analyzed robot to complete the robot from The movement of the first position point to the second position point. For example, if the path required for the robot to move is the shortest, a predetermined movable path y1 or y3 between the reference positioning point A and the reference positioning point B may be selected, and the like.
- one or more position points are preselected as a reference positioning point on a path that can be moved by the robot in a predetermined area map; upon receiving the movement of the robot from the first position point to the second position point After the command, according to the set reference positioning point and according to the predetermined path analysis rule, the path from the first position point to the second position point is analyzed, and the robot movement is controlled based on the analyzed path. Said second location point. It is not necessary for the robot to calculate the moving path in real time during path planning, but to make corresponding selection from the previously planned path, that is, the path planning process is changed from “calculation” to “selection”, which effectively reduces the real-time calculation amount and improves the path planning. s efficiency.
- the predetermined path analysis rule includes:
- a first reference positioning point eg, point A shown in FIG. 4
- a second reference positioning point closest to the second position point eg, point B shown in FIG. 4
- the path from the first location point to the first reference location point, and the second location point to the second reference location point is planned according to a preset first planning manner
- the path from the first reference positioning point to the second reference positioning point is planned according to a preset second planning manner to obtain a second planning path.
- the first planning mode is:
- the second planning manner includes the following steps:
- H1 determining an optional planning path corresponding to the first reference positioning point and the second reference positioning point according to a mapping relationship between the first reference positioning point, the second reference positioning point, and the optional planning path;
- the optional planning path is used as the second planning path of the first reference positioning point to the second reference positioning point;
- the method further includes the following steps:
- the optional planning path is filtered by a predetermined filtering method to filter out the optional planning path to be scored.
- the predetermined screening method includes the following steps:
- An optional planning path including a predetermined specific reference point is selected from each of the optional planning paths, and the selected optional planning path is used as an optional planning path to be scored. For example, if the robot needs to play an advertisement in the process of moving from point A to point B, the advertisement needs to be played on the path M-N with more crowds. Then the robot must pass through the specific reference positioning points M and N in the path planning process, and the path selectable from A to B must contain the specific reference positioning points M and N, and only the specific reference positioning points M and N can be included.
- the planning path is selected for score calculation to simplify the path selection process.
- the total length corresponding to each optional planning path may be separately calculated according to a predetermined calculation formula, and the total length of each optional planning path and the first reference positioning point to the second are respectively calculated.
- the difference between the total length of the shortest path of the reference positioning point, and the shortest path of the first reference positioning point to the second reference positioning point may be a linear distance between the first reference positioning point and the second reference positioning point, or may be The shortest path among the various optional planning paths from a reference positioning point to a second reference positioning point.
- the optional planning path whose corresponding difference is less than the preset threshold is filtered out as an optional planning path to be scored. That is, an optional planning path with a short path length is selected to select to improve the efficiency of selecting the optimal planning path.
- the predetermined calculation formula is:
- d(path) represents the total length of the path and also includes:
- the predetermined scoring rule is:
- the score corresponding to each optional planning path is two out of the optional planning paths.
- the path between adjacent nodes is the score under the influence of walking distance, the influence factor of walking time or the influencing factors of obstacles.
- the last selected path can be defined as:
- Score(path i ) refers to the comprehensive score of the path numbered i, and the comprehensive scoring formula of the path is as follows:
- Score(path) g[o(1),o(2),...,o(i),...,o(n)]
- o(i) represents the influencing factors, including the influencing factors of walking distance, the influencing factors of walking time, and the influencing factors of obstacles (for example, difficulty in avoiding obstacles).
- the whole path The rating value of the influencing factors is the sum of the scores for each segment, ie:
- L k,k+1 represents the score of the influencing factor of the path between every two adjacent nodes in the path from A to B.
- path 1 A-L1-L2-L3-B
- path 2 A-M1-M2-M3-B
- path 3 A -N1-N2-N3-B
- the length of the path 1 path is d (path 1 )
- the length of the path 2 path is d ( Path 2 )
- the length of the path 3 path is d(path 3 ).
- the score corresponding to each optional planning path is the score of the path between each two adjacent nodes in the optional planning path, such as the walking distance influencing factor, the walking time influencing factor or the obstacle influencing factor, such as path 1
- the score corresponding to the path is the path A-L1, L1-L2, L2-L3, and L3-B between each two adjacent nodes in the optional planning path.
- scoring formula of the optional planning path is as follows:
- o(t) is the time score of the optional planning path
- o(d) is the distance score of the optional planning path
- a and b are predetermined weights
- the time score of the i-th optional planning path is defined o i (t) is:
- T(path 1 ), T(path 2 )...T(path n ) are the time used by the robot to move to the target point in different alternative planning paths
- T(path i ) is the ith optional planning path.
- the time taken by the lower robot to move to the target point k ti represents the time penalty factor of the i-th optional planning path, which is the time it takes for the robot to bypass the obstacle in the ith optional planning path.
- d i represents the path length of the i-th optional planning path
- v i represents the robot speed in the i-th optional planning path
- P i represents the probability of occurrence of an obstacle in the i-th optional planning path.
- the distance score o i (d) defining the i-th optional planning path is:
- d(path 1 ), d(path 2 )...d(path n ) are the distances that the robot travels to the target point in different alternative planning paths
- k di represents the distance penalty of the i-th alternative planning path.
- the distance penalty factor is the distance that the robot needs to move more than the obstacle in the ith optional planning path.
- the obstacle influencing factors include an obstacle avoidance difficulty coefficient and a probability of occurrence of an obstacle.
- the robot can access the Internet of Things system, and more useful information can be obtained through the system. For example: (1) The robot can get information about the indoor camera of the IoT system server. Because the surveillance camera generally corresponds to a fixed scene. The image processing method is used to process the data of the camera to obtain the number and approximate distribution of dynamic obstacles in a certain area. (2) The Internet of Things system server can statistically organize the data of personnel flow. Through statistical data, it is possible to predict the probability of which people are concentrated in which time periods and in which areas. (3) Further, the robot system can obtain the distribution of indoor dynamic obstacles (such as personnel distribution) through the indoor camera, and refresh the obstacle probability of the path of each section in real time. Therefore, the robot can dynamically select the optimal path according to the existing situation.
- indoor dynamic obstacles such as personnel distribution
- FIG. 6 is a schematic diagram of quantitative calculation of an obstacle influencing factor in an actual index, and the walking path of the robot is divided into several regions. Assume that it is known:
- the corresponding distance penalty coefficient is kd and the time penalty coefficient is kt
- the time scoring formula and distance scoring formula the time and distance scores of each path after the obstacle factor correction can be calculated.
- the comprehensive score of each path can be calculated, as shown in the following table. Second:
- the path with the lowest score is selected, that is, the third path is used as the optimal moving planning path of the robot.
- the step of controlling the movement of the robot to the second position based on the analyzed path includes:
- the path planning system of the robot analyzes whether there is an obstacle in the path to be moved in real time or timing, and needs to perform mobile avoidance.
- the path planning system of the robot acquires obstacle information in the current path to be moved from a predetermined area monitoring server (for example, an Internet of Things system server) in real time or at a time, and analyzes the acquired obstacle information according to the obtained obstacle information. Whether there are obstacles or not needs to be moved to avoid.
- a predetermined area monitoring server for example, an Internet of Things system server
- the path planning system of the robot detects the obstacle information in the current path to be moved by the obstacle detecting unit (for example, the radar unit) configured by the robot in real time or timing, and analyzes whether there is an obstacle to be performed. Mobile evasion.
- the obstacle detecting unit for example, the radar unit
- the path planning system of the robot takes the current position as the new first position point, and analyzes the new first position point according to the set reference positioning point and according to the predetermined path analysis rule. a path to the second location point and controlling movement of the robot to the second location point based on the analyzed path. (For example, the planned path from point P to point Q shown in Figure 4).
- FIG. 7 is a schematic diagram of the obstacle avoidance of the robot. It is assumed that the robot is to move from point A to point B, and a dynamic obstacle suddenly appears near the point C during the movement. In the prior art, the robot dynamically bypasses the obstacle according to an algorithm and recalculates the new planned path y4 according to the current position. There are some disadvantages to this approach, such as:
- the robot In the process of bypassing the obstacle, the robot needs to constantly calculate the avoidance path and continuously calculate the path from the current position to the target point. This process will consume a lot of computing resources and time.
- the robot cannot know the size of the obstacle in front of the eye, the time it takes to bypass it, and whether there are other obstacles after the bypass. For example, what appears in front of the robot is a long wall of people, using conventional methods. It will take a lot of time to get around this wall.
- the robot reselects another path by directly selecting other reference positioning points.
- L1 and L2 are reference positioning points.
- the robot can re-select another route C-L1-L2-B to reach point B, that is, the robot can choose not to bypass the obstacle, but choose another route, and select the route. It is more efficient to calculate the route in real time, does not take up a lot of computing resources of the robot, and the response is more timely.
- the path planning system of the robot pre-selects one or more position points as the reference positioning points on the predetermined area map, and also sets the corresponding position at the position corresponding to each of the reference positioning points in the predetermined area map.
- the location point identifier may be a manual location roadmap, eg, for example, the artificial landmark at the location corresponding to the second reference location of the second layer A3 region may be “L1A3P2”, or “L1A32”;
- the position road sign eg, for example, the natural road sign at the position corresponding to the second reference point of the second layer A3 area may be " ⁇ A3".
- the step of controlling the movement of the robot to the second position based on the analyzed path further includes:
- the path planning system of the robot performs position location in real time or at regular intervals
- the triggering coordinate area may be a center of the reference positioning point and a preset length of the radius A circular area or a square area, and so on.
- the open location point identification device (such as a camera) starts detecting the location point identifier
- the distance and direction of the robot and the detected position point identification are calculated by the sensor of the robot to obtain the current position and posture of the robot, and the forward direction is calibrated according to the current position and posture of the robot.
- the step of analyzing whether the current position is in the trigger coordinate area of a reference positioning point includes:
- the current position is in the trigger coordinate area of a target reference positioning point, it is determined that the current position is in the trigger coordinate area of a reference positioning point, or if the current position is not in the trigger coordinate area of a target reference positioning point, then determining The current position is not in the trigger coordinate area of a datum point.
- the robot During the movement of the robot according to the planned path, the robot needs to determine the position of the current position and the target point by positioning, and also needs to confirm its position during the movement.
- the combination of relative positioning and absolute positioning is now widely used. Because of the inevitable error accumulation problem of relative positioning, it is necessary to use absolute positioning method for calibration.
- the robot calculates the relative positioning of the sensor based on the previous positioning result and the relative displacement measured by the inertia sensor. Since there will be some error in each positioning, the error will continue to accumulate and become larger and larger, which will eventually lead to unacceptable positioning errors after a period of time. Therefore, the robot needs to calibrate the positioning information in some way at an appropriate time.
- the position point identification is used to calibrate in the reference positioning point mode, and the robot can roughly determine the position of the road sign according to its position.
- the robot recognizes the position point identification, the distance and direction of the robot and the road sign are calculated by the sensor. , get the current position and posture of the robot.
- the robot needs to open the detecting device at all times to search for a location point identifier nearby and perform calibration. Therefore, it is necessary to arrange a large number of location point identifiers in a wide range, and also waste a large amount of computing resources of the robot.
- the arrangement range of the position point identification is reduced to the reference setting. Near the site, there is no need to arrange a large number of road signs globally, and it is only necessary to arrange road signs near the reference positioning points, thereby effectively reducing the number of road sign arrangements and preventing confusion of other types of signs caused by the layout of a large number of road signs.
- the position point of each reference anchor point is identified as a picture corresponding to the unique coordinates (a, b) in the map.
- a camera is mounted on the top of the robot to identify the location point identification picture.
- the robot captures the position point identification picture, the relative coordinates (m, n) of the robot relative to the target picture can be obtained, and the robot can obtain its current coordinate (a+m, b+n) and use the coordinate as Current accurate coordinates for coordinate calibration.
- the robot in order to not miss the location point identification during the movement, the robot will open the top camera in real time and continuously process the video.
- the camera opens the capturing position point identification for calibration if and only if the robot enters the triggering coordinate area of the reference positioning point, that is, the triggering radius. Therefore, the present embodiment gives the timing of the robot calibration by setting the trigger coordinate area of the reference positioning point, and facilitates the control of the robot, thereby reducing the calculation amount and resource consumption.
- an implementation manner is that the robot uses the current coordinates and the coordinates of each of the reference positioning points in the database to calculate, and determines the current coordinates and Whether the coordinates of a datum point are smaller than the trigger radius.
- the map and the reference positioning point are divided and classified, and all the reference positioning points are not queried during the query, but only the area where the area is located is determined, and only the reference positioning points constituting the area are determined. Make queries, which greatly reduces the amount of calculation per query.
- FIG. 8 is a schematic diagram of a reference positioning area division and a trigger radius.
- the calibration scheme includes the following steps:
- the map is segmented into a plurality of polygonal regions 1, 2, ... using a reference positioning point r, each of which has a trigger radius R of a corresponding radius.
- the robot determines in which region the current coordinates are located. For example, the robot in Figure 8 is currently located in the area numbered 5.
- the robot when the robot is in a certain polygon area, the robot will query at time interval t to confirm whether its current coordinates are in the trigger radius of the reference point of the corner point of the area.
- the current coordinates of the robot are located in a square area numbered 5, and the robot will only query the area where the current coordinates are at the reference positioning points of the four corner points constituting the area (ie, numbered A, B, C, D is the area formed by the four reference positioning points).
- the robot will open the position point identification device (such as the camera) to start detecting the position point identification.
- the robot will calibrate the current coordinates by the calculated coordinate information.
- the invention further provides a path planning system for a robot.
- FIG. 9 is a functional block diagram of a preferred embodiment of the path planning system 10 of the robot of the present invention.
- the path planning system 10 of the robot may be divided into one or more modules, the one or more modules being stored in the memory 11 and being processed by one or more processors (this embodiment) Executed for the processor 12) to complete the present invention.
- the path planning system 10 of the robot may be divided into a selection module 01 and a path planning module 02.
- the term "module" as used in the present invention refers to a series of computer program instruction segments capable of performing a specific function, which is more suitable than the program for describing the execution process of the path planning system 10 of the robot in the robot 1. The following description will specifically describe the functions of the selection module 01 and the path planning module 02.
- the selection module 01 is configured to pre-select one or more position points on the path for the robot to move in the predetermined area map as the reference positioning point.
- one or more position points are preselected on the predetermined area map as the reference positioning points.
- one or more position points may be selected as reference positioning points on each path that is connected to each other and movable by the robot, as shown in FIG. 3, some small blacks in FIG. Dots are the various datum points selected in the public library area map. Each datum point is located on the path of the public library area map for the robot to move. The larger black dot in Figure 3 is a public book. Robots cannot pass through the museum area map Obstacle through.
- the path planning module 02 is configured to: if receiving an instruction to move the robot from the first location point to the second location point, analyze the rule from the first according to the set reference positioning point and according to a predetermined path analysis rule A location points a path to the second location point and controls movement of the robot to the second location point based on the analyzed path.
- the robot needs to move from the first position point (for example, the P point shown in FIGS. 3 and 4) to the second position point.
- the path planning system of the robot analyzes the path from the first position point to the second position according to the set reference positioning point and according to the predetermined path analysis rule. And controlling the movement of the robot to the second position point based on the analyzed path. For example, for each of the selected reference positioning points in the area map, a plurality of movable paths y1, y2, and y3 between different reference positioning points may be determined in advance, as shown in FIG. 4, the reference positioning point A and the reference positioning point.
- a plurality of movable paths can be predetermined between B, and a plurality of determined movable paths can bypass a large black dot, that is, an obstacle that cannot be passed by the robot, so that the robot can move normally.
- the path planning system of the robot can select the reference positioning according to the need.
- One of a plurality of predetermined movable paths between the point A and the reference positioning point B can be used as the moving path of the analyzed robot to complete the movement of the robot from the first position point to the second position point. mobile. For example, if the path required for the robot to move is the shortest, a predetermined movable path y1 or y3 between the reference positioning point A and the reference positioning point B may be selected, and the like.
- one or more position points are preselected as a reference positioning point on a path that can be moved by the robot in a predetermined area map; upon receiving the movement of the robot from the first position point to the second position point After the command, according to the set reference positioning point and according to the predetermined path analysis rule, the path from the first position point to the second position point is analyzed, and the robot movement is controlled based on the analyzed path. Said second location point. It is not necessary for the robot to calculate the moving path in real time during path planning, but to make corresponding selection from the previously planned path, that is, the path planning process is changed from “calculation” to “selection”, which effectively reduces the real-time calculation amount and improves the path planning. s efficiency.
- the predetermined path analysis rule includes:
- a first reference positioning point eg, point A shown in FIG. 4
- a second reference positioning point closest to the second position point eg, point B shown in FIG. 4
- the path from the first location point to the first reference location point, and the second location point to the second reference location point is planned according to a preset first planning manner
- the path from the first reference positioning point to the second reference positioning point is planned according to a preset second planning manner to obtain a second planning path.
- the first planning mode is:
- the second planning manner includes the following steps:
- H1 determining an optional planning path corresponding to the first reference positioning point and the second reference positioning point according to a mapping relationship between the first reference positioning point, the second reference positioning point, and the optional planning path;
- the optional planning path is used as the second planning path of the first reference positioning point to the second reference positioning point;
- the method further includes the following steps:
- the optional planning path is filtered by a predetermined filtering method to filter out the optional planning path to be scored.
- the predetermined screening method includes the following steps:
- An optional planning path including a predetermined specific reference point is selected from each of the optional planning paths, and the selected optional planning path is used as an optional planning path to be scored. For example, if the robot needs to play an advertisement in the process of moving from point A to point B, the advertisement needs to be played on the path M-N with more crowds. Then the robot must pass through the specific reference positioning points M and N in the path planning process, and the path selectable from A to B must contain the specific reference positioning points M and N, and only the specific reference positioning points M and N can be included.
- the planning path is selected for score calculation to simplify the path selection process.
- the total length corresponding to each optional planning path may be separately calculated according to a predetermined calculation formula, and the total length of each optional planning path and the first reference positioning point to the second are respectively calculated.
- the difference between the total length of the shortest path of the reference positioning point, and the shortest path of the first reference positioning point to the second reference positioning point may be a linear distance between the first reference positioning point and the second reference positioning point, or may be The shortest path among the various optional planning paths from a reference positioning point to a second reference positioning point.
- the optional planning path whose corresponding difference is less than the preset threshold is filtered out as an optional planning path to be scored. That is, an optional planning path with a short path length is selected to select to improve the efficiency of selecting the optimal planning path.
- the predetermined calculation formula is:
- d(path) represents the total length of the path and also includes:
- the predetermined scoring rule is:
- the score corresponding to each optional planning path is two out of the optional planning paths.
- the path between adjacent nodes is the score under the influence of walking distance, the influence factor of walking time or the influencing factors of obstacles.
- the last selected path can be defined as:
- Score(path i ) refers to the comprehensive score of the path numbered i, and the comprehensive scoring formula of the path is as follows:
- Score(path) g[o(1),o(2),...,o(i),...,o(n)]
- o(i) represents the influencing factors, including the influencing factors of walking distance, the influencing factors of walking time, and the influencing factors of obstacles (for example, difficulty in avoiding obstacles).
- the whole path The rating value of the influencing factors is the sum of the scores for each segment, ie:
- L k,k+1 represents the score of the influencing factor of the path between every two adjacent nodes in the path from A to B.
- path 1 A-L1-L2-L3-B
- path 2 A-M1-M2-M3-B
- path 3 A -N1-N2-N3-B
- the length of the path 1 path is d (path 1 )
- the length of the path 2 path is d ( Path 2 )
- the length of the path 3 path is d(path 3 ).
- the score corresponding to each optional planning path is the score of the path between each two adjacent nodes in the optional planning path, such as the walking distance influencing factor, the walking time influencing factor or the obstacle influencing factor, such as path 1
- the score corresponding to the path is the path A-L1, L1-L2, L2-L3, and L3-B between each two adjacent nodes in the optional planning path.
- scoring formula of the optional planning path is as follows:
- o(t) is the time score of the optional planning path
- o(d) is the distance score of the optional planning path
- a and b are predetermined weights
- the time score of the i-th optional planning path is defined o i (t) is:
- T(path 1 ), T(path 2 )...T(path n ) are the time used by the robot to move to the target point in different alternative planning paths
- T(path i ) is the ith optional planning path.
- the time taken by the lower robot to move to the target point k ti represents the time penalty factor of the i-th optional planning path, which is the time it takes for the robot to bypass the obstacle in the ith optional planning path.
- d i represents the path length of the i-th optional planning path
- v i represents the robot speed in the i-th optional planning path
- P i represents the probability of occurrence of an obstacle in the i-th optional planning path.
- the distance score o i (d) defining the i-th optional planning path is:
- d(path 1 ), d(path 2 )...d(path n ) are the distances that the robot travels to the target point in different alternative planning paths
- k di represents the distance penalty of the i-th alternative planning path.
- the distance penalty factor is the distance that the robot needs to move more than the obstacle in the ith optional planning path.
- the obstacle influencing factors include an obstacle avoidance difficulty coefficient and a probability of occurrence of an obstacle.
- the robot can access the Internet of Things system, and more useful information can be obtained through the system. For example: (1) The robot can get information about the indoor camera of the IoT system server. Because the surveillance camera generally corresponds to a fixed scene. The image processing method is used to process the data of the camera to obtain the number and approximate distribution of dynamic obstacles in a certain area. (2) The Internet of Things system server can statistically organize the data of personnel flow. Through statistical data, it is possible to predict the probability of which people are concentrated in which time periods and in which areas. (3) Further, the robot system can obtain the distribution of indoor dynamic obstacles (such as personnel distribution) through the indoor camera, and refresh the obstacle probability of the path of each section in real time. Therefore, the robot can dynamically select the optimal path according to the existing situation.
- indoor dynamic obstacles such as personnel distribution
- FIG. 6 is a schematic diagram of quantitative calculation of an obstacle influencing factor in an actual index, and the walking path of the robot is divided into several regions. Assume that it is known:
- the corresponding distance penalty coefficient is kd and the time penalty coefficient is kt
- the time scoring formula and distance scoring formula the time and distance scores of each path after the obstacle factor correction can be calculated.
- the comprehensive score of each path can be calculated, as shown in the following table. Four:
- the path with the lowest score is selected, that is, the third path is used as the optimal moving planning path of the robot.
- path planning module 02 is further configured to:
- the path planning system of the robot acquires obstacle information in the current path to be moved from a predetermined area monitoring server (for example, an Internet of Things system server) in real time or at a time, and analyzes the acquired obstacle information according to the obtained obstacle information. Whether there are obstacles or not needs to be moved to avoid. For example, if there is a static obstacle on the path to be moved, it is determined that movement avoidance is required, or if there is a intersection point between the moving path of the dynamic obstacle and the moving path of the robot, it is determined that movement avoidance is required, and the prior art There is a need to analyze whether there is an obstacle based on the acquired obstacle information.
- a predetermined area monitoring server for example, an Internet of Things system server
- the path planning system of the robot detects the obstacle information in the current path to be moved by the obstacle detecting unit (for example, the radar unit) configured by the robot in real time or timing, and analyzes whether there is an obstacle to be performed. Mobile evasion.
- the obstacle detecting unit for example, the radar unit
- the path planning system of the robot takes the current position as the new first position point, and analyzes the new first position point according to the set reference positioning point and according to the predetermined path analysis rule. a path to the second location point and controlling movement of the robot to the second location point based on the analyzed path. (For example, the planned path from point P to point Q shown in Figure 4).
- FIG. 7 is a schematic diagram of the obstacle avoidance of the robot. It is assumed that the robot is to move from point A to point B, and a dynamic obstacle suddenly appears near the point C during the movement. In the prior art, the robot dynamically bypasses the obstacle according to an algorithm and recalculates the new planned path y4 according to the current position. There are some disadvantages to this approach, such as:
- the robot In the process of bypassing the obstacle, the robot needs to constantly calculate the avoidance path and continuously calculate the path from the current position to the target point. This process will consume a lot of computing resources and time.
- the robot cannot know the size of the obstacle in front of the eye, the time it takes to bypass it, and whether there are other obstacles after the bypass. For example, what appears in front of the robot is a long wall of people, and it takes a lot of time to bypass the wall by conventional methods.
- the robot reselects another path by directly selecting other reference positioning points.
- L1 and L2 are reference positioning points.
- the robot can re-select another route C-L1-L2-B to reach point B, that is, the robot can choose not to bypass the obstacle, but choose another route, and select the route. It is more efficient to calculate the route in real time, does not take up a lot of computing resources of the robot, and the response is more timely.
- the selection module 01 pre-selects one or more position points as the reference positioning points on the predetermined area map, and also sets the corresponding position points at the positions corresponding to the respective reference positioning points in the predetermined area map.
- the location point identifier may be a manual location roadmap, eg, for example, the artificial landmark at the location corresponding to the second reference location of the second layer A3 region may be “L1A3P2”, or “L1A32”;
- the position road sign eg, for example, the natural road sign at the position corresponding to the second reference point of the second layer A3 area may be " ⁇ A3".
- the path planning module 02 is further configured to:
- the open location point identification device (such as a camera) starts detecting the location point identifier
- the distance and direction of the robot and the detected position point identification are calculated by the sensor of the robot to obtain the current position and posture of the robot, and the forward direction is calibrated according to the current position and posture of the robot.
- the path planning module 02 is further configured to:
- the current position is in the trigger coordinate area of a target reference positioning point, it is determined that the current position is in the trigger coordinate area of a reference positioning point, or if the current position is not in the trigger coordinate area of a target reference positioning point, then determining The current position is not in the trigger coordinate area of a datum point.
- the robot During the movement of the robot according to the planned path, the robot needs to determine the current position and the target point by positioning. The location, as well as the location of the move, also needs to be confirmed during the move.
- the combination of relative positioning and absolute positioning is now widely used. Because of the inevitable error accumulation problem of relative positioning, it is necessary to use absolute positioning method for calibration. In the relative positioning of the robot, the robot calculates the relative positioning of the sensor based on the previous positioning result and the relative displacement measured by the inertia sensor. Since there will be some error in each positioning, the error will continue to accumulate and become larger and larger, which will eventually lead to unacceptable positioning errors after a period of time. Therefore, the robot needs to calibrate the positioning information in some way at an appropriate time.
- the position point identification is used to calibrate in the reference positioning point mode, and the robot can roughly determine the position of the road sign according to its position.
- the robot recognizes the position point identification, the distance and direction of the robot and the road sign are calculated by the sensor. , get the current position and posture of the robot.
- the robot needs to open the detecting device at all times to search for a location point identifier nearby and perform calibration. Therefore, it is necessary to arrange a large number of location point identifiers in a wide range, and also waste a large amount of computing resources of the robot.
- the arrangement range of the position point identification is reduced to the vicinity of the reference positioning point, and there is no need to arrange a large number of road signs globally, and only the road markings are selectively arranged near the reference positioning point, thereby effectively reducing The number of road signs arranged to prevent confusion of other types of signs caused by the layout of a large number of road signs.
- the position point of each reference anchor point is identified as a picture corresponding to the unique coordinates (a, b) in the map.
- a camera is mounted on the top of the robot to identify the location point identification picture.
- the robot captures the position point identification picture, the relative coordinates (m, n) of the robot relative to the target picture can be obtained, and the robot can obtain its current coordinate (a+m, b+n) and use the coordinate as Current accurate coordinates for coordinate calibration.
- the robot in order to not miss the location point identification during the movement, the robot will open the top camera in real time and continuously process the video.
- the camera opens the capturing position point identification for calibration if and only if the robot enters the triggering coordinate area of the reference positioning point, that is, the triggering radius. Therefore, the present embodiment gives the timing of the robot calibration by setting the trigger coordinate area of the reference positioning point, and facilitates the control of the robot, thereby reducing the calculation amount and resource consumption.
- an implementation manner is that the robot uses the current coordinates and the coordinates of each of the reference positioning points in the database to calculate, and determines the current coordinates and Whether the coordinates of a datum point are smaller than the trigger radius.
- the map and the reference positioning point are divided and classified, and all the reference positioning points are not queried during the query, but only the area where the area is located is determined, and only the reference positioning points constituting the area are determined. Make queries, which greatly reduces the amount of calculation per query.
- FIG. 8 is a schematic diagram of a reference positioning area division and a trigger radius.
- the calibration scheme includes the following steps:
- the map is segmented into a plurality of polygonal regions 1, 2, ... using a reference positioning point r, each of which has a trigger radius R of a corresponding radius.
- the robot determines in which region the current coordinates are located. For example, the robot in Figure 8 is currently located in the area numbered 5.
- the robot when the robot is in a certain polygon area, the robot will query at time interval t to confirm whether its current coordinates are in the trigger radius of the reference point of the corner point of the area.
- the current coordinates of the robot are located in a square area numbered 5, and the robot will only query the area where the current coordinates are at the reference positioning points of the four corner points constituting the area (ie, numbered A, B, C, D is the area formed by the four reference positioning points).
- the robot will open the position point identification device (such as the camera) to start detecting the position point identification.
- the robot will calibrate the current coordinates by the calculated coordinate information.
- the foregoing embodiment method can be implemented by means of software plus a necessary general hardware platform, and can also be implemented by hardware, but in many cases, the former is A better implementation.
- the technical solution of the present invention which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk,
- the optical disc includes a number of instructions for causing a terminal device (which may be a cell phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the methods described in various embodiments of the present invention.
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Aviation & Aerospace Engineering (AREA)
- Business, Economics & Management (AREA)
- Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- Evolutionary Computation (AREA)
- Game Theory and Decision Science (AREA)
- Medical Informatics (AREA)
- Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)
- Manipulator (AREA)
- Navigation (AREA)
Abstract
Description
路径 | 距离d | 速度v | 时间t | kd | kt | P |
L1-L2 | 55.0 | 3.0 | 18.3 | 1.5 | 5.0 | 0.8 |
L2-L3 | 55.0 | 3.0 | 18.3 | 1.5 | 5.0 | 0.8 |
M1-M2 | 50.0 | 3.0 | 16.7 | 2.0 | 8.0 | 0.6 |
M2-M3 | 50.0 | 3.0 | 16.7 | 2.0 | 8.0 | 0.6 |
N1-N2 | 70.0 | 3.0 | 23.3 | 1.5 | 5.0 | 0.3 |
N2-N3 | 70.0 | 3.0 | 23.3 | 1.5 | 5.0 | 0.3 |
路径 | 距离d | 速度v | 时间t | kd | kt | P |
L1-L2 | 55.0 | 3.0 | 18.3 | 1.5 | 5.0 | 0.8 |
L2-L3 | 55.0 | 3.0 | 18.3 | 1.5 | 5.0 | 0.8 |
M1-M2 | 50.0 | 3.0 | 16.7 | 2.0 | 8.0 | 0.6 |
M2-M3 | 50.0 | 3.0 | 16.7 | 2.0 | 8.0 | 0.6 |
N1-N2 | 70.0 | 3.0 | 23.3 | 1.5 | 5.0 | 0.3 |
N2-N3 | 70.0 | 3.0 | 23.3 | 1.5 | 5.0 | 0.3 |
Claims (20)
- 一种机器人的路径规划***,运行于机器人中,其特征在于,所述路径规划***包括:选择模块,用于在预先确定的区域地图中可供机器人移动的路径上预先选择一个或多个位置点作为基准定位点;路径规划模块,用于若接收到将所述机器人从第一位置点移动到第二位置点的指令,则根据设置的基准定位点并按照预先确定的路径分析规则,分析出从所述第一位置点到所述第二位置点的路径,并基于分析出的路径控制所述机器人运动到所述第二位置点。
- 如权利要求1所述的路径规划***,其特征在于,所述预先确定的路径分析规则包括:确定距离所述第一位置点最近的第一基准定位点,及距离所述第二位置点最近的第二基准定位点;为所述第一位置点至所述第一基准定位点,以及所述第二位置点至所述第二基准定位点的路径按照预设的第一规划方式进行规划;为所述第一基准定位点至所述第二基准定位点的路径按照预设的第二规划方式进行规划,得到第二规划路径。
- 如权利要求2所述的路径规划***,其特征在于,所述第一规划方式包括:若所述第一位置点与所述第一基准定位点之间无障碍物,则取所述第一位置点与所述第一基准定位点之间的直线路径;若所述第二位置点与所述第二基准定位点之间无障碍物,则取所述第二位置点与所述第二基准定位点之间的直线路径;若所述第一位置点与所述第一基准定位点之间有障碍物,则取所述第一位置点与所述第一基准定位点之间的绕过障碍物的最短路径;若所述第二位置点与所述第二基准定位点之间有障碍物,则取所述第一位置点与所述第一基准定位点之间的绕过障碍物的最短路径。
- 如权利要求2所述的路径规划***,其特征在于,所述第二规划方式包括如下步骤:h1、根据预先确定的第一基准定位点、第二基准定位点及可选规划路径的映射关系,确定第一基准定位点和第二基准定位点对应的可选规划路径;h2、按照预先确定的评分规则计算出各个可选规划路径对应的分值;h3、若最高分值的可选规划路径只有一个,则将该可选规划路径作为第一基准定位点至第二基准定位点的第二规划路径;h4、若最高分值的可选规划路径有多个,则从多个最高分值的可选规划路径中随机选择一个可选规划路径作为第一基准定位点至第二基准定位点的第二规划路径。
- 如权利要求4所述的路径规划***,其特征在于,所述步骤h1和h2之间,还包括如下步骤:从各个可选规划路径中,筛选出包含预先确定的特定基准定位点的可选规划路径,并将筛选出的可选规划路径作为待计算分值的可选规划路径;及/或,根据预先确定的计算公式分别计算出各个可选规划路径对应的总长度,并分别计算出各个可选规划路径的总长度与第一基准定位点至第二基准定位点的最短路径的总长度的差值,将差值小于预设阈值的可选规划路径筛选出来作为待计算分值的可选规划路径。
- 如权利要求4所述的路径规划***,其特征在于,所述步骤h2包括:根据各个可选规划路径对应的行走距离影响因素、行走时间影响因素和/或障碍物影响因素进行评分;其中,每一可选规划路径对应的分值为该可选规划路径中每两个相邻节点之间的路径在行走距离影响因素、行走时间影响因素或障碍物影响因素下的评分和。
- 如权利要求6所述的路径规划***,其特征在于,可选规划路径的评分公式如下:Score(path)=a·o(t)+b·o(d)其中,o(t)为可选规划路径的时间评分,o(d)为可选规划路径的距离评分,a、b为预先确定的权值;定义第i个可选规划路径的时间评分oi(t)为:其中,T(path1)、T(path2)……T(pathn)是不同可选规划路径下机器人移动到目标点所使用的时间,T(pathi)是第i个可选规划路径下机器人移动到目标点所使用的时间,kti代表第i个可选规划路径的时间惩罚系数,该时间惩罚系数为机器人在第i个可选规划路径内绕过障碍物需要多花费的时间,di代表第i个可选规划路径的路径长度,vi代表第i个可选规划路径内的机器人速度,Pi代表第i个可选规划路径内出现障碍物的概率;定义第i个可选规划路径的距离评分oi(d)为:d(pathi)=∑(kdi·di·Pi+di·(1-Pi))其中,d(path1)、d(path2)……d(pathn)是不同可选规划路径下机器人移动到目标点所行走的距离,kdi代表第i个可选规划路径的距离惩罚系数,该距离惩罚系数为机器人在第i个可选规划路径内绕过障碍物需要多移动的距离。
- 如权利要求1-7任一项所述的路径规划***,其特征在于,所述路径规划模块还用于:实时或者定时分析当前待移动的路径中是否存在障碍物需要进行移动规避;若分析存在障碍物需要进行移动规避,则将当前位置作为新的第一位置点,根据设置的基准定位点并按照预先确定的路径分析规则,分析出从新的第一位置点到所述第二位置点的路径,并基于分析出的路径控制机器人运动到所述第二位置点。
- 如权利要求1-7任一项所述的路径规划***,其特征在于,所述选择模块还用于:在预先确定的区域地图中各个基准定位点对应的位置处设置对应的位置点标识;所述路径规划模块还用于:实时或者定时进行位置定位;根据预先确定的基准定位点与触发坐标区域的映射关系,分析当前位置是否处于一个基准定位点的触发坐标区域中;若当前位置处于一个基准定位点的触发坐标区域中,则开启位置点标识识别设备开始检测位置点标识;当检测到位置点标识时,通过机器人的传感器计算出机器人与检测的位置点标识的距离和方向,以得到机器人当前的位置和姿态,并根据机器人当前的位置和姿态对前进方向进行校准。
- 一种机器人的路径规划方法,其特征在于,所述方法包括以下步骤:机器人的路径规划***在预先确定的区域地图中可供机器人移动的路径上预先选择一个或多个位置点作为基准定位点;若接收到将所述机器人从第一位置点移动到第二位置点的指令,则根据设置的基准定位点并按照预先确定的路径分析规则,分析出从所述第一位置点到所述第二位置点的路径,并基于分析出的路径控制所述机器人运动到所述第二位置点。
- 一种机器人,包括处理设备、存储设备,该存储设备中存储有机器人的路径规划 ***,该机器人的路径规划***包括至少一个计算机可读指令,该至少一个计算机可读指令可被所述处理设备执行,以实现以下操作:在预先确定的区域地图中可供机器人移动的路径上预先选择一个或多个位置点作为基准定位点;若接收到将所述机器人从第一位置点移动到第二位置点的指令,则根据设置的基准定位点并按照预先确定的路径分析规则,分析出从所述第一位置点到所述第二位置点的路径,并基于分析出的路径控制所述机器人运动到所述第二位置点。
- 如权利要求11所述的机器人,其特征在于,所述预先确定的路径分析规则包括:确定距离所述第一位置点最近的第一基准定位点,及距离所述第二位置点最近的第二基准定位点;为所述第一位置点至所述第一基准定位点,以及所述第二位置点至所述第二基准定位点的路径按照预设的第一规划方式进行规划;为所述第一基准定位点至所述第二基准定位点的路径按照预设的第二规划方式进行规划,得到第二规划路径。
- 如权利要求12所述的机器人,其特征在于,所述第一规划方式包括:若所述第一位置点与所述第一基准定位点之间无障碍物,则取所述第一位置点与所述第一基准定位点之间的直线路径;若所述第二位置点与所述第二基准定位点之间无障碍物,则取所述第二位置点与所述第二基准定位点之间的直线路径;若所述第一位置点与所述第一基准定位点之间有障碍物,则取所述第一位置点与所述第一基准定位点之间的绕过障碍物的最短路径;若所述第二位置点与所述第二基准定位点之间有障碍物,则取所述第一位置点与所述第一基准定位点之间的绕过障碍物的最短路径。
- 如权利要求12所述的机器人,其特征在于,所述第二规划方式包括如下操作:h1、根据预先确定的第一基准定位点、第二基准定位点及可选规划路径的映射关系,确定第一基准定位点和第二基准定位点对应的可选规划路径;h2、按照预先确定的评分规则计算出各个可选规划路径对应的分值;h3、若最高分值的可选规划路径只有一个,则将该可选规划路径作为第一基准定位点至第二基准定位点的第二规划路径;h4、若最高分值的可选规划路径有多个,则从多个最高分值的可选规划路径中随机选择一个可选规划路径作为第一基准定位点至第二基准定位点的第二规划路径。
- 如权利要求14所述的机器人,其特征在于,所述至少一个计算机可读指令还可被所述处理设备执行,在实现所述操作h1和h2之间,还实现如下操作:从各个可选规划路径中,筛选出包含预先确定的特定基准定位点的可选规划路径,并将筛选出的可选规划路径作为待计算分值的可选规划路径;及/或,根据预先确定的计算公式分别计算出各个可选规划路径对应的总长度,并分别计算出各个可选规划路径的总长度与第一基准定位点至第二基准定位点的最短路径的总长度的差值,将差值小于预设阈值的可选规划路径筛选出来作为待计算分值的可选规划路径。
- 如权利要求14所述的机器人,其特征在于,所述至少一个计算机可读指令被所述处理设备执行,实现所述操作h2包括:根据各个可选规划路径对应的行走距离影响因素、行走时间影响因素和/或障碍物影响因素进行评分;其中,每一可选规划路径对应的分值为该可选规划路径中每两个相邻节点之间的路径在行走距离影响因素、行走时间影响因素或障碍物影响因素下的评分和。
- 如权利要求16所述的机器人,其特征在于,可选规划路径的评分公式如下:Score(path)=a·o(t)+b·o(d)其中,o(t)为可选规划路径的时间评分,o(d)为可选规划路径的距离评分,a、b为 预先确定的权值;定义第i个可选规划路径的时间评分oi(t)为:其中,T(path1)、T(path2)……T(pathn)是不同可选规划路径下机器人移动到目标点所使用的时间,T(pathi)是第i个可选规划路径下机器人移动到目标点所使用的时间,kti代表第i个可选规划路径的时间惩罚系数,该时间惩罚系数为机器人在第i个可选规划路径内绕过障碍物需要多花费的时间,di代表第i个可选规划路径的路径长度,vi代表第i个可选规划路径内的机器人速度,Pi代表第i个可选规划路径内出现障碍物的概率;定义第i个可选规划路径的距离评分oi(d)为:d(pathi)=∑(kdi·di·Pi+di·(1-Pi))其中,d(path1)、d(path2)……d(pathn)是不同可选规划路径下机器人移动到目标点所行走的距离,kdi代表第i个可选规划路径的距离惩罚系数,该距离惩罚系数为机器人在第i个可选规划路径内绕过障碍物需要多移动的距离。
- 如权利要求11-17任一项所述的机器人,其特征在于,所述至少一个计算机可读指令还可被所述处理设备执行,以实现以下操作:实时或者定时分析当前待移动的路径中是否存在障碍物需要进行移动规避;若分析存在障碍物需要进行移动规避,则将当前位置作为新的第一位置点,根据设置的基准定位点并按照预先确定的路径分析规则,分析出从新的第一位置点到所述第二位置点的路径,并基于分析出的路径控制机器人运动到所述第二位置点。
- 如权利要求11-17任一项所述的机器人,其特征在于,所述至少一个计算机可读指令还可被所述处理设备执行,以实现以下操作:在预先确定的区域地图中各个基准定位点对应的位置处设置对应的位置点标识;实时或者定时进行位置定位;根据预先确定的基准定位点与触发坐标区域的映射关系,分析当前位置是否处于一个基准定位点的触发坐标区域中;若当前位置处于一个基准定位点的触发坐标区域中,则开启位置点标识识别设备开始检测位置点标识;当检测到位置点标识时,通过机器人的传感器计算出机器人与检测的位置点标识的距离和方向,以得到机器人当前的位置和姿态,并根据机器人当前的位置和姿态对前进方向进行校准。
- 一种计算机可读存储介质,其上存储有至少一个可被处理设备执行,以实现以下操作的计算机可读指令:在预先确定的区域地图中可供机器人移动的路径上预先选择一个或多个位置点作为基准定位点;若接收到将所述机器人从第一位置点移动到第二位置点的指令,则根据设置的基准定位点并按照预先确定的路径分析规则,分析出从所述第一位置点到所述第二位置点的路径,并基于分析出的路径控制所述机器人运动到所述第二位置点。
Priority Applications (6)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
SG11201900262RA SG11201900262RA (en) | 2017-04-11 | 2017-06-30 | Path planning system and method for robot, robot and medium |
KR1020187023692A KR102152192B1 (ko) | 2017-04-11 | 2017-06-30 | 로봇의 경로 계획 시스템, 방법, 로봇 및 매체 |
JP2018541387A JP6800989B2 (ja) | 2017-04-11 | 2017-06-30 | ロボットの経路計画システム、方法、ロボット及び媒体 |
EP17899233.5A EP3438611B1 (en) | 2017-04-11 | 2017-06-30 | Path planning system and method for robot, robot and storage medium |
US16/084,245 US11035684B2 (en) | 2017-04-11 | 2017-06-30 | Path planning system and method for robot, robot and medium |
AU2017409109A AU2017409109B9 (en) | 2017-04-11 | 2017-06-30 | Path planning system and method for robot, robot and storage medium |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710232929.0A CN107677285B (zh) | 2017-04-11 | 2017-04-11 | 机器人的路径规划***及方法 |
CN201710232929.0 | 2017-04-11 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2018188200A1 true WO2018188200A1 (zh) | 2018-10-18 |
Family
ID=61133560
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2017/091370 WO2018188200A1 (zh) | 2017-04-11 | 2017-06-30 | 机器人的路径规划***、方法、机器人及存储介质 |
Country Status (9)
Country | Link |
---|---|
US (1) | US11035684B2 (zh) |
EP (1) | EP3438611B1 (zh) |
JP (1) | JP6800989B2 (zh) |
KR (1) | KR102152192B1 (zh) |
CN (1) | CN107677285B (zh) |
AU (1) | AU2017409109B9 (zh) |
SG (1) | SG11201900262RA (zh) |
TW (1) | TWI639813B (zh) |
WO (1) | WO2018188200A1 (zh) |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111906779A (zh) * | 2020-06-30 | 2020-11-10 | 珠海市一微半导体有限公司 | 一种越障结束判断方法、越障控制方法、芯片及机器人 |
CN112346444A (zh) * | 2019-07-21 | 2021-02-09 | 长沙智能驾驶研究院有限公司 | 智慧工地的锥桶控制方法、装置、***和计算机设备 |
CN112748733A (zh) * | 2020-12-16 | 2021-05-04 | 广东电网有限责任公司 | 电缆放线车路径规划方法、装置、设备及存储介质 |
CN112947411A (zh) * | 2021-01-26 | 2021-06-11 | 清华大学深圳国际研究生院 | 基于RFID与ROS-Slam的博物馆藏品智能巡检***与方法 |
US11224972B2 (en) | 2019-11-22 | 2022-01-18 | Fanuc Corporation | State machine for dynamic path planning |
WO2024131052A1 (zh) * | 2022-12-23 | 2024-06-27 | 广东深蓝水下特种设备科技有限公司 | 基于水下声呐定位的船舶清洗方法、***及介质 |
Families Citing this family (43)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108415436A (zh) * | 2018-04-09 | 2018-08-17 | 重庆鲁班机器人技术研究院有限公司 | 机器人引导方法、装置及机器人 |
CN108717302B (zh) * | 2018-05-14 | 2021-06-25 | 平安科技(深圳)有限公司 | 机器人跟随人物方法、装置及存储介质、机器人 |
CN108780320A (zh) * | 2018-06-15 | 2018-11-09 | 深圳前海达闼云端智能科技有限公司 | 机器人运动控制方法、装置、存储介质及机器人 |
CN109077667B (zh) * | 2018-07-16 | 2020-12-01 | 广州俊德信息科技有限公司 | 清洁电器的调整方法、***、可存储介质和清洁电器 |
CN109101017A (zh) * | 2018-07-27 | 2018-12-28 | 江苏盛海智能科技有限公司 | 一种无人车寻迹路线规划方法及终端 |
CN109163613A (zh) * | 2018-08-28 | 2019-01-08 | 联誉信息股份有限公司 | 一种智能打靶机器人 |
CN109068278B (zh) * | 2018-08-31 | 2023-02-28 | 平安科技(深圳)有限公司 | 室内避障方法、装置、计算机设备及存储介质 |
WO2020132927A1 (zh) * | 2018-12-26 | 2020-07-02 | 深圳市柔宇科技有限公司 | 广告路径规划方法、穿戴装置、服务器及相关装置 |
US11338438B2 (en) * | 2019-01-25 | 2022-05-24 | Bear Robotics, Inc. | Method, system and non-transitory computer-readable recording medium for determining a movement path of a robot |
CN109933857B (zh) * | 2019-02-19 | 2023-07-04 | 飞腾信息技术有限公司 | 感知集成电路布局信息的时钟树主干拓扑生成方法及*** |
US11249492B2 (en) * | 2019-03-26 | 2022-02-15 | Intel Corporation | Methods and apparatus to facilitate autonomous navigation of robotic devices |
CN109822597B (zh) * | 2019-04-14 | 2021-01-19 | 北京中大科慧科技发展有限公司 | 一种数据中心的全自动智能巡检机器人 |
CN110221608B (zh) * | 2019-05-23 | 2021-10-01 | ***股份有限公司 | 一种巡检设备的方法及装置 |
JP7124797B2 (ja) * | 2019-06-28 | 2022-08-24 | トヨタ自動車株式会社 | 機械学習方法および移動ロボット |
CN110599089B (zh) * | 2019-08-30 | 2020-11-03 | 北京三快在线科技有限公司 | 隔离带位置确定方法、装置、存储介质和电子设备 |
CN112631209A (zh) * | 2019-10-08 | 2021-04-09 | 北京京东乾石科技有限公司 | 用于控制无人搬运车的方法和装置 |
CN112817269A (zh) * | 2019-11-15 | 2021-05-18 | 深圳拓邦股份有限公司 | 一种遍历作业方法、***及机器人设备 |
CN111177291B (zh) * | 2019-12-23 | 2021-12-14 | 腾讯科技(深圳)有限公司 | 一种对象移动方法、装置、设备及介质 |
JP7487478B2 (ja) * | 2020-01-23 | 2024-05-21 | セイコーエプソン株式会社 | 移動ロボットの制御方法及び制御装置、並びに、ロボットシステム |
US11438886B2 (en) * | 2020-02-27 | 2022-09-06 | Psj International Ltd. | System for establishing positioning map data and method for the same |
CN111694353A (zh) * | 2020-05-14 | 2020-09-22 | 特斯联科技集团有限公司 | 一种导引控制方法、装置、存储介质及服务机器人 |
CN111930113A (zh) * | 2020-06-30 | 2020-11-13 | 创新工场(北京)企业管理股份有限公司 | 一种为自主导航机器人设置行驶路径的方法与装置 |
CN111938513B (zh) * | 2020-06-30 | 2021-11-09 | 珠海市一微半导体有限公司 | 一种机器人越障的沿边路径选择方法、芯片及机器人 |
CN111813123A (zh) * | 2020-07-17 | 2020-10-23 | 徐州泰丰泵业有限公司 | 一种喷灌机行走控制***和控制方法 |
CN111906765B (zh) * | 2020-07-31 | 2022-07-12 | 平安科技(深圳)有限公司 | 应用于路径规划的空间采样方法、装置、设备及介质 |
CN112201072A (zh) * | 2020-09-30 | 2021-01-08 | 姜锡忠 | 城市交通路径规划方法及*** |
CN112256039B (zh) * | 2020-11-05 | 2023-05-26 | 深圳市锐曼智能装备有限公司 | 清洁机器人操控***及清扫路线的生成方法 |
CN112370158B (zh) * | 2020-11-13 | 2022-03-11 | 毕建平 | 一种机器人骨折复位路径规划方法、规划***及机器人 |
CN113156933B (zh) * | 2020-12-30 | 2022-05-03 | 徐宁 | 一种机器人行进控制***和方法 |
JP2022188993A (ja) * | 2021-06-10 | 2022-12-22 | 株式会社日立製作所 | 経路探索情報処理システム、経路探索情報処理方法 |
CN113807790A (zh) * | 2021-09-26 | 2021-12-17 | 上海擎朗智能科技有限公司 | 一种机器人的路径规划方法、装置、电子设备和存储介质 |
CN113842086B (zh) * | 2021-09-28 | 2022-12-06 | 深圳市云鼠科技开发有限公司 | 一种清洁方法、拖地机器人及清洁*** |
CN113892863B (zh) * | 2021-10-08 | 2022-11-01 | 珠海格力电器股份有限公司 | 路径规划方法、装置、电子设备和存储介质 |
CN113970321A (zh) * | 2021-10-21 | 2022-01-25 | 北京房江湖科技有限公司 | 一种户型动线的计算方法及装置 |
CN114115239B (zh) * | 2021-11-03 | 2024-04-12 | 中国科学院重庆绿色智能技术研究院 | 一种机器人路径规划方法、***、设备及介质 |
TWI806237B (zh) * | 2021-11-11 | 2023-06-21 | 國立虎尾科技大學 | 機器人系統及機器人控制方法 |
CN114260891B (zh) * | 2021-12-16 | 2024-06-11 | 珠海格力电器股份有限公司 | 一种机器人控制方法、装置、电子设备及存储介质 |
CN116774686A (zh) * | 2022-03-10 | 2023-09-19 | 苏州科瓴精密机械科技有限公司 | 机器人寻路方法、寻路装置、设备和计算机可读存储介质 |
CN116388691B (zh) * | 2023-04-07 | 2023-10-20 | 宁夏百川电力股份有限公司 | 一种光伏发电场智能巡检方法及*** |
CN116540709B (zh) * | 2023-05-11 | 2023-11-14 | 江苏博发机器人智能装备有限公司 | 一种基于机器人编队的避障路径规划方法 |
CN117093011B (zh) * | 2023-10-20 | 2024-01-05 | 苏州德斯米尔智能科技有限公司 | 一种智能机器人无人清洗控制方法 |
CN117250965B (zh) * | 2023-11-20 | 2024-02-23 | 广东电网有限责任公司佛山供电局 | 一种机器人避障快速路径重构方法和*** |
CN118149828B (zh) * | 2024-05-10 | 2024-07-09 | 君华高科(成都)信息技术有限公司 | 一种巡检机器人的路径规划***及方法 |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2004067232A2 (en) * | 2003-01-31 | 2004-08-12 | Thermo Crs Ltd. | Syntactic inferential motion planning method for robotic systems |
CN103294054A (zh) * | 2012-02-24 | 2013-09-11 | 联想(北京)有限公司 | 一种机器人导航方法及*** |
CN103605368A (zh) * | 2013-12-04 | 2014-02-26 | 苏州大学张家港工业技术研究院 | 一种动态未知环境中路径规划方法及装置 |
CN104416569A (zh) * | 2013-08-28 | 2015-03-18 | 鸿富锦精密工业(深圳)有限公司 | 机器人控制***、机器人及机器人控制方法 |
CN105955267A (zh) * | 2016-05-11 | 2016-09-21 | 上海慧流云计算科技有限公司 | 一种移动控制方法及*** |
Family Cites Families (35)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5978730A (en) * | 1997-02-20 | 1999-11-02 | Sony Corporation | Caching for pathfinding computation |
JP3359008B2 (ja) * | 1999-08-20 | 2002-12-24 | 三菱重工業株式会社 | 無人搬送車の走行制御システム |
JP2002133351A (ja) * | 2000-10-25 | 2002-05-10 | Nec Corp | 最小コスト経路探索装置及びそれに用いる最小コスト経路探索方法 |
US6615133B2 (en) * | 2001-02-27 | 2003-09-02 | International Business Machines Corporation | Apparatus, system, method and computer program product for determining an optimum route based on historical information |
US7447593B2 (en) * | 2004-03-26 | 2008-11-04 | Raytheon Company | System and method for adaptive path planning |
KR100745975B1 (ko) * | 2004-12-30 | 2007-08-06 | 삼성전자주식회사 | 그리드 맵을 사용하여 최소 이동 경로로 이동하는 방법 및장치 |
JP2007094743A (ja) * | 2005-09-28 | 2007-04-12 | Zmp:Kk | 自律移動型ロボットとそのシステム |
JP4143103B2 (ja) * | 2006-12-20 | 2008-09-03 | 本田技研工業株式会社 | 移動装置、ならびにその制御システム、制御プログラムおよび監督システム |
JP4661838B2 (ja) * | 2007-07-18 | 2011-03-30 | トヨタ自動車株式会社 | 経路計画装置及び方法、コスト評価装置、並びに移動体 |
US8417446B2 (en) | 2008-07-25 | 2013-04-09 | Navteq B.V. | Link-node maps based on open area maps |
US8825387B2 (en) * | 2008-07-25 | 2014-09-02 | Navteq B.V. | Positioning open area maps |
JP4745378B2 (ja) | 2008-12-08 | 2011-08-10 | 株式会社東芝 | 移動台車 |
TWI388956B (zh) * | 2009-05-20 | 2013-03-11 | Univ Nat Taiwan Science Tech | 行動機器人與其目標物處理路徑的規劃方法 |
KR100988833B1 (ko) * | 2009-07-06 | 2010-10-20 | 유티정보 주식회사 | 신호연동정보를 이용한 네비게이션 시스템 |
KR101667029B1 (ko) * | 2009-08-10 | 2016-10-17 | 삼성전자 주식회사 | 로봇의 경로 계획방법 및 장치 |
KR101667030B1 (ko) * | 2009-08-10 | 2016-10-17 | 삼성전자 주식회사 | 로봇의 경로 계획 장치 및 그 방법 |
EP2478335B1 (de) * | 2009-09-18 | 2015-08-05 | Deutsches Zentrum für Luft- und Raumfahrt e.V. (DLR) | Verfahren zur erstellung einer karte bezüglich ortsbezogener angaben über die wahrscheinlichkeit der zukünftigen bewegung einer person |
JP2011175393A (ja) * | 2010-02-24 | 2011-09-08 | Toyota Motor Corp | 経路計画装置、自律移動ロボット、及び移動経路の計画方法 |
US9323250B2 (en) * | 2011-01-28 | 2016-04-26 | Intouch Technologies, Inc. | Time-dependent navigation of telepresence robots |
JP5776440B2 (ja) * | 2011-08-24 | 2015-09-09 | 株式会社豊田中央研究所 | 自律移動体 |
US9167386B2 (en) | 2012-06-26 | 2015-10-20 | The Governing Council Of The University Of Toronto | System, method and computer program for dynamic generation of a radio map |
GB2505464B (en) * | 2012-08-31 | 2019-12-18 | Bae Systems Plc | Route planning |
KR102009482B1 (ko) * | 2012-10-30 | 2019-08-14 | 한화디펜스 주식회사 | 로봇의 경로계획 장치와 방법 및 상기 방법을 구현하는 프로그램이 기록된 기록 매체 |
CN103838240B (zh) * | 2012-11-27 | 2018-02-27 | 联想(北京)有限公司 | 控制方法和电子设备 |
WO2014172320A1 (en) * | 2013-04-15 | 2014-10-23 | Flextronics Ap, Llc | Vehicle location-based home automation triggers |
KR101743072B1 (ko) * | 2015-06-12 | 2017-06-15 | 국방과학연구소 | 경로 계획 장치 및 그의 제어방법 |
CN105549585B (zh) * | 2015-12-07 | 2018-03-23 | 江苏木盟智能科技有限公司 | 机器人导航方法及*** |
CN106168803A (zh) * | 2016-04-18 | 2016-11-30 | 深圳众为兴技术股份有限公司 | 一种用于移动机器人的位置感知方法 |
US10394244B2 (en) * | 2016-05-26 | 2019-08-27 | Korea University Research And Business Foundation | Method for controlling mobile robot based on Bayesian network learning |
CN105974928B (zh) * | 2016-07-29 | 2018-12-07 | 哈尔滨工大服务机器人有限公司 | 一种机器人导航路径规划方法 |
CN106323299B (zh) * | 2016-08-09 | 2021-05-14 | Tcl科技集团股份有限公司 | 一种导航方法、装置和*** |
CN106382944B (zh) * | 2016-10-08 | 2019-11-01 | 浙江国自机器人技术有限公司 | 一种移动机器人的路线规划方法 |
CN106547272B (zh) * | 2016-10-26 | 2019-12-03 | 北京京东尚科信息技术有限公司 | 确定设备移动路径的方法和装置 |
CN106444769B (zh) * | 2016-10-31 | 2019-05-21 | 湖南大学 | 一种室内移动机器人增量式环境信息采样的最优路径规划方法 |
JP6640777B2 (ja) * | 2017-03-17 | 2020-02-05 | 株式会社東芝 | 移動制御システム、移動制御装置及びプログラム |
-
2017
- 2017-04-11 CN CN201710232929.0A patent/CN107677285B/zh active Active
- 2017-06-30 JP JP2018541387A patent/JP6800989B2/ja active Active
- 2017-06-30 US US16/084,245 patent/US11035684B2/en active Active
- 2017-06-30 SG SG11201900262RA patent/SG11201900262RA/en unknown
- 2017-06-30 KR KR1020187023692A patent/KR102152192B1/ko active IP Right Grant
- 2017-06-30 WO PCT/CN2017/091370 patent/WO2018188200A1/zh active Application Filing
- 2017-06-30 EP EP17899233.5A patent/EP3438611B1/en active Active
- 2017-06-30 AU AU2017409109A patent/AU2017409109B9/en active Active
- 2017-10-13 TW TW106135249A patent/TWI639813B/zh active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2004067232A2 (en) * | 2003-01-31 | 2004-08-12 | Thermo Crs Ltd. | Syntactic inferential motion planning method for robotic systems |
CN103294054A (zh) * | 2012-02-24 | 2013-09-11 | 联想(北京)有限公司 | 一种机器人导航方法及*** |
CN104416569A (zh) * | 2013-08-28 | 2015-03-18 | 鸿富锦精密工业(深圳)有限公司 | 机器人控制***、机器人及机器人控制方法 |
CN103605368A (zh) * | 2013-12-04 | 2014-02-26 | 苏州大学张家港工业技术研究院 | 一种动态未知环境中路径规划方法及装置 |
CN105955267A (zh) * | 2016-05-11 | 2016-09-21 | 上海慧流云计算科技有限公司 | 一种移动控制方法及*** |
Non-Patent Citations (1)
Title |
---|
See also references of EP3438611A4 |
Cited By (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112346444A (zh) * | 2019-07-21 | 2021-02-09 | 长沙智能驾驶研究院有限公司 | 智慧工地的锥桶控制方法、装置、***和计算机设备 |
CN112346444B (zh) * | 2019-07-21 | 2023-06-13 | 长沙智能驾驶研究院有限公司 | 智慧工地的锥桶控制方法、装置、***和计算机设备 |
US11224972B2 (en) | 2019-11-22 | 2022-01-18 | Fanuc Corporation | State machine for dynamic path planning |
CN111906779A (zh) * | 2020-06-30 | 2020-11-10 | 珠海市一微半导体有限公司 | 一种越障结束判断方法、越障控制方法、芯片及机器人 |
CN111906779B (zh) * | 2020-06-30 | 2022-05-10 | 珠海一微半导体股份有限公司 | 一种越障结束判断方法、越障控制方法、芯片及机器人 |
CN112748733A (zh) * | 2020-12-16 | 2021-05-04 | 广东电网有限责任公司 | 电缆放线车路径规划方法、装置、设备及存储介质 |
CN112748733B (zh) * | 2020-12-16 | 2024-05-07 | 广东电网有限责任公司 | 电缆放线车路径规划方法、装置、设备及存储介质 |
CN112947411A (zh) * | 2021-01-26 | 2021-06-11 | 清华大学深圳国际研究生院 | 基于RFID与ROS-Slam的博物馆藏品智能巡检***与方法 |
CN112947411B (zh) * | 2021-01-26 | 2023-09-12 | 清华大学深圳国际研究生院 | 基于RFID与ROS-Slam的博物馆藏品智能巡检***与方法 |
WO2024131052A1 (zh) * | 2022-12-23 | 2024-06-27 | 广东深蓝水下特种设备科技有限公司 | 基于水下声呐定位的船舶清洗方法、***及介质 |
Also Published As
Publication number | Publication date |
---|---|
SG11201900262RA (en) | 2019-02-27 |
KR20190019897A (ko) | 2019-02-27 |
TW201837428A (zh) | 2018-10-16 |
EP3438611A4 (en) | 2019-09-11 |
AU2017409109B9 (en) | 2020-04-09 |
AU2017409109A1 (en) | 2018-11-08 |
US20210080272A1 (en) | 2021-03-18 |
US11035684B2 (en) | 2021-06-15 |
JP2019521401A (ja) | 2019-07-25 |
CN107677285A (zh) | 2018-02-09 |
EP3438611A1 (en) | 2019-02-06 |
JP6800989B2 (ja) | 2020-12-16 |
CN107677285B (zh) | 2019-05-28 |
AU2017409109B2 (en) | 2019-12-05 |
KR102152192B1 (ko) | 2020-09-07 |
TWI639813B (zh) | 2018-11-01 |
EP3438611B1 (en) | 2020-12-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2018188200A1 (zh) | 机器人的路径规划***、方法、机器人及存储介质 | |
US10953545B2 (en) | System and method for autonomous navigation using visual sparse map | |
Vysotska et al. | Lazy data association for image sequences matching under substantial appearance changes | |
CN109491375A (zh) | 用于自动驾驶车辆的基于驾驶场景的路径规划 | |
CN102638675B (zh) | 一种利用多视点视频进行目标跟踪的方法和*** | |
US11500391B2 (en) | Method for positioning on basis of vision information and robot implementing same | |
CN109489675A (zh) | 用于自动驾驶车辆的基于成本的路径规划 | |
CN107894773A (zh) | 一种移动机器人的导航方法、***及相关装置 | |
Kala | Rapidly exploring random graphs: motion planning of multiple mobile robots | |
CN109557919B (zh) | 一种融合人工路标信息的可变宽栅格地图构建方法 | |
CN110174112B (zh) | 一种用于移动机器人自动建图任务的路径优化方法 | |
CN110986945B (zh) | 基于语义高度地图的局部导航方法和*** | |
CN110660219A (zh) | 停车场停车预测方法和装置 | |
CN116075818A (zh) | 走查视频中的图像搜索 | |
WO2022152263A1 (zh) | 斜坡感知方法、装置、机器人和存储介质 | |
CN114594772A (zh) | 机器人、路径规划方法、装置和存储介质 | |
CN113358118B (zh) | 非结构环境中端到端的室内移动机器人自主导航方法 | |
CN113733086A (zh) | 一种机器人的出行方法、装置、设备及存储介质 | |
Japuria et al. | CASNSC: A context-based approach for accurate pedestrian motion prediction at intersections | |
Tas et al. | High-definition map update framework for intelligent autonomous transfer vehicles | |
CN110736465B (zh) | 导航方法、装置、机器人及计算机可读存储介质 | |
TWI806237B (zh) | 機器人系統及機器人控制方法 | |
CN112859842B (zh) | 一种路径跟随导航方法及其*** | |
TWI421707B (zh) | 行人空間行為學習系統及其方法 | |
Stüde | Environment and task modeling of long-term-autonomous service robots |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
ENP | Entry into the national phase |
Ref document number: 2018541387 Country of ref document: JP Kind code of ref document: A |
|
ENP | Entry into the national phase |
Ref document number: 20187023692 Country of ref document: KR Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2017899233 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2017899233 Country of ref document: EP Effective date: 20180910 |
|
ENP | Entry into the national phase |
Ref document number: 2017409109 Country of ref document: AU Date of ref document: 20170630 Kind code of ref document: A |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 17899233 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |