CN104407616A - Dynamic path planning method for mobile robot based on immune network algorithm - Google Patents
Dynamic path planning method for mobile robot based on immune network algorithm Download PDFInfo
- Publication number
- CN104407616A CN104407616A CN201410729927.9A CN201410729927A CN104407616A CN 104407616 A CN104407616 A CN 104407616A CN 201410729927 A CN201410729927 A CN 201410729927A CN 104407616 A CN104407616 A CN 104407616A
- Authority
- CN
- China
- Prior art keywords
- antibody
- path
- robot
- affinity
- network 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.)
- Granted
Links
Landscapes
- Manipulator (AREA)
- Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)
- Feedback Control In General (AREA)
Abstract
The invention discloses a dynamic path planning method for a mobile robot based on an immune network algorithm. The method comprises the following steps: firstly, acquiring information of working environment of the mobile robot, processing the acquired information, and expressing a static obstacle in the surrounding environment by using a rectangular bounding box; secondly, planning a global path by applying an improved immune network algorithm on the basis of the collected static environment information; thirdly, allowing the robot to move forward along the planned path, if the unknown obstacle is found, predicting whether the unknown obstacle hampers normal running of the robot or not, if the unknown obstacle influences the normal running of the robot, predicting a dangerous area with possible collision; fourthly, forming a new local environment view according to the predicated result, and planning a new local path by applying the immune network algorithm; fifthly, when the robot reaches a temporary target point of local planning, allowing the robot to return to the planned global path for continuous advancement. According to the dynamic path planning method disclosed by the invention, a global optimal path can be solved under the condition that a complex environment is guaranteed, and the optimum of the local dynamic area path planning can also be guaranteed.
Description
Technical field: the present invention relates to a kind of mobile robot's dynamic path planning method based on Immune network algorithm.The present invention can be widely used in solve relative complex dynamic environment under mobile robot's path planning problem.
Background technology: path planning is one of mobile robot's core content learning research, its objective is in the working environment with barrier, find a suitable safety movement path from given starting point to impact point, make robot can walk around all barriers without collision in motion process.In the relation technological researching of mobile robot, Path Planning Technique is an important field of research.
In reality, under most cases, mobile robot is in dynamic uncertain environments, and to the dynamic barrier in this kind of environment, mobile robot is difficult to be possessed priori and only has component environment information.In this case, mobile robot can only carry out local paths planning according to the environmental information real-time detected.In order to solve this kind of path planning problem, normally traditional global path planning algorithm is combined with the method for prediction of collision, as the algorithm that a kind of pre-collision sensing method combines with Artificial Potential Field Method, the travelling speed that this algorithm changes mobile robot according to the position that prediction collides with dynamic barrier is hidden, but it does not consider the global path planning ability of mobile robot under complex environment.For solving above-mentioned deficiency, the mobile robot path planning under the present invention uses a kind of Immune network algorithm of improvement to be applied to part circumstances not known.
Immune network algorithm is the important method of in Artificial Immune Algorithm.The distinct network proposing immune system internal regulation based on Jerne is theoretical, de Castro and Timmis proposed Immune network algorithm (opt-aiNet) in 2002, it has fast convergence rate, solving precision is high, stability is good, and effectively can overcome the feature of " precocity ", make it in global optimizing and optimal speed, have advantage, be therefore suitable for solving the complexity many obstacles Global motion planning problem in mobile robot path planning and quick dynamic obstacle avoidance planning problem.
Summary of the invention:
Goal of the invention: in order to improve the problem solving quality and solution efficiency of mobile robot path planning problem, the invention provides a kind of mobile robot's dynamic path planning method based on Immune network algorithm, the method not only can solve mobile robot global path planning in circumstance complication situation, is also applicable to the local paths planning under component environment unknown situation.
Technical scheme:
A kind of mobile robot's dynamic path planning method based on Immune network algorithm, it is characterized in that: first based on Visual Graph method, pre-service is carried out to overall static environment space, apply Immune network algorithm afterwards and cook up global path, ambient condition information is detected in real time in the process of advancing, risk prediction is carried out to the unknown dynamic disorder entering sensing range, form new local environment Visual Graph according to the result of prediction and apply Immune network algorithm and plan the local path made new advances, continue to advance in the global path of the preplanning got back to after robot arrives the transient target point of sector planning.
(1), the implementation procedure of Immune network algorithm:
Through to the improvement of Immune network algorithm and and the combination of Visual Graph, the concrete performing step of algorithm is as follows:
(1) pre-service is carried out to the environment space that mobile robot runs, build Visual Graph;
(2) according to the Establishment and analysis of Visual Graph, sum up priori and also extract vaccine, not there is not setback in the bounding box of penetrate thing and the antibody of generation or path to comprise the antibody of generation or path;
(3) initialization of population: first vaccine inoculation, in search volume, produce m antibody and m paths by implanting vaccine, the generating mode in path progressively extends to impact point from starting point, forms initial parent population by this m antibody and m paths
wherein subscript i represented for the i-th generation, and subscript m represents antibody number;
(4) stop condition: the affinity finally determining antibody according to the concentration between the fitness between antibody and antigen and antibody, calculate current parent for population genetic algebra and
in the affinity of all antibody, if satisfy condition, then stop computing and Output rusults, otherwise continue;
(5) clonal expansion: produce n clone body respectively to each antibody (path) in above-mentioned antibody population, now amplification is m*n clonal antibody (path), and now antibody population becomes
every paths all copies n doubly, and next step path variation will be more abundant, add often for the diversity of antibody;
(6) high frequency closedown: clonal antibody group
in the antibody of each clone all to experience high frequency closedown and obtain
here refer to antagonist path to carry out increasing or deletion of node;
(7) recalculate adaptation value: all individualities in antagonist group, comprise each father's antibody and variant clone antibody thereof, recalculate its affinity;
(8) memory antibody group upgrades: from each father's antibody and clonal antibody thereof
in, select to have the variant clone antibody of the highest affinity, elite's antibody variants group of what common composition m was new have most high-affinity
and it can be used as the candidate upgrading memory antibody group, then from
with
in select the new elite's antibody variants group of m the composition that affinity is the highest
calculate the average affinity in memory antibody group afterwards again;
(9) immune self-regulation and receptor editing: the individual brand-new antibody of stochastic generation r (r<m)
replace now antibody population
the individual antibody with minimum affinity of middle r, to simulate the receptor editing process in Immune System, increase the diversity of antibody population, thus, namely algorithm creates follow-on antibody population
return step 4 afterwards;
(2), based on mobile robot's active path planning step of Immune network algorithm:
Send out for mobile the situation that robot working space is the unknown of environmental information part, concrete path planning step is as follows:
(1) global path planning is carried out to the Immune network algorithm of known static context information application enhancements;
(2) robot advances along the path cooked up;
(3) judge whether to arrive impact point, arrive and then terminate, do not arrive the path of then continuing along cooking up and advance;
Because the information of the static-obstacle thing in environment space is known in advance, so whenever robot ambulation one step will judge whether the distance between robot and each known static-obstacle thing is less than scrolling windows, the i.e. radius of the sensing range of sensor, so just can show whether these static-obstacle things have appeared in the scope of scrolling windows;
(4) judge whether dyskinesia hinders the normal traveling of robot;
(5) dope mark unknown dynamic barrier can with along the preplanning good path robot of advancing next certain T moment collides, then the position in this Unknown Motion barrier T moment is recorded, be used as " static-obstacle thing " process, consider the uncertain factor in the error of prediction and actual environment, the region of this " static-obstacle thing " is expanded, is denoted as hazardous location;
(6) when hazardous location enters after within scrolling windows completely, robot using the path intersection point of current time scrolling windows preplanning with it as interim localized target point, the position of current robot is as starting point, static-obstacle thing in perceived window and hazardous location are as local environmental information, application Immune network algorithm plans the path made new advances, robot, along the route of new planning, returns step 3.
(2) in (4) step of step, robot first need not consider scrolling windows in the process of advancing, until sensor finds that new unknown barrier enters within scrolling windows, namely, when the distance of unknown barrier and robot is less than the radius of scrolling windows, marks this unknown dynamic barrier and start to predict the movement locus of unknown barrier; The result of prediction is divided into following two kinds of situations: one is the normal traveling that unknown barrier can not hinder robot, then robot continue along the good path of preplanning advance, namely return to step 2; Two is dope the normal traveling that dyskinesia may hinder robot, then forward (5) step of (two) step to.
The design of antibody in Immune network algorithm:
After Visual Graph method is to the process of mobile work robot environment space, form antibody path only to need to consider the element in the set V on each barrier summit, do not need to consider any point outside in environment space, such hunting zone will significantly be reduced, and efficiency of algorithm is improved.The structure of each node is as follows:
| IDpoint | IDobject | x | y |
Wherein IDpoint represents node serial number, and IDobject represents barrier numbering belonging to node, and x, y represent the transverse and longitudinal coordinate of node respectively, in mobile robot path planning problem, antigen represents problem to be solved and optimal path, the application is set as the Euclidean distance of starting point s and impact point g, antibody represents the solution of required problem, namely the feasible path searched out, it is by the starting point of mobile robot, the broken line that impact point and a series of intermediate node connect into is formed, for describing path trend clearly, through the order of node when in antibody, the order of element represents moveable robot movement, antibody adopts string encoding mode, its length can change with the number of node, the data structure of antibody enter lower shown in:
| Affinity | Density | Fitness | Length | s | … | v | … | g |
Wherein Affinity represents the affinity of antibody, evaluates the quality of antibody here with affinity; Fitness represents the fitness of antibody, has and has higher fitness compared with the antibody of short path; Density represents the concentration of antibody, the ratio namely in antibody population shared by same antibody, and Length represents the length of antibody by s to g, and remainder is form the node in path, this storage organization when antibody changes, the length of flexibly changing antibody;
The calculating of affinity in Immune network algorithm:
The application, in order to suppress and avoid the appearance of precocious phenomenon, adds the calculating of antibody concentration here, and the computing formula of concrete affinity is as follows:
Wherein Affinity (i) represents the affinity of antibody i; Fitness (i) represents the fitness of antibody i, and distance dependent, and the distance in antibody path is shorter, and the fitness of its antibody is higher; Density (i) represents the concentration of antibody i, and namely identical antibody path is more, and the concentration of antibody is larger; α is a positive constant, and can find out that fitness is larger by this formula, affinity is larger; Concentration is higher, and affinity is less.
Advantage and effect: the invention provides a kind of mobile robot's dynamic path planning method based on Immune network algorithm, path length as weighing the whether excellent main standard in path, be have studied the paths planning method that the opt-aiNet algorithm in Idiotype immune network theory combines with Visual Graph by the application under known at static context information, unknown dynamic barrier information circumstances not known.First based on Visual Graph method, overall static environment space is described, applies Immune network algorithm afterwards and cook up global path.Ambient condition information is detected in real time in robot moving process, risk prediction is carried out to the unknown dynamic disorder entering sensing range, form new local environment Visual Graph according to the result of prediction and apply Immune network algorithm and plan the local path made new advances, thus realize the combination of local dynamic station planning and overall static programming.In addition, the problem such as evolution precocity, antibody deficiency diversity easily occurred when immunological network carries out robot path planning, introduces the computing method of antibody concentration.The present invention also can ensure the optimum that local dynamic station zone routing is planned on the basis ensureing global optimum path.
Accompanying drawing illustrates:
Fig. 1 robot working environment schematic diagram;
Fig. 2 local paths planning process flow diagram;
Fig. 3 Immune network algorithm process flow diagram;
The path planning of Fig. 4 working environment relative complex;
The statistics of Fig. 5 evolutionary generation;
The analysis of Fig. 6 population antibody affinity;
There is the path planning of unknown dynamic barrier in Fig. 7.
Embodiment: the present invention is described further below in conjunction with accompanying drawing:
Fig. 1 represents mobile work robot environment space, the dolly of advancing along path represents mobile robot, the dashed circle of its periphery is the local sensing scope of mobile robot, i.e. effective sensing range (as laser sensor, sonac or panoramic vision sensor etc.) of sensor, s represents the starting point of mobile robot, g represents the final goal point of mobile robot, and the static-obstacle thing that black rectangle represents in environment space (uses O
jrepresent), in environment space, another dolly represents dynamic barrier, and arrow represents its direction of motion, and four summits of the Rectangular Bounding Volume of each barrier have fixing numbering (to use v
irepresent), the corresponding relation of the numbering i on its summit and the numbering j of barrier is i=1,2 ..., j*4.
Consider the physical size of mobile robot herein, the dotted line frame of certain safe distance namely barrier bounding box periphery is reserved when building barrier bounding box, the all end points satisfied condition in Fig. 1 are connected, namely form Visual Graph, in figure, the line of every bar point g from starting point s to final goal is a paths (also representing an antibody).Through the order on summit when the method for expressing in path is moveable robot movement, as path1=s → v
9→ v
2→ g.
Through the pre-service of Visual Graph method to environment space, the point all from working environment of the scope of algorithm search tapers to node and the impact point of each barrier, make the hunting zone huge compression of algorithm, significantly improve the speed of convergence of optimized algorithm, enable to adapt to real-time local paths planning.
A kind of mobile robot path planning step based on Immune network algorithm:
Send out for mobile the situation that robot working space is the unknown of environmental information part, as shown in Figure 2, concrete path planning step is as follows:
Step 1: obtain the information of mobile work robot environment and it is processed, the static-obstacle thing in surrounding environment is represented by the mode of Rectangular Bounding Volume.
The complexity of algorithm search and the requirement of real-time caused by the polytrope considering mobile work robot environment, the application adopts Visual Graph method to describe the working environment at mobile robot place.Note Visual Graph VG=(V, L), wherein V is by each summit of each barrier bounding box and starting point s, impact point g and each barrier Rectangular Bounding Volume, the set that the application adopts each summit of Rectangular Bounding Volume to form, L represents " visual " line between each summit, if namely these lines are not crossing with barrier, think that line segment is " visual ", the combination of so all " visual " lines is the Visual Graph in current environment space, and what every bar line also represented mobile robot can operating path.
Utilize the working environment space of Visual Graph method to mobile robot to carry out planning process, the problem of core is construction cost matrix, i.e. the matrix of the size formation of the spacing of each node.With node serial number, four summits of each barrier Rectangular Bounding Volume and starting point, impact point represent the row and column in Cost matrix, the Euclidean distance of content in row and column between two nodes that can directly be communicated with represents, wherein ∞ represents that the line between two nodes passes barrier, and namely cost is infinitely great.Utilize Cost matrix, the cost needed for arbitrary path can be calculated fast; After Cost matrix construction complete, solve the extraction of mobile robot path planning problem time vaccines and the determination of antibody coding mode by affecting Immune network algorithm to a certain extent.
Step 2: apply Immune network algorithm and carry out global path planning on the static context information basis of having collected.
Problem to be solved and optimal path are considered as antigen, the solution (optimal path obtained) of problem is considered as antibody, stochastic generation is to the initial path of determined number (antibody), adopt selects, copy, the operator such as transform path carries out evolutional operation to population, generation is better than the filial generation path in parent path.Here the simulation of interphase interaction to antibody in network or immune self-regulating function is added, by the similarity degree between calculating antibody, the dynamically number of antibody in balance antibody group.
The coded system of this step to the account form of the affinity in Immune network algorithm and antibody and gene thereof is improved.
As shown in Figure 3, its algorithm steps is as follows for the process flow diagram of application Immune network algorithm realizing route planning:
(1) according to the Establishment and analysis of Visual Graph, sum up priori and also extract vaccine, not there is not setback in the bounding box of penetrate thing and the antibody (path) of generation to comprise the antibody (path) of generation.
After Visual Graph method is to the process of mobile work robot environment space, form antibody path only to need to consider the element in the set V on each barrier summit, do not need to consider any point outside in environment space, such hunting zone will significantly be reduced, and efficiency of algorithm is improved.The structure of each node is as shown in table 1:
| IDpoint | IDobject | x | y |
Table 1 nodes encoding form
Wherein IDpoint represents node serial number, and IDobject represents barrier numbering belonging to node, and x, y represent the transverse and longitudinal coordinate of node respectively.In mobile robot path planning problem, antigen represents problem to be solved and optimal path, and the application is set as the Euclidean distance of starting point s and impact point g.Antibody represents the solution of required problem, the feasible path namely searched out, and the broken line that it is connected into by the starting point of mobile robot, impact point and a series of intermediate node is formed.For describing path trend clearly, through the order of node when in antibody, the order of element represents moveable robot movement.Antibody adopts string encoding mode, and its length can change with the number of node, shown in the data structure table 2 of antibody:
| Affinity | Density | Fitness | Length | s | … | v | … | g |
Table 2 antibody coding form
Wherein Affinity represents the affinity of antibody, evaluates the quality of antibody here with affinity; Fitness represents the fitness of antibody, has and has higher fitness compared with the antibody of short path; Density represents the concentration of antibody, the ratio namely in antibody population shared by same antibody, and Length represents the length of antibody by s to g, and remainder is form the node in path, this storage organization when antibody changes, the length of flexibly changing antibody.
In Immune network algorithm, the affinity of antibody plays an important role, and especially upgrade memory antibody group and weigh the value of antibody in immune self-regulation step with affinity, thus antagonist screens.
The affinity of antibody refers to the bond strength of antibody and antigen, and the application's affinity evaluates the quality of antibody.In order to suppress and avoid the appearance of precocious phenomenon, add the calculating of antibody concentration here.The computing formula of concrete affinity is as follows:
Wherein Affinity (i) represents the affinity of antibody i; Fitness (i) represents the fitness of antibody i, and distance dependent, and the distance in antibody path is shorter, and the fitness of its antibody is higher; Density (i) represents the concentration of antibody i, and namely identical antibody path is more, and the concentration of antibody is larger; α is a positive constant.Can find out that fitness is larger by this formula, affinity is larger; Concentration is higher, and affinity is less.
(2) initialization of population: first vaccine inoculation, m antibody (m paths) is produced by implanting vaccine in search volume, the generating mode in path progressively extends to impact point from starting point, forms initial parent population by this m antibody (m paths)
wherein subscript i represented for the i-th generation, and subscript m represents antibody number.
(3) stop condition: the affinity finally determining antibody according to the concentration between the fitness between antibody and antigen and antibody, calculate current parent for population genetic algebra and
in the affinity of all antibody, if satisfy condition, then stop computing and Output rusults, otherwise continue.
(4) clonal expansion: produce n clone body respectively to each antibody (path) in above-mentioned antibody population, now amplification is m*n clonal antibody (path), and now antibody population becomes
every paths all copies n doubly, and next step path variation will be more abundant, add often for the diversity of antibody.
(5) high frequency closedown: clonal antibody group
in the antibody of each clone all to experience high frequency closedown and obtain
here refer to antagonist path to carry out increasing or deletion of node.
(6) recalculate adaptation value: all individualities in antagonist group, comprise each father's antibody and variant clone antibody thereof, recalculate its affinity.
(7) memory antibody group upgrades: from each father's antibody and clonal antibody thereof
in, select to have the variant clone antibody of the highest affinity, elite's antibody variants group of what common composition m was new have most high-affinity
and it can be used as the candidate upgrading memory antibody group, then from
with
in select the new elite's antibody variants group of m the composition that affinity is the highest
calculate the average affinity in memory antibody group afterwards again.
(8) immune self-regulation and receptor editing: the individual brand-new antibody of stochastic generation r (r<m)
replace now antibody population
the individual antibody with minimum affinity of middle r, to simulate the receptor editing process in Immune System, increases the diversity of antibody population.Thus, namely algorithm creates follow-on antibody population
Return afterwards (3).
Step 3: robot advances along the path cooked up.
Step 4: judge whether to arrive impact point, arrive and then terminate, does not arrive the path of then continuing along cooking up and advances.
Because the information of the static-obstacle thing in environment space is known in advance, so whenever robot ambulation one step will judge whether the distance between robot and each known static-obstacle thing is less than the radius of scrolling windows (sensing range of sensor), so just can show whether these static-obstacle things have appeared in the scope of scrolling windows.
Step 5: judge whether dyskinesia hinders the normal traveling of robot.
Robot first need not consider scrolling windows in the process of advancing, until when sensor finds that new unknown barrier enters into (namely the distance of unknown barrier and robot is less than the radius of scrolling windows) within scrolling windows, mark this unknown dynamic barrier and start to predict the movement locus of unknown barrier.The result of prediction is divided into following two kinds of situations: one is the normal traveling that unknown barrier can not hinder robot, then robot continue along the good path of preplanning advance, namely return to step 3.Two is dope the normal traveling that dyskinesia may hinder robot, then forward step 6 to.
Step 6: dope mark unknown dynamic barrier can with along the preplanning good path robot of advancing next certain T moment collides, then the position in this Unknown Motion barrier T moment is recorded, be used as " static-obstacle thing " process, consider the uncertain factor in the error of prediction and actual environment, the region of this " static-obstacle thing " is expanded, is denoted as hazardous location.
Step 7: when hazardous location enters after within scrolling windows completely, robot using the path intersection point of current time scrolling windows preplanning with it as interim localized target point, the position of current robot is as starting point, static-obstacle thing in perceived window and hazardous location are as local environmental information, application Immune network algorithm plans the path made new advances, robot, along the route of new planning, returns step 4.
Describe through above-mentioned steps, draw the present invention can not only more efficient realize mobile robot global path planning under complex environment, the local paths planning that there is the unknown dynamic disorder in local can also be completed.
Fig. 4 represents the global path planning of environment space relative complex, is provided with multiple intensive obstacle in the movement environment of robot.In figure, 2 lines of each any not penetrate represent the feasible path line segment of robot, and any paths of s to g is all the combination of these feasible path line segments.Along with increasing of barrier, the path from s to g is increase at double.Can find out that path number feasible in Fig. 4 is very many, algorithm finally will select that paths of cost minimization from the various path of this number, from s to g, the line of overstriking line segment just represents the final path that Algorithm for Solving goes out, and the path that can solve as seen from Figure 4 is optimum.Fig. 5 represents the variation relation of path planning number of times and evolutionary generation.500 planning has been carried out at this working environment, owing to planning that initial antibodies (path) group is random generation at every turn, the randomness adding high frequency closedown, with per generation has new antibody (path) to add, makes to plan that the evolutionary generation obtained required for optimal path has uncertainty at every turn.Through showing that average evolutionary generation only had for 248 generations to the statistics of 500 planning, be starkly lower than because the excessive traditional immunization network algorithm causing evolutionary generation obviously higher in search volume.Have selected the comparatively close data of evolutionary generation (245 generation) and average evolutionary generation (248 generation) as analysis from these 500 times planning, in current planning that Fig. 6 is given, successive dynasties antibody population affinity is along with the ever-increasing situation of change of evolutionary generation, horizontal ordinate represents evolutionary generation, and ordinate represents affinity.As can be seen from Figure 6, the optimum antibody affinity of population presents progressively increasing trend along with the increase of evolutionary generation, although 500 generations of algorithm evolution, just reaches the highest affinity when evolving to for 245 generation; When optimum affinity reaches mxm., also there is certain fluctuation in average affinity always, and this is due to the diversity in order to keep antibody in population, and per generation has new random antibody to generate the antibody that in replacement population, equal number affinity is minimum.
Local paths planning be based upon global path planning basis on to there is the planning of dynamic unknown uncertain barrier for working environment, Fig. 7 shows final planning effect, the direction of motion setting unknown barrier is unknown, but it does at the uniform velocity one-way movement along straight line.Can find out that the global path cooked up and local path are optimum.In overwhelming majority situation, the complaint message that local environment comprises is less than or is significantly less than the quantity of information of the overall situation, like this from calculated amount local paths planning be just equivalent to environment simple time global path planning, its convergence of algorithm speed can be competent at the requirement of real-time.
Claims (4)
1. the mobile robot's dynamic path planning method based on Immune network algorithm, it is characterized in that: first based on Visual Graph method, pre-service is carried out to overall static environment space, apply Immune network algorithm afterwards and cook up global path, ambient condition information is detected in real time in the process of advancing, risk prediction is carried out to the unknown dynamic disorder entering sensing range, form new local environment Visual Graph according to the result of prediction and apply Immune network algorithm and plan the local path made new advances, continue to advance in the global path of the preplanning got back to after robot arrives the transient target point of sector planning.
2. the mobile robot's dynamic path planning method based on Immune network algorithm according to claim 1, is characterized in that:
(1), the implementation procedure of Immune network algorithm:
Through to the improvement of Immune network algorithm and and the combination of Visual Graph, the concrete performing step of algorithm is as follows:
(1) pre-service is carried out to the environment space that mobile robot runs, build Visual Graph;
(2) according to the Establishment and analysis of Visual Graph, sum up priori and also extract vaccine, not there is not setback in the bounding box of penetrate thing and the antibody of generation or path to comprise the antibody of generation or path;
(3) initialization of population: first vaccine inoculation, in search volume, produce m antibody and m paths by implanting vaccine, the generating mode in path progressively extends to impact point from starting point, forms initial parent population by this m antibody and m paths
, wherein subscript i represented for the i-th generation, and subscript m represents antibody number;
(4) stop condition: the affinity finally determining antibody according to the concentration between the fitness between antibody and antigen and antibody, calculate current parent for population genetic algebra and
in the affinity of all antibody, if satisfy condition, then stop computing and Output rusults, otherwise continue;
(5) clonal expansion: produce n clone body respectively to each antibody (path) in above-mentioned antibody population, now amplification is m*n clonal antibody (path), and now antibody population becomes
every paths all copies n doubly, and next step path variation will be more abundant, add often for the diversity of antibody;
(6) high frequency closedown: clonal antibody group
in the antibody of each clone all to experience high frequency closedown and obtain
here refer to antagonist path to carry out increasing or deletion of node;
(7) recalculate adaptation value: all individualities in antagonist group, comprise each father's antibody and variant clone antibody thereof, recalculate its affinity;
(8) memory antibody group upgrades: from each father's antibody and clonal antibody thereof
in, select to have the variant clone antibody of the highest affinity, elite's antibody variants group of what common composition m was new have most high-affinity
and it can be used as the candidate upgrading memory antibody group, then from
with
in select the new elite's antibody variants group of m the composition that affinity is the highest
calculate the average affinity in memory antibody group afterwards again;
(9) immune self-regulation and receptor editing: the individual brand-new antibody of stochastic generation r (r<m)
replace now antibody population
the individual antibody with minimum affinity of middle r, to simulate the receptor editing process in Immune System, increase the diversity of antibody population, thus, namely algorithm creates follow-on antibody population
return step 4 afterwards;
(2), based on mobile robot's active path planning step of Immune network algorithm:
Send out for mobile the situation that robot working space is the unknown of environmental information part, concrete path planning step is as follows:
(1) global path planning is carried out to the Immune network algorithm of known static context information application enhancements;
(2) robot advances along the path cooked up;
(3) judge whether to arrive impact point, arrive and then terminate, do not arrive the path of then continuing along cooking up and advance;
Because the information of the static-obstacle thing in environment space is known in advance, so whenever robot ambulation one step will judge whether the distance between robot and each known static-obstacle thing is less than scrolling windows, the i.e. radius of the sensing range of sensor, so just can show whether these static-obstacle things have appeared in the scope of scrolling windows;
(4) judge whether dyskinesia hinders the normal traveling of robot;
(5) dope mark unknown dynamic barrier can with along the preplanning good path robot of advancing next certain T moment collides, then the position in this Unknown Motion barrier T moment is recorded, be used as " static-obstacle thing " process, consider the uncertain factor in the error of prediction and actual environment, the region of this " static-obstacle thing " is expanded, is denoted as hazardous location;
(6) when hazardous location enters after within scrolling windows completely, robot using the path intersection point of current time scrolling windows preplanning with it as interim localized target point, the position of current robot is as starting point, static-obstacle thing in perceived window and hazardous location are as local environmental information, application Immune network algorithm plans the path made new advances, robot, along the route of new planning, returns step 3.
3. the mobile robot's local paths planning method based on Immune network algorithm according to claim 2, it is characterized in that: in (4) step of (two) step, robot first need not consider scrolling windows in the process of advancing, until sensor finds that new unknown barrier enters within scrolling windows, namely, when the distance of unknown barrier and robot is less than the radius of scrolling windows, marks this unknown dynamic barrier and start to predict the movement locus of unknown barrier; The result of prediction is divided into following two kinds of situations: one is the normal traveling that unknown barrier can not hinder robot, then robot continue along the good path of preplanning advance, namely return to step 2; Two is dope the normal traveling that dyskinesia may hinder robot, then forward (5) step of (two) step to.
4. the mobile robot's local paths planning method based on Immune network algorithm according to claim 2, is characterized in that:
The design of antibody in Immune network algorithm:
After Visual Graph method is to the process of mobile work robot environment space, form antibody path only to need to consider the element in the set V on each barrier summit, do not need to consider any point outside in environment space, such hunting zone will significantly be reduced, and efficiency of algorithm is improved.The structure of each node is as follows:
Wherein IDpoint represents node serial number, and IDobject represents barrier numbering belonging to node, and x, y represent the transverse and longitudinal coordinate of node respectively, in mobile robot path planning problem, antigen represents problem to be solved and optimal path, the application is set as the Euclidean distance of starting point s and impact point g, antibody represents the solution of required problem, namely the feasible path searched out, it is by the starting point of mobile robot, the broken line that impact point and a series of intermediate node connect into is formed, for describing path trend clearly, through the order of node when in antibody, the order of element represents moveable robot movement, antibody adopts string encoding mode, its length can change with the number of node, the data structure of antibody enter lower shown in:
Wherein Affinity represents the affinity of antibody, evaluates the quality of antibody here with affinity; Fitness represents the fitness of antibody, has and has higher fitness compared with the antibody of short path; Density represents the concentration of antibody, the ratio namely in antibody population shared by same antibody, and Length represents the length of antibody by s to g, and remainder is form the node in path, this storage organization when antibody changes, the length of flexibly changing antibody;
The calculating of affinity in Immune network algorithm:
The application, in order to suppress and avoid the appearance of precocious phenomenon, adds the calculating of antibody concentration here, and the computing formula of concrete affinity is as follows:
Wherein Affinity (i) represents the affinity of antibody i; Fitness (i) represents the fitness of antibody i, and distance dependent, and the distance in antibody path is shorter, and the fitness of its antibody is higher; Density (i) represents the concentration of antibody i, and namely identical antibody path is more, and the concentration of antibody is larger; α is a positive constant, and can find out that fitness is larger by this formula, affinity is larger; Concentration is higher, and affinity is less.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410729927.9A CN104407616B (en) | 2014-12-03 | 2014-12-03 | Dynamic path planning method for mobile robot based on immune network algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410729927.9A CN104407616B (en) | 2014-12-03 | 2014-12-03 | Dynamic path planning method for mobile robot based on immune network algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104407616A true CN104407616A (en) | 2015-03-11 |
| CN104407616B CN104407616B (en) | 2017-04-26 |
Family
ID=52645254
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410729927.9A Expired - Fee Related CN104407616B (en) | 2014-12-03 | 2014-12-03 | Dynamic path planning method for mobile robot based on immune network algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104407616B (en) |
Cited By (33)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106292673A (en) * | 2016-09-29 | 2017-01-04 | 深圳大学 | A kind of method for optimizing route and system |
| CN106873600A (en) * | 2017-03-31 | 2017-06-20 | 深圳市靖洲科技有限公司 | It is a kind of towards the local obstacle-avoiding route planning method without person bicycle |
| CN107168054A (en) * | 2017-05-10 | 2017-09-15 | 沈阳工业大学 | Multi-robotic task is distributed and paths planning method |
| CN107309876A (en) * | 2017-07-14 | 2017-11-03 | 广西师范大学 | The control method of manipulator harvesting |
| CN107578427A (en) * | 2017-07-31 | 2018-01-12 | 深圳市易成自动驾驶技术有限公司 | Detection method, device and the computer-readable recording medium of dynamic barrier |
| CN107728613A (en) * | 2017-09-19 | 2018-02-23 | 海南职业技术学院 | A kind of intelligent robot kinetic control system based on immune algorithm |
| CN108177144A (en) * | 2016-12-08 | 2018-06-19 | 发那科株式会社 | Robot system |
| WO2018120739A1 (en) * | 2016-12-30 | 2018-07-05 | 深圳光启合众科技有限公司 | Path planning method, apparatus and robot |
| CN108268042A (en) * | 2018-01-24 | 2018-07-10 | 天津大学 | A kind of path planning algorithm based on improvement Visual Graph construction |
| CN108549383A (en) * | 2018-05-17 | 2018-09-18 | 电子科技大学 | A kind of community's robot navigation method of real-time multisensor |
| CN109062215A (en) * | 2018-08-24 | 2018-12-21 | 北京京东尚科信息技术有限公司 | Robot and barrier-avoiding method, system, equipment and medium are followed based on its target |
| CN109341698A (en) * | 2018-11-29 | 2019-02-15 | 深圳市银星智能科技股份有限公司 | A kind of routing resource and device of mobile robot |
| CN109791406A (en) * | 2016-07-06 | 2019-05-21 | 劳伦斯利弗莫尔国家安全有限责任公司 | The subject perceptions and avoidance system of autonomicing carrier |
| CN110196588A (en) * | 2019-03-28 | 2019-09-03 | 陕西理工大学 | Method for planning path for mobile robot based on networks decomposition |
| CN111026115A (en) * | 2019-12-13 | 2020-04-17 | 华南智能机器人创新研究院 | Robot obstacle avoidance control method and device based on deep learning |
| CN111052027A (en) * | 2017-09-15 | 2020-04-21 | 索尼公司 | Action plan generation when self position is unknown |
| CN111142529A (en) * | 2019-12-31 | 2020-05-12 | 深圳前海达闼云端智能科技有限公司 | Virtual wall decision method and device and robot |
| CN111136651A (en) * | 2018-11-01 | 2020-05-12 | 锥能机器人（上海）有限公司 | Control system, driving device, and method and device for processing operation of driving device |
| CN111222577A (en) * | 2019-12-11 | 2020-06-02 | 上海联影智能医疗科技有限公司 | Situation awareness system and method |
| CN111283688A (en) * | 2020-03-23 | 2020-06-16 | 深圳科瑞技术股份有限公司 | Obstacle avoidance method of robot and robot equipment |
| CN111337042A (en) * | 2020-03-13 | 2020-06-26 | 湖北大学 | Vehicle path planning method and system |
| CN112601641A (en) * | 2018-08-23 | 2021-04-02 | 实时机器人有限公司 | Collision detection for robot motion planning |
| CN113009918A (en) * | 2021-03-09 | 2021-06-22 | 京东鲲鹏(江苏)科技有限公司 | Path planning method, device and system and readable storage medium |
| CN113721615A (en) * | 2021-08-27 | 2021-11-30 | 广州大学 | Sea navigation path planning method and system based on machine vision |
| CN114199266A (en) * | 2021-11-25 | 2022-03-18 | 江苏集萃智能制造技术研究所有限公司 | Path planning method for occupied target based on diagnosis guide service robot |
| CN114415665A (en) * | 2021-12-17 | 2022-04-29 | 新疆钵施然智能农机股份有限公司 | Algorithm for obstacle avoidance path planning |
| CN114460933A (en) * | 2021-12-30 | 2022-05-10 | 南京理工大学 | Mobile robot local path planning algorithm for dynamic environment |
| WO2022124938A1 (en) * | 2020-12-07 | 2022-06-16 | Общество с ограниченной ответственностью "РобоСиВи" | Robot motion planning method and mobile robot |
| US11573575B2 (en) | 2017-04-12 | 2023-02-07 | Lawrence Livermore National Security, Llc | Attract-repel path planner system for collision avoidance |
| US11927972B2 (en) | 2020-11-24 | 2024-03-12 | Lawrence Livermore National Security, Llc | Collision avoidance based on traffic management data |
| US11964393B2 (en) | 2018-03-21 | 2024-04-23 | Realtime Robotics, Inc. | Motion planning of a robot for various environments and tasks and improved operation of same |
| US11970161B2 (en) | 2018-01-12 | 2024-04-30 | Duke University | Apparatus, method and article to facilitate motion planning of an autonomous vehicle in an environment having dynamic objects |
| US12017364B2 (en) | 2019-04-17 | 2024-06-25 | Realtime Robotics, Inc. | Motion planning graph generation user interface, systems, methods and articles |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101122800A (en) * | 2007-08-24 | 2008-02-13 | 北京航空航天大学 | Combined type vision navigation method and device |
| CN101887271A (en) * | 2010-07-19 | 2010-11-17 | 东莞职业技术学院 | Mobile robot path planning method |
| CN103412490A (en) * | 2013-08-14 | 2013-11-27 | 山东大学 | Polyclone artificial immunity network algorithm for multirobot dynamic path planning |
| CN103529843A (en) * | 2013-10-17 | 2014-01-22 | 电子科技大学中山学院 | Lambda path planning algorithm |
-
2014
- 2014-12-03 CN CN201410729927.9A patent/CN104407616B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101122800A (en) * | 2007-08-24 | 2008-02-13 | 北京航空航天大学 | Combined type vision navigation method and device |
| CN101887271A (en) * | 2010-07-19 | 2010-11-17 | 东莞职业技术学院 | Mobile robot path planning method |
| CN103412490A (en) * | 2013-08-14 | 2013-11-27 | 山东大学 | Polyclone artificial immunity network algorithm for multirobot dynamic path planning |
| CN103529843A (en) * | 2013-10-17 | 2014-01-22 | 电子科技大学中山学院 | Lambda path planning algorithm |
Non-Patent Citations (1)
| Title |
|---|
| 王猛: "基于进化计算及可视图的机器人避障规划研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (49)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11796673B2 (en) | 2016-07-06 | 2023-10-24 | Lawrence Livermore National Security, Llc | Object sense and avoid system for autonomous vehicles |
| CN109791406B (en) * | 2016-07-06 | 2022-06-07 | 劳伦斯利弗莫尔国家安全有限责任公司 | Autonomous carrier object awareness and avoidance system |
| CN109791406A (en) * | 2016-07-06 | 2019-05-21 | 劳伦斯利弗莫尔国家安全有限责任公司 | The subject perceptions and avoidance system of autonomicing carrier |
| CN106292673B (en) * | 2016-09-29 | 2019-02-12 | 深圳大学 | A kind of method for optimizing route and system |
| CN106292673A (en) * | 2016-09-29 | 2017-01-04 | 深圳大学 | A kind of method for optimizing route and system |
| CN108177144B (en) * | 2016-12-08 | 2020-03-13 | 发那科株式会社 | Robot system |
| US10421193B2 (en) | 2016-12-08 | 2019-09-24 | Fanuc Corporation | Robot system |
| CN108177144A (en) * | 2016-12-08 | 2018-06-19 | 发那科株式会社 | Robot system |
| WO2018120739A1 (en) * | 2016-12-30 | 2018-07-05 | 深圳光启合众科技有限公司 | Path planning method, apparatus and robot |
| CN106873600A (en) * | 2017-03-31 | 2017-06-20 | 深圳市靖洲科技有限公司 | It is a kind of towards the local obstacle-avoiding route planning method without person bicycle |
| US11573575B2 (en) | 2017-04-12 | 2023-02-07 | Lawrence Livermore National Security, Llc | Attract-repel path planner system for collision avoidance |
| CN107168054B (en) * | 2017-05-10 | 2020-11-10 | 沈阳工业大学 | Multi-robot task allocation and path planning method |
| CN107168054A (en) * | 2017-05-10 | 2017-09-15 | 沈阳工业大学 | Multi-robotic task is distributed and paths planning method |
| CN107309876B (en) * | 2017-07-14 | 2021-04-13 | 广西师范大学 | Control method for picking by mechanical arm |
| CN107309876A (en) * | 2017-07-14 | 2017-11-03 | 广西师范大学 | The control method of manipulator harvesting |
| CN107578427A (en) * | 2017-07-31 | 2018-01-12 | 深圳市易成自动驾驶技术有限公司 | Detection method, device and the computer-readable recording medium of dynamic barrier |
| CN111052027A (en) * | 2017-09-15 | 2020-04-21 | 索尼公司 | Action plan generation when self position is unknown |
| CN107728613A (en) * | 2017-09-19 | 2018-02-23 | 海南职业技术学院 | A kind of intelligent robot kinetic control system based on immune algorithm |
| US11970161B2 (en) | 2018-01-12 | 2024-04-30 | Duke University | Apparatus, method and article to facilitate motion planning of an autonomous vehicle in an environment having dynamic objects |
| CN108268042A (en) * | 2018-01-24 | 2018-07-10 | 天津大学 | A kind of path planning algorithm based on improvement Visual Graph construction |
| US11964393B2 (en) | 2018-03-21 | 2024-04-23 | Realtime Robotics, Inc. | Motion planning of a robot for various environments and tasks and improved operation of same |
| CN108549383A (en) * | 2018-05-17 | 2018-09-18 | 电子科技大学 | A kind of community's robot navigation method of real-time multisensor |
| CN108549383B (en) * | 2018-05-17 | 2020-06-09 | 电子科技大学 | Real-time multi-sensor community robot navigation method |
| CN112601641A (en) * | 2018-08-23 | 2021-04-02 | 实时机器人有限公司 | Collision detection for robot motion planning |
| CN112601641B (en) * | 2018-08-23 | 2024-03-08 | 实时机器人有限公司 | Collision detection for robotic motion planning |
| CN109062215A (en) * | 2018-08-24 | 2018-12-21 | 北京京东尚科信息技术有限公司 | Robot and barrier-avoiding method, system, equipment and medium are followed based on its target |
| CN111136651A (en) * | 2018-11-01 | 2020-05-12 | 锥能机器人（上海）有限公司 | Control system, driving device, and method and device for processing operation of driving device |
| CN109341698A (en) * | 2018-11-29 | 2019-02-15 | 深圳市银星智能科技股份有限公司 | A kind of routing resource and device of mobile robot |
| CN110196588A (en) * | 2019-03-28 | 2019-09-03 | 陕西理工大学 | Method for planning path for mobile robot based on networks decomposition |
| US12017364B2 (en) | 2019-04-17 | 2024-06-25 | Realtime Robotics, Inc. | Motion planning graph generation user interface, systems, methods and articles |
| US11966852B2 (en) | 2019-12-11 | 2024-04-23 | Shanghai United Imaging Intelligence Co., Ltd. | Systems and methods for situation awareness |
| CN111222577A (en) * | 2019-12-11 | 2020-06-02 | 上海联影智能医疗科技有限公司 | Situation awareness system and method |
| CN111222577B (en) * | 2019-12-11 | 2024-01-26 | 上海联影智能医疗科技有限公司 | System and method for situation awareness |
| CN111026115A (en) * | 2019-12-13 | 2020-04-17 | 华南智能机器人创新研究院 | Robot obstacle avoidance control method and device based on deep learning |
| CN111142529A (en) * | 2019-12-31 | 2020-05-12 | 深圳前海达闼云端智能科技有限公司 | Virtual wall decision method and device and robot |
| CN111337042A (en) * | 2020-03-13 | 2020-06-26 | 湖北大学 | Vehicle path planning method and system |
| CN111337042B (en) * | 2020-03-13 | 2021-11-02 | 湖北大学 | Vehicle path planning method and system |
| CN111283688A (en) * | 2020-03-23 | 2020-06-16 | 深圳科瑞技术股份有限公司 | Obstacle avoidance method of robot and robot equipment |
| CN111283688B (en) * | 2020-03-23 | 2021-08-10 | 深圳市科瑞技术科技有限公司 | Obstacle avoidance method of robot and robot equipment |
| US11927972B2 (en) | 2020-11-24 | 2024-03-12 | Lawrence Livermore National Security, Llc | Collision avoidance based on traffic management data |
| WO2022124938A1 (en) * | 2020-12-07 | 2022-06-16 | Общество с ограниченной ответственностью "РобоСиВи" | Robot motion planning method and mobile robot |
| CN113009918A (en) * | 2021-03-09 | 2021-06-22 | 京东鲲鹏(江苏)科技有限公司 | Path planning method, device and system and readable storage medium |
| CN113009918B (en) * | 2021-03-09 | 2023-12-05 | 京东鲲鹏(江苏)科技有限公司 | Path planning method, device, system and readable storage medium |
| CN113721615B (en) * | 2021-08-27 | 2023-08-15 | 广州大学 | Navigation path planning method and system based on machine vision |
| CN113721615A (en) * | 2021-08-27 | 2021-11-30 | 广州大学 | Sea navigation path planning method and system based on machine vision |
| CN114199266A (en) * | 2021-11-25 | 2022-03-18 | 江苏集萃智能制造技术研究所有限公司 | Path planning method for occupied target based on diagnosis guide service robot |
| CN114415665A (en) * | 2021-12-17 | 2022-04-29 | 新疆钵施然智能农机股份有限公司 | Algorithm for obstacle avoidance path planning |
| CN114460933B (en) * | 2021-12-30 | 2023-11-03 | 南京理工大学 | Dynamic environment-oriented mobile robot local path planning algorithm |
| CN114460933A (en) * | 2021-12-30 | 2022-05-10 | 南京理工大学 | Mobile robot local path planning algorithm for dynamic environment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104407616B (en) | 2017-04-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104407616A (en) | Dynamic path planning method for mobile robot based on immune network algorithm | |
| CN103823466B (en) | Method for planning path for mobile robot under a kind of dynamic environment | |
| Luders et al. | Robust sampling-based motion planning with asymptotic optimality guarantees | |
| CN111562785B (en) | Path planning method and system for collaborative coverage of cluster robots | |
| CN105717929A (en) | Planning method for mixed path of mobile robot under multi-resolution barrier environment | |
| CN103439972B (en) | A kind of method for planning path for mobile robot under DYNAMIC COMPLEX environment | |
| CN102129249B (en) | Method for planning global path of robot under risk source environment | |
| CN106444769A (en) | Method for planning optimal path for incremental environment information sampling of indoor mobile robot | |
| CN110231824B (en) | Intelligent agent path planning method based on straight line deviation method | |
| CN109597425B (en) | Unmanned aerial vehicle navigation and obstacle avoidance method based on reinforcement learning | |
| CN104070525B (en) | For the method for space manipulator continuous trajectory tracking | |
| CN110095122A (en) | A kind of method for planning path for mobile robot based on improvement ant group algorithm | |
| JP5905481B2 (en) | Determination method and determination apparatus | |
| CN110412877A (en) | A kind of carrier-borne aircraft deck path planning method for optimally controlling based on NSP algorithm | |
| CN110045738A (en) | Robot path planning method based on ant group algorithm and Maklink figure | |
| Maw et al. | iADA*: Improved anytime path planning and replanning algorithm for autonomous vehicle | |
| CN109374005B (en) | Ship internal path planning method based on ship VR model | |
| Huang et al. | Multimodal trajectory prediction: A survey | |
| CN110530373A (en) | A kind of robot path planning method, controller and system | |
| García et al. | An efficient multi-robot path planning solution using A* and coevolutionary algorithms | |
| CN114326726B (en) | Formation path planning control method based on A and improved artificial potential field method | |
| CN104699935A (en) | Uncertainty-prediction-based track planning method | |
| Ning‐bo et al. | Destination and route choice models for bidirectional pedestrian flow based on the social force model | |
| Gottlieb et al. | Multi-target motion planning amidst obstacles for autonomous aerial and ground vehicles | |
| WO2022231519A1 (en) | Trajectory predicting methods and systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170426 Termination date: 20181203 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |