Emergency rescue route planning method and device, electronic equipment and storage medium

By receiving accident location information and optimizing path selection of community signal strength, the problem of untimely rescue vehicles seeking help in emergencies is solved, and efficient rescue path planning and communication stability are achieved.

CN119071762APending Publication Date: 2024-12-03CHINA MOBILE GROUP DESIGN INST +1
View PDF 0 Cites 3 Cited by

Patent Information

Application Number
CN202411309481.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-09-19
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

In an emergency, vehicles are not promptly requested for help. Existing smart vehicles require high-bandwidth network resources during rescue, but the base station cannot reserve wireless resources in time, resulting in rescue delays.

Method used

By receiving accident location information, multiple paths of rescue vehicles are determined based on the pre-built road network, and the target path and access base station are selected based on the cell signal strength, and the path is optimized using genetic algorithms to ensure optimal signal and stable communication.

Benefits of technology

The optimal path planning and network connection of rescue vehicles in emergencies ensure communication stability and efficiency of the rescue process.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119071762A_ABST
    Figure CN119071762A_ABST
Patent Text Reader

Abstract

The invention provides an emergency rescue route planning method and device, electronic equipment and a storage medium. The method comprises the following steps: receiving accident position information of an accident vehicle in a target area; based on the accident position information and a pre-constructed road network, determining a plurality of paths for the rescue vehicle to go to the accident vehicle; on the basis of a preset distance threshold value, dividing each path to obtain a plurality of point locations; and based on the signal intensity of the cell to which each point location belongs, determining a target path of the rescue vehicle to the accident vehicle and a base station accessed when the rescue vehicle passes through each point location. The optimal target path for the accident vehicle is determined. In the process of going to the accident vehicle based on the target path and based on the signal intensity of the cell to which each point belongs, the base station to which the rescue vehicle accesses when passing through each point is determined so as to ensure that the rescue vehicle always receives the best signal in the process of driving in the target path, the stability of communication is ensured, and the rescue process is guaranteed.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of intelligent transportation technology, and in particular to a route planning method, device, electronic equipment and storage medium for emergency rescue. Background Art

[0002] Internet of Vehicles technology plays an increasingly important role in intelligent transportation systems. In emergency situations such as traffic accidents, natural disasters, and engineering accidents, vehicles often rely on calling the police for help. The location of the traffic accident may be difficult to describe clearly, the call for help may not be timely, and subsequent vehicles may continue to drive on the road without knowing the situation, causing congestion.

[0003] Existing smart vehicles need to obtain real-time information about the accident scene and transmit the condition of the injured in real time during rescue operations, so rescue vehicles require high-bandwidth network resources. When rescue vehicles are heading to the accident scene or transporting the injured, they will pass through different communities, where the network conditions are different. There may be problems where the base station cannot reserve the required wireless resources for the rescue vehicle in time or frequent switching affects the network experience, resulting in rescue delays. Summary of the invention

[0004] The present invention provides a route planning method, device, electronic device and storage medium for emergency rescue, which are used to ensure that the rescue vehicle travels on the optimal path and obtains the optimal network connection during the rescue.

[0005] The present invention provides a route planning method for emergency rescue, comprising the following steps: Receiving accident location information of an accident vehicle in a target area; Determine multiple paths for rescue vehicles to reach the accident vehicle based on the accident location information and a pre-constructed road network, wherein the road network is a network constructed with roads in the target area as edges, intersections in the target area as points, and weight information of each road, wherein the weight information of the road is determined based on the length of the road, the number of lanes, and the road quality; Based on the preset distance threshold, each path is divided respectively to obtain multiple points corresponding to each path; Based on the signal strength of the cell to which each point belongs, the target path of the rescue vehicle to the accident vehicle and the base station to which the rescue vehicle accesses when passing each point in the target path are determined.

[0006] According to a route planning method for emergency rescue provided by the present invention, based on the signal strength of the cell to which each point belongs, a target path for the rescue vehicle to reach the accident vehicle and a base station to be accessed when the rescue vehicle passes each point in the target path are determined, including: An access matrix is ​​constructed based on each point and the cells accessed by each point; Based on the genetic algorithm, the access matrix is ​​solved to determine the target path of the rescue vehicle to the accident vehicle and the base station accessed by the rescue vehicle when passing through each point in the target path. The adaptability function of the genetic algorithm is determined based on the sum of the cell scores of the points and the data transmission interruption time caused by cell switching. The cell score is determined based on the distance of the rescue vehicle within the cell range when traveling on the path, the received signal strength and the number of access users in the cell.

[0007] According to a method for planning an emergency rescue route provided by the present invention, the cell score is: ; Among them, S is the cell score, k is the coefficient, distance is the distance of the rescue vehicle within the cell range when driving on the path, RSSI is the received signal strength, and numUser is the number of access users in the cell.

[0008] According to a route planning method for emergency rescue provided by the present invention, the receiving of accident location information of an accident vehicle in a target area includes: The accident location information of the accident vehicle is received from a roadside unit arranged around a road in a target area, wherein the accident location information is determined based on the accident warning information sent by the vehicle-mounted terminal of the accident vehicle and received by the roadside unit.

[0009] According to a method for planning an emergency rescue route provided by the present invention, the weight information of the road is: ; Among them, M is the weight information of the road, G is the coefficient, and L is the length of the road. is the number of vehicles and Q is the road quality.

[0010] According to a route planning method for emergency rescue provided by the present invention, the method determines multiple paths for rescue vehicles to reach the accident vehicle based on the accident location information and a pre-constructed road network, including: Based on the accident location information and the pre-built road network, the path algorithm Dijkstra algorithm is called to calculate multiple paths between the rescue vehicle and the destination.

[0011] A method for planning an emergency rescue route according to the present invention also includes: In the process of the rescue vehicle heading towards the accident vehicle based on the target path, the traffic accident information of the accident vehicle is obtained, and the traffic accident information is sent to the rescue vehicle based on the high-priority dedicated network slice created by the base station.

[0012] The present invention also provides a route planning device for emergency rescue, comprising the following modules: An information receiving module, used to receive accident location information of the accident vehicle in the target area; A path determination module, for determining multiple paths for rescue vehicles to reach the accident vehicle based on the accident location information and a pre-constructed road network, wherein the road network is a network constructed with roads in the target area as edges, intersections in the target area as points, and weight information of each road, wherein the weight information of the road is determined based on the length of the road, the number of lanes, and the quality of the road; A point determination module is used to divide each path based on a preset distance threshold to obtain multiple points corresponding to each path; The planning module is used to determine the target path for the rescue vehicle to the accident vehicle and the base station to be accessed when the rescue vehicle passes each point in the target path based on the signal strength of the cell to which each point belongs.

[0013] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the emergency rescue route planning method as described in any one of the above is implemented.

[0014] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the route planning method for emergency rescue as described in any one of the above is implemented.

[0015] The route planning method, device, electronic device and storage medium for emergency rescue provided by the present invention determine the best target path for the rescue vehicle to the accident vehicle based on a pre-built road network. In the process of the rescue vehicle heading to the accident vehicle based on the target path, the base station to which the rescue vehicle accesses when passing each point is determined based on the signal strength of the cell to which each point belongs, so as to ensure that the rescue vehicle always receives the best signal during the process of driving on the target path, ensure the stability of communication, and guarantee the rescue process. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0017] Figure 1 It is a flow chart of the route planning method for emergency rescue provided by the present invention.

[0018] Figure 2 It is a structural schematic diagram of the vehicle networking highway emergency system provided by the present invention.

[0019] Figure 3 It is a schematic diagram of the passing distance provided by the present invention.

[0020] Figure 4 It is a schematic diagram of the calculation flow of multiple paths provided by the present invention.

[0021] Figure 5 It is a schematic diagram of the rescue process provided by the present invention.

[0022] Figure 6 It is a structural schematic diagram of the route planning device for emergency rescue provided by the present invention.

[0023] Figure 7 It is a structural schematic diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION

[0024] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0025] Internet of Vehicles technology plays an increasingly important role in intelligent transportation systems. In related methods, in emergency situations such as traffic accidents, natural disasters, and engineering accidents, vehicles often rely on telephone calls to call for help. The location of the traffic accident may be difficult to describe clearly, the call for help may not be timely, and subsequent vehicles may continue to drive on the road without knowing it, causing congestion. Existing vehicle navigation systems and route planning algorithms do not distinguish between vehicles and users, and rescue vehicles are easily blocked by ordinary vehicles, resulting in rescue delays.

[0026] The shortcomings of the related methods are: Rely on calling the police, verbally describing the accident location, and providing vague information; Route planning algorithms usually only consider the shortest path, but in emergency situations, factors such as road conditions, traffic flow, and the priority of rescue vehicles need to be considered; The rescue vehicle may require high-bandwidth network resources, and the base station cannot reserve the required wireless resources for the rescue vehicle in time.

[0027] In view of the defects of the related methods, the present invention provides a route planning method for emergency rescue. Figure 1 is a flow chart of the route planning method for emergency rescue provided by the present invention, such as Figure 1As shown, the method includes the following: Step 110, receiving accident location information of the accident vehicle in the target area; Step 120, based on the accident location information and a pre-constructed road network, determining multiple paths for rescue vehicles to reach the accident vehicle, wherein the road network is a network constructed with roads in the target area as edges, road conditions in the target area as points, and weight information of each road, wherein the weight information of the road is determined based on the length of the road, the number of lanes, and the road quality; Step 130, based on a preset distance threshold, each path is divided to obtain a plurality of points corresponding to each path; Step 140, based on the signal strength of the cell to which each point belongs, determine the target path of the rescue vehicle to the accident vehicle, and the base station accessed by the rescue vehicle when passing each point in the target path.

