Method, system and device for fleet maneuvering path planning based on path weight

By improving the Digestra algorithm and air evacuation reconnaissance analysis, the problem of ground fleets being reconnaissanced by satellites during the mission was solved, and efficient evasion of fleet paths was achieved to ensure the smooth completion of the mission.

CN115326097BActive Publication Date: 2024-11-26NAT UNIV OF DEFENSE TECH
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202211101956.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-09-09
Publication Date
2024-11-26
Estimated Expiration
2042-09-09

AI Technical Summary

Technical Problem

When the ground convoy is detected by satellites during the mission, it is difficult to effectively avoid multi-satellite reconnaissance, which affects the smooth completion of the mission.

Method used

Using the fleet maneuver path planning method based on path weight, the improved Digestella algorithm calculates the shortest path from the starting point to the destination under the constraints of the necessary node conditions, and conducts air evacuation reconnaissance analysis to ensure that the fleet is not reconnaissed by satellites. , output this path as the fleet maneuver path.

Benefits of technology

Quickly plan the maneuver path of the fleet so that the fleet can efficiently avoid multi-satellite reconnaissance, ensure the smooth completion of the mission, and meet the dual requirements of multi-satellite reconnaissance constraints and required node constraints.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115326097B_ABST
    Figure CN115326097B_ABST
Patent Text Reader

Abstract

The present application relates to a method, system and device for planning a mobile route for a motorcade based on path weights, the method comprising: obtaining traffic road network data, road network weight matrix, satellite sub-satellite point position and motorcade travel speed in the maneuvering area; using the improved Dijkstra algorithm to calculate the shortest path from the starting point to the destination under the constraint of the necessary node condition according to the traffic road network data, road network weight matrix and motorcade travel speed; in the improved Dijkstra algorithm, the road network weights of the paths that are not related to the necessary nodes are all superimposed with a set constant value, and the set constant value is used to ensure that the shortest path satisfies the constraint of the necessary node condition; performing air avoidance reconnaissance analysis on the shortest path according to the sub-satellite point position to determine whether the motorcade is detected by the satellite on the shortest path; if the motorcade is not detected by the satellite on the shortest path, the shortest path is output as the motorcade maneuvering path. The motorcade maneuvering path can be quickly planned and the task can be successfully completed by efficiently avoiding multi-satellite reconnaissance.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field of path planning, and relates to a method, system and device for planning a mobile path for a fleet based on path weights. Background Art

[0002] Among the various factors that affect the success of a mission, the confidentiality of certain missions plays an extremely important role. As a modern high-threat reconnaissance method, satellite reconnaissance plays an important role and is also one of the main reconnaissance methods that need to be dealt with. In contrast, the mobility of ground convoys is far behind that of satellites. If they are detected during training, it means the loss of confidentiality, which greatly affects the smooth progress of the mission. In actual operations, if the convoy is detected, it is very likely to directly lead to the failure of the mission. Therefore, it is extremely important to efficiently avoid multi-satellite reconnaissance and successfully complete the mission. Summary of the invention

[0003] In response to the above problems, the present invention proposes a convoy maneuvering path planning method based on path weight, a convoy maneuvering path planning system based on path weight, and a computer device, which can quickly plan a convoy maneuvering path so that the convoy can efficiently avoid multi-satellite reconnaissance and successfully complete the mission when maneuvering along the maneuvering path.

[0004] In order to achieve the above objectives, the embodiments of the present invention adopt the following technical solutions:

[0005] On the one hand, a method for planning a mobile path for a fleet based on path weight is provided, comprising:

[0006] Obtain traffic road network data, road network weight matrix, satellite sub-satellite position and convoy travel speed in the maneuvering area;

[0007] According to the traffic network data, the network weight matrix and the speed of the fleet, the improved Dijkstra algorithm is used to calculate the shortest path from the starting point to the destination under the constraint of the necessary node condition; in the improved Dijkstra algorithm, the network weights of the paths that are not related to the necessary nodes are superimposed with a set constant value, and the set constant value is used to ensure that the shortest path meets the constraint of the necessary node condition;

[0008] Perform air avoidance reconnaissance analysis on the shortest path based on the sub-satellite point position to determine whether the convoy is detected by the satellite on the shortest path;

[0009] If the convoy is not detected by the satellite on the shortest path, the shortest path is output as the convoy's maneuvering path.

[0010] On the other hand, a fleet maneuvering path planning system based on path weight is also provided, including:

[0011] A data acquisition module is used to obtain the traffic road network data of the maneuvering area, the road network weight matrix, the satellite's sub-satellite point position and the convoy's travel speed;

[0012] The path calculation module is used to calculate the shortest path from the starting point to the destination under the constraint of the necessary node condition by using the improved Dijkstra algorithm according to the traffic network data, the network weight matrix and the traveling speed of the fleet; in the improved Dijkstra algorithm, the network weights of the paths that are not related to the necessary nodes are all superimposed with a set constant value, and the set constant value is used to ensure that the shortest path meets the constraint of the necessary node condition;

[0013] The reconnaissance analysis module is used to perform air avoidance reconnaissance analysis on the shortest path according to the sub-satellite point position to determine whether the convoy is detected by the satellite on the shortest path;

[0014] The path output module is used to output the shortest path as the convoy's maneuvering path when the convoy is not detected by the satellite on the shortest path.

[0015] On the other hand, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the above-mentioned method for maneuvering path planning of a fleet based on path weights when executing the computer program.

[0016] On the other hand, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps of the above-mentioned fleet maneuvering path planning method based on path weights are implemented.

[0017] One of the above technical solutions has the following advantages and beneficial effects:

[0018] The above-mentioned fleet maneuvering path planning method, system and equipment based on path weight first obtain the known data such as the traffic road network data, road network weight matrix, satellite sub-satellite point position and fleet travel speed of the maneuvering area, and then use the improved Dijkstra algorithm to calculate the shortest path from the starting point to the destination under the constraint of the necessary node condition based on the traffic road network data, road network weight matrix and fleet travel speed, and then perform air avoidance reconnaissance analysis on the shortest path based on the sub-satellite point position to determine whether the fleet will be detected by the satellite when traveling on the current shortest path. If it will not be detected by the satellite, then the shortest path is output as the fleet maneuvering path. The path meets the dual constraints of multi-satellite reconnaissance constraints and necessary node constraints, so as to achieve the purpose of quickly planning the fleet maneuvering path, and enabling the fleet to efficiently avoid multi-satellite reconnaissance and successfully complete the task when maneuvering along the maneuvering path. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the conventional technology, the drawings required for use in the embodiments or the conventional technology descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0020] Figure 1 A schematic diagram of a flow chart of a method for planning a mobile path for a fleet based on path weights in one embodiment;

[0021] Figure 2 Schematic diagram of three possible position relationships of a convoy relative to a satellite during its movement, where (a) is the vehicle-satellite position relationship that will be detected by the satellite during the convoy's movement, (b) is the vehicle-satellite position relationship that will not be detected by the satellite during the convoy's movement, and (c) is the vehicle-satellite position relationship that will be detected by the satellite during the convoy's movement;

[0022] Figure 3 A schematic flow chart of a method for planning a mobile path for a fleet based on path weights in another embodiment;

[0023] Figure 4 A schematic diagram of a process for formulating a temporary parking strategy in one embodiment;

[0024] Figure 5 is a schematic diagram of a traffic network in one embodiment;

[0025] Figure 6 The module structure diagram of a fleet maneuvering path planning system based on path weight in one embodiment. DETAILED DESCRIPTION

[0026] In order to make the purpose, technical scheme and advantages of the present application clearer, the present application is further described in detail below in conjunction with the accompanying drawings and examples. It should be understood that the specific embodiments described herein are only used to explain the present application and are not intended to limit the present application. Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art of the present application. The terms used herein in the specification of the present application are only for the purpose of describing specific embodiments and are not intended to limit the present application.

[0027] It should be noted that the reference to "embodiment" in this article means that the specific features, structures or characteristics described in conjunction with the embodiment may be included in at least one embodiment of the present invention. The presentation of this phrase at various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It will be appreciated by those skilled in the art that the embodiments described herein may be combined with other embodiments. The term "and / or" used in the specification of the present invention and the appended claims refers to any combination of one or more of the associated listed items and all possible combinations, and includes these combinations.

[0028] The following will describe the implementation of the present invention in detail with reference to the accompanying drawings in the embodiment diagram of the present invention.

[0029] See also Figure 1 In one embodiment, the present application provides a method for planning a mobile path for a fleet based on path weights, comprising the following processing steps S12 to S18:

[0030] S12, obtaining the traffic road network data, road network weight matrix, satellite sub-satellite position and convoy travel speed of the maneuvering area.

[0031] It can be understood that the maneuvering area refers to a geographical area that at least includes the starting point and destination of the fleet's maneuver, as well as all necessary nodes (intermediate locations) between the two places. Traffic network data, satellite sub-satellite position, initial network weight matrix and other data are all known data and can be acquired in advance, such as but not limited to obtaining through access to the relevant data system, manual uploading or database retrieval. For ease of description and understanding, it can be, but not limited to, for example: the traffic network is represented by an undirected graph G = (S, E), S represents a collection of cities, E represents a collection of roads between cities, and city s i The geographical location of (i=1, 2, ..., N) is expressed in longitude and latitude, and N is the number of cities involved. For the convenience of calculation, the actual road between the two cities is simplified to a straight line segment, and the convoy moves at a constant speed V on the road. i ,s j ) is set as the road network weight w of this section of road. ij , the road network weights of each section of road together constitute the road network weight matrix W of the convoy NM , without avoiding satellite reconnaissance, the initial weight of the road network can be shown as formula (1):

[0032]

[0033] Among them, L(s i ,s j ) represents two cities (si ,s j ) between the length of the road, e ij Indicates cities i With s j The road between Φ represents an empty set. The speed of the convoy can be set to a uniform speed or a non-uniform speed according to the mission requirements. The specific speed can be preset. If the convoy is likely to be detected by satellite during its movement, it is necessary to adopt a temporary parking and waiting strategy on the road or in the city to wait for the satellite reconnaissance to end before continuing to move. The increased time due to parking and waiting should be equivalent to the increased value of the road network weight. The increased road network weight can be expressed as:

[0034]

[0035] Among them, w ij 0 is the road network weight in the initial state, Δw ij is the added value of the road network weight. For the sub-satellite position of the satellite, in the actual maneuvering area, there may be multiple satellites covering the area. For ease of understanding, it can be assumed that there are K satellites simultaneously conducting reconnaissance on the movement of the convoy. The sub-satellite position of the satellite during the convoy's travel period can be directly calculated from the satellite's orbital root parameters:

[0036]

[0037] in, and They represent the longitude and latitude of the sub-satellite position of the kth satellite at time t, respectively. 0 represents the time when the team departs from the starting point, t max Indicates the maximum estimated time it takes for the convoy to reach its destination. During the convoy's journey from the starting point to the destination, the satellite conducts reconnaissance according to the predetermined trajectory, and the area of ​​its real-time reconnaissance is set to be a circle with the sub-satellite position as the center and a radius of R. k circular area.

[0038] The three conditions that must be met during the movement of the convoy are: 1. It must pass through the source node (i.e. the starting point), the sink node (i.e. the destination) and all the necessary nodes; 2. It must reach the destination as quickly as possible; 3. It must avoid satellite reconnaissance. During the movement of the convoy, the next stop can only be determined after arriving at a city, and U-turns on the road are not allowed. At the same time, the known predetermined cities (nodes) that must be passed must be included in the movement strategy. P can be used C (t) Record the position of the team at any time t, in the form of longitude and latitude.

[0039] S14, based on the traffic network data, the network weight matrix and the speed of the fleet, the improved Dijkstra algorithm is used to calculate the shortest path from the starting point to the destination under the constraints of the necessary node conditions; in the improved Dijkstra algorithm, the network weights of the paths that are not related to the necessary nodes are superimposed with a set constant value, and the set constant value is used to ensure that the shortest path satisfies the necessary node condition constraints.

[0040] It can be understood that the Dijkstra algorithm, also known as the Dijkstra algorithm, is a traditional shortest path algorithm that can find the global optimal solution, but its characteristics determine that it can only solve the shortest path between fixed node pairs, and cannot solve the shortest path problem with added constraints. Therefore, the present application is based on the Dijkstra algorithm, and adopts a method of unifying the road network weights of other paths except the paths adjacent to the necessary nodes and adding a set constant value, that is, increasing the road network weights of paths that are not related to the necessary nodes, so that the necessary nodes can be selected when the scheme is selected, thereby finally solving a near-optimal solution that meets the necessary node condition constraints. The necessary node condition constraint refers to the constraint that the selected shortest path must pass through all necessary nodes.

[0041] In this case, the problem of how to determine the set constant value is involved. The selection of the set constant value should make the path selection achieve the purpose of being able to select the necessary nodes. Therefore, the set constant value can be set to be much larger than the road network weight of a single reachable path, or the set constant value can be set to the sum of the road network weights of all reachable paths. The Dijkstra algorithm based on the road network weight after adding the set constant value becomes the aforementioned improved Dijkstra algorithm.

[0042] In the initial planning, the improved Dijkstra algorithm can be initialized first, such as establishing a traffic network G = (S, E) and setting the network weight matrix W = W 0 . Let the current position of the team be the starting point s start , the destination is s end , the initial road network weight in the road network weight matrix is ​​w ij =w ij 0 The speed of the convoy on the road is V. After obtaining the convoy maneuvering path plan (i.e., the shortest path from the starting point to the destination under the constraint of a necessary node condition) using the improved Dijkstra algorithm, the time required for the convoy to maneuver according to the convoy maneuvering path plan can be directly calculated based on the initial road network weight.

[0043] S16, performing air avoidance reconnaissance analysis on the shortest path according to the sub-satellite point position to determine whether the convoy is detected by the satellite on the shortest path.

[0044] It can be understood that after the initial shortest path is generated, the arrival time of the convoy at each node and the real-time position of the convoy when traveling on the shortest path can be synchronously known. Therefore, the movement of the convoy on the shortest path can be directly analyzed by air avoidance reconnaissance based on the relative position changes between the convoy position and the reconnaissance range and the sub-satellite point position of the satellite on the shortest path, so as to determine whether the convoy will be detected by the satellite during its travel on the shortest path.

[0045] S18, if the convoy is not detected by the satellite on the shortest path, the shortest path is output as the convoy maneuvering path.

[0046] It can be understood that the first shortest path from the starting point to the destination under the constraint of the necessary node conditions calculated by the improved Dijkstra algorithm, after air avoidance reconnaissance analysis, determines that the convoy will not be detected by satellite when traveling on the shortest path, then the shortest path can be output as the planned convoy maneuvering path.

[0047] The above-mentioned fleet maneuvering path planning method based on path weight first obtains the known data such as the traffic road network data, road network weight matrix, satellite sub-satellite point position and fleet travel speed of the maneuvering area, and then uses the improved Dijkstra algorithm to calculate the shortest path from the starting point to the destination under the constraint of the necessary node condition according to the traffic road network data, road network weight matrix and fleet travel speed, and then performs air avoidance reconnaissance analysis on the shortest path according to the sub-satellite point position to determine whether the fleet will be detected by the satellite when traveling on the current shortest path. If it will not be detected by the satellite, then the shortest path is output as the fleet maneuvering path. The path meets the dual constraints of multi-satellite reconnaissance constraints and necessary node constraints, so as to achieve the purpose of quickly planning the fleet maneuvering path, and enabling the fleet to efficiently avoid multi-satellite reconnaissance and successfully complete the task when maneuvering along the maneuvering path.

[0048] In one embodiment, further, regarding the above step S16, the following processing steps may be specifically included:

[0049] Determine the arrival time of the convoy at each node on the shortest path based on the shortest path;

[0050] According to the position coordinates of each node on the shortest path, the speed of the convoy and the arrival time, the position of the convoy at any time during the convoy travel period between each adjacent node on the shortest path is calculated;

[0051] According to the location of the convoy and the sub-satellite point at any time, the convoy is checked for air avoidance during the travel period between adjacent nodes on the shortest path according to the set check formula to determine whether the convoy is detected by the satellite on the shortest path; the set check formula is:

[0052] ||P S(k) (t)-P C (t)||≤R k ,t∈(t s ,t q ) (4)

[0053] Among them, t s Indicates that the team arrives at the current node s s The moment, t q Indicates that the convoy arrives at the next city s q The moment, P C (t) means (t s , t q ) is the position of the team at any time during the period, P S (k) (t) means (t s , t q ) during the period, R k Indicates the radius of the satellite reconnaissance area.

[0054] It can be understood that for any two adjacent nodes on the currently calculated shortest path, the aforementioned processing steps can be used to analyze and determine whether the convoy will be detected by the satellite when traveling on the road between the two nodes. s The time is t s , arrive at the next city s q The time is t q , based on the existing information such as the coordinates of the two cities, the arrival time and the speed of the convoy, we can directly calculate (t s , t q ) The position of the team at any time during the period P C (t), which is similar to the calculation and description of the sub-satellite point position.

[0055] Traverse (t s , t q ) time period, and use formula (4) to check whether each satellite can detect the convoy at each moment. If the convoy can be detected by the satellite at a certain moment, such as Figure 2As shown, (a) is the position relationship of the car and satellite that will be detected by the satellite during the movement of the convoy, (b) is the position relationship of the car and satellite that will not be detected by the satellite during the movement of the convoy, and (c) is the position relationship of the car and satellite that will be detected by the satellite during the movement of the convoy; the black square represents the convoy, the line between the dots represents the road, the circle represents the real-time detection range of the satellite, and the arrow line represents the direction of satellite movement. The waiting time of the convoy temporarily stopping to avoid detection is calculated, which is equivalent to the increase in the road network weight on the road, and the road network weight matrix is ​​updated accordingly. Otherwise, there is no need to perform subsequent processing steps, and the current shortest path can be output. The above steps can efficiently and accurately check the situation of the convoy being detected by the satellite during the movement on the current shortest path.

[0056] In one embodiment, Figure 3 As shown, the above-mentioned vehicle fleet maneuvering path planning method based on path weight may further include the following processing steps S19 to S23:

[0057] S19, if the convoy on the shortest path can be detected by the satellite, a temporary parking strategy for the convoy to avoid detection is determined based on the traffic network data, the network weight matrix, the sub-satellite point position and the convoy's travel speed; the temporary parking strategy includes the convoy's parking waiting position and waiting time;

[0058] S21, using the waiting time to update the road network weight matrix;

[0059] S23, based on the traffic network data, the convoy's travel speed and the updated network weight matrix, the improved Dijkstra algorithm is used to calculate the target shortest path from the starting point to the destination under the constraints of the necessary nodes.

[0060] It can be understood that for the shortest path currently calculated, the analysis determines that the convoy will be detected by satellite when traveling on the shortest path. Therefore, in order to enable the convoy to avoid satellite detection and maintain concealed mobility, a temporary parking strategy needs to be designed for the convoy. Since the convoy can only determine the next stop city after arriving at a city during the journey, and U-turns in the middle of the road are not allowed; at the same time, the known predetermined cities (nodes) that must be passed must be included in the travel strategy. Therefore, in the process of air avoidance reconnaissance analysis, temporary parking strategy formulation and shortest path replanning, other nodes before the current node of the convoy do not need to be taken into account, but only the current node needs to be analyzed and processed for other subsequent nodes on the path to each adjacent next node and the destination that can be reached.

[0061] Specifically, when the team is at t s At a time, the speed V is moving from city s s Along the road sq (e sq ∈E, 1<=q<=N) moves forward at a constant speed to the adjacent city sq In the process of analyzing the time t when the convoy is detected by the kth satellite for the i-th time z (also known as visible time), and based on the change in the position relationship between the convoy and the satellite, the convoy's parking position and waiting time are calculated. This explores the road segments in each reachable path based on the current node of the convoy. sq Temporary parking strategy on the road.

[0062] Further, regarding the above step S19, if Figure 4 As shown, the process may specifically include the following processing steps S191 to S195:

[0063] S191, determining the visible time when the convoy is detected by the satellite while the convoy is on its way from the current node to the next node;

[0064] S192, determining discrete projection points of the satellite on the reconnaissance envelope close to the current node side according to the sub-satellite point position of the satellite within a set period after the visible time and the satellite reconnaissance radius;

[0065] S193, fitting a reconnaissance envelope line close to the current node side according to the discrete projection points, determining the coordinates of the intersection of the reconnaissance envelope line and the road and recording the crossing time of the projection point crossing the road; the intersection coordinates are the parking waiting position of the convoy;

[0066] S194, recording the arrival time of the convoy when it arrives at the intersection coordinates when traveling along the shortest path;

[0067] S195, taking the difference between the crossing time and the arrival time as the waiting time for the convoy to stop and wait at the convoy parking and waiting position.

[0068] Specifically, to find a suitable parking spot, according to the visible time t z The next few seconds (t z , t z +η) the sub-satellite point P of the kth satellite S (k) (t) and the satellite’s reconnaissance radius, find the satellite near the current node (recorded as city s s ) Projection point P on the side reconnaissance envelope E (k) (t), and according to the discrete projection point P E (k) (t) The analytical expression of the reconnaissance envelope line l is fitted by the data of point (t), and then the coordinates P of the intersection point A between the reconnaissance envelope line l and the road section are solved. A As the coordinates of the parking waiting position, and record the projection point P E (k) (t) The time when the road is crossed E(i) . Record the time t when reaching point A according to the current driving strategy (that is, the shortest path currently available) C (i) ; The convoy needs to wait for the satellite to cross the road before it can continue to move forward. The waiting time is wait = t E (i) -t C (i) Among them, η is a small positive integer, and the specific size can be selected according to the actual application needs, as long as the accuracy of air avoidance reconnaissance analysis can be guaranteed.

[0069] Repeat the above analysis until the convoy reaches the next node (referred to as city s q ) represents the exploration of the path between the two adjacent nodes. sq All fleet parking waiting locations and waiting times.

[0070] Furthermore, regarding the above step S19, the following processing steps may also be included:

[0071] If the convoy's parking waiting position is detected by subsequent satellites, the process returns to step S191 to find a further convoy's parking waiting position until it retreats to the current node.

[0072] Specifically, if the current parking waiting position is found to be detected by other satellites, it is necessary to continue to check and analyze to find a waiting point further back until it retreats to the city s s , that is, in the city s In this way, the convoy can always effectively avoid aerial reconnaissance.

[0073] After determining the temporary parking strategy, the increased waiting time on each road section in each reachable path can be known. Further, regarding the above step S21, it can specifically include the following processing steps:

[0074] The road network weight matrix is ​​updated using the sum of all waiting times on the road from the current node to the next node.

[0075] Specifically, after analyzing and determining all the parking and waiting positions and their waiting times on the road between two adjacent nodes, these waiting times are added to the road network weights of the corresponding roads, and the road network weight matrix can be updated. sq The travel time on the road increases, and the road network weight is updated by formula (5).

[0076] w sq =w sq 0 +∑ i (t E (i)-t C (i) ) (5)

[0077] Among them, w sq Indicates the updated road e sq The road network weight, w sq 0 Indicates the road before update sq Repeat the above inspection, analysis and update process to update the original road network weight along s s The weight of the road after taking a temporary parking strategy on the way to each adjacent city. Finally, the improved Dijkstra algorithm is used to calculate the target shortest path from the starting point to the destination under the constraints of the necessary nodes based on the traffic network data, the team's speed and the updated network weight matrix, and replace the original shortest path that has been calculated as the team's maneuvering path.

[0078] In one embodiment, the above-mentioned fleet maneuvering path planning method based on path weight may also include the following processing steps: if the fleet on the target shortest path can still be detected by the satellite, then return to step S19 based on the current latest road network weight matrix, and iteratively update the target shortest path until the destination is reached.

[0079] It can be understood that after obtaining the new target shortest path, it can be similarly subjected to air avoidance reconnaissance analysis to determine whether the convoy will be detected by satellite when traveling on the target shortest path. If it is determined that it will not be detected, then the target shortest path is output as the result of planning. On the contrary, based on the current road network weight matrix, the temporary parking strategy is formulated, the road network weight matrix is ​​updated, and the new target shortest path is calculated again to achieve iterative update of the target shortest path. Since the current node relative to the next node is determined and the temporary parking strategy on the road between the two nodes is also determined in each iteration, each iteration is calculated based on the next node as the new current node. If the target shortest path that can be output is not found in the intermediate iteration, when it is iterated to find that the destination has been reached, the calculation ends and the final target shortest path (the path will not be detected by satellite) is output as the planning result.

[0080] In some embodiments, in order to more intuitively and comprehensively illustrate the above-mentioned fleet maneuvering path planning method based on path weights, the following is an example of a simulation test of the fleet maneuvering path planning method based on path weights. It should be noted that the simulation cases given in this specification are only for illustration and are not intended to limit the specific implementation cases of the present invention. Those skilled in the art can adopt the above-mentioned fleet maneuvering path planning method based on path weights under the guidance of the simulation cases provided by the present invention to realize fleet maneuvering path planning in different application scenarios.

[0081] To test the algorithm, suppose a convoy sets out at 4:16:39 a.m. on a certain day, and uses the local traffic map to make a traffic network diagram as follows: Figure 5 As shown, a reasonable travel strategy is given for concealed maneuvering from city 00 to the destination city 15 as quickly as possible, while passing through four necessary nodes: city 01, city 03, city 05 and city 09, and allowing a short stop along the way to avoid exposure. The longitude and latitude coordinates of the satellite sub-satellite points with inclinations of 53° and 50° are derived through existing satellite applications, starting from 4:16:39 am on the same day, and the time step is 1 second, and the longitude and latitude coordinates of each city on the traffic road network are searched online. The convoy's travel speed is recorded as 0.028 km / s. Experimental results analysis: The maneuvering strategy obtained by the method of this application is shown in Table 1. For the convenience of description, the departure time is taken as zero, and the arrival time and departure time are described in relative time. If the arrival time is equal to the departure time, it means that the convoy passes through the city but does not stop there.

