A method, electronic device and storage medium for information sharing based on driving routes

Abstract

This invention provides a method, electronic device, and storage medium for information sharing based on driving routes, relating to the field of communication technology. The method includes: acquiring a target vehicle, acquiring the time T1 when the road camera at the j-th entrance detects the target vehicle and the start time T0; acquiring a preset optimal route for the target vehicle to reach the target location, acquiring the time T2 from the road camera at the j-th entrance to the target entrance corresponding to the preset optimal route; acquiring the time T3 for the target personnel to disembark from the target vehicle; acquiring the time T4 for the target personnel to reach the vehicle within the target building corresponding to the preset optimal route from the target entrance; acquiring the time T5 for the target personnel to reach the target work location by vehicle; and sending a preset optimal route driving instruction to the target vehicle based on T0, T1, T2, T3, T4, and T5, thereby achieving vehicle management in a designated area and improving the user experience for the target personnel.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to a method for information sharing based on travel routes, an electronic device, and a storage medium. Background Technology

[0002] With the development of technology, smart parks, also known as intelligent parks, are a modern park model that utilizes next-generation information technologies such as the Internet of Things, big data, cloud computing, and artificial intelligence to comprehensively upgrade and intelligently manage the facilities, environment, operations, and services within the park. This enables the park to manage multiple aspects, including cloud platform services, integrated fee payment platforms, smart rental management, and intelligent parking management.

[0003] Intelligent parking management is particularly important for the employee experience of companies in the park. The park area is generally large, and many employees take shuttle buses to work. How to ensure that employees arrive at work on time is a concern, especially during peak hours. Summary of the Invention

[0004] To address the aforementioned technical problems, the present invention adopts the following technical solution: an information sharing method based on driving routes, the method being used to meet the time requirements of target personnel within a designated area, the method comprising the following steps:

[0005] S100, Retrieve a list of building information A = {A1, A2, ..., A...} within a specified area. i A m}、Entry information list B = {B1, B2, ..., B} j B n} and the preset personnel list information set C = {C1, C2, ..., C} r C s};

[0006] The i-th building information A i It should include at least the i-th building signage, the i-th building's internal transportation information, and the j-th entrance information B. j It includes at least: the j-th entrance identifier, the entrance camera identifier of the j-th entrance, and the road camera identifier of the j-th entrance; the r-th preset personnel list information C. r It includes at least: the work location of each preset person in the r-th preset personnel list, the work start time of each preset person, and the vehicle information of each preset person; wherein, the road camera is a camera installed on the road leading to the entrance, and all preset personnel in the same preset personnel list have the same work location;

[0007] The value of i ranges from 1 to m, where m is the number of buildings in the specified area; the value of j ranges from 1 to n, where n is the number of entrances in the specified area; and the value of r ranges from 1 to s, where s is the number of people in the preset personnel list.

[0008] S200, acquire the personnel and vehicles monitored by the road camera at the j-th entrance as the target vehicle, and acquire the time T1 when the road camera at the j-th entrance monitors the target vehicle, the target location of the target vehicle, and the work start time T0. The target location is the work position of the preset personnel corresponding to the target vehicle, and the target vehicle is the vehicle corresponding to the preset personnel and vehicle information.

[0009] S300, obtain the preset optimal route for the target vehicle to reach the target location, and obtain the time T2 consumed from the road camera at the j-th entrance to the target entrance corresponding to the preset optimal route. The preset optimal route is the shortest route among several historical routes for vehicles to reach the target location.

[0010] S400, obtain the fixed number of passengers M of the target vehicle, and obtain the time T3 for the target passengers to get off the target vehicle based on the fixed number of passengers M.

[0011] S500, obtain the time T4 for the target personnel to reach the vehicle inside the target building corresponding to the preset optimal route from the target entrance;

[0012] S600, obtain the time T5 when the target personnel arrive at the target work location by taking the transportation within the target building;

[0013] S700, if T0-T1>T2+T3+T4+T5, send a preset optimal route driving instruction to the target vehicle;