[0028] The cell in the present invention is a wireless signal coverage area covered by a base station or a part of a base station in a mobile communication system. In this area, a mobile station (such as a mobile phone, a wireless terminal, etc.) can communicate with the base station through a wireless channel.

[0029] The execution subject of the route planning method for emergency rescue provided by the present invention can be an electronic device, a component in an electronic device, an integrated circuit, or a chip. The electronic device can be a mobile electronic device or a non-mobile electronic device. Exemplarily, the mobile electronic device can be a mobile phone, a tablet computer, a laptop computer, a PDA, an ultra-mobile personal computer (UMPC), a netbook, or a personal digital assistant (PDA), etc., and the non-mobile electronic device can be a server, a network attached storage (NAS), or a personal computer (PC), etc., which is not specifically limited by the present invention.

[0030] The following takes the method for planning the route for emergency rescue provided by the present invention executed by a computer as an example to describe the technical solution of the present invention in detail.

[0031] In step 110 , accident location information of an accident vehicle in a target area is received.

[0032] Specifically, when a vehicle has an accident in the target area, the vehicle's on-board sensors detect a traffic accident. If the on-board system determines that the collision is not serious, a pop-up window will appear on the on-board screen to ask the driver whether to alarm with one click. The driver can manually cancel it before the countdown ends. Considering that the accident vehicle may not be a smart car, passing vehicles can also record the accident scene through the on-board camera. The built-in AI algorithm detects that a traffic accident may have occurred, asks the driver for consent, and uploads the image to the roadside unit RSU and alarms with one click.

[0033] RSU is one of the key nodes in the Internet of Vehicles system. It is located next to the road, receives accident information uploaded by the vehicle terminal, and broadcasts it locally. RSU is also responsible for obtaining feedback from nearby vehicles in order to more accurately judge the accident situation. The functions of RSU include: Receiving and broadcasting accident information: RSU receives accident data uploaded by the vehicle terminal, such as the location, time and severity of the collision. Verifying feedback from nearby vehicles: RSU sends a request to nearby vehicles to ask if there are any vehicles that witnessed the accident. This can be done through feedback from the vehicle camera or in the form of a pop-up window.

[0034] The RSU broadcasts locally and verifies with nearby vehicles to obtain feedback from nearby vehicles. This can be feedback from the on-board camera or a pop-up window for manual confirmation by nearby drivers. The image analysis part can be completed by the nearest edge computing node.

[0035] The highway emergency system makes a comprehensive assessment based on multiple pieces of evidence. If it is determined to be a false alarm of a traffic accident, the process ends and the relevant results are recorded in the database to facilitate the improvement of the AI ​​algorithm. If the judgment result is true, the corresponding plan is activated according to the level and the results are sent to the relevant departments and vehicles.

[0036] When it is determined to be a real accident, the accident position information of the accident vehicle is received.

[0037] In step 120, multiple paths for rescue vehicles to reach the accident vehicle are determined based on the accident location information and a pre-constructed road network. The road network is a network constructed with roads in the target area as edges, intersections in the target area as points, and weight information of each road. The weight information of the road is determined based on the length of the road, the number of lanes, and the road quality.

[0038] Pre-build the road network of the entire target area. You can define intersections as points, roads as edges, and edge weights = coefficient × road length / (number of lanes × road quality).

[0039] Among them, the road quality score can be given by the map provider, which is a subjective score of indicators such as road surface flatness. If there is no road between two points, the corresponding edge weight is set to infinity.

[0040] Optionally, call the Dijkstra algorithm to calculate the shortest path between the rescue vehicle and the destination, assuming it is ABCD, then set AB, BC, and CD to be disconnected in turn, and call the Dijkstra algorithm three times to find the shortest path between the rescue vehicle and the destination as an alternative path. Based on the determined shortest path and alternative paths, multiple paths can be used as subsequent rescue vehicles for rescue.

[0041] In step 130, each path is divided based on a preset distance threshold to obtain a plurality of points corresponding to each path.

[0042] It is understandable that the operator's road test data contains the base station signal strength received at different positions on the road POS={pos1,pos2…posM}, but these positions are usually discrete points. The preset distance threshold delta=10m is defined. If two adjacent points in the road test data exceed delta, linear interpolation is used to supplement the new points to ensure that the geographical distance between adjacent points is less than delta, so as to realize the division process of each path. After the division is completed, multiple points in each path are obtained. Among them, the preset distance threshold can be adjusted according to the actual situation.

[0043] In step 140, based on the signal strength of the cell to which each point belongs, the target path of the rescue vehicle to the accident vehicle and the base station to which the rescue vehicle accesses when passing each point in the target path are determined.

[0044] It is understandable that rescue vehicles such as ambulances may need high-definition video transmission of the on-site accident in order to transmit the condition of the injured to the rescue center in real time. While the rescue vehicle is driving on the target path, it passes through each point on the target path. A base station is composed of several cells. Because there are overlapping areas between different base stations, one point may correspond to multiple base stations. For this point, the signal strength of different base stations is different.

[0045] Based on the signal strength of the cell to which each point belongs, the optimal target path for the rescue vehicle to the accident vehicle can be determined. After the target path is determined, the base station to which the rescue vehicle accesses when passing each point in the target path can be further determined to ensure signal reception by the rescue vehicle.

[0046] When the rescue vehicle is heading towards the accident vehicle based on the target path, the base station to which the rescue vehicle connects when passing each point is determined based on the signal strength of the cell to which each point belongs, so as to ensure that the rescue vehicle always receives the best signal while driving on the target path, thereby ensuring the stability of communication.

[0047] Optional, such as Figure 2As shown in the structural schematic diagram of the vehicle-to-vehicle highway emergency system provided by the present invention, a vehicle-to-vehicle highway emergency system can be constructed to realize route planning and rescue processes.

[0048] The vehicle terminal is one of the key components of this system. It is equipped with a variety of sensors to detect traffic accidents and upload relevant information to the roadside unit (RSU). The perception module includes but is not limited to: Airbag sensor: detects whether the vehicle has collided and triggers the accident alarm.

[0049] Pressure sensor: monitors pressure changes in the vehicle, such as when the vehicle is hit by external force.

[0050] Collision Detection Sensor: Identifies collisions between the vehicle and other objects.

[0051] The communication module is used to communicate with RSU, 5G base stations and other vehicles.

[0052] The navigation module is equipped with a positioning system that can indicate the vehicle's location.

[0053] Roadside Unit: RSU is one of the key nodes in the Internet of Vehicles system. It is located next to the road, receives accident information uploaded by the vehicle terminal, and broadcasts it locally. RSU is also responsible for obtaining feedback information from nearby vehicles to more accurately judge the accident situation. The functions of RSU include: Receiving and broadcasting accident information: RSU receives accident data uploaded by the vehicle terminal, such as the location, time and severity of the collision.

[0054] Verify feedback from nearby vehicles: The RSU sends a request to nearby vehicles to ask if there are any vehicles that witnessed the accident. This can be done through feedback from the on-board camera or in the form of a pop-up window.

[0055] The roadside 5G base station is another key component of this system. It creates a high-priority dedicated network slice to meet the communication needs of rescue vehicles. Specific functions include: Dedicated network slice allocation: Based on the communication needs of rescue vehicles, roadside base stations allocate dedicated wireless resources to ensure that rescue vehicles obtain high-bandwidth, low-latency communication services.

[0056] Information distribution: Roadside base stations transmit information about traffic accidents ahead to vehicles that may be affected, and distribute new driving routes.

[0057] The Traffic Data Center is the intelligent analysis center of this system. It collects, stores and analyzes traffic accident data, predicts the possibility of accidents, and optimizes traffic flow management. The main functions include: Data collection and storage: The traffic data center collects accident data from vehicle terminals and RSUs and stores them in the database.

[0058] AI analysis module: The built-in AI analysis module analyzes accident data and predicts the possibility of an accident. For example, it determines whether it is a real accident based on historical data and road conditions.

[0059] The fire rescue agency is the final executor of this system. Based on the comprehensive evaluation of multiple evidences, the corresponding plan is initiated and the results are sent to relevant departments and vehicles. Specific functions include: Plan activation: Based on the analysis results of the traffic data center, determine whether it is a real accident and activate the corresponding plan.

[0060] Result distribution: The plan results will be distributed to traffic management departments, medical rescue agencies and vehicles in nearby areas.

[0061] The route planning method for emergency rescue provided by the present invention determines the best target path for the rescue vehicle to the accident vehicle based on a pre-built road network. In the process of the rescue vehicle heading to the accident vehicle based on the target path, the base station to which the rescue vehicle accesses when passing through each point is determined based on the signal strength of the cell to which each point belongs, so as to ensure that the clock receives the best signal during the rescue vehicle's driving on the target path, ensure the stability of communication, and guarantee the rescue process.

[0062] In one embodiment, based on the signal strength of the cell to which each point belongs, the target path of the rescue vehicle to the accident vehicle and the base station accessed by the rescue vehicle when passing each point in the target path are determined, including: constructing an access matrix based on each point and the cell accessed by each point; solving the access matrix based on a genetic algorithm to determine the target path of the rescue vehicle to the accident vehicle and the base station accessed by the rescue vehicle when passing each point in the target path, the adaptability function of the genetic algorithm is determined based on the sum of the cell scores of the points and the data transmission interruption time caused by cell switching, and the cell score is determined based on the distance of the rescue vehicle within the cell range when traveling on the path, the received signal strength and the number of access users in the cell.

[0063] The cell scores are: ; Among them, S is the cell score, distance is the distance of the rescue vehicle within the cell range when driving on the path, RSSI is the received signal strength, and numUser is the number of access users in the cell.

[0064] Specifically, after dividing each path, we get different points POS={pos1, pos2…posM} in the path. Define the set of base stations along the road as BS={BS1,…BSi}. Each base station is composed of several cells. Assume that there are N cells available for access, which are {cell1,…cellN}. Rescue vehicles do not need to access all of them because there are overlapping areas between base stations. At this time, the path is described by multiple discrete points POS. The access matrix A is used to describe which cell is accessed at each point. It has M rows and N columns. A(i, j)=1 means accessing cell j at pos i, otherwise it is 0. Use the following method to calculate the cell score: ; Among them, S is the cell score, k is the coefficient, distance is the distance of the rescue vehicle within the cell range when driving on the path, RSSI is the received signal strength, and numUser is the number of access users in the cell.

[0065] The passing distance is the estimated driving distance of the vehicle in the cell, such as Figure 3 The schematic diagram of the passing distance provided by the present invention is shown. The value is derived from the calculation based on the geographic location. A large value means that the base station coverage is good and frequent switching can be avoided. The received signal strength is the signal strength that the vehicle can receive at the pos position. The value is derived from the road test data. A large value means that the network condition is good. The number of access users reflects the current idleness of the cell. The more idle it is, the higher the switching success rate. The data comes from the real-time collection of base station side information by the traffic data center.

[0066] Based on the genetic algorithm, the solution process for the access matrix A can be: Initialize the seed: randomly generate multiple A; Adaptability function: F(A)=S(A) / D(A), where S(A) is the sum of the cell scores accessed at all locations along the way. D(A) reflects the data transmission interruption time caused by cell switching, where the interruption time caused by switching across base stations is greater than the interruption time caused by switching between different cells on the same base station. The interruption time refers to the time from the triggering of the switching operation to the time when the mobile node switches from the source cell to the target cell and starts communicating. This data is derived from historical data statistics. If there is no switching in the middle, D(A)=1.

[0067] A needs to conform to the actual situation. When the vehicle is at the POS position, it can only select 0 or 1 access from multiple cells covering the area. If it does not conform, A is directly judged to be invalid.

[0068] Crossover: arbitrarily select multiple pairs of A, random starting and ending points, exchange element contents, and update A

[0069] Compile: Select multiple A at random, change 1 to 0, 0 to 1, and update A

[0070] Elimination: Substitute the fitness function into the output value proportional to the survival probability.

[0071] End: Stop after running the specified number of rounds and get the best A and F(A); According to the above steps, the best A and F(A) under each path are calculated, and the base station that the rescue vehicle accesses when passing through each point is determined based on the determined A. This ensures both the data transmission rate along the way and a relatively short driving route.

[0072] When the number of determined paths is k, the calculation process can be as follows: Figure 4 The calculation flow diagram of multiple paths provided by the present invention is shown as follows. The best A and F(A) under each path can be calculated, and res=alpha×F(A) / path is calculated, and the path with the largest res value is selected. Among them, alpha is a hyperparameter, which is specified according to the actual situation.

[0073] In one embodiment, receiving accident location information of an accident vehicle in a target area includes: receiving accident location information of the accident vehicle sent by a roadside unit set up around the road in the target area, wherein the accident location information is determined based on accident warning information sent by an onboard terminal of the accident vehicle and received by the roadside unit.

[0074] Specifically, when a vehicle has an accident in the target area, the vehicle's on-board sensor detects a traffic accident. If the on-board system determines that the collision is not serious, a pop-up window will appear on the on-board screen to ask the driver whether to alarm with one click. The driver can manually cancel it before the countdown ends. Considering that the accident vehicle may not be a smart car, passing vehicles can also record the accident scene through the on-board camera. The built-in AI algorithm detects that a traffic accident may have occurred, asks the driver for consent, and uploads the accident alarm information to the roadside unit RSU.

[0075] The RSU broadcasts locally and verifies with nearby vehicles to obtain feedback from nearby vehicles. This can be feedback from the on-board camera or a pop-up window for manual confirmation by nearby drivers. The image analysis part can be completed by the nearest edge computing node.

[0076] The highway emergency system makes a comprehensive assessment based on multiple pieces of evidence. If it is determined to be a false alarm of a traffic accident, the process ends and the relevant results are recorded in the database to facilitate the improvement of the AI ​​algorithm. If the judgment result is true, the corresponding plan is activated according to the level and the results are sent to the relevant departments and vehicles.

[0077] Based on the received accident warning information, the accident location information is determined.

[0078] In one embodiment, the weight information of the road is: ; Among them, M is the weight information of the road, G is the coefficient, and L is the length of the road. is the number of vehicles and Q is the road quality.

[0079] It can be understood that determining the rescue vehicle's selected path based on road weight information (including road length, number of lanes, and road quality) has the following advantages: By choosing a shorter road, the time it takes for rescue vehicles to reach the accident scene can be significantly reduced, allowing rescue operations to be carried out more quickly.