[0082] Table 1

[0083]

[0084] The final planning scheme is 00→01→02→03→parking waiting point A→05→06→07→08→09→10→11→13→14→15; the waiting time at parking waiting point A is 507.85 seconds, and the total time of the scheme is 77858.06 seconds. The final results are summarized in Table 2:

[0085] Table 2

[0086]

[0087] The purpose of quickly planning the convoy's maneuvering path is achieved, and the convoy can efficiently avoid multi-satellite reconnaissance and successfully complete the mission while maneuvering along the maneuvering path.

[0088] It should be understood that although Figure 1 , Figure 3 and Figure 4 The steps in the flowchart are shown in sequence as indicated by the arrows, but the steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified in this document, there is no strict order restriction for the execution of the steps, and the steps can be executed in other orders. Figure 1 , Figure 3 and Figure 4 At least part of the steps may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily executed at the same time, but can be executed at different times. The execution order of these sub-steps or stages is not necessarily sequentially, but can be executed in turn or alternately with other steps or at least part of the sub-steps or stages of other steps.

[0089] See also Figure 6 In one embodiment, a vehicle fleet maneuvering path planning system 100 based on path weight is provided, comprising a data acquisition module 11, a path calculation module 13, a reconnaissance analysis module 15 and a path output module 17. The data acquisition module 11 is used to obtain the traffic network data, the network weight matrix, the sub-satellite point position of the satellite and the vehicle fleet's travel speed in the maneuvering area. The path calculation module 13 is used to calculate the shortest path from the starting point to the destination under the constraint of the necessary node condition by using the improved Dijkstra algorithm according to the traffic network data, the network weight matrix and the vehicle fleet's travel speed; in the improved Dijkstra algorithm, the network weights of the paths that are not related to the necessary nodes are all superimposed with a set constant value, and the set constant value is used to ensure that the shortest path satisfies the constraint of the necessary node condition. The reconnaissance analysis module 15 is used to perform air avoidance reconnaissance analysis on the shortest path according to the sub-satellite point position to determine whether the vehicle fleet is detected by the satellite on the shortest path. The path output module 17 is used to output the shortest path as the vehicle fleet maneuvering path when the vehicle fleet is not detected by the satellite on the shortest path.

[0090] The above-mentioned fleet maneuvering path planning system 100 based on path weight, through the collaboration of various modules, first obtains the known data such as the traffic road network data, road network weight matrix, satellite sub-satellite point position and fleet travel speed of the maneuvering area, and then uses the improved Dijkstra algorithm to calculate the shortest path from the starting point to the destination under the constraint of the necessary node condition based on the traffic road network data, road network weight matrix and fleet travel speed, and then performs air avoidance reconnaissance analysis on the shortest path based on the sub-satellite point position to determine whether the fleet will be detected by the satellite when traveling on the current shortest path. If it will not be detected by the satellite, then the shortest path is output as the fleet maneuvering path. The path meets the dual constraints of multi-satellite reconnaissance constraints and necessary node constraints, so as to achieve the purpose of quickly planning the fleet maneuvering path, and enabling the fleet to efficiently avoid multi-satellite reconnaissance and successfully complete the task when maneuvering along the maneuvering path.

[0091] In one embodiment, the above-mentioned fleet maneuvering path planning system 100 based on path weights also includes a parking strategy module and a parking strategy module. Among them, the parking strategy module is used to determine the temporary parking strategy of the fleet to avoid detection based on the traffic network data, the network weight matrix, the sub-satellite point position and the fleet's travel speed when the fleet is detected by the satellite on the shortest path; the temporary parking strategy includes the fleet's parking waiting position and waiting time. The weight update module is used to update the network weight matrix using the waiting time. The above-mentioned path calculation module 13 is also used to calculate the target shortest path from the starting point to the destination under the constraints of the necessary node conditions based on the traffic network data, the fleet's travel speed and the updated network weight matrix using the improved Dijkstra algorithm.

[0092] In one embodiment, the above-mentioned parking strategy module can be specifically used for: determining the visible time when the convoy is detected by the satellite on the road from the current node to the next node; determining the discrete projection points of the satellite on the reconnaissance envelope line close to the current node side according to the sub-satellite point position of the satellite within a set period after the visible time and the satellite reconnaissance radius; fitting the reconnaissance envelope straight line close to the current node side according to the discrete projection points, determining the intersection coordinates of the reconnaissance envelope straight line and the road and recording the crossing time when the projection point crosses the road; the intersection coordinates are the parking and waiting position of the convoy; recording the arrival time when the convoy arrives at the intersection coordinates when traveling along the shortest path; and taking the difference between the crossing time and the arrival time as the waiting time for the convoy to park and wait at the parking and waiting position of the convoy.

[0093] In one embodiment, the parking strategy module described above can also be used to find a later parking waiting position for the convoy when the parking waiting position for the convoy is detected by a subsequent satellite, until the convoy retreats to the current node.

[0094] In one embodiment, the above-mentioned weight updating module can be specifically used to update the road network weight matrix using the sum of all waiting times on the road from the current node to the next node.

