CN102541057B - Moving robot obstacle avoiding method based on laser range finder - Google Patents

Moving robot obstacle avoiding method based on laser range finder Download PDF

Info

Publication number
CN102541057B
CN102541057B CN 201010611255 CN201010611255A CN102541057B CN 102541057 B CN102541057 B CN 102541057B CN 201010611255 CN201010611255 CN 201010611255 CN 201010611255 A CN201010611255 A CN 201010611255A CN 102541057 B CN102541057 B CN 102541057B
Authority
CN
China
Prior art keywords
robot
barrier
axis
laser
coordinate system
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.)
Expired - Fee Related
Application number
CN 201010611255
Other languages
Chinese (zh)
Other versions
CN102541057A (en
Inventor
李燊
郑春晖
杜振军
徐方
潭波悦
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenyang Siasun Robot and Automation Co Ltd
Original Assignee
Shenyang Siasun Robot and Automation Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenyang Siasun Robot and Automation Co Ltd filed Critical Shenyang Siasun Robot and Automation Co Ltd
Priority to CN 201010611255 priority Critical patent/CN102541057B/en
Publication of CN102541057A publication Critical patent/CN102541057A/en
Application granted granted Critical
Publication of CN102541057B publication Critical patent/CN102541057B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)

Abstract

The invention relates to a moving robot obstacle avoiding method based on a laser range finder, which comprises the following steps: building the coordinate system of the robot; with the current location of the robot as a center of a circle, simulating laser transmission at the origin of coordinates to transmit N laser beams of which the directions are determined as candidate directions of the motion of the robot; dividing laser information into groups, selecting an obstacle point in each group, and mapping the obstacle point into the coordinate system of the robot; expanding the robot into a circle with a radius of R, drawing two tangent lines of the circle through one obstacle point, working out the range of the candidate directions in which the robot can go across the obstacle point according to the included angles of the tangent lines and an X-axis, and getting the direction in which the robot can go across the obstacle point; defining a cost function to evaluate all feasible directions, and selecting the optimal direction of the next circle of motion of the robot; and working out the linear speed and angular speed of the robot by using a speed control policy. According to the method, the robot can avoid an obstacle in an unknown environment, and has high performance; and without deeper theoretical foundation, the method is simple, smart, easy to understand and practical, requires small calculation, and is particularly suitable to use.

Description

A kind of mobile robot's barrier-avoiding method based on laser range finder
Technical field
The present invention relates to a kind of mobile robot and keep away barrier technique, specifically a kind of mobile robot's barrier-avoiding method based on laser range finder.
Background technology
In recent years, laser range finder is used more and more widely in the robot navigation system.Mainly be because the laser range finder measuring technique has lot of advantages, particularly have high precision, high resolving power, wide visual field, not influenced by high light that also workable advantage provides good environment recognition capability for like this independent navigation robot in the dark.Keep away in the method for barrier adopting laser range sensor to carry out the mobile robot, commonly used have Artificial Potential Field method, a vector field histogram method.The Artificial Potential Field method is kept away the prototype that hinders air navigation aid as the part, has made positive contribution for promoting to keep away the research that hinders algorithm, but inevasible, this method still exists shortcoming.Because what the Artificial Potential Field method was taked the information extraction of map is a kind of overall blur method, soon all barriers are expressed as an overall repulsion with joint efforts to the influence of robot, this description is just too general, it is not very meticulous causing navigation effect, makes it run into the difficulty that some are difficult to overcome in actual applications.The vector field histogram method is set up polar coordinate system centered by the mobile robot, barrier is quantified as obstacle intensity level on all angles to the influence of robot, selects moving direction in the barrier intensity level is lower than the angular range of threshold value.A weakness of the method is exactly to the threshold value sensitivity, and Feasible channels were left in the basket when threshold value was more too small, the excessive danger that then may cause collision obstacle of threshold value.
Summary of the invention
At the weak point that exists in the existing algorithm, the technical problem to be solved in the present invention provides the mobile robot's barrier-avoiding method based on laser range finder that a kind of method is simply ingenious, calculated amount is little, practical.
For solving the problems of the technologies described above, the technical solution used in the present invention is:
The mobile robot's barrier-avoiding method that the present invention is based on laser range finder may further comprise the steps:
1) be initial point with the robot current location, the robot course is Y-axis, be that X-axis is set up the robot coordinate system with the direction perpendicular to Y-axis, in coordinate system, be the center of circle with the robot current location, the semicircle that to open up a length in the robot dead ahead be D is starting point as active window with the coordinate origin, counterclockwise in 180 degree scopes of negative semiaxis, the equal angular N bar of simulated laser transmission interval ray is as robot motion's candidate direction from the X-axis positive axis;
2) laser intelligence with 180 degree is divided into the N-1 group accordingly, in every group, selects the minimum value of active window inner laser detection range as the barrier point of this group, and barrier point is mapped among the robot coordinate system;
3) in the robot coordinate system, with the expanded one-tenth radius of the robot circle that is R, do two round tangent lines by a barrier point, the angle of two tangent lines and X-axis is respectively a and b, and adopting formula (1) to try to achieve the candidate direction scope that robot can pass through for this barrier point by angle a, b is L 0-L rAnd L l-L N-1, wherein
Figure BDA0000041387910000021
Figure BDA0000041387910000022
4) after the candidate direction scope that each barrier point obtains passing through by said method, the common factor of the candidate direction scope of all barrier points is the feasible direction that robot can pass through;
5) judge whether to exist feasible direction, if exist, then define a cost function and estimate each feasible direction, to select the optimum orientation of next periodic motion of robot;
6) selected optimum orientation after, adopt the speed control strategy to provide robot linear velocity and angular velocity.
If there is no feasible direction then makes 90 ° or-90 ° of course angles for robot of following one-period, and the employing speed that continues control strategy provides robot linear velocity and angular velocity step.
Described N is 37,46,61,91 or 181.
The present invention has following beneficial effect and advantage:
1. the mobile robot based on laser range finder of the present invention's proposition keeps away the barrier new method, can keep away barrier, function admirable effectively in circumstances not known;
2. the inventive method is compared with other algorithms, does not need dark theoretical foundation, and method is simply ingenious, easy to understand, calculated amount are little, practical, is particularly suitable for practical application.
Description of drawings
Fig. 1 is robot coordinate and candidate direction in the inventive method;
Fig. 2 asks feasible direction in the inventive method for certain barrier point;
Fig. 3 is the process flow diagram of the inventive method.
Embodiment
Below in conjunction with accompanying drawing, with concrete example this method is described.
In this example, robot energy self-movement, robot base approaches circular, adopts laser range finder as main environment detection sensor.
The present invention is based on mobile robot's barrier-avoiding method of laser range finder as shown in Figure 3, may further comprise the steps:
1) be initial point with the robot current location, the robot course is Y-axis, be that X-axis is set up the robot coordinate system with the direction perpendicular to Y-axis, in coordinate system, be the center of circle with the robot current location, the semicircle that to open up a length in the robot dead ahead be D is starting point as active window with the coordinate origin, counterclockwise in 180 degree scopes of negative semiaxis, the equal angular N bar of simulated laser transmission interval ray is as robot motion's candidate direction from the X-axis positive axis;
2) laser intelligence with 180 degree is divided into the N-1 group accordingly, in every group, selects the minimum value of active window inner laser detection range as the barrier point of this group, and barrier point is mapped among the robot coordinate system;
3) in the robot coordinate system, with the expanded one-tenth radius of the robot circle that is R, do two round tangent lines by a barrier point, the angle of two tangent lines and X-axis is respectively a and b, and adopting formula (1) to try to achieve the candidate direction scope that robot can pass through for this barrier point by angle a, b is L 0-L rAnd L l-L N-1, wherein
Figure BDA0000041387910000031
Figure BDA0000041387910000032
4) after the candidate direction scope that each barrier point obtains passing through by said method, the common factor of the candidate direction scope of all barrier points is the feasible direction that robot can pass through;
5) judge whether to exist feasible direction, if exist, then define a cost function and estimate each feasible direction, to select the optimum orientation of next periodic motion of robot;
6) selected optimum orientation after, adopt the speed control strategy to provide robot linear velocity and angular velocity.
If there is no feasible direction then makes 90 ° or-90 ° of course angles for robot of following one-period, and the employing speed that continues control strategy provides robot linear velocity and angular velocity step.
In this embodiment, at first set up the robot coordinate system.As shown in Figure 1, be initial point with the robot current location, the robot course is Y-axis, is that X-axis is set up the robot two-dimensional coordinate system with the direction perpendicular to Y-axis, and be the center of circle with the robot current location, the semicircle that to open up a length in the robot dead ahead be D is as active window.Be starting point with the coordinate origin, counterclockwise to negative semiaxis, even 37 rays of simulated laser emission are N=37,5 degree at interval from the X-axis positive axis.These 37 direction L 0-L 36, be robot motion's candidate direction.
Equally, the laser intelligence with 180 degree is divided into 36 groups, one group of per 5 degree accordingly.In every group, select the minimum value of active window inner laser detection range as the barrier point of this group, barrier point is mapped among the robot coordinate system.
In coordinate system, be the center of circle with the robot current location, robot is puffed to a circle.At first make the circumcircle of robot, suppose that radius is r, for avoiding robot and barrier collision in keeping away barrier, robot and barrier will have certain distance, therefore, make expanded radius of a circle R=r+d, wherein d should select according to actual conditions such as the profile of robot and sizes, r is 37cm in this example, and d is 15cm.
As accompanying drawing 2, in the robot moving process, laser constantly scans barrier, dropping on D as barrier point B is in the active window of radius the time, by this barrier point B, be two tangent line m and the n of the expanded circle of robot, the positive axis angle of tangent line m and n and X-axis is respectively a and b, cross initial point and make parallel lines p and the q of m and n respectively, the angle of p and q and X-axis also is a and b.As can be seen, for this barrier point, the boundary line, the left side that robot cannot pass through is p from accompanying drawing 2, and boundary line, the right is q.What barrier point B produced can not be by the left margin direction L in zone lWith right margin direction L rCan obtain by through type (1).For example, in accompanying drawing 2, if m and n and X-axis angle are 67 degree and 28 degree, then l equals 67 degree and takes advantage of 36 again divided by 180, obtains the result and rounds up, and is that 14, r equals 28 and spends and to take advantage of 36 again divided by 180 as calculated, and obtain the result and round downwards, be 5 as calculated.L then 5-L 14Between produce the zone that can not pass through, L for barrier point B 0-L 5And L 14-L 36Be the feasible direction for barrier point B robot.For the barrier point in expanded circle, because very near with robot distance, should make robot take promptly to keep away the barrier measure, mode such as suddenly stop or retreat, and needn't adopt said method to ask candidate direction.
Can calculate the candidate direction scope that robot can pass through for all barrier points that enter into active window, the common factor of the candidate direction of all barrier points is the feasible direction that robot can pass through.For a plurality of feasible directions of passing through, define a cost function and estimate each feasible direction, to select best direction.Be defined as follows cost function:
f(u)=u 1×∠(u,g)+u 2×∠(u,c)+u 3×|u-j| (2)
In the formula, u is feasible direction, and g is target direction, and c is the current course angle of robot.∠ (u g) is the angle of feasible direction and target direction, and ∠ (u c) is the angle of feasible direction and current course angle, | u-j| is the absolute value of the differential seat angle of feasible direction and last one-period choice direction.u 1, u 2And u 3Be constant, for guaranteeing that robot advances u towards target 1Be greater than u 2, select u in the reality 1=8, u 2=3, u 3=3.Calculate the f (u) of each feasible direction, choose the direction of cost function value minimum as the robot direction of motion of following one-period.
When the visual field of robot did not have selectable direction, then making robot next cycle course angle was 90 ° or-90 °, namely allows robot turn an angle, and breaks away from current environment, seeks feasible direction again.
After having selected optimum orientation, adopt certain control strategy that robot is forwarded on the selected direction, at first make linear velocity v=v Set, v SetBe the linear velocity of setting.Order
t=Dis/v set (3)
ω=θ/t
The distance value of Dis for setting, robot should forward predetermined direction in the Dis distance.For making robot not run into barrier before forwarding predetermined direction to, Dis can set according to the lowest distance value of robot the place ahead barrier.ω is angular velocity, and θ is the course angle of next periodic motion direction of robot.If robot best feasible direction of following one-period is L k, then
θ=5×k×π/180-π/2 (4)
If the angular velocity omega of obtaining has surpassed the maximum angular rate restriction, then linear velocity is reduced certain value, and then obtain ω with formula (3), so repeatedly, limit less than maximum angular rate up to the ω that tries to achieve.Just can be in the hope of robot left and right sides wheel speed according to linear velocity and angular velocity.

Claims (3)

1. mobile robot's barrier-avoiding method based on laser range finder is characterized in that may further comprise the steps:
1) be initial point with the robot current location, the robot course is Y-axis, be that X-axis is set up the robot coordinate system with the direction perpendicular to Y-axis, in coordinate system, be the center of circle with the robot current location, the semicircle that to open up a length in the robot dead ahead be D is starting point as active window with the coordinate origin, counterclockwise in 180 degree scopes of negative semiaxis, the equal angular N bar of simulated laser transmission interval ray is as robot motion's candidate direction from the X-axis positive axis;
2) laser intelligence with 180 degree is divided into the N-1 group accordingly, in every group, selects the minimum value of active window inner laser detection range as the barrier point of this group, and barrier point is mapped among the robot coordinate system;
3) in the robot coordinate system, with the expanded one-tenth radius of the robot circle that is R, do two round tangent lines by a barrier point, the angle of two tangent lines and X-axis is respectively a and b, and adopting formula (1) to try to achieve the candidate direction scope that robot can pass through for this barrier point by angle a, b is L 0-L rAnd L l-L N-1, wherein
Figure FDA0000041387900000011
Figure FDA0000041387900000012
4) after the candidate direction scope that each barrier point obtains passing through by said method, the common factor of the candidate direction scope of all barrier points is the feasible direction that robot can pass through;
5) judge whether to exist feasible direction, if exist, then define a cost function and estimate each feasible direction, to select the optimum orientation of next periodic motion of robot;
6) selected optimum orientation after, adopt the speed control strategy to provide robot linear velocity and angular velocity.
2. a kind of mobile robot's barrier-avoiding method based on laser range finder according to claim 1 is characterized in that: if there is no feasible direction then makes 90 ° or-90 ° of course angles for robot of following one-period; The employing speed that continues control strategy provides robot linear velocity and angular velocity step.
3. a kind of mobile robot's barrier-avoiding method based on laser range finder according to claim 1, it is characterized in that: described N is 37,46,61,91 or 181.
CN 201010611255 2010-12-29 2010-12-29 Moving robot obstacle avoiding method based on laser range finder Expired - Fee Related CN102541057B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201010611255 CN102541057B (en) 2010-12-29 2010-12-29 Moving robot obstacle avoiding method based on laser range finder

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201010611255 CN102541057B (en) 2010-12-29 2010-12-29 Moving robot obstacle avoiding method based on laser range finder

Publications (2)

Publication Number Publication Date
CN102541057A CN102541057A (en) 2012-07-04
CN102541057B true CN102541057B (en) 2013-07-03

Family

ID=46348148

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201010611255 Expired - Fee Related CN102541057B (en) 2010-12-29 2010-12-29 Moving robot obstacle avoiding method based on laser range finder

Country Status (1)

Country Link
CN (1) CN102541057B (en)

Families Citing this family (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103487066B (en) * 2013-10-12 2016-05-25 惠州Tcl移动通信有限公司 A kind of smart machine and safety traffic method thereof
CN103743394A (en) * 2014-01-07 2014-04-23 北京工业大学 Light-stream-based obstacle avoiding method of mobile robot
CN104864863B (en) * 2014-02-21 2019-08-27 联想(北京)有限公司 A kind of routing resource and electronic equipment
JP6397663B2 (en) * 2014-06-18 2018-09-26 シャープ株式会社 Self-propelled electronic device
CN104267728B (en) * 2014-10-16 2016-09-14 哈尔滨工业大学 A kind of moving robot obstacle avoiding method based on range coverage centroid vector
CN105043376B (en) * 2015-06-04 2018-02-13 上海物景智能科技有限公司 A kind of intelligent navigation method and system suitable for non-Omni-mobile vehicle
CN106444735A (en) * 2015-08-11 2017-02-22 深圳市云鼠科技开发有限公司 Method and apparatus for indoor structure dynamic modeling and navigation
CN105596157A (en) * 2016-01-22 2016-05-25 江苏科凌医疗器械有限公司 Multifunctional wheel chair
CN105629975B (en) * 2016-02-05 2018-04-03 哈尔滨工程大学 A kind of bypassing method of the dyskinesia based on during virtual expanded UUV navigation
CN105549601B (en) * 2016-02-05 2018-03-02 哈尔滨工程大学 A kind of bypassing method navigated by water in the same direction with UUV based on virtual expanded dyskinesia
CN106022274B (en) * 2016-05-24 2024-01-12 零度智控(北京)智能科技有限公司 Obstacle avoidance method, obstacle avoidance device and unmanned machine
CN106774310B (en) * 2016-12-01 2019-11-19 中科金睛视觉科技(北京)有限公司 A kind of robot navigation method
CN106774329B (en) * 2016-12-29 2019-08-13 大连理工大学 A kind of robot path planning method based on oval tangent line construction
CN106647766A (en) * 2017-01-13 2017-05-10 广东工业大学 Robot cruise method and system based on complex environment UWB-vision interaction
CN107544482B (en) * 2017-08-08 2020-10-09 浙江工业大学 Automatic distribution robot system facing medical environment
CN107562048B (en) * 2017-08-08 2020-10-09 浙江工业大学 Dynamic obstacle avoidance control method based on laser radar
CN107782311A (en) * 2017-09-08 2018-03-09 珠海格力电器股份有限公司 Mobile path planning method and device for mobile terminal
CN109975819B (en) * 2017-12-28 2023-03-24 沈阳新松机器人自动化股份有限公司 Low-cost optimization method for laser measurement data
CN108544491B (en) * 2018-03-30 2020-04-28 杭州电子科技大学 Mobile robot obstacle avoidance method comprehensively considering two factors of distance and direction
CN109250808A (en) * 2018-10-25 2019-01-22 罗德斌 A kind of sewage treatment machine people of environmental protection
CN109828566B (en) * 2019-01-30 2022-05-24 华南理工大学 Autonomous sailing method for unmanned surface vehicle
CN111158370B (en) * 2019-12-30 2023-06-30 华东交通大学 Automatic guided vehicle AGV deployment method and system and automatic guided vehicle AGV
CN111665846B (en) * 2020-06-24 2022-04-19 哈尔滨工程大学 Water surface unmanned ship path planning method based on rapid scanning method
CN112051850B (en) * 2020-09-08 2023-07-28 中国人民解放军海军航空大学 Robot tangent obstacle avoidance method based on inertial navigation and laser radar measurement
CN113885522B (en) * 2021-10-28 2023-04-25 武汉大学 Obstacle avoidance method, device and equipment for water surface robot and readable storage medium
CN114043481B (en) * 2021-11-26 2023-03-21 上海景吾智能科技有限公司 Remote control method and system for automatic obstacle avoidance
CN117406755B (en) * 2023-12-01 2024-04-19 北京极智嘉科技股份有限公司 Robot obstacle avoidance method, device, equipment and readable storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101059700A (en) * 2007-03-23 2007-10-24 北京大学 Underwater bionic robot cooperated transportation method
EP2128733A2 (en) * 2008-05-28 2009-12-02 Murata Machinery, Ltd. Autonomous moving body and method for controlling movement thereof
CN101666649A (en) * 2009-09-17 2010-03-10 华南农业大学 Non-360-degree targeting navigation method for detecting robot
CN101701818A (en) * 2009-11-05 2010-05-05 上海交通大学 Method for detecting long-distance barrier
CN101769754A (en) * 2010-01-19 2010-07-07 湖南大学 Quasi three-dimensional map-based mobile robot global path planning method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101059700A (en) * 2007-03-23 2007-10-24 北京大学 Underwater bionic robot cooperated transportation method
EP2128733A2 (en) * 2008-05-28 2009-12-02 Murata Machinery, Ltd. Autonomous moving body and method for controlling movement thereof
CN101666649A (en) * 2009-09-17 2010-03-10 华南农业大学 Non-360-degree targeting navigation method for detecting robot
CN101701818A (en) * 2009-11-05 2010-05-05 上海交通大学 Method for detecting long-distance barrier
CN101769754A (en) * 2010-01-19 2010-07-07 湖南大学 Quasi three-dimensional map-based mobile robot global path planning method

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
基于信息融合的同时定位与地图创建研究;罗荣华等;《哈尔滨工业大学学报》;20040530;第36卷(第05期);566-569 *
基于激光测距仪的移动机器人避障新方法;徐玉华等;《机器人》;20100331;第32卷(第02期);179-183 *
徐玉华等.基于激光测距仪的移动机器人避障新方法.《机器人》.2010,第32卷(第02期),179-183.
罗荣华等.基于信息融合的同时定位与地图创建研究.《哈尔滨工业大学学报》.2004,第36卷(第05期),566-569.

Also Published As

Publication number Publication date
CN102541057A (en) 2012-07-04

Similar Documents

Publication Publication Date Title
CN102541057B (en) Moving robot obstacle avoiding method based on laser range finder
CN107239076B (en) AGV laser SLAM method based on virtual scanning and distance measurement matching
CN104375505A (en) Robot automatic road finding method based on laser ranging
Peng et al. The obstacle detection and obstacle avoidance algorithm based on 2-d lidar
US9563808B2 (en) Target grouping techniques for object fusion
CN102207736B (en) Robot path planning method and apparatus thereof based on Bezier curve
CN103455034B (en) A kind of based on the histogrammic obstacle-avoiding route planning method of minimum distance vector field
CN101604166B (en) Path planning method for mobile robots based on particle swarm optimization algorithm
CN110632921A (en) Robot path planning method and device, electronic equipment and storage medium
CN104267728B (en) A kind of moving robot obstacle avoiding method based on range coverage centroid vector
US20200110173A1 (en) Obstacle detection method and device
AU2019210587B2 (en) Object detection based on lidar intensity
CN111338359A (en) Mobile robot path planning method based on distance judgment and angle deflection
CN106682787A (en) Method for quickly generating generalized Voronoi diagram based on wavefront algorithm
CN109375211B (en) Radar and multi-optical equipment-based mobile unmanned platform target searching method
CN108873915B (en) Dynamic obstacle avoidance method and omnidirectional security robot thereof
CN104765371A (en) Route planning method based on rolling window deep searching and fuzzy control fusion
CN110705385B (en) Method, device, equipment and medium for detecting angle of obstacle
Zhu et al. A path planning algorithm based on fusing lane and obstacle map
CN114755373B (en) Air pollution source early warning positioning method based on multi-robot formation
Fang et al. Camera and LiDAR fusion for on-road vehicle tracking with reinforcement learning
CN117389305A (en) Unmanned aerial vehicle inspection path planning method, system, equipment and medium
CN108544491B (en) Mobile robot obstacle avoidance method comprehensively considering two factors of distance and direction
CN103968767A (en) Laser measuring method for sphere recognition
Xin et al. A new occupancy grid of the dynamic environment for autonomous vehicles

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130703

CF01 Termination of patent right due to non-payment of annual fee