CN110146103B - Unmanned equipment path planning method considering target trend and energy supply - Google Patents
Unmanned equipment path planning method considering target trend and energy supply Download PDFInfo
- Publication number
- CN110146103B CN110146103B CN201910513985.0A CN201910513985A CN110146103B CN 110146103 B CN110146103 B CN 110146103B CN 201910513985 A CN201910513985 A CN 201910513985A CN 110146103 B CN110146103 B CN 110146103B
- Authority
- CN
- China
- Prior art keywords
- node
- energy
- weight
- target
- source
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 239000013589 supplement Substances 0.000 claims description 65
- 238000010586 diagram Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 230000001502 supplementing effect Effects 0.000 description 3
- 102100023190 Armadillo repeat-containing protein 1 Human genes 0.000 description 2
- 101000684952 Homo sapiens Armadillo repeat-containing protein 1 Proteins 0.000 description 2
- 230000000295 complement effect Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000013332 literature search Methods 0.000 description 1
- 239000004576 sand Substances 0.000 description 1
- 230000000153 supplemental effect Effects 0.000 description 1
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/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/3415—Dynamic re-routing, e.g. recalculating the route when the user deviates from calculated route or after detecting real-time traffic data or accidents
-
- 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
- G01C21/3469—Fuel consumption; Energy use; Emission aspects
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Navigation (AREA)
Abstract
The invention discloses an unmanned equipment path planning method considering target direction and energy supply, which is applied to the field of unmanned equipment path planning and aims to solve the problem that the energy supply of unmanned equipment in a midway energy station is not considered in the prior art.
Description
Technical Field
The invention belongs to the field of path planning of unmanned equipment, and particularly relates to a path planning technology of the unmanned equipment, which considers the trend of a target and energy supply.
Background
The intelligent unmanned equipment is an important component of the internet of things era, and the path planning problem is one of the key problems to be solved in the development of the intelligent unmanned equipment. When the unmanned equipment completes a given task, the unmanned equipment needs to pass through a plurality of intermediate nodes, the selection of the passed paths is diversified and not unique, different paths have different execution times and different consumed energy sources, and therefore the unmanned equipment needs to consider the constraint conditions of the paths to find the optimal path under the condition that the requirements and conditions defined by a system are met, which is also the premise of intelligent equipment movement. For example, in emergency rescue, unmanned devices move among various target points due to high requirements on short time and low time delay, and how to reach a rescued target area with minimum cost and transmit data back to a control center in real time is a problem to be considered. Therefore, many scholars have also studied the problem of optimizing path planning.
According to the existing literature search, in the path planning problem, although there are many path planning algorithms, most of the path planning algorithms only consider the weight of the moving path edge, and do not consider the weight of the intermediate node, that is, the practical problem that the unmanned device performs energy supplement at the energy station midway is not considered, and the practical problems that the future target trend and the paths and the intermediate node are influenced are not considered, for example, due to different road conditions, different speeds through each path, different queuing times and energy prices of each energy supplement station node and the like, the practical problems can influence the path planning of the unmanned device, and meanwhile, the existing algorithms also have many practical problems of high model complexity, low algorithm convergence speed and the like.
Disclosure of Invention
In order to solve the technical problems, the invention provides an unmanned equipment lightweight path planning method considering energy supply, considers a vehicle moving model in reality, and provides a strategy for comprehensively considering node loss factors such as speed, energy supply time and energy price of a vehicle in a driving process to realize an optimal moving scheme.
The technical scheme adopted by the invention is as follows: the unmanned equipment lightweight path planning method considering energy replenishment comprises the following steps:
s1, establishing an energy supply node set according to the target trend sequence window, and establishing a first topological graph according to the energy supply node set;
s2, expanding the source nodes and all the target nodes in the target trend sequence window into the first topological graph to obtain a second topological graph;
s3, updating the weight of the second topological graph;
s4, calculating the optimal path from the source node to the current target node by adopting a trend reverse push algorithm according to the topological graph updated by the weight in the step S3;
s5, advancing to the current target node, and ending if the current target node is the global final target node; otherwise, taking the current target node as a new source node, and calculating the optimal path from the source node to the next target node.
Further, the weight values of step S3 are updated in consideration of the money cost:
the method comprises the steps of updating a money cost weight between two energy source nodes according to a distance cost unit price between the two energy source supplement nodes, updating a money cost weight between a source node and an adjacent energy source supplement node according to the distance cost unit price between the source node and the adjacent energy source supplement node, updating a money cost weight between a target node and the adjacent energy source supplement node according to the distance cost unit price between the target node and the adjacent energy source supplement node, and updating the money cost weight of the energy source supplement node according to the maximum capacity of equipment energy corresponding to unmanned equipment, the energy source unit price corresponding to the energy source supplement node and energy required to be supplemented at the energy source supplement node.
Further, the weight values of step S3 are updated in consideration of time consumption: the time weight between the two energy source nodes is updated according to the passing time of the distance between the two energy source supplement nodes, the time weight between the source node and the adjacent energy source supplement node is updated according to the passing time of the distance between the source node and the adjacent energy source supplement node, the time weight between the target node and the adjacent energy source supplement node is updated according to the passing time of the distance between the target node and the adjacent energy source supplement node, and the time weight of the energy source supplement node is updated according to the maximum energy capacity corresponding to the unmanned equipment, the energy supplement speed of the energy source supplement node and the energy needed to be supplemented at the energy source supplement node.
Further, the weight values in step S3 are updated by comprehensively considering the money cost and the time cost:
definition of RMDefining R as a weight coefficient for money costTCost a weight coefficient for time, and RM+RT=1;
According to the money cost weight, the time cost weight and R between the two energy supplement nodesM、RTUpdating the weight between the two energy nodes according to the money cost weight, the time cost weight and R between the source node and the adjacent energy supplement nodeM、RTUpdating the weight between the source node and the adjacent energy supplement node according to the money cost weight, the time cost weight, R between the target node and the adjacent energy supplement nodeM、RTUpdating the weight between the target node and the adjacent energy supplement node according to the money cost weight, the time cost weight and R of the energy supplement nodeM、RTAnd updating the weight of the energy supplement node.
Further, the step S1 includes the following sub-steps:
s11, establishing an energy supply node set according to the target trend sequence window;
and S12, if the distance between the two energy supply nodes in the step S11 set is smaller than the full energy movement distance of the unmanned equipment, adding a connecting line between the two energy supply nodes into the topological graph as a directed edge, wherein the weight of the directed edge is the distance between the two energy supply nodes, and traversing the pairwise combination of all the energy supply nodes to obtain a final first topological graph.
Further, step S2 includes:
s21, adding the source node to the first topological graph, specifically: if the distance from the source node to a certain energy source node is smaller than the maximum distance that the unmanned equipment can travel in the residual energy of the source node, adding a connecting line between the source node and the energy source supply node into the current topological graph as a directed edge, wherein the weight of the directed edge is the distance between the source node and the energy source supply node;
s22, adding the target node in the target heading sequence window to the first topological graph, which specifically includes: if the distance from a certain energy node to a target node is smaller than the difference between the full energy movement distance of the unmanned equipment and the distance from the target node to the nearest energy supply node, adding a connecting line between the energy supply node and the target node into the current topological graph as a directed edge, wherein the weight of the directed edge is the distance between the energy supply node and the target node;
s23, obtaining a second topological graph according to the step S21 and the step S22.
Further, the trend reverse algorithm in step S4 calculates the best path to the next target node, including the following sub-steps:
a1, calculating the energy needed to be reserved from the current target node to the next hop in the target moving sequence window;
a2, calculating the optimal path from the previous target node to the current target node by adopting Dijkstra algorithm according to the energy required to be reserved by the current target node and the second topological graph of the step S3;
or according to the energy required to be reserved by the current target node and the second topological graph of the step S3, calculating the optimal path from the source node to the current target node by adopting a Dijkstra algorithm.
Further, step a1 specifically includes:
if the current target node is the last target node in the target trend sequence window, taking the energy supply node closest to the target node as the next hop of the current target node, and calculating to obtain the energy required to be reserved from the current target node to the next hop;
otherwise, the next hop of the current target node is obtained according to the optimal path from the target node to the next target node, and the energy required to be reserved from the current target node to the next hop is calculated and obtained.
Further, the step S5 of calculating the best path from the source node to the next target node by taking the current target node as the new source node includes the following sub-steps:
b1, taking the current target node as a new source node, and updating the target moving sequence window;
b2, judging whether the current first topological graph covers the energy supply node set corresponding to the updated target trend sequence window, if so, returning to the step S2, and updating the current second topological graph; otherwise, returning to step S1, updating the current first topological graph according to the updated target trend sequence window.
The invention has the beneficial effects that: in the invention, a network topological graph is established in advance, and according to road conditions, energy supplementing time, price and other factors which need to be considered in reality, and the emphasis of different tasks on different weight factors are considered, the time and cost are jointly optimized, and a normalized weight network is established; the unmanned equipment acquires information of a weight network before executing the task, and an optimal path for executing the task is planned by using the target node energy constraint condition; meanwhile, the invention also provides an unmanned equipment path planning method considering the target trend and energy supply, the method is more suitable for the actual unmanned equipment path planning, the optimal path planning scheme can be obtained, and the operation cost of the unmanned equipment is reduced.
Drawings
Fig. 1 is a flow chart of the unmanned aerial vehicle lightweight path planning method considering energy replenishment.
Fig. 2 is a scene schematic diagram of the unmanned aerial vehicle lightweight path planning method considering energy replenishment.
Fig. 3 is an energy supply node network diagram of the unmanned aerial vehicle lightweight path planning method considering energy supply of the present invention.
Fig. 4 is an illustrative diagram of the unmanned aerial vehicle lightweight path planning method considering energy replenishment.
Detailed Description
In order to facilitate the understanding of the technical contents of the present invention by those skilled in the art, the present invention will be further explained with reference to the accompanying drawings.
In the invention, in the process that the unmanned equipment passes through a plurality of intermediate energy supply nodes from a source node to a target node, the optimal moving path of the unmanned equipment when executing a series of tasks is determined by considering the path planning of multi-factor joint optimization.
Fig. 1 is a flow chart of the method of the present invention, in which a coordinate map, paths and energy supply costs of all energy supply nodes are known, and fig. 2 is a schematic view of a scene provided in this embodiment, including a source node qsA plurality of target nodes (Q ═<q1,q2,…,qn>) And a plurality of energy supply nodes (P ═ P)1,P2,…,Pm]). Solving the following steps: current position s ═ q of vehicle0To a series of target points (Q ═ Q)<q1,q2,…,qn>) The optimal path of (2); the realization process of the invention is as follows:
step 1: and constructing an energy supply node topological graph G according to the trend of the unmanned equipment.
Step 1.1: based on the map, energy supply nodes near the target of the unmanned device are found to form an energy supply node set (P ═ P)1,P2,…,Pm]). The specific implementation steps are as follows:
step 1.2.1: the drone target course is represented by a sequence of source and target nodes as W ═ tone<qi,qi+1>I-s … s + w-1, indicating that the drone is to be routed by the source node qsStarting from that, i.e. passing qs+1,qs+2,…,qs+wAnd waiting for the target nodes, wherein w is the maximum number of the target nodes considered in the current calculation, and can be preconfigured or adaptively adjusted, and the value of w in the embodiment is 3, that is, the target moving sequence window at least comprises one source node and two target nodes.
Step 1.2.2: and setting P as an empty set, respectively checking the target trend sequence, and adding all energy complementing nodes near the trend sequence into P. The specific method is to<qi,qi+1>A circular area is defined on the map for the diameter, and all energy-complementing nodes located within the circular area are added to P, i ═ s … s + w-1.
Step 1.2.3: the complementary nodes in P are numbered as (P (1),,, P (m)).
Step 1.2: and (3) for the energy supply node sets (P (1),, P (m)), m represents the total number of the energy supply nodes, the distance between every two energy supply nodes is checked, and if a path with the distance smaller than the full energy moving distance L exists between P (i) and P (j), P (i) P (j) is used as a directed edge to be added into G. The specific implementation steps are as follows:
step 1.2.1: calculating the distance between P (1) and P (2), P (3) … P (m), respectively, assuming that the maximum distance that the unmanned device can move when fully powered is L, if d(P(1),P(j))<L, if P (1) P (j) is called as the mutual neighbor point, then P (1) P (j) is added into the topological graph G, and the weight given to the edge is d(P(1),P(j));
Step 1.2.2: respectively calculating the distance between P (2) and P (1) P (3) … P (m), assuming that the maximum distance that the unmanned equipment can move when the unmanned equipment is full of energy is L, if d(P(2),P(j))<L, adding P (2) P (j) into the edge set of the topological graph G, and giving the weight of the edge d(P(2),P(j)). And by analogy, each node meeting the conditions is added into the network topology graph G. A schematic diagram of which is shown in fig. 3.
Step 2: and adding the nodes in the trend sequence W into the network topological graph to generate an expanded topological graph G'.
And copying the topology graph G to be used as an expanded topology graph G ', G ' is G, and adding nodes in the sequence W to G '.
Step 2.1: the first node in the sequence W, i.e. the source node qsAdding to the topology map
If from qsTo P (i) by a distance d(qs,P(i))Paths less than Ls, then (q) will besP (i)) adds G' as a directed edge. Here, Ls is the vehicle at qsThe maximum distance that the remaining energy source can travel.
Step 2.2: the remaining target nodes { q ] in the sequence WiWhere i + s +1, …, s + w, is added to the augmented topology graph G'
If from P (j) to qiExists at a distance d(P(j),qi)If the path is less than L-L (r), then (P (j), q)i) G' is added as a directed edge. Where L (r) is from qiThe closest distance to a nearby charging site. The establishment of the whole network topological graph is completed. A schematic diagram of which is shown in fig. 4.
And step 3: and calculating the weight on the extended topological graph G'.
Updating the weight of the edge set and the point set to complete the establishment of a weight network: the weight given to the edge set is only dependent on the length of the path, however, in an actual environment, the unmanned device needs to consider multiple comprehensive factors, such as road conditions and time for queuing to supplement energy, the road conditions and the road toll of each path are different, the time and the price of the supplement energy of each energy supplement node are different, and thus, the unmanned device needs to give weight again according to the actual situation. The weight calculation method is divided into the following 3 types of situations, and can be configured:
An optimization path algorithm considering a node weight function and a target trend has the basic idea that the calculation is performed reversely along a trend sequence W, and the calculation is performed from q to q respectivelyi-1To qiI from s + w to s +1, and finally qsGo to qs+1The optimal path of (2). The trend reverse-push algorithm computes pseudo-code as follows:
step 4.1: calculating the slave q on G' by using Dijkstra algorithmi-1To qiThe shortest path of (2). The Dijkstra algorithm is a well-known algorithm in the computer field and the invention is not described in detail here.
Step 4.2: once q is foundi-1To qiOf the unmanned device is in qs+w-1The energy needed to be reserved is determined, and the unmanned equipment q is updatedi-1Energy sources requiring conservation at the site, i.e. Remainc (q)i-1)=L-dist(qi-1;vi-1(next))。vi-1(next) is qi-1To qiMay be the target node or the complementary station.
5. After proceeding to the next target point, the optimal path is recalculated
When the target site q is reached along the optimal paths+1And then judging whether the last target site is reached. If the last target point has been reached, the algorithm ends.
Otherwise, updating the current position to q by s-s +1sAnd updating the trend sequence W, including a new target node, if the topological graph G already covers the range of the W, turning to the step 2, otherwise, turning to the step 1, and updating the topological graph G.
The invention is further illustrated by the following specific example.
As shown in fig. 4, a source node and a target node and an energy supplement node are given, and a network topology graph is established according to step 1, and each parameter of the edges and nodes has been labeled on the graph. Suppose unmanned equipment is full energy capacity F max20, 100, weight of time spent and money spent RM=0.1,RT0.9, then the following will be followedProceeding from source node arc to target node qiFor the sake of illustration, the optimal path is planned by considering only the case of reaching one target node. Here, arc represents the source node qsDst is the destination node qi。
First, an array d [2 ] having a length of 4 is defined]Element d [ i-1 ] of]Represents the shortest distance from the source point arc to the node p (i). Array f [2 ] with a defined length of 4]. Its element f [ i-1 ]]If 1, it means that the shortest path from the source point arc to P (i) has been found, its element f [ i-1 ]]If 0, it means that the shortest path from the source point arc to P (i) has not been found. Defining an array p of length 5 for each node P (i)i[]It stores the node numbers that are passed through in sequence from the source point to p (i), i.e. the shortest path.
And calculating the weights of the nodes and edges adjacent to the source node. Considering arc to P (1) first, the required road cost for this journey is W in terms of monetary costM(arc,1)=Mp(arc,1)*d(arc,1)3 x 50 x 150 x. The monetary cost at P (1) is WM(1)=[(d(arc,P(1))*Fmax)/L]*Mp(1) 50. Considering arc to P (1), the time required for this stretch is W in terms of time spentT(arc,1)=d(arc,P(1))V (arc,1) ═ 1.67. The time spent at P (1) is WT(1)=[(d(arc,P(1))*Fmax)/L]/Vp(1) + T (1) ═ 2. Thus, the total weight W of edge arcP (1)all(arc,1)=RM*WM(arc,1)+RT*WT(arc,1) — 16.5, total weight W of point P (1)all(1)=RM*WM(1)+RT*WT(1) 6.8. The total weight of the path from arc directly to P (1) is then Wall(arc,1)+Wall(1)=16.5+6.8=23.3。
Then consider arc to P (3), the required road cost for this journey is W in terms of monetary costM(arc,3)=Mp(arc,3)*d(arc,3)40 x 0.4 x 16. The monetary cost at P (3) is WM(3)=[(d(arc,P(3))*Fmax)/L]*Mp(3) 32. Considering arc to P (3), the time required for this trip in terms of time costIs WT(arc,3)=d(arc,P(3))V (arc,3) ═ 2. The time spent at P (3) is WT(3)=[(d(arc,P(3))*Fmax)/L]/Vp(3) + T (3) ═ 1. Thus, the total weight W of edge arcP (3)all(arc,3)=RM*WM(arc,3)+RT*WT(arc,3) ═ 3.4, total weight W of point P (3)all(3)=RM*WM(3)+RT*WT(3) 4.1. The total weight of the path from arc directly to P (3) is then Wall(arc,3)+Wall(3)=3.4+4.1=7.5。
Updating each array: d 0]And d 2]Updated to 23.3 and 7.5, respectively, and the other elements are ∞. Due to d [0 ]]>d[2]Then P (3) is the current closest point to the source point, updating the array f [2 ]]1, the other elements are 0, and the array p is updated3[0]=0,p3[1]=3,p1[0]=0,p1[1]The first round of finding the minimum path is now completed by 1.
Taking P (3) as an intermediate path, and continuing the next round of operation. Considering P (3) to P (1), the required road toll for this route is W in terms of monetary costM(3,1)=Mp(3,1)*d(p(3),P(1))0.6 × 40 × 24. The monetary cost at P (1) is WM(1)=(d(p(3),P(1))*Fmax)/L*Mp(1) 40. Considering P (3) to P (1), the time required for this route in terms of time consumption is WT(3,1)=d(p(3),P(1))And V (3,1) is 4. The time spent at P (1) is WT(1)=[(d(p(3),P(1))*Fmax)/L]/Vp(1) + T (1) ═ 1.8. Thus, the total weight W of the edge P (3) P (1)all(3,1)=RM*WM(3,1)+RT*WT(3,1) ═ 6, total weight W of point P (1)all(1)=RM*WM(1)+RT*WT(1) 5.6. The total weight of the path from P (3) directly to P (1) is then Wall(3,1)+Wall(1)=6+5.6=11.6。
Considering P (3) to P (2), the required road toll for this route is W in terms of monetary costM(3,2)=Mp(3,2)*d(p(3),P(2))=1*9090. The monetary cost at P (2) is WM(2)=(d(p(3),P(2))*Fmax)/L*Mp(2) 108. Considering P (3) to P (2), the time required for this route in terms of time consumption is WT(3,2)=d(p(3),P(2))V (3,2) ═ 4.5. The time spent at P (2) is WT(2)=[(d(p(3),P(2))*Fmax)/L]/Vp(2) + T (2) ═ 2.8. Thus, the total weight W of the edge P (3) P (2)all(3,2)=RM*WM(3,2)+RT*WT(3,2) 13, the total weight W of the point P (2)all(2)=RM*WM(2)+RT*WT(2) 13.3. The total weight of the path from P (3) directly to P (2) is then Wall(3,2)+Wall(2)=13+13.3=26.3。
Updating each array: d 0]=23.3>d[2]+Wall(3,1)+Wall(1) So d [0 ] is updated as 19.1]Update d [1 ] 19.1]=d[2]+Wall(3,2)+Wall(2) 33.8, the other elements are unchanged. Due to d [0 ]]<d[1]Then P (1) is the current closest point to the source point, and the array f [0 ] is updated]Other elements are 0. Because d [0 ]]With updates, so the array p is updated1[]=p3[]And p is1[2]1. At this time p1[]=[0,3,1,0,0]. The second round of finding the minimum path is now complete.
Following the above procedure, up to f 3]When p is equal to 14[]=[0,3,1,2,4]The optimal paths are arc, P (3), P (1), P (2), qiAs shown in fig. 4. Its path total weight value is stored in array d [3 ]]In (1).
It will be appreciated by those of ordinary skill in the art that the embodiments described herein are intended to assist the reader in understanding the principles of the invention and are to be construed as being without limitation to such specifically recited embodiments and examples. Various modifications and alterations to this invention will become apparent to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the scope of the claims of the present invention.
Claims (7)
1. An unmanned equipment path planning method considering target trend and energy supply is characterized by comprising the following steps:
s1, establishing an energy supply node set according to the target trend sequence window, and establishing a first topological graph according to the energy supply node set; the step S1 includes the following sub-steps:
s11, establishing an energy supply node set according to the target trend sequence window;
s12, if the distance between the two energy supply nodes in the step S11 set is smaller than the full energy movement distance of the unmanned equipment, a connecting line between the two energy supply nodes is used as a directed edge to be added into the topological graph, the weight of the directed edge is the distance between the two energy supply nodes, and the final first topological graph is obtained by traversing the pairwise combination of all the energy supply nodes;
s2, expanding the source nodes and all the target nodes in the target trend sequence window into the first topological graph to obtain a second topological graph; step S2 includes:
s21, adding the source node to the first topological graph, specifically: if the distance from the source node to a certain energy source node is smaller than the maximum distance that the unmanned equipment can travel in the residual energy of the source node, adding a connecting line between the source node and the energy source supply node into the current topological graph as a directed edge, wherein the weight of the directed edge is the distance between the source node and the energy source supply node;
s22, adding the target node in the trend window into the first topological graph, specifically: if the distance from a certain energy node to a target node is smaller than the difference between the full energy movement distance of the unmanned equipment and the distance from the target node to the nearest energy supply node, adding a connecting line between the energy supply node and the target node into the current topological graph as a directed edge, wherein the weight of the directed edge is the distance between the energy supply node and the target node;
s23, obtaining a second topological graph according to the step S21 and the step S22;
s3, updating the weight of the second topological graph;
s4, calculating the optimal path from the source node to the current target node by adopting a trend reverse push algorithm according to the topological graph updated by the weight in the step S3;
s5, advancing to the current target node, and ending if the current target node is the global final target node; otherwise, taking the current target node as a new source node, and calculating the optimal path from the source node to the next target node.
2. The method for unmanned aerial vehicle path planning considering target trend and energy replenishment according to claim 1, wherein the weight values of step S3 are updated in consideration of money cost:
the method comprises the steps of updating a money cost weight between two energy source nodes according to a distance cost unit price between the two energy source supplement nodes, updating a money cost weight between a source node and an adjacent energy source supplement node according to the distance cost unit price between the source node and the adjacent energy source supplement node, updating a money cost weight between a target node and the adjacent energy source supplement node according to the distance cost unit price between the target node and the adjacent energy source supplement node, and updating the money cost weight of the energy source supplement node according to the maximum capacity of equipment energy corresponding to unmanned equipment, the energy source unit price corresponding to the energy source supplement node and energy required to be supplemented at the energy source supplement node.
3. The method for planning the path of the unmanned aerial vehicle considering the trend of the target and the energy supply as claimed in claim 1, wherein the weight values of step S3 are updated in consideration of time consumption: the time weight between the two energy source nodes is updated according to the passing time of the distance between the two energy source supplement nodes, the time weight between the source node and the adjacent energy source supplement node is updated according to the passing time of the distance between the source node and the adjacent energy source supplement node, the time weight between the target node and the adjacent energy source supplement node is updated according to the passing time of the distance between the target node and the adjacent energy source supplement node, and the time weight of the energy source supplement node is updated according to the maximum energy capacity corresponding to the unmanned equipment, the energy supplement speed of the energy source supplement node and the energy needed to be supplemented at the energy source supplement node.
4. The method for planning the path of the unmanned aerial vehicle considering the trend of the target and the energy supply as claimed in claim 2 or 3, wherein the weight values in step S3 are updated by comprehensively considering the cost of money and the cost of time:
definition of RMDefining R as a weight coefficient for money costTCost a weight coefficient for time, and RM+RT=1;
According to the money cost weight, the time cost weight and R between the two energy supplement nodesM、RTUpdating the weight between the two energy nodes according to the money cost weight, the time cost weight and R between the source node and the adjacent energy supplement nodeM、RTUpdating the weight between the source node and the adjacent energy supplement node according to the money cost weight, the time cost weight, R between the target node and the adjacent energy supplement nodeM、RTUpdating the weight between the target node and the adjacent energy supplement node according to the money cost weight, the time cost weight and R of the energy supplement nodeM、RTAnd updating the weight of the energy supplement node.
5. The unmanned aerial vehicle path planning method considering target trend and energy replenishment as claimed in claim 1, wherein the trend back-stepping algorithm of step S4 calculates the optimal path to the next target node, comprising the following sub-steps:
a1, calculating the energy needed to be reserved from the current target node to the next hop in the target moving sequence window;
a2, calculating the optimal path from the previous target node to the current target node by adopting Dijkstra algorithm according to the energy required to be reserved by the current target node and the second topological graph of the step S3;
or according to the energy required to be reserved by the current target node and the second topological graph of the step S3, calculating the optimal path from the source node to the current target node by adopting a Dijkstra algorithm.
6. The method for unmanned aerial vehicle path planning considering goal trend and energy supply according to claim 5, wherein the step A1 is specifically as follows:
if the current target node is the last target node in the target trend sequence window, taking the energy supply node closest to the target node as the next hop of the current target node, and calculating to obtain the energy required to be reserved from the current target node to the next hop;
otherwise, the next hop of the current target node is obtained according to the optimal path from the target node to the next target node, and the energy required to be reserved from the current target node to the next hop is calculated and obtained.
7. The unmanned aerial vehicle path planning method considering target trend and energy replenishment as claimed in claim 6, wherein the step S5 of calculating the optimal path from the source node to the next target node with the current target node as the new source node comprises the following sub-steps:
b1, taking the current target node as a new source node, and updating the target moving sequence window;
b2, judging whether the current first topological graph covers the energy supply node set corresponding to the updated target trend sequence window, if so, returning to the step S2, and updating the current second topological graph; otherwise, returning to step S1, updating the current first topological graph according to the updated target trend sequence window.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910513985.0A CN110146103B (en) | 2019-06-14 | 2019-06-14 | Unmanned equipment path planning method considering target trend and energy supply |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910513985.0A CN110146103B (en) | 2019-06-14 | 2019-06-14 | Unmanned equipment path planning method considering target trend and energy supply |
Publications (2)
Publication Number | Publication Date |
---|---|
CN110146103A CN110146103A (en) | 2019-08-20 |
CN110146103B true CN110146103B (en) | 2021-03-02 |
Family
ID=67591447
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910513985.0A Expired - Fee Related CN110146103B (en) | 2019-06-14 | 2019-06-14 | Unmanned equipment path planning method considering target trend and energy supply |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110146103B (en) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111314119B (en) * | 2020-01-19 | 2023-06-27 | 合肥工业大学 | Method and device for quickly reconstructing unmanned platform information sensing network in uncertain environment |
CN111489549B (en) * | 2020-03-11 | 2021-08-27 | 北京交通大学 | Travel vehicle path selection method based on historical behavior portrait |
CN112668793B (en) * | 2020-12-31 | 2022-09-13 | 广州极飞科技股份有限公司 | Supply point location determining method, operation planning method and related device |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105574169A (en) * | 2015-12-18 | 2016-05-11 | 河南思维自动化设备股份有限公司 | Method for storing topological graph of railway bureau lines |
CN107144287A (en) * | 2017-04-28 | 2017-09-08 | 深圳充电网科技有限公司 | A kind of trip planning method and device of electric car |
CN108983789A (en) * | 2018-08-20 | 2018-12-11 | 广东华中科技大学工业技术研究院 | A kind of path planning of unmanned boat and lay dispatching method |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4975075B2 (en) * | 2009-09-30 | 2012-07-11 | クラリオン株式会社 | Navigation device and route calculation method |
US9448083B2 (en) * | 2014-02-25 | 2016-09-20 | Ford Global Technologies, Llc | Method and apparatus for providing a navigation route with recommended charging |
CN105841709B (en) * | 2016-03-22 | 2019-01-18 | 吉林大学 | A kind of running car paths planning method |
CN107323300B (en) * | 2017-07-26 | 2019-05-24 | 河海大学 | A kind of-electric car reservation charging method of vehicle conjunctive model of being stood based on road- |
CN108519737B (en) * | 2018-04-11 | 2020-06-09 | 电子科技大学 | Unmanned equipment path planning method considering energy supply |
CN108981732B (en) * | 2018-04-26 | 2021-05-18 | 杭州中恒云能源互联网技术有限公司 | Charging navigation method of electric vehicle charging navigation system |
-
2019
- 2019-06-14 CN CN201910513985.0A patent/CN110146103B/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105574169A (en) * | 2015-12-18 | 2016-05-11 | 河南思维自动化设备股份有限公司 | Method for storing topological graph of railway bureau lines |
CN107144287A (en) * | 2017-04-28 | 2017-09-08 | 深圳充电网科技有限公司 | A kind of trip planning method and device of electric car |
CN108983789A (en) * | 2018-08-20 | 2018-12-11 | 广东华中科技大学工业技术研究院 | A kind of path planning of unmanned boat and lay dispatching method |
Also Published As
Publication number | Publication date |
---|---|
CN110146103A (en) | 2019-08-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110146103B (en) | Unmanned equipment path planning method considering target trend and energy supply | |
Liu et al. | Novel best path selection approach based on hybrid improved A* algorithm and reinforcement learning | |
CN111785045B (en) | Distributed traffic signal lamp combined control method based on actor-critic algorithm | |
WO2021248607A1 (en) | Deep reinforcement learning-based taxi dispatching method and system | |
CN107203190A (en) | A kind of inertial navigation AGV dispatching methods and system based on pahtfinder hard | |
KR102511004B1 (en) | Apparatus and method for controlling driving of multi-robot | |
CN108519737B (en) | Unmanned equipment path planning method considering energy supply | |
JP6760501B2 (en) | Area evaluation system, method and program | |
EP4141599A1 (en) | Multi-robot route planning | |
CN109115220B (en) | Method for parking lot system path planning | |
CN105806360A (en) | Navigation aid method based on meteorological conditions | |
CN114415690A (en) | Multi-agent path planning method, navigation server and readable storage medium | |
CN114237259A (en) | Multi-agent path planning method based on floating resources, navigation server and readable storage medium | |
Zhang et al. | APFD: an effective approach to taxi route recommendation with mobile trajectory big data | |
KR20220095452A (en) | Computer system of providing service consumption plan for efficient service migration in mobile edge computing environments, and method thereof | |
Liu et al. | Real-time traffic impedance and priority based cooperative path planning mechanism for SOC-ITS: Efficiency and equilibrium | |
Mantha et al. | Task allocation and route planning for robotic service networks with multiple depots in indoor environments | |
KR20230082753A (en) | Server, method and computer program for providing route information for logistics | |
Sun et al. | Transit assignment model incorporating bus dwell time | |
Dai et al. | Distributed traffic control for reduced fuel consumption and travel time in transportation networks | |
Hamada et al. | Smartpark: A Location-Independent Smart Park and Transfer System | |
WO2022242966A1 (en) | Robot fleet management method and system using a graph neural network | |
WO2022124004A1 (en) | Path planning device | |
Giannakopoulou et al. | Dynamic timetable information in smart cities | |
Jiang et al. | Optimisation of Multi-Type Logistics UAV Scheduling under High Demand |
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 | ||
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20210302 |