[0095] In one embodiment, the reconnaissance analysis module 15 can also be used to iteratively update the target shortest path based on the latest road network weight matrix indication until the destination is reached when the convoy is still detected by the satellite on the target shortest path.

[0096] In one embodiment, the reconnaissance analysis module 15 can be specifically used to: determine the arrival time of the convoy at each node on the shortest path according to the shortest path; calculate the position of the convoy at any time during the convoy travel period between adjacent nodes on the shortest path according to the position coordinates of each node on the shortest path, the convoy's travel speed and the arrival time; perform an air avoidance check on the convoy travel period between adjacent nodes on the shortest path according to the set check formula according to the convoy's position at any time and the sub-satellite point position, and determine whether the convoy on the shortest path is detected by the satellite; the set check formula is:

[0097] ||P S (k) (t)-P C (t)||≤R k , t∈(t s , t q )

[0098] Among them, t s Indicates that the team arrives at the current node s s The moment, t q Indicates that the convoy arrives at the next city s q The moment, PC (t) means (t s , t q ) is the position of the team at any time during the period, P S (k) (t) means (t s , t q ) during the period, R k Indicates the radius of the satellite reconnaissance area.

[0099] Regarding the specific limitations of the fleet maneuvering path planning system 100 based on path weights, please refer to the corresponding limitations of the fleet maneuvering path planning method based on path weights above, which will not be repeated here. Each module in the above-mentioned fleet maneuvering path planning system 100 based on path weights can be implemented in whole or in part through software, hardware and a combination thereof. The above-mentioned modules can be embedded in or independent of a device with a specific data processing function in hardware form, or can be stored in the memory of the aforementioned device in software form, so that the processor can call and execute the operations corresponding to the above modules. The aforementioned device can be, but is not limited to, various types of portable or vehicle-mounted data analysis and processing devices already available in the art.

[0100] In one embodiment, a computer device is also provided, including a memory and a processor, the memory stores a computer program, and the processor implements the following processing steps when executing the computer program: obtaining traffic network data, a network weight matrix, a sub-satellite point position of a satellite, and a motorcade travel speed in a maneuvering area; using an improved Dijkstra algorithm to calculate the shortest path from a starting point to a destination under the constraint of a necessary node condition based on the traffic network data, the network weight matrix, and the motorcade travel speed; in the improved Dijkstra algorithm, the network weights of paths that are not related to the necessary nodes are all superimposed with a set constant value, and the set constant value is used to ensure that the shortest path satisfies the necessary node condition constraint; performing air avoidance reconnaissance analysis on the shortest path based on the sub-satellite point position to determine whether the motorcade is detected by the satellite on the shortest path; if the motorcade is not detected by the satellite on the shortest path, outputting the shortest path as the motorcade maneuvering path.

[0101] It can be understood that in addition to the memory and processor mentioned above, the above-mentioned computer device also includes other software and hardware components not listed in this specification. The specific components can be determined according to the model of the specific data processing device in different application scenarios, and this specification will not list them one by one in detail.

[0102] In one embodiment, when the processor executes the computer program, it can also implement the steps or sub-steps added in each embodiment of the above-mentioned fleet maneuvering path planning method based on path weight.

[0103] In one embodiment, a computer-readable storage medium is also provided, on which a computer program is stored. When the computer program is executed by a processor, the following processing steps are implemented: obtaining traffic network data, a network weight matrix, a sub-satellite point position of the satellite and a motorcade travel speed in the maneuvering area; using an improved Dijkstra algorithm to calculate the shortest path from the starting point to the destination under the constraint of the necessary node condition based on the traffic network data, the network weight matrix and the motorcade travel speed; in the improved Dijkstra algorithm, the network weights of the paths that are not related to the necessary nodes are all superimposed with a set constant value, and the set constant value is used to ensure that the shortest path satisfies the necessary node condition constraint; performing air avoidance reconnaissance analysis on the shortest path based on the sub-satellite point position to determine whether the motorcade is detected by the satellite on the shortest path; if the motorcade is not detected by the satellite on the shortest path, outputting the shortest path as the motorcade maneuvering path.

[0104] In one embodiment, when the computer program is executed by a processor, it can also implement the steps or sub-steps added in each embodiment of the above-mentioned fleet maneuvering path planning method based on path weight.

[0105] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus dynamic random access memory (Rambus DRAM, referred to as RDRAM) and interface dynamic random access memory (DRDRAM).

[0106] The technical features of the above embodiments can be combined arbitrarily. In order to make the description concise, all possible combinations of the technical features in the above embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification. The above embodiments only express several implementation methods of the present application, and their descriptions are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that for ordinary technicians in this field, without departing from the concept of the present application, several variations and improvements can be made, all of which belong to the protection scope of the present application. Therefore, the protection scope of the patent of this application shall be based on the attached claims.

Claims

1. A fleet maneuvering path planning method based on path weight, characterized in that: include: Obtain traffic road network data, road network weight matrix, satellite sub-satellite position and convoy travel speed in the maneuvering area; According to the traffic network data, the network weight matrix and the speed of the convoy, the shortest path from the starting point to the destination under the constraint of the necessary node condition is calculated using the improved Dijkstra algorithm; in the improved Dijkstra algorithm, the network weights of the paths that are not related to the necessary nodes are all superimposed with a set constant value, and the set constant value is used to ensure that the shortest path satisfies the constraint of the necessary node condition; Performing air avoidance reconnaissance analysis on the shortest path according to the sub-satellite point position to determine whether the convoy is detected by the satellite on the shortest path; If the convoy is not detected by the satellite on the shortest path, the shortest path is output as the convoy maneuvering path.

