CN103092204B - A kind of Robotic Dynamic paths planning method of mixing - Google Patents

A kind of Robotic Dynamic paths planning method of mixing Download PDF

Info

Publication number
CN103092204B
CN103092204B CN201310020680.9A CN201310020680A CN103092204B CN 103092204 B CN103092204 B CN 103092204B CN 201310020680 A CN201310020680 A CN 201310020680A CN 103092204 B CN103092204 B CN 103092204B
Authority
CN
China
Prior art keywords
robot
planning
point
information
line
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
CN201310020680.9A
Other languages
Chinese (zh)
Other versions
CN103092204A (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.)
Zhejiang University ZJU
Original Assignee
Zhejiang University ZJU
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 Zhejiang University ZJU filed Critical Zhejiang University ZJU
Priority to CN201310020680.9A priority Critical patent/CN103092204B/en
Publication of CN103092204A publication Critical patent/CN103092204A/en
Application granted granted Critical
Publication of CN103092204B publication Critical patent/CN103092204B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

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

Abstract

The invention discloses a kind of Robotic Dynamic paths planning method of mixing, the method can be applied in environmental information part known and there is unknown dynamic and static state barrier simultaneously when.First obtain global path by a kind of genetic algorithm as Global Planning for above-mentioned situation, then carry out sector planning with the Artificial Potential Field Method improved.In sector planning, invention also contemplates that the Velocity-acceleration information of robot and barrier, so have good effect to process active path planning, in addition also contemplate the effect of Global motion planning path to sector planning.The present invention realizes simply, and the robot path obtained comparatively is optimized, and shows good dirigibility in the application simultaneously.

Description