[0014] S800, if T0-T1≤T2+T3+T4+T5, send a pre-selected route driving instruction to the target vehicle. The pre-selected route is the route that the target vehicle takes to reach the target location, excluding the preset optimal route.

[0015] According to another aspect of the present invention, a non-transitory computer-readable storage medium is provided, wherein at least one instruction or at least one program is stored therein, the at least one instruction or the at least one program being loaded and executed by a processor to implement the aforementioned method.

[0016] According to another aspect of the present invention, an electronic device is provided, including a processor and the aforementioned non-transitory computer-readable storage medium.

[0017] The present invention has at least the following beneficial effects: In summary, it obtains a list of building information, a list of entrance information, and a preset list of personnel information within a specified area; it obtains the personnel and vehicles monitored by the road camera at the j-th entrance as the target vehicle; it obtains the time when the road camera at the j-th entrance monitored the target vehicle, the target location of the target vehicle, and the start time of operation; it obtains the preset optimal route for the target vehicle to reach the target location; it obtains the time T2 from the road camera at the j-th entrance to the target entrance corresponding to the preset optimal route; it obtains the fixed number of passengers M of the target vehicle; and it obtains the time T3 for the target personnel to disembark from the target vehicle based on the fixed number of passengers M. The invention obtains the time T4 for a target person to reach the target building's vehicle corresponding to the preset optimal route from the target entrance, and the time T5 for the target person to reach the target work location by vehicle. If T0-T1>T2+T3+T4+T5, a preset optimal route driving instruction is sent to the target vehicle; if T0-T1≤T2+T3+T4+T5, a preset selected route driving instruction is sent to the target vehicle. The preset selected route is a route other than the preset optimal route for the target vehicle to reach the target location. This invention obtains the preset optimal route of the target vehicle, realizes vehicle management in a designated area, ensures that the target personnel arrive at work on time, and improves the experience of the target personnel. Attached Figure Description

[0018] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0019] Figure 1 A flowchart illustrating an information sharing method based on a driving route, provided in an embodiment of the present invention. Detailed Implementation

[0020] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0021] This invention provides an information sharing method based on driving routes, which is used to meet the time requirements of target personnel within a specified area, such as... Figure 1 As shown, the method includes the following steps:

[0022] S100, Retrieve a list of building information A = {A1, A2, ..., A...} within a specified area. i A m}、Entry information list B = {B1, B2, ..., B} j B n} and the preset personnel list information set C = {C1, C2, ..., C} r C s}

[0023] Specifically, the i-th building information A i It should include at least the i-th building signage, the i-th building's internal transportation information, and the j-th entrance information B. j It includes at least: the j-th entrance identifier, the entrance camera identifier of the j-th entrance, and the road camera identifier of the j-th entrance; the r-th preset personnel list information C. r It includes at least: the work location of each preset person in the r-th preset personnel list, the start time of each preset person's work, and the vehicle information of each preset person; wherein, the road camera is a camera installed on the road leading to the entrance, and all preset personnel in the same preset personnel list have the same work location; the value of i ranges from 1 to m, where m is the number of buildings in the specified area, the value of j ranges from 1 to n, where n is the number of entrances in the specified area, and the value of r ranges from 1 to s, where s is the number of preset personnel lists.

[0024] Specifically, the preset personnel and vehicle information includes: preset personnel and vehicle license plate numbers.

[0025] Specifically, the designated area can be a park, the building signage can be, for example, “Building H”, “Building I”, “Gate 15”, etc., the means of transportation within the building can be, for example, an elevator, and the preset personnel list can be, for example, the personnel of a company.

[0026] S200, acquire the personnel and vehicles monitored by the road camera at the j-th entrance as the target vehicle, and acquire the time T1 when the road camera at the j-th entrance monitored the target vehicle, the target location of the target vehicle, and the work start time T0, wherein the target location is the work position of the preset personnel corresponding to the target vehicle.

[0027] Specifically, the target vehicle is the vehicle corresponding to the preset personnel and vehicle information.