2. The method for planning a mobile path for a fleet based on path weight according to claim 1, characterized in that: The method further comprises: If the convoy on the shortest path is detected by the satellite, a temporary parking strategy for the convoy to avoid detection is determined according to the traffic network data, the network weight matrix, the sub-satellite point position and the convoy's travel speed; the temporary parking strategy includes the convoy's parking waiting position and waiting time; Using the waiting time to update the road network weight matrix; According to the traffic network data, the traveling speed of the fleet and the updated network weight matrix, the improved Dijkstra algorithm is used to calculate the target shortest path from the starting point to the destination under the constraints of the necessary nodes.

3. The method for planning a mobile path for a fleet based on path weights according to claim 2, characterized in that: The step of determining a temporary parking strategy for a convoy to avoid detection according to the traffic network data, the network weight matrix, the sub-satellite point position and the convoy travel speed comprises: Determine the visible time when the convoy is detected by the satellite while the convoy is on its way from the current node to the next node; Determine discrete projection points of the satellite on the reconnaissance envelope close to the current node side according to the sub-satellite point position of the satellite within a set period after the visible moment and the satellite reconnaissance radius; According to the discrete projection points, a reconnaissance envelope line close to the current node is fitted, the intersection coordinates of the reconnaissance envelope line and the road are determined, and the crossing time of the projection point crossing the road is recorded; the intersection coordinates are the parking waiting position of the convoy; Recording the arrival time of the convoy when it arrives at the intersection coordinates when traveling along the shortest path; The difference between the crossing time and the arrival time is used as the waiting time for the convoy to park and wait at the convoy parking and waiting position.

4. The method for planning a mobile path for a fleet based on path weights according to claim 3, characterized in that: The step of determining a temporary parking strategy for the convoy to avoid detection according to the traffic network data, the network weight matrix, the sub-satellite point position and the convoy travel speed also includes: If the parking and waiting position of the convoy is detected by subsequent satellites, return to the step of determining the visible time when the convoy is detected by satellites on the road from the current node to the next node, and find a later parking and waiting position for the convoy until it retreats to the current node.

5. The method for planning a mobile path for a fleet based on path weight according to claim 3, characterized in that: The step of updating the road network weight matrix using the waiting time comprises: The road network weight matrix is ​​updated using the sum of all waiting times on the road from the current node to the next node.

6. The method for planning a mobile path for a fleet based on path weights according to claim 2, characterized in that: The method further comprises: If the convoy on the target shortest path can still be detected by the satellite, then based on the current latest road network weight matrix, return to the step of determining the convoy's temporary parking strategy to avoid detection according to the traffic network data, the road network weight matrix, the sub-satellite point position and the convoy's travel speed, and iteratively update the target shortest path until the destination is reached.

7. The method for planning a mobile path for a fleet based on path weights according to claim 2, characterized in that: The step of performing air avoidance reconnaissance analysis on the shortest path according to the sub-satellite point position to determine whether the convoy on the shortest path is detected by the satellite comprises: Determine the arrival time of the convoy at each node on the shortest path according to the shortest path; According to the position coordinates of each node on the shortest path, the traveling speed of the convoy and the arrival time, respectively calculate the position of the convoy at any time during the traveling period of the convoy between each adjacent node on the shortest path; According to the position of the convoy at any time and the position of the sub-satellite point, the convoy travel period between each adjacent node on the shortest path is checked for air avoidance according to the set check formula to determine whether the convoy is detected by the satellite on the shortest path; the set check formula is: ||P s (k) (t)-P C (t)||≤R k ,t∈(t s ,t q ) Among them, t s Indicates that the team arrives at the current node s s The moment, t q Indicates that the convoy arrives at the next city s q The moment, P C (t) means (t s , t q ) is the position of the team at any time during the period, P S (k) (t) means (t s , t q ) during the period, R k Indicates the radius of the satellite reconnaissance area.

8. A fleet maneuvering path planning system based on path weight, characterized in that: include: A data acquisition module is used to obtain the traffic road network data of the maneuvering area, the road network weight matrix, the satellite's sub-satellite point position and the convoy's travel speed; A path calculation module, for calculating the shortest path from a starting point to a destination under the constraint of a necessary node condition by using an improved Dijkstra algorithm according to the traffic network data, the network weight matrix and the traveling speed of the convoy; in the improved Dijkstra algorithm, the network weights of paths that are not related to the necessary nodes are all superimposed with a set constant value, and the set constant value is used to ensure that the shortest path satisfies the necessary node condition constraint; A reconnaissance analysis module, configured to perform air avoidance reconnaissance analysis on the shortest path according to the sub-satellite point position, and determine whether the convoy is detected by the satellite on the shortest path; The path output module is used to output the shortest path as the motorcade maneuvering path when the motorcade is not detected by the satellite on the shortest path.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the fleet maneuvering path planning method based on path weights described in any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the fleet maneuvering path planning method based on path weights described in any one of claims 1 to 7 are implemented.