CN111174797A - Closed area global path planning method - Google Patents
Closed area global path planning method Download PDFInfo
- Publication number
- CN111174797A CN111174797A CN202010047336.9A CN202010047336A CN111174797A CN 111174797 A CN111174797 A CN 111174797A CN 202010047336 A CN202010047336 A CN 202010047336A CN 111174797 A CN111174797 A CN 111174797A
- Authority
- CN
- China
- Prior art keywords
- path
- area
- point
- connection
- vehicle
- 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
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/28—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network with correlation of data from several navigational instruments
- G01C21/30—Map- or contour-matching
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)
- Navigation (AREA)
Abstract
The invention discloses a global path planning method for a closed area, which comprises the following steps: step S1, obtaining an environment map model of the closed area and generating an intermediate connection path; step S2, acquiring a starting point and a target point for completing the job task; step S3, according to the area of the starting point and the target point, corresponding global path planning is carried out; step S4, controlling the vehicle to run according to the planned global path; in step S1, the environmental map of the closed area may be obtained by a dispatcher by giving the area map, or by obtaining the environmental map from related map software, dividing the large closed area map into two parts, and changing time by space to generate an intermediate connection road in the intermediate connection area for storage and standby use, which is convenient for subsequent planning and rapid acquisition. According to the closed region global path planning method, the path planning in the closed region can be effectively and quickly realized through the setting from the step S1 to the step S4.
Description
Technical Field
The invention relates to the field of vehicle path planning, in particular to a global path planning method for a closed area.
Background
The global path planning of the unmanned vehicle means that an effective path which is free of collision and can safely reach a target point is planned according to performance indexes after a starting point and the target point of the unmanned vehicle are given on the basis of a certain environment model. The performance index may be the shortest distance traveled by the route, the shortest time of movement, etc. After the vehicle acquires the global path, the unmanned vehicle system controls the vehicle to run according to the planned path, and the specified operation task is completed safely and efficiently.
For large closed areas such as ports, parks, mining areas, farmlands and the like, operation sub-areas for completing different tasks are distributed at different positions of the closed area, and an operation vehicle runs in the same sub-area or among different sub-areas to complete the operation tasks. The existing main global path planning method for the unmanned vehicle is as follows: patent document CN 109085825 a proposes an optimal path selection method for unmanned mine car mining, in the method, after receiving a dispatching command, the unmanned mine car detects the surrounding environment through a radar sensor and performs weight judgment on obstacle avoidance and target following, the driving direction is adjusted according to the strength of a strengthening signal, and the unmanned mine car avoids obstacles and drives to a target, so that the method can meet the requirement that the unmanned mine car adapts to a complex mining area environment; patent document CN102854880A proposes a robot global path planning method facing to mixed terrain area uncertain environment, which first detects and constructs a robot working environment model, including a movement starting point and a target point, a static obstacle position and shape, a possible coverage area of an uncertain obstacle, a covered terrain type and area, and plans an optimal path by using a path weighted passable length containing terrain information and a path containment degree of the uncertain obstacle in an avoidance area as an objective function, aiming at ensuring that a robot completes a task at the lowest risk degree in the mixed terrain environment; patent document CN 107436603a proposes an automatic driving method and system for agricultural vehicle curve path, which obtains vehicle position information in real time and judges the angle deviation with the preset curve operation track, and performs machine learning to obtain driving experience by enhancing signal feedback.
The above patents all propose path planning methods for unmanned vehicles from different angles, but still have certain drawbacks: such as the application scenario only for a single farmland environment, may result in unnecessary redundant paths, slow path planning, etc. The invention provides a global path planning method and system facing a large closed area based on the idea of changing space into time, and the required global path can be rapidly acquired.
Disclosure of Invention
In view of the shortcomings of the prior art, it is an object of the present invention to provide a method and system for global path planning of an enclosed area, which overcomes one or more of the above-mentioned drawbacks of the various methods.
In order to achieve the purpose, the invention provides the following technical scheme: a global path planning method for an enclosed area comprises the following steps:
step S1, obtaining an environment map model of the closed area and generating an intermediate connection path;
step S2, acquiring a starting point and a target point for completing the job task;
step S3, according to the area of the starting point and the target point, corresponding global path planning is carried out;
step S4, controlling the vehicle to run according to the planned global path;
the environment map of the closed area in step S1 may be the area map given by the dispatcher, or obtained from related map software, and the large closed area map is divided into two parts, including the work areas completing various work tasks and the connection areas connecting different work areas, where at least one or more connection points exist at the junction between each work area and the connection area, and in the connection areas, a global path planning algorithm is applied to every two connection points of the different work areas to generate a connection path and store the connection path as a known path for standby.
As a further improvement of the present invention, in step S2, the starting point is the current position of the vehicle, the position information is determined by the relevant GPS positioning system configured in the vehicle, and the target point is determined by the staff of the dispatching center according to the task specification of the driving job to be completed or the unmanned control system according to the current task state of the vehicle. As a further improvement of the present invention, in step S3, if the start point and the target point are in the same job area: and connecting the starting point and the target point by adopting the shortest circular arc curve or straight line or a mixture of the two as a driving path of the vehicle under the multi-constraint condition of meeting the minimum turning radius of the vehicle according to the course of the vehicle at the starting point and the expected parking direction at the target point.
As a further improvement of the present invention, in step S3, if the starting point and the target point are in different working areas, the global path from the starting point to the target point can be divided into the following three parts for three-stage global path planning:
(1) the first section is a path from the starting point to a connecting point of the operation area and the connecting area, and the path adopts the shortest circular arc curve or straight line or mixed connection of the shortest circular arc curve and the straight line as a driving path of the vehicle under the condition of meeting the minimum turning radius of the vehicle according to the course of the vehicle at the starting point and the course of the vehicle at the connecting point;
(2) the second section of path is a path from the connection point of the operation area where the starting point is located and the connection area to the connection point of the operation area where the target point is located and the connection area. The segment of the path can be obtained quickly according to the known path of the connection area in step S1 in combination with the two connection points;
(3) the third path is a path from a connection point of the connection area and the area where the target point is located to the target point. The path segment is based on the heading at the entry junction and the desired direction of parking at the target point. And under the condition of meeting the minimum turning radius of the vehicle, the shortest circular arc curve or the straight line or the mixed connection of the two is adopted as the driving path of the vehicle.
As a further improvement of the present invention, in step S3, if the starting point is not in the job area but in the connection area, the global path from the starting point to the target point can be divided into the following three parts:
(1) the first section is a path from a starting point to a tangent point of a nearby known path entering the connecting area, and the path is connected by adopting a shortest circular arc curve or a straight line or a mixture of the shortest circular arc curve and the straight line as a driving path of the vehicle under the condition of meeting the minimum turning radius of the vehicle according to the course of the vehicle at the starting point and the course of the vehicle at the tangent point of the nearby known path;
(2) the second section of the path is a path from the tangent point of the vehicle entering the nearby known path to the connection point between the operation area where the target point is located and the connection area along the known path. The segment of the path is quickly available according to the known path of the connection area in step S1;
(3) the third section of path is a path from a connection point of the connection area and the area where the target point is located to the target point, and the section of path is connected by adopting the shortest circular arc curve or straight line or the mixture of the shortest circular arc curve and the straight line as the driving path of the vehicle under the condition of meeting the minimum turning radius of the vehicle according to the course of entering the connection point and the expected parking direction of the target point.
The invention has the advantages that the global path planning can be realized in the closed area through the arrangement from the step S1 to the step S4, in the step S1, the large closed area is divided into areas, then the connection path is generated by the connection points between the divided areas according to the global path planning algorithm, the space is changed for the time, and the intermediate path can be quickly obtained by the subsequent planning. Compared with the way of planning the path in the whole area in the prior art, the method can synthesize the property state of each area in the large-scale closed area, thereby realizing path planning and ensuring that the finally planned path is faster, more reasonable and more reliable.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a schematic view of an enclosed area of an embodiment of the present invention;
FIG. 3 is a schematic diagram of an embodiment of the invention for generating an intermediate link;
FIG. 4 is a schematic diagram of a path plan with a start point and a target point located in the same working area according to the present invention;
FIG. 5 is a schematic diagram of a path plan with a start point and a target point located in two different work areas according to the present invention;
FIG. 6 is a schematic diagram of a path plan with at least one of the start point and the target point located in a connection area according to the present invention.
Detailed Description
The invention will be further described in detail with reference to the following examples, which are given in the accompanying drawings.
As shown in the flow chart of fig. 1, the invention adopts the following technical scheme: a closed area global path planning method and a system thereof comprise the following steps:
s1 obtaining environment map model of closed region and generating intermediate connection path
First, the environment map of the enclosed area may be given by the dispatcher of the control center or obtained from the relevant map software.
As shown in fig. 2, the closed area may represent, but is not limited to, a large closed area such as a harbor, a garden, a mine, and a farmland. The hatched area in fig. 2 represents an impassable area, and the passable area of the closed area is mainly composed of two parts, including a work area 1, a work area 2, a work area 3, and a work area 4 for completing various work tasks, and an intermediate road connecting area for connecting different work areas.
Each junction between the working area and the middle road connecting area is provided with two connecting points, such as A, B, C, D, E, F, M, N, and in fig. 2, each junction is provided with two connecting points, but the number of the connecting points is not limited to two in other embodiments.
Then, in the connection area, aiming at different operation areas, a global path planning algorithm is adopted for every two connection points of the operation areas to generate a connection path, the connection path is stored as a known path for standby, and the time required by subsequent path planning is shortened. The global path planning algorithm taken may be the a-algorithm, Dijkstra algorithm, etc.
If the a-algorithm is used for global path planning, the map rasterization processing may be performed after the environment map of the closed region is obtained at step S1, so as to form a rasterized environment map model, which is convenient for the a-algorithm to search and obtain the optimal global path. According to the range size of the closed region environment model, the appropriate grid size can be selected. For example, in large enclosed areas such as ports, the grid size may be selected to be 0.5m or 1 m.
Fig. 3 is a schematic diagram of the intermediate connection route generated in the intermediate road connection area of the closed area after step S1. The generated intermediate connection path is stored as a known path for standby, the idea of changing space into time is applied, and the storage space is used for changing path planning time in the subsequent global path planning process.
S2 obtaining the start point and the target point of completing the job task
The starting point for completing the work task is generally the current position of the vehicle, and the position information can be determined by a related GPS positioning system and the like configured by the vehicle; the target point can be specified by the staff of the dispatching center according to the running job task to be completed or determined by the unmanned control system according to the current task state of the vehicle.
S3 carrying out corresponding global path planning according to the area where the starting point and the target point are located
And (4) aiming at the starting point and the target point acquired in the step (S2), performing corresponding global path planning according to the area positions of the starting point and the target point in the closed area.
As shown in fig. 4, the start point and the target point are located in the same work area.
And connecting the starting point S and the target point G by adopting the shortest circular arc curve or straight line or a mixture of the two as a driving path SG of the vehicle under the condition of meeting the multi-constraint condition of the minimum turning radius of the vehicle according to the heading of the vehicle at the starting point S and the expected parking direction at the target point G.
As shown in fig. 5, the start point and the target point are located in two different work areas. The starting point S is located in the working area 2 and the target point G is located in the working area 1. And carrying out global path planning by adopting a three-section path.
(1) The first section is a path SC from the starting point S to a connecting point C of the working area 2 and the connecting area, and the path adopts the shortest circular arc curve or straight line or the mixed connection of the two as the driving path of the vehicle under the condition of meeting the minimum turning radius of the vehicle according to the course of the vehicle at the starting point S and the course of the vehicle at the connecting point C.
(2) The second path is a path from the connection point C of the work area 2 where the starting point S is located and the connection area to the connection point B of the work area 1 where the target point G is located and the connection area. The segment of the path CB is obtained by combining the two connection points C and B according to the known path of the connection area in step S1. The path CB acquired here does not need to perform global path planning again on the connection area based on the connection point because it is acquired at step S1, which saves planning time and quickly acquires the path.
(3) The third path is a path from a connection point B of the connection area and the work area 1 where the target point G is located to the target point G. The path BG is based on the heading at the point of connection B and the desired direction of parking at the target point G. And under the condition of meeting the minimum turning radius of the vehicle, the shortest circular arc curve or the straight line or the mixed connection of the two is adopted as the driving path of the vehicle.
The three paths SC, CB, BG may be smoothly connected in sequence at the two connection points C and B as a total global path SG, since the vehicle heading at the connection points C and B is taken into account.
As shown in fig. 6, the start point S is located within the connection area instead of within the work area, and the target point G is located within the work area 1. Then the adjacent intermediate path is selected for global path planning.
(1) The first segment is a path from the starting point S to a tangent point L of a nearby known path entering the connecting area, and the path of the segment is connected by adopting a shortest circular arc curve or a straight line or a mixture of the two as a driving path SL of the vehicle under the condition of meeting the minimum turning radius of the vehicle according to the course direction of the vehicle at the starting point S and the course direction of the tangent point L of the nearby known path of the vehicle.
(2) The second section of the path is a path between a working area where the vehicle enters a nearby known path and a connecting point B of the connecting area along the known path to the target point. The segment of the path LB is available from the known path of the connection region in step S1. The path LB obtained here does not need to perform global path planning again on the connection area based on the connection point because it is obtained in step S1, which saves planning time and obtains the path quickly.
(3) The third path is a path from a connection point B connecting the area and the area where the target point G is located to the target point G. The path BG is based on the heading at the point of connection B and the desired direction of parking at the target point G. And under the condition of meeting the minimum turning radius of the vehicle, the shortest circular arc curve or the straight line or the mixed connection of the two is adopted as the driving path of the vehicle.
The three-segment paths SL, LB, BG may be smoothly connected in sequence at the tangent point L and the connection point B as a total global path SG, since the vehicle heading at the tangent point L and the connection point B is taken into account.
And S4, controlling the vehicle to run according to the planned global path.
The vehicle running control system controls the vehicle to run to complete the task according to the global path planned in step S3.
The above description is only a preferred embodiment of the present invention, and the protection scope of the present invention is not limited to the above embodiments, and all technical solutions belonging to the idea of the present invention belong to the protection scope of the present invention. It should be noted that modifications and embellishments within the scope of the invention may occur to those skilled in the art without departing from the principle of the invention, and are considered to be within the scope of the invention.
Claims (5)
1. A closed area global path planning method is characterized in that: the method comprises the following steps:
step S1, obtaining an environment map model of the closed area and generating an intermediate connection path;
step S2, acquiring a starting point and a target point for completing the job task;
step S3, according to the area of the starting point and the target point, corresponding global path planning is carried out;
step S4, controlling the vehicle to run according to the planned global path;
the environment map of the closed area in step S1 may be the area map given by the dispatcher, or obtained from related map software, and the large closed area map is divided into two parts, including the work areas completing various work tasks and the connection areas connecting different work areas, where at least one or more connection points exist at the junction between each work area and the connection area, and in the connection areas, a global path planning algorithm is applied to every two connection points of the different work areas to generate a connection path and store the connection path as a known path for standby.
2. The closed area global path planning method according to claim 1, characterized in that: in step S2, the starting point is the current position of the vehicle, the position information is determined by a related GPS positioning system configured in the vehicle, and the target point is determined by a worker in the dispatching center according to the task designation of the driving job to be completed or by the unmanned control system according to the current task state of the vehicle.
3. The closed area global path planning method according to claim 1 or 2, characterized in that: in step S3, if the start point and the target point are in the same work area: and connecting the starting point and the target point by adopting the shortest circular arc curve or straight line or a mixture of the two as a driving path of the vehicle under the multi-constraint condition of meeting the minimum turning radius of the vehicle according to the course of the vehicle at the starting point and the expected parking direction at the target point.
4. The closed area global path planning method according to claim 3, characterized in that: in step S3, if the start point and the target point are in different work areas, the global path from the start point to the target point can be divided into the following three parts for three-segment global path planning:
(1) the first section is a path from the starting point to a connecting point of the operation area and the connecting area, and the path adopts the shortest circular arc curve or straight line or mixed connection of the shortest circular arc curve and the straight line as a driving path of the vehicle under the condition of meeting the minimum turning radius of the vehicle according to the course of the vehicle at the starting point and the course of the vehicle at the connecting point;
(2) the second section of path is a path from the connection point of the operation area where the starting point is located and the connection area to the connection point of the operation area where the target point is located and the connection area. The segment of the path is obtained by combining the two connection points according to the known path of the connection area in step S1;
(3) the third section of path is a path from a connection point of the connection area and the area where the target point is located to the target point, and the section of path is connected by adopting the shortest circular arc curve or straight line or the mixture of the shortest circular arc curve and the straight line as the driving path of the vehicle under the condition of meeting the minimum turning radius of the vehicle according to the course of entering the connection point and the expected parking direction of the target point.
5. The closed area global path planning method according to claim 4, characterized in that: in step S3, if the starting point is not in the job area but in the connection area, the global path from the starting point to the target point can be divided into the following three parts:
(1) the first section is a path from a starting point to a tangent point of a nearby known path entering the connecting area, and the path is connected by adopting a shortest circular arc curve or a straight line or a mixture of the shortest circular arc curve and the straight line as a driving path of the vehicle under the condition of meeting the minimum turning radius of the vehicle according to the course of the vehicle at the starting point and the course of the vehicle at the tangent point of the nearby known path;
(2) the second section of the path is a path from the tangent point of the vehicle entering the nearby known path to the connection point between the operation area where the target point is located and the connection area along the known path. The segment of the path is available from the known path connecting the regions in step S1;
(3) the third path is a path from a connection point of the connection area and the area where the target point is located to the target point. The path segment is based on the heading at the entry junction and the desired direction of parking at the target point. And under the condition of meeting the minimum turning radius of the vehicle, the shortest circular arc curve or the straight line or the mixed connection of the two is adopted as the driving path of the vehicle.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010047336.9A CN111174797B (en) | 2020-01-16 | 2020-01-16 | Closed area global path planning method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010047336.9A CN111174797B (en) | 2020-01-16 | 2020-01-16 | Closed area global path planning method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111174797A true CN111174797A (en) | 2020-05-19 |
| CN111174797B CN111174797B (en) | 2022-10-14 |
Family
ID=70656365
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010047336.9A Active CN111174797B (en) | 2020-01-16 | 2020-01-16 | Closed area global path planning method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111174797B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111750862A (en) * | 2020-06-11 | 2020-10-09 | 深圳优地科技有限公司 | Multi-region-based robot path planning method, robot and terminal equipment |
| CN112015176A (en) * | 2020-08-14 | 2020-12-01 | 合肥工业大学 | Unmanned tractor field operation path planning method and device |
| CN112232558A (en) * | 2020-10-09 | 2021-01-15 | 中国铁建重工集团股份有限公司 | TBM spraying and mixing system operation path planning method |
| CN113093745A (en) * | 2021-03-31 | 2021-07-09 | 南京苏美达智能技术有限公司 | Control method of cross-regional automatic walking equipment and automatic walking equipment |
| CN113705966A (en) * | 2021-07-20 | 2021-11-26 | 重庆超体科技有限公司 | Vehicle transportation scheduling method for meeting road load rate in closed plant area |
| CN114220282A (en) * | 2021-11-15 | 2022-03-22 | 三一专用汽车有限责任公司 | Vehicle scheduling control method and device and electronic equipment |
| CN114459480A (en) * | 2021-12-03 | 2022-05-10 | 广州极飞科技股份有限公司 | Operation safety region generation method, path planning method and related device |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101840333A (en) * | 2010-03-16 | 2010-09-22 | 中国科学院计算技术研究所 | Text description method and device for route result |
| CN101840416A (en) * | 2010-03-16 | 2010-09-22 | 中国科学院计算技术研究所 | Trans-regional path searching method and device |
| WO2015068249A1 (en) * | 2013-11-08 | 2015-05-14 | 株式会社日立製作所 | Autonomous driving vehicle and autonomous driving system |
| CN104808671A (en) * | 2015-05-19 | 2015-07-29 | 东南大学 | Robot path planning method under home environment |
| CN107092978A (en) * | 2017-04-05 | 2017-08-25 | 武汉大学 | A kind of shortest path hierarchical reconfiguration planning method of the Virtual earth |
| CN107450535A (en) * | 2017-07-31 | 2017-12-08 | 中南大学 | A kind of intelligent carrying robot optimal path combination chart discusses controlling planning method |
| CN108088456A (en) * | 2017-12-21 | 2018-05-29 | 北京工业大学 | A kind of automatic driving vehicle local paths planning method with time consistency |
| CN108896052A (en) * | 2018-09-20 | 2018-11-27 | 鲁东大学 | A kind of mobile robot smooth paths planing method under the environment based on DYNAMIC COMPLEX |
-
2020
- 2020-01-16 CN CN202010047336.9A patent/CN111174797B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101840333A (en) * | 2010-03-16 | 2010-09-22 | 中国科学院计算技术研究所 | Text description method and device for route result |
| CN101840416A (en) * | 2010-03-16 | 2010-09-22 | 中国科学院计算技术研究所 | Trans-regional path searching method and device |
| WO2015068249A1 (en) * | 2013-11-08 | 2015-05-14 | 株式会社日立製作所 | Autonomous driving vehicle and autonomous driving system |
| CN104808671A (en) * | 2015-05-19 | 2015-07-29 | 东南大学 | Robot path planning method under home environment |
| CN107092978A (en) * | 2017-04-05 | 2017-08-25 | 武汉大学 | A kind of shortest path hierarchical reconfiguration planning method of the Virtual earth |
| CN107450535A (en) * | 2017-07-31 | 2017-12-08 | 中南大学 | A kind of intelligent carrying robot optimal path combination chart discusses controlling planning method |
| CN108088456A (en) * | 2017-12-21 | 2018-05-29 | 北京工业大学 | A kind of automatic driving vehicle local paths planning method with time consistency |
| CN108896052A (en) * | 2018-09-20 | 2018-11-27 | 鲁东大学 | A kind of mobile robot smooth paths planing method under the environment based on DYNAMIC COMPLEX |
Non-Patent Citations (1)
| Title |
|---|
| 李宁宁等: "改进的Dijkstra算法在GIS路径规划中的应用", 《计算机与现代化》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111750862A (en) * | 2020-06-11 | 2020-10-09 | 深圳优地科技有限公司 | Multi-region-based robot path planning method, robot and terminal equipment |
| CN112015176A (en) * | 2020-08-14 | 2020-12-01 | 合肥工业大学 | Unmanned tractor field operation path planning method and device |
| CN112232558A (en) * | 2020-10-09 | 2021-01-15 | 中国铁建重工集团股份有限公司 | TBM spraying and mixing system operation path planning method |
| CN112232558B (en) * | 2020-10-09 | 2024-02-20 | 中国铁建重工集团股份有限公司 | TBM (Tunnel boring machine) spraying and mixing system operation path planning method |
| CN113093745A (en) * | 2021-03-31 | 2021-07-09 | 南京苏美达智能技术有限公司 | Control method of cross-regional automatic walking equipment and automatic walking equipment |
| CN113705966A (en) * | 2021-07-20 | 2021-11-26 | 重庆超体科技有限公司 | Vehicle transportation scheduling method for meeting road load rate in closed plant area |
| CN113705966B (en) * | 2021-07-20 | 2024-01-26 | 重庆超体科技有限公司 | Vehicle transportation scheduling method for meeting road load rate in closed factory |
| CN114220282A (en) * | 2021-11-15 | 2022-03-22 | 三一专用汽车有限责任公司 | Vehicle scheduling control method and device and electronic equipment |
| CN114220282B (en) * | 2021-11-15 | 2022-12-02 | 三一专用汽车有限责任公司 | Vehicle scheduling control method and device and electronic equipment |
| CN114459480A (en) * | 2021-12-03 | 2022-05-10 | 广州极飞科技股份有限公司 | Operation safety region generation method, path planning method and related device |
| CN114459480B (en) * | 2021-12-03 | 2024-06-07 | 广州极飞科技股份有限公司 | Operation safety area generation method, path planning method and related devices |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111174797B (en) | 2022-10-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111174797B (en) | Closed area global path planning method | |
| CN107990898B (en) | Travel route generation device | |
| US7010425B2 (en) | Path planner and a method for planning a path of a work vehicle | |
| CN104133472B (en) | Method for planning virtual trajectory and method for operating unmanned transport vehicle | |
| US9851718B2 (en) | Intelligent control apparatus, system, and method of use | |
| US6799100B2 (en) | Permission system for controlling interaction between autonomous vehicles in mining operation | |
| RU2691679C1 (en) | Method of creating track of movement for autonomous movement of movable object and method of autonomous movement of movable object along path of movement | |
| US20180164117A1 (en) | Travel route generation apparatus and method for generating travel route | |
| KR102479709B1 (en) | driving route management system | |
| Hameed | Coverage path planning software for autonomous robotic lawn mower using dubins' curve | |
| US20010021888A1 (en) | Anti-rut system for autonomous-vehicle guidance | |
| Carsten et al. | Global planning on the mars exploration rovers: Software integration and surface testing | |
| US20180156622A1 (en) | Method and robot system for autonomous control of a vehicle | |
| US20200356096A1 (en) | Autonomous agricultural working machine and method of operation | |
| CN113739802B (en) | Unmanned bulldozer path planning method, system, storage medium and equipment | |
| CN112988938A (en) | Map construction method and device and terminal equipment | |
| Klaudt et al. | A-priori map information and path planning for automated valet-parking | |
| Hosseini et al. | Interactive path planning for teleoperated road vehicles in urban environments | |
| Schmidt et al. | Construction site navigation for the autonomous excavator Thor | |
| López et al. | A new approach to local navigation for autonomous driving vehicles based on the curvature velocity method | |
| EP3330824A1 (en) | Method and robot system for autonomous control of a vehicle | |
| CN112731934B (en) | Method for quickly returning intelligent mower to charging station based on region segmentation | |
| Stoll | Automatic operation planning for GPS-guided machinery | |
| Saska et al. | Efficient airport snow shoveling by applying autonomous multi-vehicle formations | |
| Tang et al. | A reference path guided rrt* method for the local path planning of UGVS |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |