Emergency task allocation method and system for urban mobile target blockade

By structuring and optimizing the blockade action task area in the urban road topology, the problem of insufficient resources in the allocation of urban emergency tasks is solved, and precise blockade of mobile targets and efficient resource scheduling is achieved.

CN118586689BActive Publication Date: 2025-02-28NAT UNIV OF DEFENSE TECH
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202411086487.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-08-08
Publication Date
2025-02-28
Estimated Expiration
2044-08-08

AI Technical Summary

Technical Problem

In the allocation of urban emergency tasks, we face the problem of insufficient resources and difficulty in rationally allocating all urban mobile targets at the same time.

Method used

By constructing an optional blocking action task area based on urban road topology and mobile target travel information, calculate the task action resources required in each area, select the optimal blocking task area, predict the target arrival status and time, form a matching relationship between the task resources and the target, and determine the latest start execution time of the task resources.

Benefits of technology

Accurate blockade of urban mobile targets has been achieved, ensuring that the target loses its mobility within the blocked area, and thus can more effectively schedule task resources for emergency task allocation.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 00000000_0000_ABST
    Figure 00000000_0000_ABST
Patent Text Reader

Abstract

The present invention provides an emergency task allocation method and system for the blockade of urban mobile targets, the method comprising constructing an optional blockade action task area according to the urban road topology and the travel information of the mobile blockade target of interest; calculating the task action resources required for the blockade target in each optional blockade area; selecting the optimal blockade task area based on resource requirements; predicting the state and time of the mobile target of interest arriving at the optimal blockade task area based on the optimal blockade task area; forming a matching relationship between task resources and mobile blockade targets based on the optimal blockade task area, state and time; determining the latest start time of task action resources based on the matching relationship. By determining the matching relationship between task resources and targets, the present invention can accurately implement the blockade of the mobile target of interest, block it in a certain area, make it lose its mobility and become a fixed target, thereby achieving the purpose of task execution.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the field of computer technology, and in particular relates to an emergency task allocation method and system for blocking urban mobile targets. Background Art

[0002] In the allocation of urban emergency tasks, it is necessary to block the mobile targets in the city. Such targets are sudden and urgent, so when mobilizing resources, there is usually a situation where resources are insufficient and it is difficult to allocate all targets.

[0003] In reality, for ground mobile targets, due to limited mission action resources, it is difficult to achieve emergency task allocation if all targets cannot be reasonably allocated at the same time.

[0004] Therefore, how to construct a task allocation method for blocking mobile targets in urban road networks has become an urgent problem that needs to be solved in emergency task allocation. Summary of the invention

[0005] In order to overcome the deficiencies of the prior art, the present invention provides an emergency task allocation method and system for urban mobile target blockade to improve the demand for urban mobile target blockade.

[0006] In order to achieve the above object, the present invention adopts the following technical solutions:

[0007] An emergency task allocation method for blocking urban mobile targets, comprising:

[0008] According to the topological structure of urban roads and the travel information of the mobile blockade target of interest, an optional blockade action mission area is constructed;

[0009] Calculate the mission action resources required to block the mobile blockade target of interest in each of the optional blockade action mission areas;

[0010] Based on the mission action resources, select the optimal blockade mission area;

[0011] Based on the optimal blocking task area, predicting the state and time of the mobile blocking target of interest arriving at the optimal blocking task area;

[0012] Based on the optimal blocking task area, the state and the time, forming a matching relationship between the task action resource and the mobile blocking target of interest;

[0013] And based on the matching relationship, determine the latest time for the task action resource to start executing the task.

[0014] Furthermore, the optional blocking action task area is constructed according to the urban road topology and the travel information of the mobile blocking target of interest, including:

[0015] According to the urban road topology and the travel information of the mobile blockade target of interest, all roads appearing on the travel route of the mobile blockade target of interest are calculated. and intersections ;

[0016] According to the city's road information, get the length of all roads , the number of mobile targets that can pass through all roads at the same time is Information about the number of roads connected to the intersection ;

[0017] From arrive As a starting point, construct the optional blockade mission area set , ,in Requirements:

[0018] ;

[0019] in, Blocks the target travel length for the move of interest.

[0020] Furthermore, the calculation of the mission action resources required for the blockade targets of interest in each of the optional blockade areas includes:

[0021] Calculates the set of optional blockade mission areas Mission Operations Resource Requirements and the number of roads with a moving target traffic count of 1 .

[0022] Further, the selecting the optimal blocking mission area based on the mission action resources includes:

[0023] Action resource requirements as per stated mission A collection of the optional blockade mission areas from low to high Sort and get a set of optional blockade mission areas with the lowest mission action resource requirements , so that:

[0024] ;

[0025] A collection of selectable interdiction mission areas that have the lowest resource requirements for the mission in question Internally, the number of roads with a traffic volume of 1 according to the moving target Sort from high to low and choose the best one , so that ,and Less than or equal to the maximum number of available blocked resources.

[0026] Furthermore, the mobile blocking targets of interest are sorted along the travel route as follows: The execution time of the task action resource for the mobile blocking target of interest is respectively ;

[0027] The forming of a matching relationship between the task action resource and the mobile blocking target of interest based on the optimal blocking task area, the state and the time includes:

[0028] Calculate the mobile blocking target with the shortest execution time of the mission action resources, and the shortest execution time ;

[0029] Based on the shortest execution time of all task action resources , select the task action resource that takes the most time and mobile blocking targets of interest The combination of is determined as the final solution, then ;

[0030] Delete in pending mission action resources , delete from the pending mobile blockade targets , forming a new set of mission action resources and a set of mobile blockade targets of concern;

[0031] The above steps are repeated until all mobile blockade targets of interest are allocated mission action resources to form a matching relationship between the mission action resources and the mobile blockade targets of interest.

[0032] In addition, the present invention also provides an emergency task allocation system for blocking urban mobile targets, including:

[0033] A construction module, used for constructing an optional blocking action mission area according to the topological structure of urban roads and the travel information of the mobile blocking target of interest;

[0034] A calculation module, used for calculating the mission action resources required for blocking the mobile blocking target of interest in each of the optional blocking action mission areas;

[0035] A selection module, used for selecting an optimal blocking mission area based on the mission action resources;

[0036] A prediction module, used for predicting the state and time of the mobile blocking target of interest arriving at the optimal blocking task area based on the optimal blocking task area;

[0037] A relationship matching module, used for forming a matching relationship between the task action resource and the mobile blocking target of interest based on the optimal blocking task area, the state and the time;

[0038] And a determination module is used to determine the latest time for the task action resource to start executing the task based on the matching relationship.

[0039] Furthermore, the construction module is used to:

[0040] According to the urban road topology and the travel information of the mobile blockade target of interest, all roads appearing on the travel route of the mobile blockade target of interest are calculated. and intersections ;

[0041] According to the city's road information, get the length of all roads , the number of mobile targets that can pass through all roads at the same time is Information about the number of roads connected to the intersection ;

[0042] From arrive As a starting point, construct the optional blockade mission area set , ,in Requirements:

[0043] ;

[0044] in, Blocks the target travel length for the move of interest.

[0045] Furthermore, the calculation module is used for:

[0046] Calculates the set of optional blockade mission areas Mission Operations Resource Requirements and the number of roads with a moving target traffic count of 1 .

[0047] Furthermore, the selected module is used to:

[0048] Action resource requirements as per stated mission A collection of the optional blockade mission areas from low to high Sort and get a set of optional blockade mission areas with the lowest mission action resource requirements , so that:

[0049] ;

[0050] A collection of selectable interdiction mission areas that have the lowest resource requirements for the mission in question Internally, the number of roads with a traffic volume of 1 according to the moving target Sort from high to low and choose the best one , so that ,and Less than or equal to the maximum number of available blocked resources.

[0051] Furthermore, the mobile blocking targets of interest are sorted along the travel route as follows: The execution time of the task action resource for the mobile blocking target of interest is respectively ;

[0052] The relationship matching module is used for:

[0053] Calculate the mobile blocking target with the shortest execution time of the mission action resources, and the shortest execution time ;

[0054] Based on the shortest execution time of all task action resources , select the task action resource that takes the most time and mobile blocking targets of interest The combination of is determined as the final solution, then ;

[0055] Delete in pending mission action resources , delete from the pending mobile blockade targets , forming a new set of mission action resources and a set of mobile blockade targets of concern;

[0056] The above steps are repeated until all mobile blockade targets of interest are allocated mission action resources to form a matching relationship between the mission action resources and the mobile blockade targets of interest.

[0057] In the present invention, by determining the matching relationship between task action resources and the mobile blockade target of interest, tasks can be accurately assigned to the head and tail targets of the mobile blockade target of interest, and the mobile blockade target of interest can be blocked within a certain area to make it lose its mobility and become a fixed target, so that more task action resources can be dispatched to perform emergency task assignments on it. BRIEF DESCRIPTION OF THE DRAWINGS

[0058] The drawings described herein are used to provide a further understanding of the present invention and constitute a part of the present invention. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention, but do not constitute an improper limitation of the present invention. In the drawings:

[0059] Figure 1 The process of the method of the present invention is Figure 1 ;

[0060] Figure 2 The process of the method of the present invention is Figure 2 ;

[0061] Figure 3 The process of the method of the present invention is Figure 3 ;

[0062] Figure 4 The process of the method of the present invention is Figure 4 ;

[0063] Figure 5 is a structural example diagram of the system of the present invention; DETAILED DESCRIPTION

[0064] In order to enable those skilled in the art to better understand the solutions of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention.

[0065] In the description of the present invention, it should be understood that the orientation or positional relationship indicated by the terms and the like is based on the orientation or positional relationship shown in the accompanying drawings, and is only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device, element, module, system, platform or device referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation on the present invention. The following description of the present invention is only understood as a description of individual embodiments of the technical solution of the present invention. Other embodiments are not reflected in the following description, but it does not mean that the present invention excludes these other embodiments, and the technical solution of the present invention is not limited to the specific implementation methods described below, and the protection scope of the present invention is not limited to only the specific implementation methods described below. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work should belong to the scope of protection of the present invention.

[0066] It should be noted that if the terms "first", "second", etc. appear in the specification and claims of the present invention and the above-mentioned drawings, the description is only used to distinguish similar objects, and is not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0067] The urban mobile target of the present invention may be a moving convoy, the vehicles of which may move quickly on the roads of the city. The urban mobile convoy of interest is a group of vehicles consisting of a large number of vehicles moving along the city roads in the city.

[0068] In some embodiments, Figure 1 As shown, an emergency task allocation method for blocking urban mobile targets includes:

[0069] S1: construct an optional blockade action mission area based on the urban road topology and the travel information of the mobile blockade target of interest;

[0070] S2: Calculating the mission action resources required to block the mobile blockade target of interest in each of the optional blockade action mission areas;

[0071] S3: Based on the mission action resources, select the optimal blockade mission area;

[0072] S4: Based on the optimal blocking task area, predicting the state and time of the mobile blocking target of interest arriving at the optimal blocking task area;

[0073] S5: Based on the optimal blocking task area, the state and the time, forming a matching relationship between the task action resource and the mobile blocking target of interest;

[0074] And S6: Based on the matching relationship, determine the latest time for the task action resource to start executing the task.

[0075] In some embodiments, Figure 2 As shown, step S1 includes:

[0076] S11: According to the urban road topology and the travel information of the mobile blockade target of interest, all roads appearing on the travel route of the mobile blockade target of interest are calculated. and intersections ;

[0077] S12: According to the road information of the city, get the length of all roads , the number of mobile targets that can pass through all roads at the same time is Information about the number of roads connected to the intersection ;

[0078] Assume that when the position information of the convoy is detected, there are n vehicles in the convoy and the vehicle at the end of the convoy is Road, and the target convoy travels a distance of ,by When road conditions do not support the convoy to maintain When the convoy advances in formation, it is considered that the convoy maintains the maximum possible number of formations.

[0079] S13: From arrive As a starting point, construct the optional blockade mission area set , .

[0080] Assume that The range of the area starting from the road is determined as follows: arrive All the roads so far exist Satisfy the conditions, that is satisfy ,in, is the travel length of the mobile blocking target of interest; then for the starting point The area is ,.

[0081] In some embodiments, step S2 includes:

[0082] S21: Calculate the set of optional blockade mission areas Mission Operations Resource Requirements and the number of roads with a moving target traffic count of 1 .

[0083] In some embodiments, Figure 3 As shown, step S3 includes:

[0084] S31: Action resource requirements according to the task A collection of the optional blockade mission areas from low to high Sort and get a set of optional blockade mission areas with the lowest mission action resource requirements , so that:

[0085] ;

[0086] S32 A collection of optional interdiction mission areas with the lowest resource requirements for the mission action Internally, the number of roads with a traffic volume of 1 according to the moving target Sort from high to low and choose the best one , so that ,and Less than or equal to the maximum number of available blocked resources.

[0087] If there are multiple optimal regions that meet the conditions, one of them can be randomly selected.

[0088] In some embodiments, the mobile blocking targets of interest are sorted along the travel route as follows: The execution time of the task action resource for the mobile blocking target of interest is respectively ;

[0089] like Figure 4 As shown, step S5 may include:

[0090] S51: Calculate the mobile blocking target of interest with the shortest execution time of the task action resource, and the shortest execution time ;

[0091] S52: The shortest execution time of all task action resources , select the task action resource that takes the most time and mobile blocking targets of interest The combination of is determined as the final solution, then ;

[0092] S53: Delete from pending mission action resources , delete from the pending mobile blockade targets , forming a new set of mission action resources and a set of mobile blockade targets of concern;

[0093] S54: Repeat the above steps until all mobile blockade targets of interest are allocated mission action resources to form a matching relationship between the mission action resources and the mobile blockade targets of interest.

[0094] In addition, if Figure 5 As shown, the present invention also provides an emergency task allocation system 1 for blocking urban mobile targets, comprising:

[0095] A construction module 11 is used to construct an optional blocking action mission area according to the urban road topology and the travel information of the mobile blocking target of interest;

[0096] A calculation module 12, used for calculating the task action resources required for blocking the mobile blocking target of interest in each of the optional blocking action task areas;

[0097] A selection module 13, for selecting an optimal blocking mission area based on the mission action resources;

[0098] A prediction module 14 is used to predict the state and time of the mobile blocking target of interest arriving at the optimal blocking task area based on the optimal blocking task area;

[0099] A relationship matching module 15, for forming a matching relationship between the task action resource and the mobile blocking target of interest based on the optimal blocking task area, the state and the time;

[0100] And a determination module 16 is used to determine the latest time for the task action resource to start executing the task based on the matching relationship.

[0101] In some embodiments, the construction module 11 is used to:

[0102] According to the urban road topology and the travel information of the mobile blockade target of interest, all roads appearing on the travel route of the mobile blockade target of interest are calculated. and intersections ;

[0103] According to the city's road information, get the length of all roads , the number of mobile targets that can pass through all roads at the same time is Information about the number of roads connected to the intersection ;

[0104] From arrive As a starting point, construct the optional blockade mission area set , ,in Requirements:

[0105] ;

[0106] in, Blocks the target travel length for the move of interest.

[0107] In some embodiments, the computing module 12 is used to:

[0108] Calculates the set of optional blockade mission areas Mission Operations Resource Requirements and the number of roads with a moving target traffic count of 1 .

[0109] In some embodiments, the selection module 13 is used to:

[0110] Action resource requirements as per stated mission A collection of the optional blockade mission areas from low to high Sort and get a set of optional blockade mission areas with the lowest mission action resource requirements , so that:

[0111] ;

[0112] A collection of selectable interdiction mission areas that have the lowest resource requirements for the mission in question Internally, the number of roads with a traffic volume of 1 according to the moving target Sort from high to low and choose the best one , so that ,and Less than or equal to the maximum number of available blocked resources.

[0113] In some embodiments, the mobile blocking targets of interest are sorted along the travel route as follows: The execution time of the task action resource for the mobile blocking target of interest is respectively ;

[0114] The relationship matching module 15 is used for:

[0115] Calculate the mobile blocking target with the shortest execution time of the mission action resources, and the shortest execution time ;

[0116] Based on the shortest execution time of all task action resources , select the task action resource that takes the most time and mobile blocking targets of interest The combination of is determined as the final solution, then ;

[0117] Delete in pending mission action resources , delete from the pending mobile blockade targets , forming a new set of mission action resources and a set of mobile blockade targets of concern;

[0118] The above steps are repeated until all mobile blockade targets of interest are allocated mission action resources to form a matching relationship between the mission action resources and the mobile blockade targets of interest.

