Route Planning Evaluation Method Adapted to Networked Unit Clusters
By building a cluster collaborative digital twin environment and dynamic priority weight allocation, detect path conflicts in real time and update weights, and embed priority weights into path planning, the dynamic adaptability and robustness problems in networked group cluster route planning evaluation are solved, and efficient collaborative security and task guarantee are achieved.
Patent Information
- Application Number
- CN202510648247.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2025-05-20
- Publication Date
- 2025-08-01
- Estimated Expiration
- 2045-05-20
AI Technical Summary
In the prior art, the route planning evaluation method of networked group clusters has insufficient dynamic adaptability, and it is impossible to dynamically adjust the path priority according to real-time task urgency or resource competition. The evaluation dimension is single, and it is difficult to generate extreme confrontation scenarios that conform to physical laws to verify robustness.
Build a cluster collaborative digital twin environment, calculate the initial priority weight through a fuzzy logic model, detect path conflicts in real time and update priority weights based on the distributed negotiation protocol, embed priority weights into the path cost function, use heading angle adjustment strategy to avoid conflicts, and perform multi-dimensional performance evaluation and dynamic parameter optimization.
It realizes high dynamic adaptability and multi-dimensional performance evaluation of networked network group clusters in complex environments, significantly improves collaborative security and task guarantee capabilities, can quantify priority guarantee and conflict resolution efficiency, and covers a wide range of scenarios.
Smart Images