[0028] Specifically, as those skilled in the art will know, any existing method for monitoring vehicles using cameras falls within the scope of protection of this invention, and will not be elaborated further here.

[0029] Specifically, based on the license plate number of the target vehicle, the work location of the preset personnel corresponding to the target vehicle is obtained, and this work location is used as the target location. This can be understood as the work start time T0 being the clock-in time.

[0030] S300, obtain the preset optimal route for the target vehicle to reach the target location, and obtain the time T2 consumed by the target vehicle from the road camera at the j-th entrance to the target entrance corresponding to the preset optimal route. The preset optimal route is the shortest route among several historical routes for vehicles to reach the target location.

[0031] Specifically, the preset optimal route can be determined based on actual needs; in one embodiment of the present invention, the preset optimal route for the target vehicle to reach the target location is obtained through an ant colony algorithm. This can be understood as T2 being the time required for the target vehicle to travel from the location of the j-th entrance road camera to the target entrance, where the target entrance is the entrance corresponding to the preset optimal route.

[0032] S400: Obtain the fixed number of passengers M in the target vehicle, and based on the fixed number of passengers M, obtain the time T3 for the target passengers to disembark. This can be understood as follows: the number of passengers in the target vehicle, such as a shuttle bus, is fixed. Therefore, it is not necessary to identify the number of people inside the target vehicle; the fixed number of passengers can be determined through the vehicle's license plate number.

[0033] Specifically, obtain the historical time t3 for a single person to get off the vehicle, and then obtain T3 = M × t3.

[0034] S500, obtain the time T4 for the target personnel to reach the vehicle inside the target building corresponding to the preset optimal route from the target entrance.

[0035] In one embodiment of the present invention, T4 is the time it takes for the target person to walk from the target entrance to the target elevator, and the target elevator is a means of transportation within the target building corresponding to a preset optimal route.

[0036] S600, obtain the time T5 when the target person arrives at the target work location by means of transportation.

[0037] Specifically, T5 represents the time it takes for the target personnel to wait to board the vehicle after arriving at the target building and to reach the target work location.

[0038] S700, if T0-T1 > T2+T3+T4+T5, send a preset optimal route driving instruction to the target vehicle. This can be understood as, if T0-T1 > T2+T3+T4+T5, assuming that the target personnel can arrive at the target location before the work start time T0.

[0039] S800, if T0-T1≤T2+T3+T4+T5, a pre-selected route driving instruction is sent to the target vehicle. The pre-selected route is a route for the target vehicle to reach the target location other than the preset optimal route. This can be understood as follows: if T0-T1≤T2+T3+T4+T5, it is assumed that the target personnel cannot reach the target location before the work start time T0, and therefore an alternative route is immediately provided to the target vehicle.

[0040] In summary, the system obtains a list of building information, an entrance information list, and a preset personnel list within a specified area. It then identifies the personnel and vehicles detected by the road camera at the j-th entrance as the target vehicle, and obtains the time the road camera at the j-th entrance detected the target vehicle, the target location of the target vehicle, and the start time of work. It also obtains the preset optimal route for the target vehicle to reach the target location, the time T2 for the target vehicle to reach the target entrance corresponding to the preset optimal route from the road camera at the j-th entrance, the fixed number of passengers M in the target vehicle, and the time T3 for the target personnel to disembark based on the fixed number of passengers M. Finally, it obtains the time T4 for the target personnel to reach the target building's transportation vehicle corresponding to the preset optimal route from the target entrance, and the time T5 for the target personnel to reach the target work location by transportation vehicle. If T0-T1 > T2+T3+T4+T5, a preset optimal route driving instruction is sent to the target vehicle; if T0-T1 ≤ T2+T3+T4+T5, a preset selected route driving instruction is sent to the target vehicle. The preset selected route is a route other than the preset optimal route for the target vehicle to reach the target location.

[0041] This invention obtains the preset optimal route for the target vehicle and divides the time required for the entire preset optimal route into four parts: the time taken for the target vehicle to reach the target entrance, the time taken for the target personnel to get off the vehicle at the target entrance, the time taken for the target personnel to walk from the target entrance to the vehicle inside the target building, and the time taken for the target personnel to ride the vehicle inside the target building. By summing the time taken in these four parts, it is determined whether the target personnel can reach the target location at the start time of work, thereby realizing vehicle management in a designated area, ensuring that the target personnel arrive at work on time, and improving the experience of the target personnel.

[0042] In one embodiment of the present invention, S600 further includes: obtaining T5 through the following steps:

[0043] S610, obtain the number of waiting people P1 in the target building's transportation at time T1, and obtain the time T6 for the waiting people to complete their journey in the target building's transportation.

[0044] Specifically, images of waiting people can be obtained from cameras located at the transportation points within the target building. The number of waiting people can then be determined by identifying these images.

[0045] Furthermore, those skilled in the art will understand that any existing method for identifying quantities through images falls within the scope of protection of this invention, and will not be elaborated further here.

[0046] S620, if T2+T3+T4>T6, obtain the first ride count roundup(k) and obtain T5 based on roundup(k) and the target location, where k×NM=0, roundup() is the round-up function, and N is the maximum number of passengers that a single vehicle can carry within the target building.

[0047] Specifically, if T2+T3+T4>T6, it is assumed that when the target personnel arrive at the transportation inside the target building, all the waiting personnel have already left by the transportation inside the target building. Therefore, k is obtained, and k is used to determine how many elevators the target personnel need to take to reach the target location.

[0048] Specifically, T5 = roundup(k) × f × T9, where f is the number of floors at the target location, and T9 is the time taken for a vehicle to ascend one floor without stopping within the target building.

[0049] S630, if T2+T3+T4≤T6, obtain the second ride count roundup(x) and obtain T5 based on roundup(x) and the target location, where x×N-P1-M=0.

[0050] This can be understood as follows: if T2+T3+T4>T6, it is assumed that when the target personnel arrive at the transportation within the target building, not all the waiting personnel have left using the transportation within the target building. For ease of calculation and to obtain the maximum waiting time, it is assumed that the waiting personnel within the transportation within the target building have not left at this time, and the number P1 has not changed. Therefore, the second number of rides is obtained, and T5 is obtained using the second number of rides. Here, f is the floor number of the target location, and T9 is the time consumed by the transportation within the target building to ascend one floor without stopping.

[0051] Specifically, T5 = roundup(x) × f × T9.

[0052] In summary, at time T1, the number of waiting personnel P1 in the target building's transportation system is obtained, along with the time T6 for these waiting personnel to complete their journey in the target building's transportation system. If T2+T3+T4>T6, the first number of rides roundup(k) is obtained, and T5 is obtained based on roundup(k) and the target location. If T2+T3+T4≤T6, the second number of rides roundup(x) is obtained, and T5 is obtained based on roundup(x) and the target location. By determining the time it takes for the target personnel to arrive at the target building's transportation system and the time it takes for the waiting personnel to leave, the time it takes for the target personnel to reach their target work location by using the target building's transportation system can be obtained more accurately.

[0053] In another embodiment of the present invention, S600 further includes: obtaining T5 through the following steps:

[0054] S601, Obtain the distance D between the road camera at the j-th entrance and the target entrance. j .

[0055] S602, obtain the historical average vehicle speed v, and based on D j Based on the historical average vehicle speed v, obtain the travel time T7.

[0056] Specifically, D j / v=T7.

[0057] S603, obtain the vehicles that passed through during the time period [T1-T7, T1].

[0058] S604, based on the vehicles passing through during the time period [T1-T7, T1], obtain the number of people passing through P2.

[0059] Specifically, based on the license plate numbers of the passing vehicles, the fixed number of passengers in each vehicle is obtained. The fixed number of passengers in all passing vehicles is then summed to obtain the number of people passing through, P2. Within the smart park, the passing vehicles are generally fixed shuttle buses with a fixed number of passengers. This can be understood as the passing vehicles during the time period [T1-T7, T1] still traveling on the road from the road camera to the target entrance, which may cause waiting time for the target personnel.

[0060] S605, based on P1 and P2, obtains T5.

[0061] Specifically, S605 includes:

[0062] S6051, obtain the time T8 when the passenger completes the journey using the transportation within the target building.

[0063] Specifically, the historical average travel time for the number of people in P2 is recorded as T8.

[0064] S6052, if T2+T3+T4>T6+T8, obtain T5 based on roundup(k) and the target location.

[0065] Specifically, if T2+T3+T4>T6+T8, it is assumed that when the target personnel arrive at the vehicle inside the target building, all waiting personnel and passing personnel have already left by the vehicle inside the target building. Therefore, T5 is obtained based on roundup(k) and the target location.

[0066] S6053, if T2+T3+T4≤T6+T8, obtain the third ride number roundup(y) and obtain T5 based on roundup(y) and the target location, where y×N-P1-P2-M=0.

[0067] Specifically, if T2+T3+T4≤T6+T8, it is considered that when the target personnel arrive at the transportation inside the target building, not all the waiting personnel and the passing personnel leave by taking the transportation inside the target building. Therefore, the third ride count is obtained, and T5 is obtained based on the third ride count.

[0068] In summary, the distance between the road camera at the j-th entrance and the target entrance is obtained, the historical average vehicle speed is obtained, and based on D... j Based on the historical average vehicle speed, the travel time T7 is obtained. The number of vehicles passing through within the time interval [T1-T7, T1] is obtained. Based on the vehicles passing through within the time interval [T1-T7, T1], the number of passengers P2 is obtained. The time T8 for passengers to complete their journey within the target building's transportation is obtained. If T2+T3+T4>T6+T8, T5 is obtained based on roundup(k) and the target location. If T2+T3+T4≤T6+T8, the third ride count roundup(y) is obtained, and T5 is obtained based on roundup(y) and the target location. This invention considers vehicles that travel ahead of the target vehicle but have not reached the target entrance, thus more accurately obtaining the waiting time of target personnel within the target building's transportation.

[0069] Embodiments of the present invention also provide a non-transitory computer-readable storage medium that can be disposed in an electronic device to store at least one instruction or at least one program related to implementing a method in the method embodiments, wherein the at least one instruction or the at least one program is loaded and executed by the processor to implement the method provided in the above embodiments.

[0070] Embodiments of the present invention also provide an electronic device, including a processor and the aforementioned non-transitory computer-readable storage medium.

[0071] While specific embodiments of the invention have been described in detail by way of example, those skilled in the art should understand that the above examples are for illustrative purposes only and are not intended to limit the scope of the invention. Those skilled in the art should also understand that various modifications can be made to the embodiments without departing from the scope and spirit of the invention. The scope of the invention is defined by the appended claims.

Claims

1. A method for information sharing based on travel routes, the method being used to meet the time requirements of target personnel within a designated area, characterized in that, The method includes the following steps: S100, retrieve the building information list A={A1, A2, ..., A...} within the specified area. i A m }、Entry information list B={B1, B2, ..., B j B n } and the preset personnel list information set C={C1, C2, ..., C r C s }; The i-th building information A i It includes at least the i-th building sign and the transportation information within the i-th building; The j-th entry information B j It includes at least: the j-th entrance identifier, the entrance camera identifier of the j-th entrance, and the road camera identifier of the j-th entrance; the r-th preset personnel list information C. r It includes at least: the work location of each preset person in the r-th preset personnel list, the work start time of each preset person, and the vehicle information of each preset person; wherein, the road camera is a camera installed on the road leading to the entrance, and all preset personnel in the same preset personnel list have the same work location; The value of i ranges from 1 to m, where m is the number of buildings in the specified area; the value of j ranges from 1 to n, where n is the number of entrances in the specified area; and the value of r ranges from 1 to s, where s is the number of people in the preset personnel list. S200, acquire the personnel and vehicles monitored by the road camera at the j-th entrance as the target vehicle, and acquire the time T1 when the road camera at the j-th entrance monitors the target vehicle, the target location of the target vehicle, and the work start time T0. The target location is the work position of the preset personnel corresponding to the target vehicle, and the target vehicle is the vehicle corresponding to the preset personnel and vehicle information. S300, obtain the preset optimal route for the target vehicle to reach the target location, and obtain the time T2 consumed from the road camera at the j-th entrance to the target entrance corresponding to the preset optimal route. The preset optimal route is the shortest route among several historical routes for vehicles to reach the target location. S400, obtain the fixed number of passengers M of the target vehicle, and obtain the time T3 for the target passengers to get off the vehicle based on the fixed number of passengers M; where T3 = M × t3, t3 is the historical time for a single passenger to get off the vehicle. S500, obtain the time T4 for the target personnel to reach the vehicle inside the target building corresponding to the preset optimal route from the target entrance; S600, obtain the time T5 when the target personnel arrive at the target work location by taking the transportation within the target building; S700, if T0-T1>T2+T3+T4+T5, send a preset optimal route driving instruction to the target vehicle; S800, if T0-T1≤T2+T3+T4+T5, send a pre-selected route driving instruction to the target vehicle. The pre-selected route is the route that the target vehicle takes to reach the target location, excluding the preset optimal route. S600 includes obtaining T5 through the following steps: S610, obtain the number of waiting people P1 in the vehicles inside the target building at time T1 and obtain the time T6 when the waiting people complete their journey in the vehicles inside the target building; S620, if T2+T3+T4>T6, obtain the first ride count roundup(k) and obtain T5 based on roundup(k) and the target location, where k×NM=0, roundup() is the round-up function, and N is the maximum number of passengers that a single vehicle can carry within the target building.

2. The information sharing method based on driving routes according to claim 1, characterized in that, The preset personnel and vehicle information includes: the preset personnel and vehicle license plate numbers.

3. The information sharing method based on driving routes according to claim 2, characterized in that, S600 also includes: obtaining T5 through the following steps: S630, if T2+T3+T4≤T6, obtain the second number of rides roundup(x) and obtain T5 based on roundup(x) and the target location, where x×N-P1-M=0.

4. The information sharing method based on driving routes according to claim 3, characterized in that, S600 also includes: obtaining T5 through the following steps: S601, Obtain the distance D between the road camera at the j-th entrance and the target entrance. j ; S602, obtain the historical average vehicle speed v, and based on D j Based on the historical average vehicle speed v, obtain the travel time T7; S603, retrieve the vehicles that passed through during the time period [T1-T7, T1]; S604, Based on the vehicles passing through during the time period [T1-T7, T1], obtain the number of people passing through P2; S605, based on P1 and P2, obtains T5.

5. The information sharing method based on driving routes according to claim 4, characterized in that, S605 includes: S6051, obtain the time T8 when the person completes the journey using the transportation within the target building; S6052, if T2+T3+T4>T6+T8, obtain T5 based on roundup(k) and the target location; S6053, if T2+T3+T4≤T6+T8, obtain the third ride number roundup(y) and obtain T5 based on roundup(y) and the target location, where y×N-P1-P2-M=0.

6. The information sharing method based on driving routes according to claim 3, characterized in that, S620 also includes: T5 = roundup(k) × f × T9, where f is the number of floors at the target location, and T9 is the time taken for a vehicle to ascend one floor without stopping within the target building.

7. The information sharing method based on driving routes according to claim 3, characterized in that, S630 also includes: T5 = roundup(x) × f × T9, where f is the number of floors in the target location and T9 is the time taken for a vehicle in the target building to ascend one floor without stopping.

8. The information sharing method based on driving routes according to claim 4, characterized in that, D j / v=T7。 9. A non-transitory computer-readable storage medium, wherein the storage medium stores at least one instruction or at least one program segment, characterized in that, The at least one instruction or the at least one program segment is loaded and executed by the processor to implement the route-based information sharing method as described in any one of claims 1-8.

10. An electronic device, characterized in that, Includes a processor and the non-transitory computer-readable storage medium as described in claim 9.

Images