[0119] Optionally, specific examples in the present invention may refer to the examples described in the above embodiments and optional implementation modes.

[0120] The specific embodiments of the present invention described above are for description only and do not represent the advantages or disadvantages of the embodiments.

[0121] In the above embodiments of the present invention, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0122] In the several embodiments provided by the present invention, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the system embodiments described above are only exemplary, for example, multiple devices can be combined or integrated into another system, or some features can be ignored or not executed.

[0123] The above is only a preferred implementation of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. An emergency task allocation method for urban mobile target blockade, characterized in that: include; According to the topological structure of urban roads and the travel information of the mobile blockade target of interest, an optional blockade action mission area is constructed; Calculate the mission action resources required to block the mobile blockade target of interest in each of the optional blockade action mission areas; Based on the mission action resources, select the optimal blockade mission area; Based on the optimal blocking task area, predicting the state and time of the mobile blocking target of interest arriving at the optimal blocking task area; Based on the optimal blocking task area, the state and the time, forming a matching relationship between the task action resource and the mobile blocking target of interest; and determining the latest time for the task action resource to start executing the task based on the matching relationship; The optional blocking action mission area is constructed according to the urban road topology and the travel information of the mobile blocking target of interest, including: According to the urban road topology and the travel information of the mobile blockade target of interest, all roads appearing on the travel route of the mobile blockade target of interest are calculated. and intersections ; According to the city's road information, get the length of all roads , the number of mobile targets that can pass through all roads at the same time is Information about the number of roads connected to the intersection ; From arrive As a starting point, construct the optional blockade mission area set , ,in Requirements: ; in, Length of travel for mobile blockade target of interest; The calculation of the mission action resources required for blocking the mobile blocking target of interest in each optional blocking action mission area includes: Calculates the set of optional blockade mission areas Mission Operations Resource Requirements and the number of roads with a moving target traffic count of 1 ; The step of selecting the optimal blocking mission area based on the mission action resources includes: Action resource requirements as per stated mission A collection of the optional blockade mission areas from low to high Sort and get a set of optional blockade mission areas with the lowest mission action resource requirements , so that: ; A collection of selectable interdiction mission areas that have the lowest resource requirements for the mission in question Internally, the number of roads with a traffic volume of 1 according to the moving target Sort from high to low and choose the best one , so that ,and Less than or equal to the maximum number of available blocked resources; The mobile blocking targets of interest are sorted along the travel route as follows: The execution time of the task action resource for the mobile blocking target of interest is respectively ; The forming of a matching relationship between the task action resource and the mobile blocking target of interest based on the optimal blocking task area, the state and the time includes: Calculate the mobile blocking target with the shortest execution time of the mission action resources, and the shortest execution time ; Based on the shortest execution time of all task action resources , select the task action resource that takes the most time and mobile blocking targets of interest The combination of is determined as the final solution, then ; Delete in pending mission action resources , delete from the pending mobile blockade targets , forming a new set of mission action resources and a set of mobile blockade targets of concern; The above steps are repeated until all mobile blockade targets of interest are allocated mission action resources to form a matching relationship between the mission action resources and the mobile blockade targets of interest.

2. An emergency task allocation system for urban mobile target blockade, used to execute the emergency task allocation method for urban mobile target blockade as claimed in claim 1, characterized in that: include; A construction module, used for constructing an optional blocking action mission area according to the urban road topology and the travel information of the mobile blocking target of interest; A calculation module, used for calculating the mission action resources required for blocking the mobile blocking target of interest in each of the optional blocking action mission areas; A selection module, used for selecting an optimal blocking mission area based on the mission action resources; A prediction module, used for predicting the state and time of the mobile blocking target of interest arriving at the optimal blocking task area based on the optimal blocking task area; A relationship matching module, used for forming a matching relationship between the task action resource and the mobile blocking target of interest based on the optimal blocking task area, the state and the time; And a determination module is used to determine the latest time for the task action resource to start executing the task based on the matching relationship.

Citation Information

Patent Citations

  • Public security resource scheduling system utilizing urban brain

    CN111338768A

  • Optimal design method for urban epidemic prevention lock line under limited inspection resources

    CN113379132A