A kind of Robotic Dynamic paths planning method of mixing
Technical field
The present invention relates to a kind of paths planning method, particularly relate to the paths planning method of a kind of mobile robot in the environment that there is dynamic barrier and static-obstacle thing.
Background technology
The planning of mobile robot's real-time route and navigation are one of key elements reflecting robot autonomous ability, are also one of more scabrous problems.The planning of the planning that robot path planning is mainly divided into environmental information known and environmental information the unknown.Adopt segregation reasons for the former, the path obtained is more excellent more, and the latter is many, and employing is planned online, embodies the real-time of path planning.
In recent years the method for many path plannings study by people.The method of main path planning can be divided into two classes---the method (AI) of artificial intelligence and Artificial Potential Field Method (APF).The method that the former mainly uses has genetic algorithm (GA), fuzzy logic control (FLC) and artificial neural network (ANN), and often comparatively complex calculation speed is also comparatively slow for these methods.And the latter is used widely due to its terseness and rapidity in robot path planning, what its basic thought was impact point in environment to its attractive force and barrier forms a kind of potential field environment to its repulsive force.In dynamic environment, Artificial Potential Field Method mainly contains two kinds for the thinking solving planning problem, a kind of resolving ideas is by propositions such as Fujimura, main thought is as a dimension using temporal information, dynamic disorder rule translation is static programming, but limitation is that the track of dynamic barrier needs known in advance.Another kind of solution is by propositions such as Ko and Lee, main thought is that the velocity information of barrier is incorporated in repulsive potential force function, Ge and Cui has done further improvement on this basis, and the benefit of the method is the track not needing to know in advance barrier, so have good real-time.
The real-life situation situation that component environment information is known often, as under the environment of plant, some operating modes are known, some operating modes are unknown.The path only obtained with above-mentioned online paths planning method is more for optimizing, only comparatively slow by above-mentioned off-line planning method computing velocity, compares and is difficult to process dynamic barrier.
Summary of the invention
The object of the invention is to overcome the deficiencies in the prior art, a kind of Robotic Dynamic paths planning method of mixing is provided.
The object of the invention is to be achieved through the following technical solutions: a kind of Robotic Dynamic paths planning method of mixing comprises the steps:
Step 1: utilize vision sensor to obtain environmental information, comprise the positional information of known quiescent state obstacle information in environment, impact point information and robot self;
Step 2: the environmental information obtained in step 1 represents with Grid Method, obtains grating map, the size of grid depends on planning precision;
Step 3: the path planning grating map genetic algorithm obtained in step 2 being carried out to the overall situation, obtain an overall path, this path is a broken line;
Step 4: extract break and global object point, starting point in the broken line obtained from step 3 as the key point needed for sector planning, these key points are the localized target point of sector planning;
Step 5: utilize the dynamic barrier of mobile robot's periphery and the key point described in step 4 as localized target point, adopt Artificial Potential Field Method (APF) to construct potential field environment, also add the line segment that is formed by connecting by the adjacent key point obtained in step 4 in potential field environment to the attractive force potential field of robot simultaneously;
Step 6: be subject to attractive force and repulsive force, the move under influence of making a concerted effort in the potential field environment that robot constructs in step 5, carry out localized target planning;
Step 7: judge whether the current position of robot arrives the localized target point described in step 4, if arrive localized target point, upgrading impact point is that next key point turns to step 5 to re-construct local potential field environment as localized target point;
Step 8: if current localized target point is that the global object point of environment is then when method after robot arrival global object point terminates;
The invention has the beneficial effects as follows, carry out segregation reasons, plan online circumstances not known known environment, combine both advantages, optimization was both compared in the path after planning, and also had stronger dirigibility to the process of the unknown barriers such as dynamic barrier.The method that the present invention proposes is more applicable for the path planning of actual automatic factory environment.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of the Robotic Dynamic paths planning method of mixing;
Tu2Shi robot is subject to repulsion vector plot.
Embodiment
Describe the present invention in detail below in conjunction with accompanying drawing, object of the present invention and effect will become more obvious.
As shown in Figure 1, the Robotic Dynamic paths planning method of the present invention's mixing comprises the steps:
Step 1: utilize vision sensor to obtain environmental information, comprise the positional information of known quiescent state obstacle information in environment, impact point information and robot self.
This step can adopt Liu Mingshuo. based on the flexible mechanical arm track following of binocular vision odometry. and in Zhejiang University academic dissertation .2011.04, the method for chapter 3 obtains the positional information of Obstacle Position and robot self.
Step 2: the environmental information obtained in step 1 represents with Grid Method, obtains grating map, the size of grid depends on planning precision.
This step can adopt Zhang Handong. the application of Lattice encoding new method in robot path planning. and Central China University of Science and Technology's journal: natural science edition, the method for 2007,35 (1): 50 one 53. represents environmental information Grid Method.
Step 3: the path planning grating map genetic algorithm obtained in step 2 being carried out to the overall situation, obtain an overall path, this path is a broken line.
This step can adopt Zhang Handong. the application of Lattice encoding new method in robot path planning. and Central China University of Science and Technology's journal: natural science edition, the method of 2007,35 (1): 50 one 53. uses genetic algorithm finally to obtain a broken line.
Step 4: extract break and global object point, starting point in the broken line obtained from step 3 as the key point needed for sector planning, these key points are the localized target point of sector planning.
Obtain the break of broken line and starting point and impact point, by its number consecutively 1,2,3 ... N, wherein 1 is starting point, and N is impact point, gets these key points as path planning.
Step 5: utilize the dynamic barrier of mobile robot's periphery and the key point described in step 4 as localized target point, adopt Artificial Potential Field Method (APF) to construct potential field environment, also add the line segment that is formed by connecting by the adjacent key point obtained in step 4 in potential field environment to the attractive force potential field of robot simultaneously.
The potential field environment of structure comprises gravitational field function and repulsion field function, and the function of potential field environment is as follows: U (q)=U att(q)+U rep(q), wherein U attq () is gravitational field function U repq () is repulsion field function, q is robot location's vector.
About gravitational field function, the present invention introduces velocity information and the acceleration information of robot relative target point on the basis of traditional gravitational field function, and stressed in gesture force field of such robot can adjust according to position, speed, acceleration.In addition, in order to follow the tracks of a preferably route, robot, except the attraction being subject to impact point, is subject to the attraction in the path that has existed all the time, i.e. so-called " line potential field ".Gravitational field function after improvement is: U att(q, v, a)=α q|| q-q g|| m+ α v|| v-v g|| n+ α a|| a-a g|| p+ α l(|| q-q line|| l+ || v-v line|| l+ || a-a line|| l) wherein q, v, a are respectively the vector of the position of robot, speed, acceleration, α q, α v, α abe scale-up factor with m, n, p, different values represents the weight of robot and impact point relative position information, relative velocity, relative acceleration information in gravitation function, α lwhat represent with l is the weight of line potential field.α v, α aand α lwhen being zero then, the gravitational field function of improvement is identical with traditional gravitational field function.Q g, v g, a gfor the position of impact point, speed and acceleration.Q line=(x 0, r (x 0)) twherein r (x) equation (x that is curve 0, r (x 0)) represent coordinate curve arriving the nearest point of mobile robot's current location, along with this coordinate of movement of robot can corresponding change.V line, a linefor speed and the acceleration of the point on path, usual desirable v line=(0,0) t, a line=(0,0) trepresent that robot is 0 to the acceleration of the point of the proximal most position on curve and speed.
In like manner repulsion field also comprises the positional information of robot and barrier and relative velocity and relative acceleration information, and such robot comprehensively above information can obtain that to keep away barrier stressed.Concrete formula is as follows: U rep(q, v, a)=α q(1/ ρ obs-1/ ρ 0)+α vv ro+ α aa rowherein be respectively the vector of the position of robot, speed, acceleration, ρ 0represent the safe distance of barrier to robot, only at ρ 0scope within the machine talent be subject to the repulsive interaction of barrier.ρ obs=|| q-q obs|| for the center of robot is to the distance at the center of barrier, α v, α aand α lscale-up factor, v roand a rorepresent the phasor difference of the speed of barrier and the speed of robot respectively, the phasor difference of the acceleration speed of barrier and the acceleration of robot.
Step 6: be subject to attractive force and repulsive force, the move under influence of making a concerted effort in the potential field environment that robot constructs in step 5, carry out localized target planning.
Robot is as follows at potential field environment lower stress: F=F att+ F repwherein F attfor robot is subject to attractive force, F repfor the repulsive force that robot is subject to.
Can be by attractive force suffered by the gravitation function Tui get robot in step 5 F att ( q , v , a ) = - ▿ U att ( q , v , a ) = - ▿ q U att ( q , v , a ) - ▿ v U att ( q , v , a ) - ▿ a U att ( q , v , a ) Robot is subject to the power F that gravitation has relative position to cause attq(q), the power F that relative velocity causes attv(v), the power F that relative velocity causes atta(a) F attq ( q ) = - ∂ U att ( q , v , a ) / ∂ q = mα q | | q - q g | | m - 1 e qrg + l α l | | q - q line | | l - 1 e qrline , F attv ( v ) = - ∂ U att ( q , v , a ) / ∂ v = nα v | | v - v g | | n - 1 e vrg + lα l | | v - v line | | l - 1 e vrline , F atta ( a ) = - ∂ U att ( q , v , a ) / ∂ a = pα a | | a - a g | | p - 1 e arg + lα line | | a - a line | | l - 1 e arline Then F att(q, v, a)=F attq(q)+F attv(v)+F atta(a), wherein e qrgrepresent that robot location points to object position, e vrgrepresent robot speed's vectors directed object velocity, e argrepresent that robot acceleration points to object acceleration, described in all the other sign synchronization rapid 5.
Can be by repulsion suffered by the repulsion function Tui get robot in step 5 F rep ( q , v , a ) = - ▿ U rep ( q , v , a ) = F repq ( q ) + F repv ( v ) + F repa ( a ) . F repq(q), F repv(v), F repaa () is respectively robot and barrier relative position, speed, acceleration cause repulsive force. F repq = α q e or / ρ obs 2 + α v v ro ⊥ e ro ⊥ / ρ obs + α a a ro ⊥ e ro ⊥ / ρ obs , F repvvv roe or, F repaav roe or, by F repqthree α vv ro ⊥e ro ⊥/ ρ obs, α aa ro ⊥e ro ⊥/ ρ obsbe defined as F respectively repq1, F repq2, F repq3what obtain the repulsion of robot according to above rule makes a concerted effort figure as shown in Figure 2.E orand e ro ⊥represent that barrier points to the direction of robot respectively, and robot points to barrier by rotating clockwise the direction after right angle, v ro ⊥e ro ⊥and a ro ⊥e ro ⊥represent v roand a roat e ro ⊥component on direction.F repqbe split as e ro ⊥the F in direction repq2and F repq3, at e orthe F in direction repq1and and F repqvand F repqamerge and obtain F repq3, described in all the other sign synchronization rapid 5.
Step 7: judge whether the current position of robot arrives the localized target point described in step 4, if arrive localized target point, upgrading impact point is that next key point turns to step 5 to re-construct local potential field environment as localized target point.
Robot self position current can be learnt by vision sensor by robot, if robot arrives localized target point then get 1 described in step 4 ... next key point in N, and mark a key point and access.
Step 8: if current localized target point is that the global object point of environment is then when method after robot arrival global object point terminates.
The present invention is directed to the situation that environmental information part is known, have employed a kind of barrier-avoiding method of mixing, first carry out Global motion planning by genetic algorithm and obtain global path, then modified embedded-atom method carry out sector planning.Add velocity information and acceleration information in the artificial potential function improved, not only can enable robot preferably avoiding obstacles but also robot can be made to arrive impact point to be unlikely to speed excessive.The artificial potential function improved also add line potential field, and for following the tracks of expected path preferably, this method simple possible, can meet the requirement of robot real-time route planning.