Figure CN120163509B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of intelligent transportation and unmanned systems, and particularly relates to a route planning intelligent evaluation method adapted to a networked unit cluster, and is particularly applicable to collaborative path planning and performance evaluation of multi-agent clusters such as unmanned aerial vehicles and unmanned vehicles in complex environments. Background Art
[0002] Intelligent equipment such as unmanned aerial vehicles and unmanned vehicles can usually independently establish route planning. For the evaluation of route planning of single intelligent equipment, documents such as CN115235491A, CN113312562A, and CN105203120A have been proposed. However, there has always been no good solution to the route planning evaluation method for networked unit clusters.
[0003] That is, the path planning of conventional networked unit clusters is usually based on fixed priority rules (such as task type or submission time) or centralized control strategies, and there are the following problems: insufficient dynamic adaptability, unable to dynamically adjust path priorities according to real-time task urgency or resource competition; single evaluation dimension, only evaluating basic indicators such as path length and time, lacking quantification of priority guarantee and conflict resolution efficiency; limited scenario coverage: testing depends on preset scenarios, and it is difficult to generate extreme confrontation scenarios that conform to physical laws to verify robustness.
[0004] Therefore, a new technical solution is needed to solve the above technical problems. Summary of the Invention
[0005] For this reason, the present invention provides a route planning evaluation method adapted to a networked unit cluster to solve the above technical problems.
[0006] A route planning evaluation method adapted to a networked unit cluster, characterized by including the following steps:
[0007] S100: Construct a cluster collaborative digital twin environment: Load the kinematic model of the unit, task attribute tags, and high-precision environmental map, where the task attribute tags include urgency grading;
[0008] S200: Dynamic priority weight assignment:
[0009] Based on the task urgency grading and the remaining endurance of the unit, calculate the initial priority weight through a fuzzy logic model;
[0010] Real-time detect path conflicts between units, and update the priority weight based on a distributed negotiation protocol. The priority weight update formula satisfies: the priority weight value is negatively correlated with the conflict distance overlimit, and the normalization of the priority weight ensures that the total priority weight sum of the cluster is 1;
[0011] S300: Multi - objective Path Planning and Conflict Resolution:
[0012] Embed the priority weight into the path cost function to generate the initial path;
[0013] When the initial path intersection is detected, the low - priority aircraft adopts the heading angle adjustment strategy to avoid conflicts and ensure the minimum safety distance;
[0014] S400: Multi - dimensional Performance Evaluation:
[0015] Calculate the actual completion time deviation rate of high - urgency tasks as the priority guarantee rate index;
[0016] Statistical proportion of the average detour distance caused by priority adjustment as the conflict resolution efficiency index;
[0017] S500: Dynamic Parameter Optimization:
[0018] Reverse - adjust the parameters of the fuzzy logic model according to the evaluation results;
[0019] If the priority guarantee rate fails to meet the standard continuously, trigger an alarm and lock the current parameter set.
[0020] Among them, in step 200, the fuzzy logic model is preset with a fuzzy rule table, where the fuzzy rule table is preset with conditional combinations and rule weights, and each conditional combination corresponds to a rule weight, and based on the task urgency classification and the remaining endurance of the aircraft, calculating the initial priority weight through the fuzzy logic model includes the following steps:
[0021] S201: Based on the task urgency classification and the remaining endurance of the aircraft, match the conditional combinations of the fuzzy rule table and assign rule weights;
[0022] S202: Obtain the initial priority weight according to the membership degree values of the task urgency and the remaining endurance and the rule weights. Among them, the membership degree function of the task urgency adopts a combination of triangular and trapezoidal functions to cover the domain, and the membership degree function of the remaining endurance adopts a combination of trapezoidal functions to cover the domain.
[0023] Among them, in step S200, conflict detection is performed by means of spatio - temporal overlap determination.
[0024] Among them, the update of the priority weight based on the distributed negotiation protocol is carried out according to the following steps:
[0025] When the path conflict between aircraft i i and j j is detected, each aircraft broadcasts its initial priority weight and ;
[0026] Each unit updates its weight according to the following formula:
[0027] ;
[0028] Where:
[0029] : The unit The updated priority weight;
[0030] : The unit The initial priority weight (calculated by the fuzzy logic model);
[0031] : The unit The initial priority weight (calculated by the fuzzy logic model);
[0032] : The dynamic decay coefficient;
[0033] Is the conflict distance overlimit;
[0034] : Represents the actual spatial distance between two units at a certain moment;
[0035] : The set of units that conflict with the unit ;
[0036] : The set of all conflicting units;
[0037] And, the updated priority weight should satisfy So that the total priority weight of the cluster is conserved.
[0038] Among them, embedding the priority weight in the path cost function in step S300 is carried out through the following steps:
[0039] S301: Obtain the priority weight of the current unit ;
[0040] S302: Embed the priority weight Into the multi-objective optimization framework, comprehensively calculate the time cost T, energy consumption cost E, and safety cost S, and weight them according to the dynamic weight.
[0041] Among them, after step S300, there is a step of increasing the priority weight of the avoidance unit.
[0042] Among them, after generating the initial path in step S300, there is also a step of optimizing the local path by using the gradient descent method.
[0043] If the initial path or the initial path after local path optimization still has path conflicts, then return to execute step S200: real-time detection of path conflicts between units, updating the priority weights based on the distributed negotiation protocol, and the priority weight update formula satisfies: the priority weight value is negatively correlated with the conflict distance overlimit, and the normalization of the priority weights ensures that the total priority weight of the cluster is 1.
[0044] Among them, in step S500, the parameters of the fuzzy logic model are adjusted, including adjusting the parameters of the membership function and the rule weights in the rule table.
[0045] Among them, the average detour distance ratio ≤ 15%, and the priority guarantee rate ≥ 90%.
[0046] Beneficial effects: The embodiment of the present invention provides a route planning evaluation method adapted to a networked unit cluster, including the following steps: constructing a cluster collaborative digital twin environment, dynamically allocating priority weights, multi-objective path planning and conflict, multi-dimensional performance evaluation, dynamic parameter optimization. Through the above evaluation method, the balance between task urgency guarantee and conflict resolution efficiency is achieved. At the same time, an efficient balance is achieved among real-time conflict detection, dynamic weight adjustment and distributed negotiation, significantly improving the collaborative security and task guarantee ability of the networked unit cluster, and having characteristics such as high dynamic adaptability, multiple evaluation dimensions capable of quantifying priority guarantee and conflict resolution efficiency, and wide scene coverage. Description of the Drawings
[0047] Figure 1 It is a flowchart of the route planning evaluation method of the present invention adapted to a networked unit cluster. Detailed Embodiments
[0048] Refer to the attached Figure 1 drawings. The embodiment of the present invention provides a route planning evaluation method adapted to a networked unit cluster, including the following steps:
[0049] S100: Construct a cluster collaborative digital twin environment: load the kinematic model of the unit, task attribute tags and a high-precision environment map, where the task attribute tags include urgency grading.
[0050] Specifically, when the unit is a drone unit, the drone can adopt a six-degree-of-freedom model. When the unit is an unmanned vehicle unit, the unmanned vehicle can adopt a bicycle model. Preferably, the unit is a drone unit.
[0051] Among them, the task attribute tags can set urgency level tags and allowable maximum delay and other tags according to the task type.
[0052] Among them, the high-precision environmental map can generate a grid map using lidar and visual SLAM, with a resolution ≤ 0.1 m. At the same time, the initial distribution of dynamic obstacles is randomly generated through a Poisson process.
[0053] S200: Dynamic priority weight assignment:
[0054] a. Calculate the initial priority weight through a fuzzy logic model based on the task urgency classification and the remaining endurance of the aircraft.
[0055] Among them, the task urgency refers to the time sensitivity level of the task. In this embodiment, the task urgency is represented by E, and the larger the value, the more urgent it is. In other embodiments, it can also be set such that the smaller the value, the more urgent it is.
[0056] In this embodiment, the value range of the task urgency E is E ∈ [0, 5], which specifically represents a finite level of 5 levels. In other embodiments, the task urgency can also be other value ranges, such as E ∈ [0, 10]. It can be understood that the value range of the task urgency E should be finite and excessive dispersion should be avoided.
[0057] Among them, the remaining endurance refers to the percentage of the current remaining energy of the aircraft in the total capacity. In this embodiment, the remaining endurance is represented by R, and its value range is R ∈ [0%, 100%]. It can be understood that the lower the endurance, the more limited the ability to execute high-priority tasks.
[0058] The fuzzy logic model is preset with a fuzzy rule table. Among them, the fuzzy rule table is preset with conditional combinations and rule weights, and each conditional combination corresponds to a rule weight. At the same time, the conditional combination is the fuzzy set cross combination of the task urgency E and the remaining endurance R.
[0059] In a specific embodiment, the fuzzy rule base is the rule shown in the following table.
[0060]
[0061] The calculation of the initial priority weight through a fuzzy logic model based on the task urgency classification and the remaining endurance of the aircraft includes the following steps:
[0062] S201: Based on the task urgency classification and the remaining endurance of the aircraft, match the conditional combination of the fuzzy rule table and assign the rule weight;
[0063] S202: Obtain the initial priority weight according to the membership degree values of the task urgency and the remaining endurance and the rule weight.
[0064] Among them, the initial priority weight is obtained based on the membership degree values of task urgency and remaining battery life and the rule weight, and the centroid method is used to calculate and obtain the initial priority weight.
[0065] Specifically, the calculation is carried out through the following formula:
[0066] ;
[0067] In the formula:
[0068] : The initial priority weight;
[0069] : The rule weight of each rule;
[0070] : The activation strength of each rule, where and are the membership degree values of task urgency and remaining battery life respectively.
[0071] It can be understood that the initial priority weight is the weighted average of the activation strength of each rule and the rule weight.
[0072] Among them, the membership degree value of task urgency is represented by a membership function. In this embodiment, the membership function of the task urgency E adopts a combination of triangular and trapezoidal functions to cover the domain:
[0073] Low urgency (Low):
[0074] ;
[0075] Medium urgency (Medium):
[0076] ;
[0077] High urgency (High):
[0078] ;
[0079] Among them, the membership degree value of the remaining battery life is represented by a membership function. In this embodiment, the membership function of the remaining battery life R adopts a trapezoidal function to cover the domain:
[0080] Low battery life (Low):
[0081] ;
[0082] Medium battery life (Medium)
[0083] ;
[0084] High endurance:
[0085] ;
[0086] It can be understood that in other embodiments, when the task urgency E takes other value ranges, such as E ∈ [0, 10], the membership function can be re - formulated according to the value range of the task urgency E. However, the membership functions of each fuzzy set (low, medium, high) should cover the entire range without gaps.
[0087] In a specific embodiment, when the task urgency of a certain unmanned aerial vehicle is E = 4 (medium - high urgency) and the remaining endurance R = 70% (medium endurance), its:
[0088] Membership degree of task urgency: High = 0.5, Medium = 0.5;
[0089] Membership degree of remaining endurance: Medium = 1.0;
[0090] Matching rules 1, 2 and 4 of the fuzzy rule table:
[0091] Rule 1 (High(E≥3), Any R): Rule weight w1 = 0.9, activation strength μ1 = min(0.5, 1)=0.5;
[0092] Rule 2 (High(E≥3), Medium (80%>R>30%)): Rule weight w2 = 0.7, activation strength μ2 = min(0.5, 1)=0.5;
[0093] Rule 4 (Medium(1<E<5), Medium(80%>R>30%)): Rule weight w3 = 0.5, activation strength μ5 = min(0.5, 1)=0.5;
[0094] Then, the initial priority weight is:
[0095] ;
[0096] b. Real - time detection of path conflicts between units, and update the priority weight based on the distributed negotiation protocol. The weight update formula satisfies: the weight value is negatively correlated with the conflict distance excess limit, and the weight normalization ensures that the total weight sum of the cluster is 1.
[0097] Among them, conflict detection is carried out by means of spatio - temporal overlap determination.
[0098] Specifically, it includes:
[0099] Path prediction: Each unit periodically broadcasts its predicted path for the next T seconds.
[0100] The described periodicity can be per second, and the format of the predicted path can be a time-position sequence:
[0101] ;
[0102] In the formula:
[0103] Unit 's predicted path;
[0104] t: Timestamp;
[0105] : Unit At time 's horizontal plane coordinate;
[0106] : Unit At time 's vertical plane coordinate.
[0107] Collision determination: Preset safety distance threshold , and when the paths of two units and enter the spatial overlap area within the same time period, and the distance between them is less than or equal to , there is a collision.
[0108] Specifically, it can be determined by the following formula:
[0109] ;
[0110] In the formula:
[0111] : Safety distance threshold;
[0112] : Time t is within the interval ;
[0113]
[0114] Among them, can be set through experiments or industry standards or adjusted based on real-time status. When the described is preset as a fixed value, is 8 - 12m. When is configured to be adjusted based on real-time status, 's value can be dynamically calculated according to the unit's current speed, environmental risk level, etc. Specifically, it can be dynamically adjusted by the following formula:
[0115] ;
[0116] Wherein:
[0117] The influence weight of speed on the safety distance;
[0118] : The influence weight of acceleration on the safety distance;
[0119] : The influence weight of the environmental risk factor on the safety distance;
[0120] ;
[0121] : The instantaneous acceleration of the unit at time t;
[0122] : The environmental risk factor, such as increasing the margin in low visibility;
[0123] : The dynamically adjusted safety distance (value at time t);
[0124] Wherein, , , : Usually can be calibrated through historical data.
[0125] The update of the priority weight based on the distributed negotiation protocol is carried out according to the following steps:
[0126] S210: When it is detected that there is a path conflict between the unit and each unit broadcasts its initial fuzzy logic weight and .
[0127] S211: Each unit updates the weight according to the following formula:
[0128] ;
[0129] Wherein:
[0130] : The updated priority weight of unit ;
[0131] : The initial priority weight of unit (calculated by the fuzzy logic model);
[0132] : The initial priority weight of unit (calculated by the fuzzy logic model);
[0133] is the dynamic attenuation coefficient: ; λ is the conflict sensitivity coefficient, and its value range is [0.05, 0.2]. The smaller the value, the more sensitive it is to the conflict distance;
[0134] is the conflict distance overlimit: ;
[0135] : represents the actual spatial distance between two units at a certain moment;
[0136] : the set of units that conflict with unit
[0137] : the set of all conflicting units.
[0138] It can be understood that the weight value is negatively correlated with the conflict distance overlimit, that is, the overlimit is larger, is smaller, and the greater the reduction in weight. That is, the closer it is to 1, the more the optimization time and energy consumption are prioritized (high-priority units pursue efficiency), while the closer it is to 0, the more the risk avoidance is prioritized (low-priority units take the initiative to avoid).
[0139] At the same time, the updated weight should satisfy to ensure the conservation of the total weight of the cluster.
[0140] In a specific embodiment:
[0141] Initial state:
[0142] Unit A (medical task): = 0.6;
[0143] Unit B (logistics task): = 0.3;
[0144] Unit C (inspection task): = 0.1;
[0145] Safety distance = 10 m → γ = 0.1.
[0146] Conflict event:
[0147] 1. A conflicts with B: The predicted distance between A and B: d AB = 8 m → Δd AB = 2 m;
[0148] 2. B conflicts with C: The predicted distance between B and C: dBC = 9 meters → Δd BC = 1 meter.
[0149] After weight update
[0150] = 0.4912 / 0.8039 ≈ 0.611;
[0151] = 0.2222 / 0.8039 ≈ 0.276;
[0152] = 0.0905 / 0.8039 ≈ 0.113;
[0153] ;
[0154] That is: the weight of the high - priority unit A increases (0.6 → 0.611) because its conflict is relatively minor (Δd = 2); the weight of unit B decreases (0.3 → 0.276) and it undertakes more avoidance responsibilities; the total weight remains 1, satisfying the normalization constraint.
[0155] Meanwhile, through the above - mentioned step - by - step mechanism, the system achieves an efficient balance among real - time conflict detection, dynamic weight adjustment, and distributed negotiation, significantly improving the collaborative security and task guarantee capabilities of the connected unit cluster.
[0156] S300: Multi - objective path planning and conflict resolution.
[0157] a. Embed the priority weight into the path cost function to generate the initial path.
[0158] The path cost function is a heuristic function based on the A* algorithm:
[0159] ;
[0160] Among them,
[0161] is the actual path cost from the starting point to node n;
[0162] is the heuristic estimated cost from node n to the end point.
[0163] The initial path is the path of the node with the minimum
[0164] Among them, the embedding of the priority weight is carried out in the following way:
[0165] S301: Obtain the priority weight of the current unit ;
[0166] S302: Embed the priority weight into the multi-objective optimization framework, comprehensively calculate the time cost T, energy consumption cost E, and safety cost S, and weight them according to the dynamic weight:
[0167] ;
[0168] In the formula:
[0169] : The actual path cost from the starting point to node n;
[0170] : Time cost = path length / maximum speed of the unit;
[0171] : Energy consumption cost = integral of the square of acceleration (reflecting control energy consumption);
[0172] : Safety risk cost, ;
[0173] : Weight coefficient of time cost;
[0174] : Weight coefficient of energy consumption cost;
[0175] : Weight coefficient of safety cost;
[0176] Each weight coefficient should also satisfy the normalization constraint, that is: .
[0177] Furthermore, the gradient descent method is used to optimize the local path.
[0178] Among them, the optimized variable is the sequence of path point heading angles { , ,..., };
[0179] The objective function is:
[0180] ;
[0181] In the formula:
[0182] ;
[0183] ;
[0184] : Conflict penalty coefficient, usually = 10;
[0185] : Indicates the actual spatial distance between the two units at a certain moment;
[0186] :After determining the initial path ,Right now:
[0187] ;
[0188] ϵ: a very small positive number;
[0189] Iteratively update the objective function to: :
[0190] ;
[0191] Where:
[0192] : learning rate, usually, =0.01.
[0193] : .
[0194] Furthermore, the method further includes a step of verifying the feasibility of the initial path.
[0195] Specifically include:
[0196] Perform a kinematic constraint check:
[0197] Among them, the maximum steering angle limit is: ;
[0198] : Maximum permissible steering angle; understandable, It can be set according to the kinematic model of the crew. Preferably, the angle is 30° for UAV and 25° for unmanned vehicle.
[0199] Acceleration limit: ;
[0200] : Maximum allowable acceleration.
[0201] Furthermore, the initial path or the path after local path optimization is still < , then return to step 200b to perform dynamic weight update.
[0202] It can be understood that through multi-objective path planning with priority weight embedding and gradient descent local optimization, efficient coordination and autonomous conflict resolution of networked unit clusters are achieved.
[0203] b. When a path crossing is detected, the low-priority aircraft adopts a heading angle adjustment strategy to avoid conflicts and ensure a minimum safety distance.
[0204] Furthermore, before performing this step, it includes a priority comparison step:
[0205] That is, compare the priority weights of the two aircraft with , and the aircraft with the lower weight is marked as the avoidance responsible party. At the same time, if the weights are the same, the one with the smaller ID is the avoidance responsible party.
[0206] The described heading angle adjustment strategy includes the following steps:
[0207] S310: Obtain the relative position and velocity vectors of the two aircraft at the conflict point:
[0208] ;
[0209] In the formula:
[0210] : The position vector difference of the two aircraft at the predicted conflict time ;
[0211] : The predicted conflict time;
[0212] : The position coordinate of aircraft at time ;
[0213] : The position coordinate of aircraft at time ;
[0214] : The instantaneous velocity vector of aircraft , with the direction consistent with the tangent direction of the motion trajectory;
[0215] : The instantaneous velocity vector of aircraft , with the direction consistent with the tangent direction of the motion trajectory.
[0216] Obtain the minimum safety distance constraint:
[0217] ;
[0218] In the formula:
[0219] : The conflict prediction time window, which is the time window from the current moment to the predicted conflict time and is used to calculate the offset of the future position.
[0220] Obtain the direction of heading angle adjustment:
[0221] Calculate the relative heading angle between the two units: ; If the current heading of the unit is , preferentially adjust in the direction perpendicular to the relative heading (turn left or right).
[0222] Among them, , ;
[0223] : The relative heading angle, representing the azimuth angle from unit to unit .
[0224] Obtain the heading angle increment based on geometric avoidance:
[0225] ;
[0226] Among them, the constraint conditions: , is the maximum allowable steering angle.
[0227] S311: Execute the heading angle adjustment.
[0228] The heading angle adjustment can be executed by means of a single turn or progressive adjustment.
[0229] Among them, when using a single turn, directly apply to execute the heading angle adjustment.
[0230] When executing the heading angle adjustment in a progressive adjustment manner, increase by per step, and a total of steps are used for adjustment to avoid sharp turns.
[0231] It can be understood that it is also necessary to verify whether the acceleration of the adjusted path meets . If not, reduce the speed or adjust in segments.
[0232] In addition, generate an adjusted path according to the new heading angle and re-broadcast it to the cluster.
[0233] In addition, after this step, it is also necessary to verify the avoidance effect: re-predict the distance between the two units at time tc , if ≥ , then the avoidance is successful. If < , then re-execute step 300b.
[0234] Furthermore, due to the additional energy consumption or time loss caused by the avoidance unit's detour, its weight can be temporarily increased , for example, , that is, it is increased by 1.1 times to avoid continuous resource preemption.
[0235] Through the above method, the minimum adjustment amount can be quickly generated, the detour distance can be reduced, the temporary weight increase mechanism can balance the avoidance cost, and the low computational complexity can ensure real-time performance. That is, through the heading angle adjustment strategy driven by priority, the low-priority aircraft can avoid conflicts at the minimum path cost on the premise of ensuring a safe distance, and ensure the efficient execution of high-priority tasks.
[0236] S400: Multi-dimensional performance evaluation.
[0237] a. Calculate the actual completion time deviation rate of high-emergency tasks as the priority guarantee rate index.
[0238] The high-emergency tasks mentioned above are tasks defined as High in the task urgency classification, or tasks with E≥4 in the 5-level urgency classification, or tasks defined as high-emergency tasks in the urgency level identification.
[0239] The time deviation rate is obtained through the following formula:
[0240] ;
[0241] In the formula:
[0242] ;
[0243] ;
[0244] , for task , its theoretical optimal time, ; where, : The length of the conflict-free shortest path; : The maximum speed defined in the aircraft kinematic model.
[0245] It can be understood that when it is a negative deviation, it means it is completed in advance, then = 0%, when it is a positive deviation, it means it is completed late.
[0246] Priority guarantee rate statistics:
[0247] ;
[0248] In the formula:
[0249] ;
[0250] ;
[0251] N: Total number of high - urgency tasks;
[0252] It can be understood that if the task is not completed (such as cancelled or failed), then = 100%.
[0253] Furthermore, the priority guarantee rate can be calculated with weights, such as assigning weights according to the task urgency , then the priority guarantee rate is calculated according to the following formula:
[0254] ;
[0255] In the formula:
[0256] : Weight;
[0257] : .
[0258] Furthermore, if the task is not completed due to system failure, it is marked as = 100%, and is included in the guarantee rate calculation for statistics.
[0259] Furthermore, is positively correlated with the task urgency E. Specifically, when E = 5, = 5, when E = 4 = 3.
[0260] It can be understood that by calculating the time deviation rate of high - urgency tasks and statistically calculating the priority guarantee rate, the system can accurately evaluate the effectiveness of dynamic path planning and conflict resolution strategies, providing core data support for parameter optimization and operation and maintenance decisions.
[0261] b. Statistically calculate the proportion of the average detour distance caused by priority adjustment as an index of conflict resolution efficiency.
[0262] Among them, the proportion of detour distance is obtained according to the following formula:
[0263] ;
[0264] In the formula:
[0265] : The theoretically shortest path of each unit without conflict, which can be obtained by calculating through the path planning algorithm in step S300a.
[0266] : The actual driving path length of the unit due to priority adjustment, which is measured in real - time by a trajectory tracking algorithm (such as SLAM).
[0267] It can be understood that the proportion of detour distance needs to be calculated for each conflict event
[0268] ;
[0269] Among them,
[0270] : represents the m-th conflict event, ;
[0271] : the total number of effective conflict events that occur between units during the evaluation period;
[0272] =1: no detour;
[0273] <1: path increase;
[0274] >1: path optimization.
[0275] Global average efficiency ≥85%, that is, the proportion of the average detour distance ≤ 15%. Among them, the global average efficiency is obtained through the following formula:
[0276] ;
[0277] S500: Dynamic parameter optimization:
[0278] a. Reverse-adjust the parameters of the fuzzy logic model according to the evaluation results.
[0279] The adjustment of the parameters of the fuzzy logic model mentioned above can be to adjust the parameters of the membership function and the rule weight w in the rule table k .
[0280] Among them, the parameters of the membership function can be the vertex position of the triangular function of the task urgency E, the turning points of the trapezoidal function of the remaining endurance R, etc.
[0281] The reverse adjustment of the parameters of the fuzzy logic model according to the evaluation results also includes the priority guarantee rate and the conflict resolution efficiency
[0282] Merge the evaluation results (priority guarantee rate and conflict resolution efficiency) into a single optimization goal:
[0283] ;
[0284] In the formula:
[0285] : the weight coefficient of the conflict resolution efficiency. In this embodiment =0.5, and it can be adjusted according to the scenario in other embodiments;
[0286] J: Comprehensive optimization target value (to be maximized);
[0287] It can be understood that should be maximized to improve both priority guarantee and conflict resolution efficiency simultaneously.
[0288] b. If the priority guarantee rate fails to meet the standard continuously, trigger an alarm and lock the current parameter set.
[0289] The continuous failure of the priority guarantee rate to meet the standard means that it has not met the standard in the most recent K consecutive periods. Meeting the standard means that the priority guarantee rate ≥ 90%. Usually, K is 3 - 5. In this embodiment, K = 3.
[0290] It can be understood that in this embodiment, by inversely adjusting the parameters of the fuzzy logic model, the system can autonomously optimize the dynamic priority allocation strategy, significantly improve the collaborative performance of the networked unit cluster in complex scenarios, while ensuring continuous improvement of the evaluation indicators. At the same time, through continuous monitoring, intelligent alarm and parameter locking mechanisms, the system can quickly respond when the priority guarantee rate is continuously insufficient, ensure the reliability of key task execution, and provide stable operation guarantee for the networked unit cluster in complex dynamic environments.
[0291] The above are only the embodiments of the present invention, and do not limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made by using the content of the specification and drawings of the present invention, or directly or indirectly applied in other related technical fields, shall be equally included in the patent protection scope of the present invention.
Claims
1. A route planning and evaluation method adapted to a networked unit cluster, characterized in that, It includes the following steps: S100: Construct a cluster collaborative digital twin environment: Load the kinematic model of the unit, task attribute tags, and a high-precision environmental map, where the task attribute tags include urgency grading; S200: Dynamic priority weight allocation: Based on the task urgency grading and the remaining endurance of the unit, calculate the initial priority weight through a fuzzy logic model; Real-time detect path conflicts between units, and update the priority weight based on a distributed negotiation protocol. The priority weight update formula satisfies: The priority weight value is negatively correlated with the conflict distance overlimit, and the normalization of the priority weight ensures that the total priority weight of the cluster is 1; S300: Multi-objective path planning and conflict resolution: Embed the priority weight into the path cost function to generate an initial path; When an initial path intersection is detected, the low-priority unit adopts a heading angle adjustment strategy to avoid conflicts and ensure the minimum safety distance; S400: Multi-dimensional performance evaluation: Calculate the actual completion time deviation rate of high-urgency tasks as the priority guarantee rate index; Statistically calculate the proportion of the average detour distance caused by priority adjustment as the conflict resolution efficiency index; S500: Dynamic parameter optimization: Reverse-adjust the parameters of the fuzzy logic model according to the evaluation results; If the priority guarantee rate fails to meet the standard continuously, trigger an alarm and lock the current parameter set; Collision detection is performed by means of spatio-temporal overlap determination in step S200, and a preset safety distance threshold , and when the paths of two units and enter the spatial overlap area within the same time period, and the distance between them is less than or equal to , there is a collision; The update of the priority weight based on the distributed negotiation protocol is carried out according to the following steps: When the path conflict between unit i i and j j is detected, each unit broadcasts its initial priority weight and ; Each unit updates the weight according to the following formula: ; In the formula: : Unit Updated priority weight; : Unit The initial priority weight of is calculated by the fuzzy logic model; : Initial priority weight of the unit calculated by the fuzzy logic model; : Dynamic attenuation coefficient; The conflict distance exceeds the limit, ; : represents the actual spatial distance between the two units at a certain moment; : The set of units in conflict with the unit; : The set of all conflicting units; Moreover, the updated priority weights should satisfy such that the total priority weight of the cluster is conserved.
2. The evaluation method according to claim 1, characterized in that In step 200, the fuzzy logic model is preset with a fuzzy rule table. Among them, the fuzzy rule table is preset with conditional combinations and rule weights, and each conditional combination corresponds to a rule weight. And based on the task urgency grading and the remaining endurance of the unit, calculating the initial priority weight through the fuzzy logic model includes the following steps: S201: Based on the task urgency grading and the remaining endurance of the unit, match the conditional combinations of the fuzzy rule table and assign rule weights; S202: Obtain the initial priority weight according to the membership degree values of the task urgency and the remaining endurance and the rule weights. Among them, the membership function of the task urgency adopts a combination of triangular and trapezoidal functions to cover the domain, and the membership function of the remaining endurance adopts a combination of trapezoidal functions to cover the domain.
3. The evaluation method according to claim 2, wherein Embedding the priority weight into the path cost function in step S300 is carried out according to the following steps: S301: Obtain the priority weight of the current unit ; S302: Embed the priority weight into the multi-objective optimization framework, comprehensively calculate the time cost T, energy consumption cost E, and security cost S, and weight them according to the dynamic weight.
4. The evaluation method according to claim 3, wherein After step S300, it includes the step of increasing the priority weight of the avoiding unit.
5. The evaluation method according to claim 4, wherein After generating the initial path in step S300, it also includes the step of optimizing the local path using the gradient descent method.
6. The evaluation method according to claim 5, characterized in that If there is still a path conflict in the initial path or the initial path optimized by the local path, return to execute the step in step S200: Real-time detect path conflicts between units, and update the priority weight based on the distributed negotiation protocol. The priority weight update formula satisfies: The priority weight value is negatively correlated with the conflict distance overlimit, and the normalization of the priority weight ensures that the total priority weight of the cluster is 1.
7. The evaluation method according to claim 6, characterized in that Adjusting the parameters of the fuzzy logic model in step S500 includes adjusting the parameters of the membership function and the rule weights in the rule table.
8. The evaluation method according to claim 1, wherein The proportion of the average detour distance ≤ 15%, and the priority guarantee rate ≥ 90%.
Citation Information
Patent Citations
Navigation route detecting and evaluating method and device
CN105203120A
Route planning method and device, electronic equipment, storage medium and program product
CN113312562A
Yaw planning method and device, electronic equipment, storage medium and program product
CN115235491A
Oil depot tank field inspection robot task allocation method and system based on Internet of Things
CN119417192A
Intelligent auxiliary decision-making method for ship entry and exit and berthing based on multi-source data
CN119784102A