CN105843234A - Two-dimensional route planning method for UUV to geometrically bypass circular barriers - Google Patents
Two-dimensional route planning method for UUV to geometrically bypass circular barriers Download PDFInfo
- Publication number
- CN105843234A CN105843234A CN201610312415.1A CN201610312415A CN105843234A CN 105843234 A CN105843234 A CN 105843234A CN 201610312415 A CN201610312415 A CN 201610312415A CN 105843234 A CN105843234 A CN 105843234A
- Authority
- CN
- China
- Prior art keywords
- planning
- point
- circular barrier
- barrier
- uuv
- 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
- 230000004888 barrier function Effects 0.000 title claims abstract description 97
- 238000000034 method Methods 0.000 title claims abstract description 34
- 230000008929 regeneration Effects 0.000 claims description 4
- 238000011069 regeneration method Methods 0.000 claims description 4
- 230000000007 visual effect Effects 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 7
- 230000007613 environmental effect Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/04—Control of altitude or depth
- G05D1/06—Rate of change of altitude or depth
- G05D1/0692—Rate of change of altitude or depth specially adapted for under-water vehicles
Landscapes
- Engineering & Computer Science (AREA)
- Aviation & Aerospace Engineering (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a two-dimensional route planning method for a UUV to geometrically bypass circular barriers. The method comprises the following steps: 1, reading a route origin Ob, a route terminal point Oe and parameters of each circular barrier from a mission text; 2, performing expansion processing on each circular barrier, and calculating the parameters of each circular barrier after expansion; 3, establishing a bypassing point set S, making a planning current point Oc to be a starting point Ob, and placing the starting point in the bypassing point set S; 4, if the planning current point Oc is the route terminal point Oe, or the planning current point Oc and the route terminal point O2 are visual, skipping to the sixth step, and otherwise, executing the fifth step; 5, performing geometric bypassing on a circular barrier closest to the planning current point Oc, obtaining a bypassing point, placing the bypassing point in the bypassing point set S, updating the planning current point Oc, and skipping to the fourth step; and 6, placing the route terminal point Oe in the bypassing point set S, and at the moment, planning ends. According to the invention, bypassing of the circular barriers is realized through a simple geometric principle, and the UVV can rapidly and efficiently obtain a safe bump-free two-dimensional route in a complex environment with multiple circular barriers.
Description
Technical field
The present invention relates to one is UUV Route planner, particularly a kind of UUV to circular barrier geometry around
The two-dimentional Route planner of row.
Background technology
Routeing be underwater unmanned vehicle (Unmanned Underwater Vehicle, UUV) key technology it
One, it is the important embodiment of UUV capacity of will.Routeing refers to, under known obstacle environment, cook up one from starting point
Walk around all barriers and reach home without touching path.According to Spatial Dimension, routeing can be divided into two dimension routeing and
Three-dimensional routeing.Wherein, two dimension routeing is the basis of three-dimensional routeing, and the most extensive in the application of UUV,
It it is the focus of UUV routeing technical research.At present, the Route planner of UUV is a lot, but how at complicated obstacle ring
Under border not only quickly but also feasible one nothing of acquisition touches path, particularly planing method can be adapted to engineer applied, remains one
Difficult point.
Prior art related to the present invention is " submarine navigation device path planning based on geometric algorithm " (" naval engineering
College journal ", page 2009,21 (6): 41-44), it is mentioned that consider that during circular barrier, submarine navigation device is calculated based on geometry
The path planning of method, but the Route planner that circular barrier is detoured by the document is different from the present invention.
Summary of the invention
It is an object of the invention to provide a kind of calculate simple, planning efficiency is high, plan fireballing UUV to circular obstacle
The two-dimentional Route planner that thing geometry detours.
The object of the present invention is achieved like this:
Step one: from mission Reading text air route starting point Ob, air route terminal OeParameter with each circular barrier;
Step 2: each circular barrier is carried out expansion process, calculates the parameter of each circular barrier after expanding;
Step 3: set up a set S that detours, O is currently put in order planningcFor starting point Ob, and put into and detour in set S;
Step 4: if O is currently put in planningcIt is air route terminal Oe, or planning currently put OcWith air route terminal OeVisually,
Go to step six, otherwise perform step 5;
Step 5: currently put O to away from planningcNearest circular barrier carries out geometry and detours, and obtains detouring a little and puts into
Detouring in a set S, Regeneration planning currently puts Oc, go to step four;
Step 6: by air route terminal OePutting into and detour in a set S, planning terminates.
The present invention can also include:
1, circular barrier carries out the method that geometry detours is:
(1), judge that O is currently put in planningcWhether on circular barrier, if, order point O1=Oc;Otherwise, planning is solved
Currently put OcWith the intersection point of the line of center of circle O with circumference, and to make it be an O1;
(2) air route terminal O, is solvedeWith the intersection point of the line of center of circle O with circumference, and to make it be an O2;
(3) ∠ O, is solved1OO2The intersection point of angular bisector and circumference, and to make it be an O3;
(4) some O, was solved1Circle tangent line with cross some an O3The intersection point of tangent line of circle, and to make it be an O4;
(5) some O, was calculated2Circle tangent line with cross some an O3The intersection point of tangent line of circle, and to make it be an O5;
(6), will an O1, some O4, some O5, some O2Detour that a little putting into detours gathers in S as circular barrier, and more
New planning currently puts OcFor an O2, end of detouring.
2, the method that circular barrier is carried out expansion process is to terminate the basis of barrier geometry in normal planning
On, according to barrier shape edges with radius of safety ruuvOutward expansion goes out a radius of safety region.
The present invention utilizes geometrical principle to carry out the two-dimentional routeing of UUV, have employed simple geometry on environmental model
Model, uses the simple geometrical principle to detour barrier when calculating without touching path, it is to avoid other planing methods need
Map to be set up, cyclic search are without touching the problem of the complexity that contains much information, calculates caused by path, and not only planning efficiency is high, rule
Draw speed fast, and principle is simple, amount of calculation is little, it is easy to Project Realization.
The present invention and background technology " submarine navigation device path planning based on geometric algorithm (" naval engineering college journal ",
Page 2009,21 (6): 41-44) " differ primarily in that:
1, the present invention has carried out expansion process to circular barrier, and background technology " underwater navigation based on geometric algorithm
Device path planning " do not carry out expansion process.Circular barrier is carried out expansion process, it is to avoid UUV is along the navigation of planning air route
Time with the collision of circular barrier, improve the nevigation safety of UUV.
2, the present invention and background technology " submarine navigation device path planning based on geometric algorithm " are to single circular barrier
The method that detours different.The method that detours of the present invention as shown in Figure 4 and Figure 5, formation be a plurality of line segment composition air route of detouring;
And background technology is formed is line segment and air route of detouring that circular arc combines, and control is followed the tracks of in the air route that circular arc air route is unfavorable for UUV
System.The present invention only has the air route of detouring of line segment to be more conducive to the air route tracing control of UUV, can improve the air route tracking effect of UUV.
The beneficial effects of the present invention is:
1, environmental model uses geometric space model, compared to traditional grid, cartographic model, required planning information
Amount is few, and planning efficiency is high, is particularly suitable for the environment of complicated multi-obstacle avoidance.
2, circular barrier has been applied only to geometrical principle around line algorithm, calculate simple, be prone to Project Realization, and
Amount of calculation is the least, and planning speed is fast.
3, for radius of safety, circular barrier has been carried out expansion process with the overall dimensions of UUV, it is to avoid UUV is along planning
With the collision of circular barrier during the navigation of air route, improve the nevigation safety of UUV.
4, the air route of detouring formed only has line segment, the air route tracing control of beneficially UUV, and the air route that can improve UUV is followed the tracks of
Effect.
Accompanying drawing explanation
Circular barrier schematic diagram in Fig. 1 planning environment model;
The radius of safety schematic diagram of Fig. 2 circle barrier expansion process;
The expansion schematic diagram of Fig. 3 circle barrier;
Fig. 4 plans the schematic diagram that when current point is not on circular barrier detours circular barrier;
Fig. 5 plans the schematic diagram that when current point is on circular barrier detours circular barrier;
The flow chart that the geometry of circular barrier is detoured by Fig. 6 UUV;
Fig. 7 judges that be linked to be the flow chart whether line segment intersects with circular barrier at 2;
The two-dimentional routeing flow chart that circular barrier geometry is detoured by Fig. 8 UUV;
Fig. 9 utilizes the present invention to carry out the design sketch that the geometry of circular barrier is detoured by UUV.
Detailed description of the invention
The present invention is described in detail in citing below.
The environmental model of UUV two dimension routeing is introduced in conjunction with Fig. 1.
In the present invention, the environmental model of routeing uses two-dimensional geometry spatial model.If the air route starting point of planning is
Ob, air route terminal is Oe, ObAnd OeIt is expressed as with two-dimensional coordinate respectively:
Ob=(xob,yob);Oe=(xoe,yoe) (1)
The planning that during separately setting routeing, each step is used currently is put as Oc, it is expressed as with two-dimensional coordinate:
Oc=(xoc,yoc) (2)
If two-dimensional geometry space exists a number of circular barrier, as it is shown in figure 1, set circular barrier as
Zcirc, its parametrization is expressed as:
Zcirc=(xcirc,ycirc,r) (3)
In formula, (xcirc,ycirc) representing the two-dimensional coordinate in the center of circle, r represents the radius of circular barrier.
The method for building up of circular barrier inflationary model is introduced in conjunction with Fig. 2 and Fig. 3.
When carrying out routeing, usually UUV being considered as particle, the air route therefore planned may be away from obstacle
Thing is nearer.But it practice, UUV is the entity having physical dimension, when the air route of planning is when barrier is nearer, it is more likely that lead
Cause UUV to collide with barrier.For this when carrying out routeing, a radius of safety is set to prevent UUV along planning boat
Collide with barrier during the navigation of road.The method that the present invention uses is circumradius r of the overall dimensions with UUVuuvFor peace
Full radius (as shown in Figure 2), then on the basis of the geometry of normal circular barrier, according to its shape edges with radius
ruuvOutward expansion goes out a radius of safety region.Fig. 3 gives the expansion signal after circular barrier outward expansion radius of safety
Figure.
After expansion, the parametrization of circular barrier is expressed as:
Z′circ=(xcirc,ycirc,r′) (4)
In formula: (xcirc,ycirc) still represent the two-dimensional coordinate in the center of circle;And r '=r+ruuvRepresent the circular obstacle after expanding
Thing radius.
Introduce UUV in conjunction with Fig. 4, Fig. 5, Fig. 6 circular barrier to be detoured method.
Circular barrier is detoured and is divided into the current point of planning on circular barrier and not on circular barrier two kinds
Situation, Fig. 4 gives the planning current point not schematic diagram that detours on circular barrier, and Fig. 5 gives the current point of planning to be justified
The schematic diagram that detours on shape barrier.As can be seen from Figure 4 and Figure 5, circular barrier is detoured, use utilize a plurality of
The intersection point of tangent line of circle a little detours as detouring the method for circle barrier, and utilizes geometrical principle to solve respectively to detour a little.
Fig. 6 gives the flow process that detours of circular barrier.
Step one: judge that O is currently put in planningcWhether on barrier, if on barrier, make O1=Oc, go to step
Three;Otherwise perform step 2;
Step 2: solve planning and currently put OcLine and round intersection point O with center of circle O1=(xO1,yO1), O1Position sit
Mark is calculated by formula (5), has two solutions, chooses and currently puts OcApart near solution as some O1Coordinate.
In formula: kcRepresent that O is currently put in planningcThe slope of straight line connected with center of circle O, and have
Step 3: solve air route terminal OeLine and round intersection point O with center of circle O2=(xO2,yO2), O2Position coordinates
Calculate by formula (6), have two solutions, choose and air route terminal OeApart near solution as some O2Coordinate.
In formula: keRepresent air route terminal OeThe slope of straight line connected with center of circle O, and have
Step 4: solve ∠ O1OO2Angular bisector L0Intersection point O with circle3=(xO3,yO3), O3Position coordinates by formula
(7) calculate, have two solutions, choose and put O1(or some O2) apart near solution as some O3Coordinate.
In formula:Represent ∠ O1OO2Angular bisector L0Slope, and have
Step 5: solved some O respectively1、O2、O3The tangent line L of circle1、L2、L3, its tangential equation is respectively by formula (8), formula
(9) calculate with formula (10).
In formula: kL1、bL1Represent round tangent line L respectively1Slope and intercept;kL2、bL2Represent round tangent line L respectively2's
Slope and intercept;kL3、bL3Represent round tangent line L respectively3Slope and intercept.
Step 6: calculate tangent line L1And L3Intersection point O4=(xO4,yO4), O4Position coordinates by formula (11) calculate
Step 7: calculate tangent line L2And L3Intersection point O5=(xO5,yO5), O5Position coordinates by formula (12) calculate
Step 8: will an O1、O4、O5、O2Detouring a little to put into and detour in a set S as circular barrier, and update ought
Front some OcFor O2, end of detouring.
Introduce judgement planning in conjunction with Fig. 7 and currently put OcWith air route terminal OeThe most visual method.
Point OcWith an OeRefer to that do not stopped by any circular barrier at 2.Judge that 2 methods the most visual are exactly
Judge whether the line segment that 2 lines are formed intersects with all of circular barrier, if do not intersected with any circular barrier
Then show at 2 visually.Judge that O is currently put in planningcWith air route terminal OeThe most visual flow process is as shown in Figure 7:.
Step one: select first circular barrier;
Step 2: solve and currently put OcWith air route terminal OeThe discriminant of the root of the quadratic equation of 2 lines and circle simultaneous
Δ, shown in method for solving such as formula (13):
In formula, kceAnd bceRepresent some O respectivelycWith an OeConnected straight slope and intercept, and hadbce=yoc-kcexoc;
Step 3: judge that the discriminant Δ of root, whether more than or equal to 0, goes to step four if greater than equal to 0, otherwise goes to step
Six
Step 4: solve and currently put OcWith air route terminal OeThe abscissa x of two intersection points of 2 lines and circlepc1And xpc2,
Shown in method for solving such as formula (14):
Step 5: judge xpc1Value at xocAnd xoeBetween or xpc2Value is at xocAnd xoeBetween whether meet, if meet turn
Step 7, otherwise goes to step six;
Step 6: judge whether also circular barrier, if it has, select next circular barrier, goes to step two, no
Then go to step eight;
Step 7: currently put OcWith air route terminal OeNot visible, it is judged that to terminate;
Step 8: currently put OcWith air route terminal OeVisually, it is judged that terminate.
The UUV whole flow process to the two-dimentional routeing that circular barrier geometry detours is introduced in conjunction with Fig. 8.
Step one: from mission Reading text air route starting point Ob, air route terminal OeParameter with each circular barrier;
Step 2: set up each circular barrier inflationary model, calculates the parameter of each circular barrier after expanding, set up around
Row point set S;
Step 3: O is currently put in order planningcFor starting point Ob, and put into and detour in set S;
Step 4: judge that O is currently put in planningcIt is air route terminal Oe, if going to step ten, otherwise go to step five;
Step 5: judge that O is currently put in planningcWith air route terminal OeThe most visual, if visually going to step ten, otherwise turn step
Rapid six;
Step 6: O is currently put in Search Length planningcNearest circular barrier;First searching method for finding obstruction current
Point OcWith air route terminal OeThe all circular barrier of line, then solves above each circular barrier center and currently puts Oc's
Distance, being of distance minimum currently puts O away from planningcNearest circular barrier;
Step 7: currently put O to away from planningcNearest circular barrier carries out geometry and detours;
Step 8: will detour a little to put into and detour in a set S;
Step 9: Regeneration planning currently puts Oc, go to step four;
Step 10: by air route terminal OePutting into and detour in a set S, planning terminates.
Fig. 9 gives and utilizes the present invention to carry out UUV to detour circular barrier geometry one realization of two dimension routeing
Case.
In present case, it is provided with 10 circular barriers, starting point O in air route altogetherbTerminal O with air routeeMark the most in the drawings
Go out.First, when planning, each barrier having been carried out expansion process, chain-dotted line is used on the expansion border of each barrier the most in the drawings
Mark.Then, part circular barrier is detoured by UUV, has obtained a set S={O that detoursb,P1,P2,P3,…,P16,
Oe, and the UUV that by detour a little form has been represented by dashed line out in the drawings detours air route.
Claims (3)
1. the two-dimentional Route planner that circular barrier geometry is detoured by UUV, is characterized in that:
Step one: from mission Reading text air route starting point Ob, air route terminal OeParameter with each circular barrier;
Step 2: each circular barrier is carried out expansion process, calculates the parameter of each circular barrier after expanding;
Step 3: set up a set S that detours, O is currently put in order planningcFor starting point Ob, and put into and detour in set S;
Step 4: if O is currently put in planningcIt is air route terminal Oe, or planning currently put OcWith air route terminal OeVisually, go to step
Six, otherwise perform step 5;
Step 5: currently put O to away from planningcNearest circular barrier carries out geometry and detours, and obtains detouring a little and puts into and detours a little
In set S, Regeneration planning currently puts Oc, go to step four;
Step 6: by air route terminal OePutting into and detour in a set S, planning terminates.
The two-dimentional Route planner that circular barrier geometry is detoured by UUV the most according to claim 1, it is right to it is characterized in that
Circular barrier carries out the method that geometry detours:
(1), judge that O is currently put in planningcWhether on circular barrier, if, order point O1=Oc;Otherwise, planning is solved current
Point OcWith the intersection point of the line of center of circle O with circumference, and to make it be an O1;
(2) air route terminal O, is solvedeWith the intersection point of the line of center of circle O with circumference, and to make it be an O2;
(3) ∠ O, is solved1OO2The intersection point of angular bisector and circumference, and to make it be an O3;
(4) some O, was solved1Circle tangent line with cross some an O3The intersection point of tangent line of circle, and to make it be an O4;
(5) some O, was calculated2Circle tangent line with cross some an O3The intersection point of tangent line of circle, and to make it be an O5;
(6), will an O1, some O4, some O5, some O2Detour that a little putting into detours gathers in S as circular barrier, and Regeneration planning
Currently put OcFor an O2, end of detouring.
The two-dimentional Route planner that circular barrier geometry is detoured by UUV the most according to claim 1 and 2, its feature
It is that the method that circular barrier is carried out expansion process is: on the basis of normal planning terminates barrier geometry, according to
Barrier shape edges is with radius of safety ruuvOutward expansion goes out a radius of safety region.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610312415.1A CN105843234B (en) | 2016-05-12 | 2016-05-12 | A kind of two-dimentional Route planner that UUV detours to round barrier geometry |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610312415.1A CN105843234B (en) | 2016-05-12 | 2016-05-12 | A kind of two-dimentional Route planner that UUV detours to round barrier geometry |
Publications (2)
Publication Number | Publication Date |
---|---|
CN105843234A true CN105843234A (en) | 2016-08-10 |
CN105843234B CN105843234B (en) | 2018-08-31 |
Family
ID=56592313
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201610312415.1A Active CN105843234B (en) | 2016-05-12 | 2016-05-12 | A kind of two-dimentional Route planner that UUV detours to round barrier geometry |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105843234B (en) |
Cited By (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107168344A (en) * | 2017-05-17 | 2017-09-15 | 哈尔滨工程大学 | A kind of UUV approaches air route generation method during seabed operation |
CN107491068A (en) * | 2017-08-29 | 2017-12-19 | 歌尔股份有限公司 | Method for planning path for mobile robot, device and route design device |
CN108073166A (en) * | 2016-11-16 | 2018-05-25 | 阳光暖果(北京)科技发展有限公司 | A kind of shortest time obstacle-avoiding route planning method |
CN108279692A (en) * | 2018-01-17 | 2018-07-13 | 哈尔滨工程大学 | A kind of UUV dynamic programming methods based on LSTM-RNN |
CN108829635A (en) * | 2018-03-09 | 2018-11-16 | 中国人民解放军海军大连舰艇学院 | The calculation method in the motor-driven area of enemy plane in a kind of surface ship air-defense |
CN109460045A (en) * | 2019-01-14 | 2019-03-12 | 哈尔滨工程大学 | USV is based on the collision-avoidance planning method for improving ant group optimization under dynamic disorder online awareness |
CN109990782A (en) * | 2017-12-29 | 2019-07-09 | 北京欣奕华科技有限公司 | A kind of method and apparatus of avoiding obstacles |
CN110658819A (en) * | 2019-09-30 | 2020-01-07 | 北京猎户星空科技有限公司 | Obstacle avoidance method and device, electronic equipment and storage medium |
CN111290376A (en) * | 2018-11-22 | 2020-06-16 | 中国科学院沈阳自动化研究所 | Method for tracking circular track of unmanned underwater vehicle |
CN112179351A (en) * | 2020-09-30 | 2021-01-05 | 上海电机学院 | Three-dimensional obstacle avoidance track planning method based on pre-planned path optimization RRT algorithm |
CN112859864A (en) * | 2021-01-15 | 2021-05-28 | 大连海事大学 | Unmanned ship-oriented geometric path planning method |
CN114442626A (en) * | 2022-01-24 | 2022-05-06 | 深圳市拓普智造科技有限公司 | Efficient global path planning method |
CN115179970A (en) * | 2022-09-14 | 2022-10-14 | 毫末智行科技有限公司 | Path planning method and device, electronic equipment and storage medium |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103576685A (en) * | 2013-11-14 | 2014-02-12 | 哈尔滨工程大学 | Method for determining path of UUV in process of recycling mother ship |
CN103777639A (en) * | 2014-01-10 | 2014-05-07 | 哈尔滨工程大学 | UUV three-dimension sea route planning method in moving obstacle environment |
CN104020770A (en) * | 2014-06-13 | 2014-09-03 | 哈尔滨工程大学 | UUV space trajectory planning method based on polynomial |
CN105549600A (en) * | 2016-02-05 | 2016-05-04 | 哈尔滨工程大学 | Evading method based on opposite-direction sailing of virtual puffed motion obstacle and UUV |
-
2016
- 2016-05-12 CN CN201610312415.1A patent/CN105843234B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103576685A (en) * | 2013-11-14 | 2014-02-12 | 哈尔滨工程大学 | Method for determining path of UUV in process of recycling mother ship |
CN103777639A (en) * | 2014-01-10 | 2014-05-07 | 哈尔滨工程大学 | UUV three-dimension sea route planning method in moving obstacle environment |
CN104020770A (en) * | 2014-06-13 | 2014-09-03 | 哈尔滨工程大学 | UUV space trajectory planning method based on polynomial |
CN105549600A (en) * | 2016-02-05 | 2016-05-04 | 哈尔滨工程大学 | Evading method based on opposite-direction sailing of virtual puffed motion obstacle and UUV |
Non-Patent Citations (1)
Title |
---|
刘晓: "基于几何算法的水下航行器路径规划", 《海军工程大学学报》 * |
Cited By (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108073166A (en) * | 2016-11-16 | 2018-05-25 | 阳光暖果(北京)科技发展有限公司 | A kind of shortest time obstacle-avoiding route planning method |
CN107168344A (en) * | 2017-05-17 | 2017-09-15 | 哈尔滨工程大学 | A kind of UUV approaches air route generation method during seabed operation |
CN107168344B (en) * | 2017-05-17 | 2020-01-17 | 哈尔滨工程大学 | Method for generating air route in process of UUV (unmanned Underwater vehicle) approaching seabed operation |
CN107491068B (en) * | 2017-08-29 | 2020-12-04 | 歌尔股份有限公司 | Mobile robot path planning method and device and path planning equipment |
CN107491068A (en) * | 2017-08-29 | 2017-12-19 | 歌尔股份有限公司 | Method for planning path for mobile robot, device and route design device |
CN109990782A (en) * | 2017-12-29 | 2019-07-09 | 北京欣奕华科技有限公司 | A kind of method and apparatus of avoiding obstacles |
CN108279692A (en) * | 2018-01-17 | 2018-07-13 | 哈尔滨工程大学 | A kind of UUV dynamic programming methods based on LSTM-RNN |
CN108279692B (en) * | 2018-01-17 | 2020-12-22 | 哈尔滨工程大学 | UUV dynamic planning method based on LSTM-RNN |
CN108829635A (en) * | 2018-03-09 | 2018-11-16 | 中国人民解放军海军大连舰艇学院 | The calculation method in the motor-driven area of enemy plane in a kind of surface ship air-defense |
CN108829635B (en) * | 2018-03-09 | 2019-07-19 | 中国人民解放军海军大连舰艇学院 | The calculation method in the motor-driven area of enemy plane in a kind of surface ship air-defense |
CN111290376A (en) * | 2018-11-22 | 2020-06-16 | 中国科学院沈阳自动化研究所 | Method for tracking circular track of unmanned underwater vehicle |
CN109460045A (en) * | 2019-01-14 | 2019-03-12 | 哈尔滨工程大学 | USV is based on the collision-avoidance planning method for improving ant group optimization under dynamic disorder online awareness |
CN109460045B (en) * | 2019-01-14 | 2022-02-22 | 哈尔滨工程大学 | Improved ant colony optimization-based collision avoidance planning method for USV under dynamic obstacle online perception |
CN110658819A (en) * | 2019-09-30 | 2020-01-07 | 北京猎户星空科技有限公司 | Obstacle avoidance method and device, electronic equipment and storage medium |
CN110658819B (en) * | 2019-09-30 | 2022-04-15 | 北京猎户星空科技有限公司 | Obstacle avoidance method and device, electronic equipment and storage medium |
CN112179351A (en) * | 2020-09-30 | 2021-01-05 | 上海电机学院 | Three-dimensional obstacle avoidance track planning method based on pre-planned path optimization RRT algorithm |
CN112179351B (en) * | 2020-09-30 | 2023-03-28 | 上海电机学院 | Three-dimensional obstacle avoidance track planning method based on pre-planned path optimization RRT algorithm |
CN112859864A (en) * | 2021-01-15 | 2021-05-28 | 大连海事大学 | Unmanned ship-oriented geometric path planning method |
CN114442626A (en) * | 2022-01-24 | 2022-05-06 | 深圳市拓普智造科技有限公司 | Efficient global path planning method |
CN114442626B (en) * | 2022-01-24 | 2024-04-26 | 深圳市拓普智造科技有限公司 | Global path planning method |
CN115179970A (en) * | 2022-09-14 | 2022-10-14 | 毫末智行科技有限公司 | Path planning method and device, electronic equipment and storage medium |
Also Published As
Publication number | Publication date |
---|---|
CN105843234B (en) | 2018-08-31 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105843234A (en) | Two-dimensional route planning method for UUV to geometrically bypass circular barriers | |
CN105929824B (en) | A kind of UUV two dimension Route planners based on geometry detour principle | |
EP3109842B1 (en) | Map-centric map matching method and apparatus | |
Zhao et al. | Dynamic motion planning for autonomous vehicle in unknown environments | |
CN110703762A (en) | Hybrid path planning method for unmanned surface vehicle in complex environment | |
CN107422736B (en) | Unmanned ship autonomous return control method | |
CN108564202B (en) | Unmanned ship route optimization method based on environment forecast information | |
Héry et al. | Map-based curvilinear coordinates for autonomous vehicles | |
CN106546244B (en) | A kind of method for determining ship's navigation local optimum path for convex barrier boat thing | |
CN107168344B (en) | Method for generating air route in process of UUV (unmanned Underwater vehicle) approaching seabed operation | |
CN104820430B (en) | A kind of AUV based on dipole potential field returns depressed place guidance system and guidance method | |
CN103674029B (en) | A kind of method of many ships collaborative navigation formation configuration based on underwater sound communication | |
CN106503837A (en) | A kind of time optimal Route planner based on improvement level set algorithm | |
CN103900573A (en) | Underwater vehicle multi-constrained path planning method based on S57 standard electronic chart | |
CN111665846B (en) | Water surface unmanned ship path planning method based on rapid scanning method | |
JP6863027B2 (en) | Three-dimensional object detection processing device | |
CN104732066A (en) | Vehicle behavior spatial-temporal evolution modeling method under path constraint condition and application thereof | |
Chen et al. | Path Planning for Autonomous Vehicle Based on a Two‐Layered Planning Model in Complex Environment | |
CN113515111B (en) | Vehicle obstacle avoidance path planning method and device | |
Xinchi et al. | A research on intelligent obstacle avoidance for unmanned surface vehicles | |
Liu et al. | Gravity aided positioning based on real-time ICCP with optimized matching sequence length | |
CN106097408B (en) | A kind of continuous multi-scale expression method and system of seashore line feature | |
CN106020213B (en) | A kind of two-dimentional Route planner that UUV detours to rectangular obstruction geometry | |
Wang et al. | Autonomous path planning method of uuv in complex environment based on improved ant colony optimization algorithm | |
CN110969900A (en) | All-lane horizontal bias algorithm based on lane management |
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 |