Claims (1)

1. a Robotic Dynamic paths planning method for mixing, is characterized in that, comprise the steps:
Step 1: utilize vision sensor to obtain environmental information, comprise the positional information of known quiescent state obstacle information in environment, impact point information and robot self;
Step 2: the environmental information obtained in step 1 represents with Grid Method, obtains grating map, the size of grid depends on planning precision;
Step 3: the path planning grating map genetic algorithm obtained in step 2 being carried out to the overall situation, obtain an overall path, this path is a broken line;
Step 4: extract break and global object point, starting point in the broken line obtained from step 3 as the key point needed for sector planning, these key points are the localized target point of sector planning;
Step 5: utilize the dynamic barrier of mobile robot's periphery and the key point described in step 4 as localized target point, adopt Artificial Potential Field Method (APF) to construct potential field environment, also add the line segment that is formed by connecting by the adjacent key point obtained in step 4 in potential field environment to the attractive force potential field of robot simultaneously; This step is specially: the function of structure potential field environment is as follows: U (q)=U att(q)+U rep(q), wherein U attq () is gravitational field function, U repq () is repulsion field function, q is robot location's vector;
On the basis of traditional gravitational field function, wherein introduce velocity information and the acceleration information of robot relative target point, stressed in gesture force field of such robot can adjust according to position, speed, acceleration; In addition, in order to follow the tracks of a preferably route, robot, except the attraction being subject to impact point, is subject to the attraction in the path that has existed all the time, and improving its formula is U att(q, v, a)=α q|| q-q g|| m+ α v|| v-v g|| n+ α a|| a-a g|| p+ α l(|| q-q line|| l+ || v-v line|| l+ || a-a line|| l), wherein, q g, v g, a gfor the position of impact point, speed and acceleration; q line=(x 0, r (x 0)) t, the wherein equation of ideal path curve that obtains for Global motion planning of r (x), (x 0, r (x 0)) represent coordinate curve arriving the nearest point of mobile robot's current location, along with this coordinate of movement of robot can change accordingly; v line, a linefor speed and the acceleration of the point on path; || q-q g|| m, || v-v g|| n, || a-a g|| prepresent the potential field information of the relative position between robot and impact point, relative velocity, relative acceleration respectively; M, n, p are positive integer, and be worth larger, the intensity of these potential field information is higher; α q, α v, α abe scale-up factor, represent the weight of the potential field information of above-mentioned relative position, relative velocity, relative acceleration in gravitation function; Similarly, || q-q line|| l, || v-v line|| l, || a-a line|| lrepresent the potential field information of the relative position between robot and ideal path curve, relative velocity, relative acceleration respectively, they with expression line potential field information; L is positive integer, is worth larger, and the intensity of line potential field information is higher; α lbe the real number between 0 to 1, expression be the weight of line potential field information;
In like manner repulsion field also comprises the positional information of robot and barrier and relative velocity and relative acceleration information, and such robot comprehensively above information can obtain that to keep away barrier stressed; Concrete formula is as follows: U rep(q, v, a)=α q(1/ ρ obs-1/ ρ 0)+α vv ro+ α aa ro, wherein q, v, a are respectively the vector of the position of robot, speed, acceleration, ρ 0represent the safe distance of barrier to robot, only at ρ 0scope within the machine talent be subject to the repulsive interaction of barrier; ρ obs=|| q-q obs|| for the center of robot is to the distance at the center of barrier, α v, α aand α qbe scale-up factor, represent the weight of the potential field information of above-mentioned relative velocity, relative acceleration, relative position in repulsion function, v roand a rorepresent the phasor difference of the speed of barrier and the speed of robot respectively, the phasor difference of the acceleration of barrier and the acceleration of robot;
Step 6: be subject to attractive force and repulsive force, the move under influence of making a concerted effort in the potential field environment that robot constructs in step 5, carry out localized target planning;
Step 7: judge whether the current position of robot arrives the localized target point described in step 4, if arrive localized target point, upgrading impact point is that next key point turns to step 5 to re-construct local potential field environment as localized target point;
Step 8: if current localized target point is that the global object point of environment is then when method after robot arrival global object point terminates.
CN201310020680.9A 2013-01-18 2013-01-18 A kind of Robotic Dynamic paths planning method of mixing Expired - Fee Related CN103092204B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310020680.9A CN103092204B (en) 2013-01-18 2013-01-18 A kind of Robotic Dynamic paths planning method of mixing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310020680.9A CN103092204B (en) 2013-01-18 2013-01-18 A kind of Robotic Dynamic paths planning method of mixing

Publications (2)

Publication Number Publication Date
CN103092204A CN103092204A (en) 2013-05-08
CN103092204B true CN103092204B (en) 2016-04-13

Family

ID=48204903

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310020680.9A Expired - Fee Related CN103092204B (en) 2013-01-18 2013-01-18 A kind of Robotic Dynamic paths planning method of mixing

Country Status (1)

Country Link
CN (1) CN103092204B (en)

Families Citing this family (57)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103455034B (en) * 2013-09-16 2016-05-25 苏州大学张家港工业技术研究院 A kind of based on the histogrammic obstacle-avoiding route planning method of minimum distance vector field
CN103760904B (en) * 2014-02-13 2016-10-19 北京工业大学 A kind of voice broadcast type intelligent vehicle path planning apparatus and implementation
CN104020776B (en) * 2014-06-13 2016-08-24 哈尔滨工程大学 The tracking of the UUV motion lash ship to having multiple prohibited area
CN104317292A (en) * 2014-09-16 2015-01-28 哈尔滨恒誉名翔科技有限公司 Method for planning collision avoidance path of robot with complicated shape
CN104202793A (en) * 2014-09-26 2014-12-10 江南大学 Obstacle avoidance method by adopting connected graph in mixed wireless sensor network
CN104536445B (en) * 2014-12-19 2018-07-03 深圳先进技术研究院 Mobile navigation method and system
CN104390648B (en) * 2014-12-22 2017-07-11 中国矿业大学 A kind of Mine Disaster Relief Robot paths planning method based on Artificial Potential Field
CN104606886B (en) * 2014-12-25 2017-10-17 珠海金山网络游戏科技有限公司 A kind of method of distributed collisionless movement planning
CN105988468A (en) * 2015-01-28 2016-10-05 中国人民公安大学 Improved genetic algorithm-based mobile robot path planning method
CN104881026B (en) * 2015-04-28 2017-11-24 国家电网公司 High-tension line rushes to repair mechanical arm mobile route planning system and method
CN104808671B (en) * 2015-05-19 2017-03-15 东南大学 A kind of robot path planning method under domestic environment
CN105589459B (en) * 2015-05-19 2019-07-12 中国人民解放军国防科学技术大学 The semi-autonomous remote control method of unmanned vehicle
CN105320133A (en) * 2015-10-26 2016-02-10 广东雷洋智能科技股份有限公司 Improved potential grid method applied to floor cleaning robots
CN105446339B (en) * 2015-12-22 2018-03-16 安徽工程大学 A kind of method for planning path for mobile robot
CN105526942B (en) * 2016-01-25 2019-03-08 重庆邮电大学 Intelligent vehicle paths planning method based on threat estimating
CN105629974B (en) * 2016-02-04 2018-12-04 重庆大学 A kind of robot path planning method and system based on modified Artificial Potential Field Method
CN105974917B (en) * 2016-05-11 2018-12-14 江苏大学 A kind of vehicle obstacle-avoidance path planning research method based on novel artificial potential field method
CN106020199B (en) * 2016-07-06 2018-10-23 江苏科技大学 Coagulo meter dynamic obstacle avoidance paths planning method based on optimization Artificial Potential Field Method
CN106569491A (en) * 2016-10-31 2017-04-19 江苏华航威泰机器人科技有限公司 Robot obstacle avoidance trajectory planning method
CN106325285A (en) * 2016-11-05 2017-01-11 杭州畅动智能科技有限公司 Control method based on underwater obstacle avoidance device
CN106708063A (en) * 2017-03-22 2017-05-24 江南大学 Route planning method for search and rescue robot in chemical disaster scene
WO2018195815A1 (en) * 2017-04-26 2018-11-01 深圳市元征科技股份有限公司 Article delivery method and terminal
CN108873875B (en) * 2017-05-08 2023-11-14 中国华电集团有限公司青海分公司 Robot steering motion control method and device, robot and storage medium
CN107065880A (en) * 2017-05-16 2017-08-18 南京农业大学 Remote operating agricultural vehicle man-computer cooperation paths planning method based on dynamic guiding point
EP4129581A1 (en) * 2017-05-18 2023-02-08 KUKA Hungária Kft. Robot motion planning for avoiding collision with moving obstacles
CN107092255A (en) * 2017-05-19 2017-08-25 安徽工程大学 A kind of multi-robots path-planning method based on improved adaptive GA-IAGA
CN107357293A (en) * 2017-07-31 2017-11-17 上海应用技术大学 Method for planning path for mobile robot and system
CN107544502A (en) * 2017-09-25 2018-01-05 华中科技大学 A kind of Planning of Mobile Robot under known environment
CN107992036B (en) * 2017-11-20 2021-03-16 汕头大学 Method and device for planning vehicle access path in intelligent parking garage and storage medium
CN108170136A (en) * 2017-12-15 2018-06-15 武汉理工大学 More unmanned boat formation control system and methods based on wireless sensor network
CN108171796A (en) * 2017-12-25 2018-06-15 燕山大学 A kind of inspection machine human visual system and control method based on three-dimensional point cloud
CN108508913B (en) * 2018-03-29 2021-03-02 中国海洋大学 Autonomous underwater vehicle seabed path planning method based on data driving
CN109358637B (en) * 2018-05-25 2021-11-09 武汉科技大学 Three-dimensional obstacle avoidance method for earth surface close-range autonomous exploration unmanned aerial vehicle based on preset air route
CN108803614A (en) * 2018-07-04 2018-11-13 广东猪兼强互联网科技有限公司 A kind of unmanned machine people path planning system
CN108898866B (en) * 2018-07-04 2021-03-16 矩阵数据科技(上海)有限公司 Intelligent vehicle control system
CN108958250A (en) * 2018-07-13 2018-12-07 华南理工大学 Multisensor mobile platform and navigation and barrier-avoiding method based on known map
CN108983789A (en) * 2018-08-20 2018-12-11 广东华中科技大学工业技术研究院 A kind of path planning of unmanned boat and lay dispatching method
CN108955696B (en) * 2018-09-30 2020-07-03 江苏美的清洁电器股份有限公司 Sweeper and path planning method and device thereof
CN109445440B (en) * 2018-12-13 2022-03-22 重庆邮电大学 Dynamic obstacle avoidance method based on sensor fusion and improved Q learning algorithm
CN109782757A (en) * 2018-12-30 2019-05-21 芜湖哈特机器人产业技术研究院有限公司 A kind of path dispatching method of more AGV systems based on subsection scheduling
CN109945873B (en) * 2019-04-04 2022-07-15 东南大学 Hybrid path planning method for indoor mobile robot motion control
CN109945885B (en) * 2019-04-16 2021-01-15 清华大学 Unmanned motorcycle dynamic obstacle avoidance path planning and calculating method
CN110673633B (en) * 2019-09-29 2023-04-07 合肥工业大学 Power inspection unmanned aerial vehicle path planning method based on improved APF
CN111369038B (en) * 2020-02-25 2022-06-14 华南理工大学 Multi-target dynamic scheduling method based on genetic algorithm
CN111506068B (en) * 2020-04-20 2023-02-03 哈尔滨工程大学 Water surface unmanned ship local path planning method for multi-beam sonar scanning operation
WO2021242215A1 (en) * 2020-05-26 2021-12-02 Edda Technology, Inc. A robot path planning method with static and dynamic collision avoidance in an uncertain environment
TWI780468B (en) 2020-08-13 2022-10-11 國立陽明交通大學 Method and system of robot for human following
CN112034853A (en) * 2020-09-04 2020-12-04 南京凌华微电子科技有限公司 Working method of household monitoring robot
CN112099501B (en) * 2020-09-15 2022-10-28 哈尔滨工程大学 Unmanned ship path planning method based on potential field parameter optimization
CN112092810B (en) * 2020-09-24 2022-06-14 上海汽车集团股份有限公司 Vehicle parking-out method and device and electronic equipment
CN112882479B (en) * 2021-01-28 2022-11-22 南通大学 Path planning method based on internal and external angle accumulation state
CN113199474B (en) * 2021-04-25 2022-04-05 广西大学 Robot walking and operation intelligent cooperative motion planning method
CN113791627B (en) * 2021-11-16 2022-02-11 中国科学院自动化研究所 Robot navigation method, equipment, medium and product
CN114355926B (en) * 2021-12-29 2022-10-14 深圳市云鼠科技开发有限公司 Path planning method and device, robot and storage medium
CN116414118A (en) * 2021-12-31 2023-07-11 追觅创新科技(苏州)有限公司 Path planning method and system based on obstacle marks and self-moving robot
CN114779821B (en) * 2022-05-25 2023-06-27 四川大学 Unmanned aerial vehicle self-adaptive repulsive force coefficient path planning method based on deep learning
CN115907248B (en) * 2022-10-26 2023-07-14 山东大学 Multi-robot unknown environment path planning method based on geometric neural network

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070100496A1 (en) * 2003-05-27 2007-05-03 Stockholmsmassan Robot system, method and computer program product
CN101077578A (en) * 2007-07-03 2007-11-28 北京控制工程研究所 Mobile Robot local paths planning method on the basis of binary environmental information
CN101359229A (en) * 2008-08-18 2009-02-04 浙江大学 Barrier-avoiding method for mobile robot based on moving estimation of barrier

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070100496A1 (en) * 2003-05-27 2007-05-03 Stockholmsmassan Robot system, method and computer program product
CN101077578A (en) * 2007-07-03 2007-11-28 北京控制工程研究所 Mobile Robot local paths planning method on the basis of binary environmental information
CN101359229A (en) * 2008-08-18 2009-02-04 浙江大学 Barrier-avoiding method for mobile robot based on moving estimation of barrier

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
机器人动态路径规划与协作路径规划研究;梁文君;《中国优秀硕士学位论文全文数据库》;20100815(第08期);第3、9、20-26、28页 *
移动机器人路径规划方法研究;曲道奎等;《机器人》;20080331;第30卷(第2期);第97-99页 *

Also Published As

Publication number Publication date
CN103092204A (en) 2013-05-08

Similar Documents

Publication Publication Date Title
CN103092204B (en) A kind of Robotic Dynamic paths planning method of mixing
Kirby et al. Companion: A constraint-optimizing method for person-acceptable navigation
Deng et al. Two-wheeled mobile robot motion control in dynamic environments
CN105867365B (en) Path planning navigation system and method based on modified embedded-atom method
CN105629974A (en) Robot path planning method and system based on improved artificial potential field method
Zhang et al. A cooperative-control-based underwater target escorting mechanism with multiple autonomous underwater vehicles for underwater Internet of Things
CN104317292A (en) Method for planning collision avoidance path of robot with complicated shape
Ardiyanto et al. Real-time navigation using randomized kinodynamic planning with arrival time field
CN104076688A (en) Master-slave type cooperative control method for autonomous underwater vehicles
CN106054876A (en) Obstacle avoidance path optimal successive operation planning method for spatial multiplexing
Yang et al. Smooth trajectory planning along Bezier curve for mobile robots with velocity constraints
Tian et al. Improved algorithm for navigation of rescue robots in underground mines
Qi Spatial target path following control based on Nussbaum gain method for underactuated underwater vehicle
Zhuang et al. Mobile robot hybrid path planning in an obstacle-cluttered environment based on steering control and improved distance propagating
Liu et al. TD3 Based Collision Free Motion Planning for Robot Navigation
Yin et al. An improved potential field method for mobile robot path planning in dynamic environments
Jiang et al. Design and full-link trajectory tracking control of underwater snake robot with vector thrusters under strong time-varying disturbances
Woo Mobile robot path planning with randomly moving obstacles and goal
Hassan et al. A global integrated artificial potential field/virtual obstacles path planning algorithm for multi-robot system applications
Wang et al. Efficient reinforcement learning for autonomous ship collision avoidance under learning experience reuse
Meng et al. A navigation framework for mobile robots with 3D LiDAR and monocular camera
Furukawa et al. Wind‐Disturbance‐Based Control Approach for Blimp Robots
Suh et al. Energy-efficient high-dimensional motion planning for humanoids using stochastic optimization
Li et al. A novel hybrid path planning method for mobile robots
Yao Path Planning Algorithm of Indoor Mobile Robot Based on ROS System

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20160413

Termination date: 20190118