[0080] Taking into account the number of lanes and road quality, rescue vehicles can avoid congested sections and choose roads with greater capacity, further shortening rescue time.

[0081] Reasonable planning of rescue routes based on road weight information can avoid the waste of rescue resources and ensure that more rescue tasks are completed with limited resources.

[0082] In one embodiment, based on the accident location information and a pre-constructed road network, multiple paths for the rescue vehicle to reach the accident vehicle are determined, including: based on the accident location information and the pre-constructed road network, calling the path algorithm Dijkstra algorithm to calculate multiple paths between the rescue vehicle and the destination.

[0083] Optionally, the Dijkstra algorithm is called to calculate the shortest path between the rescue vehicle and the destination based on the accident location information and the pre-built road network, assuming it is ABCD, and then AB, BC, and CD are set to be disconnected in turn, and the Dijkstra algorithm is called three times to find the shortest path between the rescue vehicle and the destination as an alternative path. Based on the determined shortest path and alternative paths, multiple paths can be used as rescue paths for subsequent rescue vehicles.

[0084] Among them, the Dijkstra algorithm is an algorithm for finding the shortest path from a single source in a graph. The core idea is to gradually find the shortest path from the source point to all other nodes by gradually increasing the set of nodes with the shortest path determined.

[0085] In one embodiment, it also includes: in the process of the rescue vehicle heading towards the accident vehicle based on the target path, obtaining traffic accident information of the accident vehicle, and sending the traffic accident information to the rescue vehicle based on the high-priority dedicated network slice created by the base station.

[0086] Optionally, the specific rescue process can be as follows Figure 5 As shown in the rescue process diagram provided by the present invention, specifically, when a vehicle has an accident in the target area, the vehicle's on-board sensor detects a traffic accident. If the on-board system determines that the collision is not serious, a pop-up window may appear on the on-board large screen to ask the driver whether to alarm with one key, and the driver may manually cancel it before the countdown ends. Considering that the accident vehicle may not be a smart car, passing vehicles can also record the accident scene through the on-board camera. The built-in AI algorithm detects that a traffic accident may have occurred, and asks the driver for consent and uploads the image to the roadside unit RSU and alarms with one key.

[0087] The RSU broadcasts locally and verifies with nearby vehicles to obtain feedback from nearby vehicles. This can be feedback from the on-board camera or a pop-up window for manual confirmation by nearby drivers. The image analysis part can be completed by the nearest edge computing node.

[0088] The highway emergency system makes a comprehensive assessment based on multiple pieces of evidence. If it is determined to be a false alarm of a traffic accident, the process ends and the relevant results are recorded in the database to facilitate the improvement of the AI ​​algorithm. If the judgment result is true, the corresponding plan is activated according to the level and the results are sent to the relevant departments and vehicles.

[0089] When it is determined to be a real accident, the traffic control department is notified, the medical rescue agency is notified, and the situation of nearby vehicles is obtained based on the RSU.

[0090] When the rescue vehicle is heading towards the accident vehicle based on the target path, the 5G base station will create a high-priority dedicated network slice, transmit information about the traffic accident ahead to vehicles that may be affected, issue a new driving path, and provide video transmission services for the rescue vehicle.

[0091] The base station will allocate dedicated wireless resources to the slice, and appropriately reduce the proportion of video resources occupied by other low-priority services, or terminate some entertainment audio and video service network slices in advance. After calculating the best driving path for the rescue vehicle, the edge computing node will send it to the RSU and base stations along the way. The RSU captures the current location of the rescue vehicle. The base stations along the way will calculate the expected access time based on the current location, speed, etc., and reserve wireless resources for the video transmission service in advance. The number of bytes to be reserved = video transmission rate requirement × (vehicle driving distance within the cell coverage area / vehicle speed-cell switching time).

[0092] A distributed emergency center can be set up to prevent a single point failure from causing the entire system to fail. Some functions can be moved to multi-access edge computing (MEC) nodes to reduce the pressure on the transmission network and reduce the latency of key services.

[0093] The route planning device for emergency rescue provided by the present invention is described below. The route planning device for emergency rescue described below and the route planning method for emergency rescue described above can be referred to each other.

[0094] like Figure 6 As shown, the device comprises: The information receiving module 610 is used to receive the accident location information of the accident vehicle in the target area; A path determination module 620 is used to determine multiple paths for rescue vehicles to reach the accident vehicle based on the accident location information and a pre-constructed road network, wherein the road network is a network constructed with roads in the target area as edges, intersections in the target area as points, and weight information of each road, wherein the weight information of the road is determined based on the length of the road, the number of lanes, and the road quality; The point determination module 630 is used to divide each path based on a preset distance threshold to obtain multiple points corresponding to each path; The planning module 640 is used to determine the target path of the rescue vehicle to the accident vehicle and the base station to be accessed when the rescue vehicle passes each point in the target path based on the signal strength of the cell to which each point belongs.

