Emergency rescue methods, systems, and platforms based on multi-dimensional information fusion
By integrating multi-dimensional information and optimizing dynamic potential fields, the problems of information gaps and traffic congestion in urban emergency rescue systems have been solved, enabling rapid and effective rescue route planning and vehicle coordination, thereby improving the efficiency of emergency rescue.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- SHANDONG MAINLAND AUTO RESCUE SERVICE CO LTD
- Filing Date
- 2025-08-27
- Publication Date
- 2026-05-26
AI Technical Summary
The existing urban emergency rescue system suffers from problems such as untimely and inaccurate information transmission and a lack of coordination among departments when dealing with traffic accidents, resulting in low rescue efficiency and difficulty in quickly reaching the accident scene in the event of traffic congestion.
By receiving rescue request information through the emergency rescue center, multi-dimensional information fusion is achieved, the optimal rescue route is planned, and the destination of congested vehicles is considered to alleviate congestion and plan avoidance routes. Dynamic potential fields are used to optimize the coordination strategy between vehicles to ensure the smoothness and efficiency of the rescue route.
It enables rapid coordination among multiple rescue parties during emergencies, ensuring timely arrival of rescue departments at the scene, improving rescue efficiency, and reducing the impact of traffic congestion on rescue efforts.
Smart Images
Figure CN121191348B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of emergency rescue technology, specifically to an emergency rescue method, system, and platform based on multi-dimensional information fusion. Background Technology
[0002] With the acceleration of urbanization, urban traffic flow is constantly increasing, and the frequency of traffic accidents and emergencies is also rising. Existing urban emergency rescue systems face numerous challenges in handling these events. These systems primarily rely on traditional communication and dispatch methods, such as telephone calls and manual dispatch. These methods are insufficient in terms of the timeliness and accuracy of information transmission, easily leading to delays in rescue efforts. Simultaneously, the lack of effective coordination mechanisms between departments makes it difficult to form a cohesive rescue operation. For example, rescue vehicles struggle to reach the accident scene quickly in congested traffic, and poor communication between departments results in low rescue efficiency.
[0003] Chinese patent CN119648011B discloses an emergency rescue method and system based on UAVs and a city 3D platform. According to a detection plan, a UAV formation is driven to the emergency area to obtain real-time regional information. The acquired real-time regional information is then used with a pre-trained accident situation image recognition algorithm to input the accident situation features into a regional 3D model for simulation processing, generating an accident simulation model. This model provides real-time accident situation feedback to assist rescue personnel in making scientific rescue decisions. Chinese patent CN116308944B discloses a digital battlefield combat command and control platform and architecture for emergency rescue. It comprehensively utilizes technologies such as real-time 3D modeling, satellite communication, converged communication, IoT sensing, and edge computing. With an intelligent command and dispatch system and an aerial rapid 3D sensing network as the core, an emergency tactical internet as the backbone, and a field IoT sensing network as the nervous system, it establishes a major disaster rescue combat system that can effectively meet the needs of rapid emergency rescue, including real-time perception, intelligent analysis, map-based dispatch, and command coordination.
[0004] Both of the aforementioned patent documents can achieve synergy in emergency rescue compared to existing traditional emergency rescue methods. However, in urban areas, once a traffic accident or other emergency occurs, it will cause severe traffic congestion. How to alleviate traffic congestion so that emergency rescue departments can quickly reach the scene is a technical problem that urgently needs to be solved in this field. Summary of the Invention
[0005] In order to solve the above-mentioned technical problems, this application proposes the following technical solution:
[0006] In a first aspect, embodiments of this application provide an emergency rescue method based on multi-dimensional information fusion, including:
[0007] The emergency response center receives rescue requests from the location of the emergency.
[0008] Based on the rescue request information, information coordination among all rescue parties is achieved, and rescue route planning is realized based on multi-dimensional information;
[0009] By combining the destinations of congested vehicles along the rescue route, traffic can be cleared and alternative routes can be planned for these vehicles.
[0010] In one possible implementation, the step of coordinating information among all rescue parties based on the rescue request information and planning rescue routes based on multi-dimensional information includes:
[0011] The emergency rescue center broadcasts the emergency event and its location to all rescue parties and receives responses from the first rescue parties, wherein the first rescue parties include multiple parties.
[0012] Traverse all connecting routes based on the location of the first rescuer and the location of the emergency event;
[0013] Send inquiry information to vehicles on each route and receive feedback information from all vehicles that respond to the inquiry information;
[0014] The optimal route is selected from all connected routes based on the feedback information.
[0015] In one possible implementation, selecting the optimal route from all connected routes based on the feedback information includes:
[0016] The road congestion index is calculated based on real-time speed data from vehicle feedback: ,in: Let be the real-time average speed of the connected path (i,j). Let (i,j) be the free-flow velocity of road segment (i,j).
[0017] The congestion update index of the connecting route is determined by combining dynamic feedback information from multiple vehicles and the congestion index of the road segment:
[0018]
[0019] in: This is a congestion update index for connecting routes. The congestion mitigation index represents the overall traffic flow on the connecting routes. Provide dynamic feedback information for vehicle k on the connecting route (i,j). It is inversely proportional to the distance of vehicle k from the next intersection. , Let K be the distance from the next intersection. The congestion penalty coefficient, It is a constant;
[0020] The probability of selecting a connectivity route is determined based on the congestion update index.
[0021]
[0022] in, The reciprocal of the length of the connected path (i,j). and They are respectively and The weights;
[0023] According to the above The optimal route for the first rescue team to reach the location of the emergency is determined as the rescue route.
[0024] In one possible implementation, the process of alleviating traffic congestion by combining the destinations of vehicles in the rescue route with the planned avoidance routes for these vehicles includes:
[0025] The congested vehicles are divided into groups based on their destinations, and the location of the emergency event is sent to all congested vehicles.
[0026] Congested vehicles plan an avoidance route based on their destination and the location of the emergency, and send the avoidance route to the emergency rescue center;
[0027] After collecting the avoidance routes of all vehicles, the emergency rescue center updates the dynamic potential field of the rescue route, which reflects the future congestion level of the rescue route.
[0028] The emergency rescue center broadcasts the dynamic potential field to all congested vehicles.
[0029] The vehicle receiving the broadcast determines its driving decision to reach the next intersection based on the updated dynamic potential field.
[0030] Once the first vehicle exits from the next intersection and arrives at the new intersection, the coordination strategy between vehicles is continuously optimized based on the actual travel time.
[0031] In one possible implementation, the emergency rescue center collects the avoidance routes of all vehicles and then updates the dynamic potential field of the rescue routes, including:
[0032]
[0033]
[0034]
[0035]
[0036] in: This is the static potential energy determined by the physical properties of the road. The dynamic potential energy is determined by real-time traffic conditions and vehicle intentions. and These are the weighting coefficients. For road section Length, For road section Maximum speed limit For road section Current vehicle density, For road section Predict vehicle density, It is an indicator function that indicates if vehicle i is expected to occupy a road segment at time t in its avoidance route. If the value is 1, then the value is 1; otherwise, it is 0. M is the total number of vehicles. It is a section of road Traffic capacity.
[0037] In one possible implementation, the vehicle receiving the broadcast determines a driving decision to reach the next intersection based on the updated dynamic potential field, including:
[0038] A path combination (P1, P2, ..., PN) is determined from the updated dynamic potential field. P1, P2, ..., PN are the avoidance paths chosen by different vehicles. A vehicle may have multiple avoidance paths, and an avoidance path may also be chosen by multiple vehicles.
[0039] Determine the travel cost of each avoidance path in the path combination, where the travel cost is the optimal solution that achieves the best avoidance and reduces travel time;
[0040] The sum of all costs for all avoidance paths is used as feedback to all vehicles to achieve dynamic control in deciding how to reach the next intersection.
[0041] In one possible implementation, determining the travel cost of each avoidance path in the path combination includes:
[0042]
[0043] in: This is the avoidance path chosen by vehicle i. This represents the set of avoidance paths chosen by all other vehicles. It is a path The sum of the potential energy of all road segments represents the estimated travel time; Vehicle i along the path The estimated total time, It is the average of the estimated travel time for all vehicles currently. It is the fairness weighting coefficient.
[0044] In one possible implementation, the step of continuously optimizing the inter-vehicle coordination strategy based on the actual travel time after the first vehicle exits from the next intersection and arrives at the new intersection includes:
[0045] Once the first vehicle exits from the next intersection and arrives at the new intersection, determine the traffic congestion situation of the avoidance section.
[0046] The second vehicle, whose avoidance path overlaps with that of the first vehicle, searches for a second avoidance path with a shorter travel time or better congestion conditions and sends it to the emergency rescue center.
[0047] The emergency rescue center updates the dynamic potential field in real time according to the second avoidance path and broadcasts it to all vehicles to be avoided;
[0048] The vehicles to be avoided update and optimize their avoidance routes based on the latest received dynamic potential field, and vehicles in the same group can share routes.
[0049] Secondly, embodiments of this application provide an emergency rescue system based on multi-dimensional information fusion, including:
[0050] The information receiving module is used by the emergency rescue center to receive rescue request information from the location of the emergency event.
[0051] The rescue route planning module is used to achieve information coordination among all rescue parties based on the rescue request information and to plan the rescue route based on multi-dimensional information;
[0052] The route congestion relief module is used to relieve congested vehicles by combining the destinations of vehicles in the rescue route and to plan alternative routes for the congested vehicles.
[0053] Thirdly, embodiments of this application provide an emergency rescue platform based on multi-dimensional information fusion, including:
[0054] Emergency command display screen;
[0055] The control platform is electrically connected to the emergency command display screen;
[0056] The control platform includes a processor, a memory, and a computer program, wherein the computer program is stored in the memory and includes instructions that, when executed by the processor, cause the scheduling platform to perform the method described in any possible implementation of the first aspect.
[0057] In this embodiment, the emergency rescue center coordinates multiple rescue parties based on the received location of the emergency event to plan the optimal rescue route. Furthermore, considering congested sections along the rescue route, it alleviates traffic congestion and plans alternative routes to avoid the emergency event location. This enables coordination among multiple rescue parties to be initiated immediately upon the occurrence of an emergency, and maximizes the time available for rescue parties to reach the emergency site, thereby improving rescue efficiency. Attached Figure Description
[0058] Figure 1 A flowchart illustrating an emergency rescue method based on multi-dimensional information fusion, provided as an embodiment of this application;
[0059] Figure 2 This is a schematic diagram of an intelligent traffic monitoring system provided in an embodiment of this application;
[0060] Figure 3 A schematic diagram of an emergency rescue system based on multi-dimensional information fusion provided in an embodiment of this application;
[0061] Figure 4 This is a schematic diagram of the scheduling platform provided in an embodiment of this application. Detailed Implementation
[0062] The present solution will now be described in conjunction with the accompanying drawings and specific embodiments.
[0063] See Figure 1 The emergency rescue method based on multi-dimensional information fusion provided in this embodiment includes:
[0064] S101, the emergency rescue center receives rescue request information from the location of the emergency.
[0065] In this embodiment, the emergency rescue center obtains information about emergency events in several ways. First, on-site personnel reports: direct reports from on-site personnel (such as witnesses or parties involved) are the fastest and most direct source of information. Second, the monitoring and alarm system: real-time warnings are triggered through monitoring equipment (such as cameras and sensors) and automatic alarm devices in the intelligent traffic monitoring system. See also... Figure 2 The diagram shown illustrates an intelligent traffic monitoring system, illustrating camera deployment information. Thirdly, there's the government emergency platform and public alert system; the government emergency platform, integrating data from multiple departments, can cover a wide range of information collection.
[0066] After receiving an emergency report, the emergency response center will make a simple record of the incident, especially its location. This location doesn't need to be detailed down to coordinates; only the road segment number needs to be identified.
[0067] S102, based on the rescue request information, information coordination among all rescue parties is achieved, and rescue route planning is realized based on multi-dimensional information.
[0068] Upon receiving an emergency alarm, the emergency rescue center broadcasts the emergency and its location to all rescue parties and receives responses from multiple first rescue parties. Based on the locations of these first rescue parties and the emergency location, the center iterates through all connecting routes, sending inquiry messages to vehicles on each route and receiving feedback from all responding vehicles. Based on this feedback, the optimal route is selected from all connecting routes.
[0069] Specifically, in this embodiment, selecting the optimal route from all connected routes based on the feedback information includes:
[0070] The road congestion index is calculated based on real-time speed data from vehicle feedback: ,in: Let be the real-time average speed of the connected path (i,j). Let be the free-flow velocity of road segment (i,j).
[0071] The congestion update index of the connecting route is determined by combining dynamic feedback information from multiple vehicles and the congestion index of the road segment:
[0072]
[0073] in: This is a congestion update index for connecting routes. The congestion mitigation index represents the overall traffic flow on the connecting routes. Provide dynamic feedback information for vehicle k on the connecting route (i,j). It is inversely proportional to the distance of vehicle k from the next intersection. , Let K be the distance from the next intersection. The congestion penalty coefficient, It is a constant.
[0074] The probability of selecting a connectivity route is determined based on the congestion update index.
[0075]
[0076] in, The reciprocal of the length of the connected path (i,j). and They are respectively and The weights;
[0077] According to the above The optimal route for the first rescue team to reach the location of the emergency is determined as the rescue route.
[0078] S103, combined with the destination of congested vehicles in the rescue route, to relieve traffic and plan avoidance routes for congested vehicles.
[0079] After determining the rescue routes for each rescue party, it is also necessary to consider the accessibility of the rescue routes, especially during morning and evening rush hours when roads are subject to greater dynamic changes. In order to ensure that the rescue parties can reach the location of the emergency as soon as possible, it is necessary to ensure the accessibility of the rescue routes to the greatest extent possible.
[0080] In this embodiment, the congested vehicles are grouped according to their destinations, and the location of the emergency event is sent to all congested vehicles. Each congested vehicle plans an avoidance route based on its destination and the location of the emergency event, and sends this avoidance route to the emergency rescue center. The emergency rescue center collects all the avoidance routes and updates the dynamic potential field of the rescue route, which reflects the future congestion level of the rescue route. The emergency rescue center broadcasts the dynamic potential field to all congested vehicles. Vehicles receiving the broadcast determine their travel decisions to reach the next intersection based on the updated dynamic potential field. Once the first vehicle exits the next intersection and arrives at the new intersection, the coordination strategy between vehicles is continuously optimized based on the actual travel time.
[0081] Specifically, after collecting the avoidance routes of all vehicles, the emergency rescue center updates the dynamic potential field of the rescue routes, including:
[0082]
[0083]
[0084]
[0085]
[0086] in: This is the static potential energy determined by the physical properties of the road. The dynamic potential energy is determined by real-time traffic conditions and vehicle intentions. and These are the weighting coefficients. For road section Length, For road section Maximum speed limit For road section Current vehicle density, For road section Predict vehicle density, It is an indicator function that indicates if vehicle i is expected to occupy a road segment at time t in its avoidance route. If the value is 1, then the value is 1; otherwise, it is 0. M is the total number of vehicles. It is a section of road Traffic capacity.
[0087] The vehicles receiving the broadcast determine their travel decisions to reach the next intersection based on the updated dynamic potential field. This includes: determining a path combination (P1, P2, ..., PN) from the updated dynamic potential field, where P1, P2, ..., PN are different avoidance paths chosen by different vehicles. A vehicle may have multiple avoidance paths, and a single avoidance path may also have multiple vehicle choices. The travel cost of each avoidance path in the path combination is determined. This travel cost is the optimal solution for achieving the best avoidance and reducing travel time. The sum of all costs for all avoidance paths is used to feed back to all vehicles for dynamic adjustment of their decisions to reach the next intersection.
[0088] In this embodiment, determining the travel cost of each avoidance path in the path combination includes:
[0089]
[0090] in: This is the avoidance path chosen by vehicle i. This represents the set of avoidance paths chosen by all other vehicles. It is a path The sum of the potential energy of all road segments represents the estimated travel time; Vehicle i along the path The estimated total time, It is the average of the estimated travel time for all vehicles currently. It is the fairness weighting coefficient.
[0091] To achieve efficient coordination among vehicles, after the first vehicle exits from the next intersection and arrives at the new intersection, the traffic congestion situation of the avoidance section is determined. The second vehicle, whose avoidance path overlaps with the first vehicle's, searches for a second avoidance path with a shorter travel time or better congestion conditions and sends this information to the emergency rescue center. The emergency rescue center updates the dynamic potential field in real time based on the second avoidance path and broadcasts it to all vehicles waiting to be avoided. The vehicles waiting to be avoided then update and optimize their avoidance routes based on the latest received dynamic potential field, with vehicles in the same group able to share routes.
[0092] In this embodiment, the vehicle to be avoided can optimize its avoidance path by continuously interacting with other vehicles and having prior knowledge of the avoidance routes of other vehicles and the traffic conditions of several avoidance routes. This not only ensures the efficiency of avoidance passage but also directly guarantees the smooth flow of rescue routes.
[0093] Corresponding to the emergency rescue method based on multi-dimensional information fusion provided in the above embodiments, this application also provides an embodiment of an emergency rescue system based on multi-dimensional information fusion.
[0094] See Figure 3 An emergency rescue system 20 based on multi-dimensional information fusion includes:
[0095] The information receiving module 201 is used by the emergency rescue center to receive rescue request information from the location of the emergency event.
[0096] The rescue route planning module 202 is used to achieve information coordination among all rescue parties based on the rescue request information and to plan the rescue route based on multi-dimensional information.
[0097] The route congestion relief module 203 is used to relieve congested vehicles by combining the destinations of vehicles in the rescue route and to plan avoidance routes for the congested vehicles.
[0098] Corresponding to the above embodiments, this application also provides an emergency rescue platform based on multi-dimensional information fusion.
[0099] The emergency rescue platform based on multi-dimensional information fusion in this embodiment includes: an emergency command display screen and a dispatching platform electrically connected to the emergency command display screen.
[0100] like Figure 4 As shown, the scheduling platform 300 may include a processor 301, a memory 302, and a communication unit 303. These components communicate through one or more buses. Those skilled in the art will understand that the scheduling platform structure shown in the figure does not constitute a limitation on the embodiments of this application. It may be a bus topology or a star topology, and may include more or fewer components than shown, or combine certain components, or have different component arrangements.
[0101] The communication unit 303 is used to establish a communication channel, enabling the dispatch platform to communicate with other devices, such as emergency rescue teams and municipal road monitoring equipment.
[0102] The processor 301 serves as the control center of the scheduling platform, connecting various parts of the platform via interfaces and lines. It executes software programs and / or modules stored in the memory 302, and calls data stored in the memory to perform various functions of the scheduling platform and / or process data. The processor can be composed of integrated circuits (ICs), such as a single packaged IC or multiple packaged ICs with the same or different functions connected together. For example, the processor 301 may consist only of a central processing unit (CPU). In this embodiment, the CPU may have a single processing core or include multiple processing cores.
[0103] Memory 302 is used to store the execution instructions of processor 301. Memory 302 can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic storage, flash memory, magnetic disk or optical disk.
[0104] When the execution instructions in memory 302 are executed by processor 301, the scheduling platform 300 is able to execute some or all of the steps in the above method embodiments.
[0105] Corresponding to the above embodiments, this application also provides a computer-readable storage medium, wherein the computer-readable storage medium may store a program, wherein when the program runs, it can control the device where the computer-readable storage medium is located to execute some or all of the steps in the above method embodiments. In specific implementation, the computer-readable storage medium may be a magnetic disk, an optical disk, read-only memory (ROM), or random access memory (RAM), etc.
[0106] In this application embodiment, "at least one" refers to one or more, and "more than one" refers to two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent the existence of A alone, the simultaneous existence of A and B, or the existence of B alone. A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects have an "or" relationship. "At least one of the following" and similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, and c can represent: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or multiple.
[0107] The above description is merely a specific embodiment of this application. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the protection scope of this application. The protection scope of this application should be determined by the protection scope of the claims.
Claims
1. An emergency rescue method based on multi-dimensional information fusion, characterized in that, include: The emergency response center receives rescue requests from the location of the emergency. Based on the rescue request information, information coordination among all rescue parties is achieved, and rescue route planning is implemented based on multi-dimensional information, including: The emergency rescue center broadcasts the emergency event and its location to all rescue parties and receives responses from the first rescue parties, wherein the first rescue parties include multiple parties. Traverse all connecting routes based on the location of the first rescuer and the location of the emergency event; Send inquiry information to vehicles on each route and receive feedback information from all vehicles that respond to the inquiry information; Based on the feedback information, the optimal route is selected from all connected routes, including: The road congestion index is calculated based on real-time speed data from vehicle feedback: ,in: Let be the real-time average speed of the connected path (i,j). Let be the free-flow velocity of the connected path (i,j); The congestion update index of the connecting route is determined by combining dynamic feedback information from multiple vehicles and the congestion index of the road segment: in: This is a congestion update index for connecting routes. The congestion mitigation index represents the overall traffic flow on the connecting routes. Provide dynamic feedback information for vehicle k on the connecting route (i,j). It is inversely proportional to the distance of vehicle k from the next intersection. , Let K be the distance from the next intersection. The congestion penalty coefficient, It is a constant; The probability of selecting a connectivity route is determined based on the congestion update index. in, The reciprocal of the length of the connected path (i,j). and They are respectively and The weights; According to the above The optimal route for the first rescue team to reach the location of the emergency is determined as the rescue route; By combining the destinations of congested vehicles along the rescue route, traffic can be cleared and alternative routes can be planned for these vehicles.
2. The emergency rescue method based on multi-dimensional information fusion according to claim 1, characterized in that, The method of easing traffic congestion by combining the destinations of vehicles in the rescue route and planning alternative routes for these vehicles includes: The congested vehicles are divided into groups based on their destinations, and the location of the emergency event is sent to all congested vehicles. Congested vehicles plan an avoidance route based on their destination and the location of the emergency, and send the avoidance route to the emergency rescue center; After collecting the avoidance routes of all vehicles, the emergency rescue center updates the dynamic potential field of the rescue route, which reflects the future congestion level of the rescue route. The emergency rescue center broadcasts the dynamic potential field to all congested vehicles. The vehicle receiving the broadcast determines its driving decision to reach the next intersection based on the updated dynamic potential field. Once the first vehicle exits from the next intersection and arrives at the new intersection, the coordination strategy between vehicles is continuously optimized based on the actual travel time.
3. The emergency rescue method based on multi-dimensional information fusion according to claim 2, characterized in that, The emergency rescue center collects the avoidance routes of all vehicles and then updates the dynamic potential field of the rescue routes, including: in: This is the static potential energy determined by the physical properties of the road. The dynamic potential energy is determined by real-time traffic conditions and vehicle intentions. and These are the weighting coefficients. For road section Length, For road section Maximum speed limit For road section Current vehicle density, For road section Predict vehicle density, It is an indicator function that indicates if vehicle i is expected to occupy a road segment at time t in its avoidance route. If the value is 1, then the value is 1; otherwise, it is 0. M is the total number of vehicles. It is a section of road Traffic capacity.
4. The emergency rescue method based on multi-dimensional information fusion according to claim 2, characterized in that, The vehicle receiving the broadcast determines its driving decision to reach the next intersection based on the updated dynamic potential field, including: A path combination (P1, P2, ..., PN) is determined from the updated dynamic potential field. P1, P2, ..., PN are the avoidance paths chosen by different vehicles. A vehicle may have multiple avoidance paths, and an avoidance path may also be chosen by multiple vehicles. Determine the travel cost of each avoidance path in the path combination, where the travel cost is the optimal solution that achieves the best avoidance and reduces travel time; The sum of all costs for all avoidance paths is used as feedback to all vehicles to achieve dynamic control in deciding how to reach the next intersection.
5. The emergency rescue method based on multi-dimensional information fusion according to claim 4, characterized in that, Determining the travel cost of each avoidance path in the path combination includes: in: This is the avoidance path chosen by vehicle i. This represents the set of avoidance paths chosen by all other vehicles. It is a path The sum of the potential energy of all road segments represents the estimated travel time; Vehicle i along the path The estimated total time, It is the average of the estimated travel time for all vehicles currently. It is the fairness weighting coefficient.
6. The emergency rescue method based on multi-dimensional information fusion according to claim 5, characterized in that, The process of continuously optimizing the inter-vehicle coordination strategy based on actual travel time after the first vehicle exits from the next intersection and arrives at the new intersection includes: Once the first vehicle exits from the next intersection and arrives at the new intersection, determine the traffic congestion situation of the avoidance section. The second vehicle, whose avoidance path overlaps with that of the first vehicle, searches for a second avoidance path with a shorter travel time or better congestion conditions and sends it to the emergency rescue center. The emergency rescue center updates the dynamic potential field in real time according to the second avoidance path and broadcasts it to all vehicles to be avoided; The vehicles to be avoided update and optimize their avoidance routes based on the latest received dynamic potential field, and vehicles in the same group can share routes.
7. An emergency rescue system based on multi-dimensional information fusion, characterized in that, Performing the method of claim 1, comprising: The information receiving module is used by the emergency rescue center to receive rescue request information from the location of the emergency event. The rescue route planning module is used to achieve information coordination among all rescue parties based on the rescue request information and to plan the rescue route based on multi-dimensional information; The route congestion relief module is used to relieve congested vehicles by combining the destinations of vehicles in the rescue route and to plan alternative routes for the congested vehicles.
8. An emergency rescue platform based on multi-dimensional information fusion, characterized in that, include: Emergency command display screen; The dispatch platform is electrically connected to the emergency command display screen; The scheduling platform includes a processor, a memory, and a computer program, wherein the computer program is stored in the memory and includes instructions that, when executed by the processor, cause the scheduling platform to perform the method according to any one of claims 1 to 6.