CN113932818B - Robot walking route planning method, program and storage medium - Google Patents
Robot walking route planning method, program and storage medium Download PDFInfo
- Publication number
- CN113932818B CN113932818B CN202111547317.3A CN202111547317A CN113932818B CN 113932818 B CN113932818 B CN 113932818B CN 202111547317 A CN202111547317 A CN 202111547317A CN 113932818 B CN113932818 B CN 113932818B
- Authority
- CN
- China
- Prior art keywords
- image
- boundary
- robot
- walking route
- algorithm
- 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
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/20—Instruments for performing navigational calculations
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Manipulator (AREA)
- Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)
Abstract
The invention discloses a robot walking route planning method, a program and a storage medium, which are characterized in that firstly, information of an RGB image T of a scene is acquired, and then the image T is converted into a gray image A; after a gray image A with the size of M multiplied by N is input and obtained, binaryzation is carried out on the image A by adopting an improved algorithm of Renyi entropy to obtain an optimal threshold value, so that the entropy value HA of the image A is maximum, and a binaryzation image B is obtained; carrying out boundary search on the binary image B to obtain an original boundary, and carrying out polygonization processing on the obtained original boundary to obtain an expanded region polygon boundary of an obstacle in a scene; identifying the vertexes of each outer convex angle of the polygon boundary of the expansion area one by one, and forming a safety fitting curve by using the vertexes; and planning the walking route of the robot by taking the safety fitting curve as a reference boundary. Therefore, the invention has the advantages of high walking efficiency, small lateral impact, accurate boundary identification and good tolerance performance.
Description
Technical Field
The present invention relates to the field of intelligent robot path planning strategies, and in particular, to a method, program and storage medium for robot path planning.
Background
The two-dimensional plane multi-robot path planning technology has achieved great results and is widely applied. In the research of the path planning technology of the existing multi-mobile robot system, a two-dimensional plane path planning solution is basically proposed aiming at the possible conflict of the mobile robot driving on the ground. The prior art, such as the chinese patent publication No. CN102929279B, discloses a robot path planning method, which is technically characterized by comprising a main thread, a planning thread, a collision avoidance thread and an execution thread which are executed in parallel in a scheduling server, wherein the main thread initializes a three-dimensional mesh path diagram and updates in real time, the planning thread divides tasks, task paths, marks task paths and sends the task paths into an execution queue, the collision avoidance thread divides a collision zone and executes a command escaping task before a command, and the execution thread sends an execution command to a mobile robot or an elevator robot. The invention realizes the automatic switching of the mobile robot and the elevator robot and the requirement of randomly accessing goods across floors by a method of jointly completing the task walking route through the relay operation of different kinds of robots, and has the characteristics of high efficiency, reasonability, instantaneity and the like.
Disclosure of Invention
The invention aims to provide a robot walking route planning method, a program and a storage medium with high walking efficiency, small lateral impact, accurate boundary identification and good tolerance performance aiming at the prior art.
The technical scheme adopted by the invention for solving the technical problems is as follows: the robot walking route planning method comprises the steps of converting an image T into a gray image A by acquiring information of an RGB image T of a scene; after a gray image A with the size of M multiplied by N is input and obtained, binaryzation is carried out on the image A by adopting an improved algorithm of Renyi entropy to obtain an optimal threshold value, so that the entropy value HA of the image A is maximum, and a binaryzation image B is obtained; carrying out boundary search on the binary image B to obtain an original boundary, and carrying out polygonization processing on the obtained original boundary to obtain an expanded region polygon boundary of an obstacle in a scene; identifying the vertexes of each outer convex angle of the polygon boundary of the expansion area one by one, and forming a safety fitting curve by using the vertexes; and planning the walking route of the robot by taking the safety fitting curve as a reference boundary. By adopting a new binarization algorithm, the outer contour boundary of the barrier is simplified and then optimized, so that a smoother path is divided and a practicable space is provided. Through new walking path logic, the transverse impact during walking is reduced, the transported object is prevented from sideslipping, and the optimized outline boundary is smooth and larger than the outline of the obstacle, so that the situation that the walking is clamped between the obstacles can be avoided.
In order to optimize the technical scheme, the adopted measures further comprise: the algorithm for obtaining the optimal threshold value by the Renyi entropy improvement algorithm is as follows:
wherein, L is the gray scale, (t (alpha), s (alpha)) is the optimal threshold value, and (t, s) is a two-dimensional vector;
Hα backrenyi entropy with (t, s) as background, Hobj α(t, s) is the Renyi entropy of the obstacle; epsilon is a correction coefficient used for shielding shadow influence. The problem of identification comfort of human senses to images after binarization can be solved by adopting Renyi entropy under a common condition, but the binarized images generated by adopting a general method cannot be used for robot stroke planning and need to be further denoised. The introduction of the correction factor epsilon into the whole calculation introduces a correction factor.
Hback α（t,s）、Hobj α(t, s) is calculated as follows:
wherein p (i, j) is the symbiotic probability. The value of epsilon is:
where R, G, B represent the RGB values of the red, green, blue color at that point of the image T. The outer coating outline boundary of the graph is reduced through the information in the color image, so that the number of acute angles generated by a post-processing polygon bounding algorithm is reduced, and the region which can pass through a robot can be reflected more truly.
The polygonization processing is as follows: enclosing the original boundary of the binary image B by adopting a scanning line algorithm to obtain a polygon boundary; and expanding the radius distance of the mobile robot outside the polygon boundary to obtain the polygon boundary of the expanded area. After the polygon boundary is expanded, the robot can be simplified into one point, and the calculation force for comparing the radius distance can be saved. The algorithm for planning the walking route of the robot is specifically as follows: and (4) taking a tangent point from the O point and the safety fitting curve, extending the radius of the robot at the tangent point, taking the tangent point from the safety fitting curve, and circulating until no barrier exists between the robot and the target area. The path planning method has small horizontal impact on the path, can keep the stability of the object on the robot conveying platform at a higher speed and avoid deviation. Alpha is 0.81 to 0.83. Through the research on the complex environment, under the planning strategy with the extended robot radius, the alpha value cannot be used in the general value range of the general graphic processing.
The invention also provides a computer program for implementing the method. The present invention also provides a storage medium storing the computer program.
Because the invention adopts the method of converting the image T into the gray image A; after a gray image A with the size of M multiplied by N is input and obtained, binaryzation is carried out on the image A by adopting an improved algorithm of Renyi entropy to obtain an optimal threshold value, so that the entropy value HA of the image A is maximum, and a binaryzation image B is obtained; carrying out boundary search on the binary image B to obtain an original boundary, and carrying out polygonization processing on the obtained original boundary to obtain an expanded region polygon boundary of an obstacle in a scene; identifying the vertexes of each outer convex angle of the polygon boundary of the expansion area one by one, and forming a safety fitting curve by using the vertexes; the safe fitting curve is used as a reference boundary, the walking route of the robot is planned, and the like, so that the robot has the advantages of high walking efficiency, small lateral impact, accurate boundary identification and good tolerance performance.
Drawings
FIG. 1 is a schematic diagram of a principle of construction of a fitting curve according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of an example of image binarization and fitting curve construction according to an embodiment of the invention;
FIG. 3 is a diagram illustrating an example of image path comparison according to an embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the following examples.
The reference numbers illustrate: the mobile robot comprises a mobile robot O, a polygon boundary 1, an extended area polygon boundary 2, a fitting curve 3, a safety fitting curve 4, a person 5 and a target area 6.
Example 1:
referring to fig. 1-3, a robot walking route planning method includes acquiring information of an RGB image T of a scene, and then converting the image T into a gray image a; after a gray image A with the size of M multiplied by N is input and obtained, binaryzation is carried out on the image A by adopting an improved algorithm of Renyi entropy to obtain an optimal threshold value, so that the entropy value HA of the image A is maximum, and a binaryzation image B is obtained; carrying out boundary search on the binary image B to obtain an original boundary, and carrying out polygonization processing on the obtained original boundary to obtain an expanded region polygon boundary 2 of an obstacle in a scene; identifying the vertexes of each external salient angle of the extended area polygon boundary 2 one by one, and forming a safety fitting curve 4 by using the vertexes; and planning the walking route of the robot O by taking the safety fitting curve 4 as a reference boundary. By adopting a new binarization algorithm, the outer contour boundary of the barrier is simplified and then optimized, so that a smoother path is divided and a practicable space is provided. Through new walking path logic, the transverse impact during walking is reduced, the transported object is prevented from sideslipping, and the optimized outline boundary is smooth and larger than the outline of the obstacle, so that the situation that the walking is clamped between the obstacles can be avoided.
The algorithm for obtaining the optimal threshold value by the Renyi entropy improvement algorithm is as follows:
wherein, L is the gray scale, (t (alpha), s (alpha)) is the optimal threshold value, and (t, s) is a two-dimensional vector;
Hα backrenyi entropy with (t, s) as background, Hobj α(t, s) is the Renyi entropy of the obstacle; epsilon is a correction coefficient used for shielding shadow influence. The problem of identification comfort of human senses to images after binarization can be solved by adopting Renyi entropy under a common condition, but the binarized images generated by adopting a general method cannot be used for robot stroke planning and need to be further denoised. The introduction of the correction factor epsilon into the whole calculation introduces a correction factor.
Hback α（t,s）、Hobj α(t, s) is calculated as follows:
wherein p (i, j) is the symbiotic probability. The value of epsilon is:
where R, G, B represent the RGB values of the red, green, blue color at that point of the image T. The outer coating outline boundary of the graph is reduced through the information in the color image, so that the number of acute angles generated by a post-processing polygon bounding algorithm is reduced, and the region which can pass through a robot can be reflected more truly. The polygonization processing is as follows: enclosing the original boundary of the binary image B by adopting a scanning line algorithm to obtain a polygon boundary; and expanding the radius distance of the mobile robot outside the polygon boundary to obtain the polygon boundary of the expanded area. After the polygon boundary is expanded, the robot can be simplified into one point, and the calculation force for comparing the radius distance can be saved. The algorithm for planning the walking route of the robot is specifically as follows: and (4) taking a tangent point from the O point and the safety fitting curve, extending the radius of the robot at the tangent point, taking the tangent point from the safety fitting curve, and circulating until no barrier exists between the robot and the target area. The path planning method has small horizontal impact on the path, can keep the stability of the object on the robot conveying platform at a higher speed and avoid deviation. Alpha is 0.81 to 0.83. Through the research on the complex environment, under the planning strategy with the extended robot radius, the alpha value cannot be used in the general value range of the general graphic processing.
Example 2
An RGB image T of a scene is acquired, and the image T is converted into a gray image A.
After a gray image A with the size of M multiplied by N is input and obtained, the image A is binarized by adopting an improved algorithm of Renyi entropy, and an optimal threshold value is obtained by adopting the following algorithm, so that the entropy value HA of the image A is maximum:
wherein, L is the gray scale, (t (alpha), s (alpha)) is the optimal threshold value, and (t, s) is a two-dimensional vector;
Hα backrenyi entropy with (t, s) as background, Hobj α(t, s) is the Renyi entropy of the obstacle; epsilon is a correction coefficient used for shielding shadow influence.
The value of epsilon is:
where R, G, B represent the RGB values of the red, green, blue color at that point of the image T.
And (3) performing illumination description on the color by using epsilon so as to adjust the shadow-to-edge detection error of the gray image A. The shadow is adjusted, so that the problem that invalid vertexes influencing the path planning efficiency are formed when the vertexes of each outer convex angle of the polygon boundary 2 of the extension area are identified one by one in the later stage can be avoided.
The gray level of the gray image A with the size of M multiplied by N is L, the gray value of the pixel point (M, N) is f (M, N), and f (M, N) is more than or equal to 0 and less than or equal to L-1.
The implementation pseudo-code for entropy threshold partitioning is as follows:
inputting a grayscale image
Calculating the gray level-neighborhood mean probability p (i, j) of the pixel point to find out the gray level Hist corresponding to the maximum probability of f (m, n)max；
for loop (loop variable a from HistmaxTo 254)
for loop (loop variable c from a +1 to 255)
If p (i, j) ≠ 0, the Renyi entropy of equation 2 is calculated
End for cycle (cycle variable c)
End for cycle (cycle variable a)
Finding out the threshold value pair corresponding to the maximum Renyi entropy by the formula 1(t* (α), s* (α))
The optimal segmentation threshold is t*(α), dividing the grayscale image
End up
The value of the Renyi entropy parameter alpha is 0.81 to 0.83, alpha is a real constant, alpha is more than 0, and alpha is not equal to 1.
only the vertices of the convex polygon and the edges that make up the convex polygon are considered. Considering the mobile robot O as a circle, i.e. representing the mobile robot by a circle, the assumed benefit is to allow the sides of the circular robot to be tangent to the sides 1 of the obstacle. Preferably, the path planning may be performed by enlarging the radius of the mobile robot O to form a new traveling boundary 2 and then processing the robot O into points.
The vertices of each of the outer lobes of the extended region polygon bounding 2 are identified one by one.
Each obstacle MnAnd the vertex of the outer lobe closest to the mobile robot O of the extended area polygon boundary 2 of (2) is defined as On', n =1, 2 … n. With On' As the initial fitting points, the vertexes of the convex angles outside the polygon limit 2 of the expansion area of the obstacle are connected by a fitting curve 3 one by one, and the O is usedn' as endpoint, a region of closed fitted curve 3 is formed to represent each obstacle. When the extended region polygon boundary 2 and the fitting curve 3 intersect outside the vertexes of the outer convex angles, the vertexes of the two outer convex angles closest to the intersection position are taken as end points, and the fitting point between the vertexes of the two outer convex angles is deleted to form a safety fitting curve 4. The starting point of the fitted curve 3 for each identified obstacle, which assumes the vertex of the closest two outer lobes, is not normally identified in the plan for generating a tangent. Under the condition of small probability, when the initial point is identified to need to find a tangent, the initial point is replaced by a perpendicular line of an angle symmetrical bisector. The path search algorithm adopts an improved ant colony algorithm. Different from the prior art, the logic adopted by the improved algorithm is that a tangent point is taken by the point O and the safety fitting curve 4, the radius of the robot O is extended at the tangent point, then the tangent point is taken by the point O and the safety fitting curve 4, and the operation is circulated until no barrier exists between the robot O and the target area 6. If the bending angle of the last segment is larger, the distance can be preset for prejudgment, the walking speed of the robot O is predecelerated, and the overall planning efficiency is further maintained in a mode of sacrificing the walking efficiency of the last segment. Compared with the prior ant algorithm combined with the technical scheme of quadtree decomposition, the invention has shorter path, and has smaller lateral deviation relative to the technical scheme of path planning by the polygon limit 2 vertex connection of the extended area.
The fitting curve 3 is fitted with a spline function. May be a uniform B-spline curve, a quasi-uniform B-spline curve, a segmented Bezier curve, a non-uniform B-spline. Through comparison, when the robot O walks fast to carry tableware, the spline curves are tested in a single-factor mode, the influence of the spline curves on the lateral deviation sliding of the tableware on a carrying platform is small, a route P2 obtained by selecting corresponding types of curves according to calculation force and performing path planning by adopting the conventional IACO algorithm has a more zigzag route, the horizontal impact is large, and the speed of the robot O on most of the routes cannot be further improved. Forming path P3 in a manner that estimates horizontal impacts based on robot speed and path shape wastes time by forming a spiral-like redundant path in the last segment. By adopting the walking path of the technical scheme of the invention, the shorter path P3 can be calculated and screened out from the feasible path, and the walking path has better performance in path, horizontal impact and walking time.
Embodiment 3 a computer program for implementing the method of embodiments 1, 2 described above. Embodiment 4 is a storage medium storing the computer program of embodiment 3 described above.
While the invention has been described in connection with a preferred embodiment, it is not intended to limit the invention, and it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the spirit and scope of the invention.
While the invention has been described in connection with a preferred embodiment, it is not intended to limit the invention, and it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the spirit and scope of the invention.
Claims (8)
1. The robot walking route planning method comprises the steps of obtaining information of an RGB image T of a scene, and is characterized in that: converting the image T into a gray image A; after a gray image A with the size of M multiplied by N is input and obtained, binaryzation is carried out on the image A by adopting an improved algorithm of Renyi entropy to obtain an optimal threshold value, so that the entropy value HA of the image A is maximum, and a binaryzation image B is obtained; carrying out boundary search on the binary image B to obtain an original boundary, and carrying out polygonization processing on the obtained original boundary to obtain an expanded region polygon boundary (2) of an obstacle in a scene; identifying the vertex of each external convex angle of the extended region polygon boundary (2) one by one, and forming a safety fitting curve (4) by using the vertex; and planning the walking route of the robot (O) by taking the safety fitting curve (4) as a reference boundary.
2. The robot walking route planning method according to claim 1, characterized in that: the algorithm for obtaining the optimal threshold value by the Renyi entropy improvement algorithm is as follows:
wherein, L is the gray scale, (t (alpha), s (alpha)) is the optimal threshold value, and (t, s) is a two-dimensional vector;
Hα backrenyi entropy with (t, s) as background, Hobj α(t, s) is the Renyi entropy of the obstacle; epsilon is a correction coefficient used for shielding shadow influence.
3. The robot walking route planning method according to claim 1, characterized in that: the polygonization treatment comprises the following steps: enclosing the original boundary of the binary image B by adopting a scanning line algorithm to obtain a polygon boundary (1); and (3) expanding the polygon limit (1) by the radius distance of the mobile robot (O) to obtain the expanded region polygon limit (2).
4. The robot walking route planning method according to claim 2, characterized in that: the value of epsilon is as follows:
where R, G, B represent the RGB values of the red, green, blue color at that point of the image T.
5. The robot walking route planning method according to claim 2, characterized in that: the algorithm for planning the walking route of the robot (O) is specifically as follows: and (3) taking a tangent point of the O point and the safety fitting curve (4), extending the radius of the robot (O) at the tangent point, taking the tangent point with the safety fitting curve (4), and circulating until no barrier exists between the robot (O) and the target area (6).
6. Computer device, characterized by: comprising one or more processors; a memory; and one or more computer programs, wherein the one or more computer programs are stored in the memory, the one or more computer programs comprising instructions which, when executed by the apparatus, cause the apparatus to perform the method of any of claims 1 to 5.
7. A computer storage medium characterized by: the computer storage medium stores one or more computer programs that, when executed by the apparatus, cause the apparatus to perform the method of any of claims 1 to 5.
8. A robot device is characterized in that: the computer storage medium of claim 7 is installed.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2020116197481 | 2020-12-30 | ||
| CN202011619748.1A CN112762940A (en) | 2020-12-30 | 2020-12-30 | Robot walking route planning method, program and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113932818A CN113932818A (en) | 2022-01-14 |
| CN113932818B true CN113932818B (en) | 2022-03-29 |
Family
ID=75698182
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011619748.1A Pending CN112762940A (en) | 2020-12-30 | 2020-12-30 | Robot walking route planning method, program and storage medium |
| CN202111547317.3A Active CN113932818B (en) | 2020-12-30 | 2021-12-17 | Robot walking route planning method, program and storage medium |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011619748.1A Pending CN112762940A (en) | 2020-12-30 | 2020-12-30 | Robot walking route planning method, program and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN112762940A (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115326099B (en) * | 2022-10-11 | 2023-03-07 | 禾多科技（北京）有限公司 | Local path planning method and device, electronic equipment and computer readable medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110865642A (en) * | 2019-11-06 | 2020-03-06 | 天津大学 | Path planning method based on mobile robot |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP6303332B2 (en) * | 2013-08-28 | 2018-04-04 | 富士通株式会社 | Image processing apparatus, image processing method, and image processing program |
| CN103810716B (en) * | 2014-03-13 | 2016-07-06 | 北京工商大学 | Move and the image partition method of Renyi entropy based on gray scale |
| CN106546233A (en) * | 2016-10-31 | 2017-03-29 | 西北工业大学 | A kind of monocular visual positioning method towards cooperative target |
| CN107807644A (en) * | 2017-10-30 | 2018-03-16 | 洛阳中科龙网创新科技有限公司 | A kind of farm machinery consumption minimization trajectory path planning method |
| CN112346463B (en) * | 2020-11-27 | 2022-09-23 | 西北工业大学 | Unmanned vehicle path planning method based on speed sampling |
-
2020
- 2020-12-30 CN CN202011619748.1A patent/CN112762940A/en active Pending
-
2021
- 2021-12-17 CN CN202111547317.3A patent/CN113932818B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110865642A (en) * | 2019-11-06 | 2020-03-06 | 天津大学 | Path planning method based on mobile robot |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113932818A (en) | 2022-01-14 |
| CN112762940A (en) | 2021-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Park et al. | Pix2pose: Pixel-wise coordinate regression of objects for 6d pose estimation | |
| US10031231B2 (en) | Lidar object detection system for automated vehicles | |
| KR102210537B1 (en) | Robust merge of 3d textured meshes | |
| US11763459B2 (en) | Method and computing system for object identification | |
| JP4251545B2 (en) | Route planning system for mobile robot | |
| CN113932818B (en) | Robot walking route planning method, program and storage medium | |
| JP2006228218A (en) | Processing method for line pattern using convolution kernel, processor for line pattern, and medium stored with program for executing the processing method for line pattern | |
| US20030151604A1 (en) | Volume rendering with contouring texture hulls | |
| CN110648359B (en) | Fruit target positioning and identifying method and system | |
| CN113269801A (en) | Method and computing system for processing candidate edges | |
| CN115311172A (en) | Map area segmentation method and related device | |
| CN115330969A (en) | Local static environment vectorization description method for ground unmanned vehicle | |
| US8717356B2 (en) | Display processing method and apparatus | |
| CN114756020A (en) | Method, system and computer readable recording medium for generating robot map | |
| US20210200232A1 (en) | Method of generating scan path of autonomous mobile robot and computing device | |
| Tasar et al. | Polygonization of binary classification maps using mesh approximation with right angle regularity | |
| CN113343987B (en) | Text detection processing method and device, electronic equipment and storage medium | |
| WO2021220345A1 (en) | Elevator 3d data processing device | |
| WO2021220346A1 (en) | Elevator 3-d data processing device | |
| US11778156B2 (en) | Stereo depth estimation | |
| KR102671839B1 (en) | Method, system, and non-transitory computer-readable recording medium for generating a map for a robot | |
| CN114972495A (en) | Grabbing method and device for object with pure plane structure and computing equipment | |
| JP2988097B2 (en) | How to segment a grayscale image | |
| KR102621569B1 (en) | Method, system, and non-transitory computer-readable recording medium for controlling a robot | |
| Trisiripisal | Image approximation using triangulation |
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 |