[0095] The route planning device for emergency rescue provided by the present invention determines the best target path for the rescue vehicle to the accident vehicle based on a pre-built road network. In the process of the rescue vehicle heading to the accident vehicle based on the target path, the base station to which the rescue vehicle accesses when passing through each point is determined based on the signal strength of the cell to which each point belongs, so as to ensure that the rescue vehicle always receives the best signal during the process of driving on the target path, ensure the stability of communication, and guarantee the rescue process.

[0096] In one embodiment, the planning module 640 is specifically used to: Determining a target path for the rescue vehicle to reach the accident vehicle and a base station to be accessed by the rescue vehicle when passing through each point in the target path based on the signal strength of the cell to which each point belongs, including: An access matrix is ​​constructed based on each point and the cells accessed by each point; Based on the genetic algorithm, the access matrix is ​​solved to determine the target path of the rescue vehicle to the accident vehicle and the base station accessed by the rescue vehicle when passing through each point in the target path. The adaptability function of the genetic algorithm is determined based on the sum of the cell scores of the points and the data transmission interruption time caused by cell switching. The cell score is determined based on the distance of the rescue vehicle within the cell range when traveling on the path, the received signal strength and the number of access users in the cell.

[0097] In one embodiment, the planning module 640 is further specifically configured to: The cell score is determined as: ; Among them, S is the cell score, k is the coefficient, distance is the distance of the rescue vehicle within the cell range when driving on the path, RSSI is the received signal strength, and numUser is the number of access users in the cell.

[0098] In one embodiment, the information receiving module 610 is specifically used for: The receiving of accident location information of the accident vehicle in the target area includes: The accident location information of the accident vehicle is received from a roadside unit arranged around a road in a target area, wherein the accident location information is determined based on the accident warning information sent by the vehicle-mounted terminal of the accident vehicle and received by the roadside unit.

[0099] In one embodiment, the path determination module 620 is specifically used to: Determine the weight information of the road: ; Among them, M is the weight information of the road, G is the coefficient, and L is the length of the road. is the number of vehicles and Q is the road quality.

[0100] In one embodiment, the path determination module 620 is further specifically configured to: The method of determining multiple paths for rescue vehicles to reach the accident vehicle based on the accident location information and the pre-constructed road network includes: Based on the accident location information and the pre-built road network, the path algorithm Dijkstra algorithm is called to calculate multiple paths between the rescue vehicle and the destination.

[0101] In one embodiment, the planning module 640 is further specifically configured to: In the process of the rescue vehicle heading towards the accident vehicle based on the target path, the traffic accident information of the accident vehicle is obtained, and the traffic accident information is sent to the rescue vehicle based on the high-priority dedicated network slice created by the base station.

[0102] Figure 7 An example of a physical structure diagram of an electronic device is shown in FIG. Figure 7As shown, the electronic device may include: a processor 710, a communications interface 720, a memory 730 and a communication bus 740, wherein the processor 710, the communications interface 720 and the memory 730 communicate with each other through the communication bus 740. The processor 710 may call the logic instructions in the memory 730 to execute the route planning method for emergency rescue, which includes: Receiving accident location information of an accident vehicle in a target area; Determine multiple paths for rescue vehicles to reach the accident vehicle based on the accident location information and a pre-constructed road network, wherein the road network is a network constructed with roads in the target area as edges, intersections in the target area as points, and weight information of each road, wherein the weight information of the road is determined based on the length of the road, the number of lanes, and the road quality; Based on the preset distance threshold, each path is divided respectively to obtain multiple points corresponding to each path; Based on the signal strength of the cell to which each point belongs, the target path of the rescue vehicle to the accident vehicle and the base station to which the rescue vehicle accesses when passing each point in the target path are determined.

[0103] In addition, the logic instructions in the above-mentioned memory 730 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on this understanding, the technical solution of the present invention can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium, including several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc. Various media that can store program codes.

[0104] On the other hand, the present invention further provides a computer program product, the computer program product includes a computer program, the computer program can be stored in a non-transitory computer-readable storage medium, when the computer program is executed by a processor, the computer can execute the emergency rescue route planning method provided by the above methods, the method includes: Receiving accident location information of an accident vehicle in a target area; Determine multiple paths for rescue vehicles to reach the accident vehicle based on the accident location information and a pre-constructed road network, wherein the road network is a network constructed with roads in the target area as edges, intersections in the target area as points, and weight information of each road, wherein the weight information of the road is determined based on the length of the road, the number of lanes, and the road quality; Based on the preset distance threshold, each path is divided respectively to obtain multiple points corresponding to each path; Based on the signal strength of the cell to which each point belongs, the target path of the rescue vehicle to the accident vehicle and the base station to which the rescue vehicle accesses when passing each point in the target path are determined.

[0105] In another aspect, the present invention further provides a non-transitory computer-readable storage medium having a computer program stored thereon, which is implemented when the computer program is executed by a processor to execute the route planning method for emergency rescue provided by the above methods, the method comprising: Receiving accident location information of an accident vehicle in a target area; Determine multiple paths for rescue vehicles to reach the accident vehicle based on the accident location information and a pre-constructed road network, wherein the road network is a network constructed with roads in the target area as edges, intersections in the target area as points, and weight information of each road, wherein the weight information of the road is determined based on the length of the road, the number of lanes, and the road quality; Based on the preset distance threshold, each path is divided respectively to obtain multiple points corresponding to each path; Based on the signal strength of the cell to which each point belongs, the target path of the rescue vehicle to the accident vehicle and the base station to which the rescue vehicle accesses when passing each point in the target path are determined.

[0106] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.

[0107] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0108] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A route planning method for emergency rescue, It is characterized in that The method comprises: Receiving accident location information of an accident vehicle in a target area; Determine multiple paths for rescue vehicles to reach the accident vehicle based on the accident location information and a pre-constructed road network, wherein the road network is a network constructed with roads in the target area as edges, intersections in the target area as points, and weight information of each road, wherein the weight information of the road is determined based on the length of the road, the number of lanes, and the road quality; Based on the preset distance threshold, each path is divided respectively to obtain multiple points corresponding to each path; Based on the signal strength of the cell to which each point belongs, the target path of the rescue vehicle to the accident vehicle and the base station to which the rescue vehicle accesses when passing each point in the target path are determined.

2. The route planning method for emergency rescue according to claim 1, It is characterized in that The method of determining the target path of the rescue vehicle to the accident vehicle and the base station accessed by the rescue vehicle when passing through each point in the target path based on the signal strength of the cell to which each point belongs includes: An access matrix is ​​constructed based on each point and the cells accessed by each point; Based on the genetic algorithm, the access matrix is ​​solved to determine the target path of the rescue vehicle to the accident vehicle and the base station accessed by the rescue vehicle when passing through each point in the target path. The adaptability function of the genetic algorithm is determined based on the sum of the cell scores of the points and the data transmission interruption time caused by cell switching. The cell score is determined based on the distance of the rescue vehicle within the cell range when traveling on the path, the received signal strength and the number of access users in the cell.

3. The route planning method for emergency rescue according to claim 2, It is characterized in that The cell scores are: ; Among them, S is the cell score, k is the coefficient, distance is the distance of the rescue vehicle within the cell range when driving on the path, RSSI is the received signal strength, and numUser is the number of access users in the cell.

4. The route planning method for emergency rescue according to claim 1, It is characterized in that The receiving of accident location information of the accident vehicle in the target area includes: The accident location information of the accident vehicle is received from a roadside unit arranged around a road in a target area, wherein the accident location information is determined based on the accident warning information sent by the vehicle-mounted terminal of the accident vehicle and received by the roadside unit.

5. The route planning method for emergency rescue according to claim 1, It is characterized in that The weight information of the road is: ; Among them, M is the weight information of the road, G is the coefficient, and L is the length of the road. is the number of vehicles and Q is the road quality.

6. The route planning method for emergency rescue according to claim 1, It is characterized in that The method of determining multiple paths for rescue vehicles to reach the accident vehicle based on the accident location information and the pre-constructed road network includes: Based on the accident location information and the pre-built road network, the path algorithm Dijkstra algorithm is called to calculate multiple paths between the rescue vehicle and the destination.

7. The route planning method for emergency rescue according to claim 1, It is characterized in that Also includes: In the process of the rescue vehicle heading towards the accident vehicle based on the target path, the traffic accident information of the accident vehicle is obtained, and the traffic accident information is sent to the rescue vehicle based on the high-priority dedicated network slice created by the base station.

8. A route planning device for emergency rescue, It is characterized in that include: An information receiving module, used to receive accident location information of the accident vehicle in the target area; A path determination module, for determining multiple paths for rescue vehicles to reach the accident vehicle based on the accident location information and a pre-constructed road network, wherein the road network is a network constructed with roads in the target area as edges, intersections in the target area as points, and weight information of each road, wherein the weight information of the road is determined based on the length of the road, the number of lanes, and the quality of the road; A point determination module is used to divide each path based on a preset distance threshold to obtain multiple points corresponding to each path; The planning module is used to determine the target path for the rescue vehicle to the accident vehicle and the base station to be accessed when the rescue vehicle passes each point in the target path based on the signal strength of the cell to which each point belongs.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, It is characterized in that When the processor executes the computer program, the route planning method for emergency rescue as described in any one of claims 1 to 7 is implemented.

10. A non-transitory computer-readable storage medium having a computer program stored thereon, It is characterized in that When the computer program is executed by a processor, the route planning method for emergency rescue as described in any one of claims 1 to 7 is implemented.

Citation Information

Cited By

  • Positioning-optimized code scanning communication rescue management method and system

    CN119358980A

  • Intelligent positioning method and system for vehicle rescue state

    CN120603049A

  • Collaborative optimization method and system for monitoring station site selection and rescue path planning

    CN121031931A