Information sharing method based on driving route, electronic equipment and storage medium

Abstract

The invention provides an information sharing method based on a driving route, electronic equipment and a storage medium, and relates to the technical field of communication, and the method comprises the steps: obtaining a target vehicle, obtaining the time T1 when a road camera of a jth entrance monitors the target vehicle and the work starting time T0, obtaining a preset optimal route for the target vehicle to arrive at a target place, obtaining the time T2 from the jth entrance road camera to a target entrance corresponding to the preset optimal route, obtaining the time T3 consumed for getting off a target person of the target vehicle, and obtaining the time T4 from the target entrance to a traffic tool in a target building corresponding to the preset optimal route of the target person; and the time T5 when the target person arrives at the target working position by taking the vehicle is obtained, and a preset optimal route driving instruction is sent to the target vehicle based on T0, T1, T2, T3, T4 and T5, so that vehicle management of the designated area is realized, and the experience feeling of the target person is improved.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to an information sharing method based on a driving route, an electronic device and a storage medium. Background Art

[0002] With the development of science and technology, smart parks, also often referred to as intelligent parks, are modern parks that use new-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. The park is managed in multiple aspects such as cloud platform services, comprehensive fee payment platforms, smart rental management, and smart parking management.

[0003] Smart parking management is particularly important for the employee experience of park enterprises. Park areas are generally large, and many employees take shuttle buses to work. How to ensure that employees arrive at work on time is an issue worthy of attention, especially during rush hour. Summary of the invention

[0004] In view of the above technical problems, the technical solution adopted by the present invention is: a method for sharing information based on driving routes, the method is used to meet the time requirements of target personnel in a specified area, and the method comprises the following steps:

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

[0006] The i-th building information A i At least includes the i-th building logo, the i-th building transportation information; the j-th entrance information B j At least including: the jth entrance sign, the jth entrance camera sign, the jth entrance road camera sign; the rth preset personnel list information C r At least including: the work position of each preset person in the rth preset person 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 the work positions of all preset persons in the same preset person list are the same;

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

[0008] S200, obtaining the personnel vehicle monitored by the road camera at the j-th entrance as the target vehicle, and obtaining 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, wherein 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 vehicle information;

[0009] S300, obtaining a preset optimal route for the target vehicle to reach the target location, and obtaining the time T2 consumed from the road camera at the jth entrance to the target entrance corresponding to the preset optimal route, wherein the preset optimal route is the shortest route among several historical routes for vehicles to reach the target location;

[0010] S400, obtaining a fixed number of passengers M of the target vehicle, and obtaining a target person getting off the target vehicle based on the fixed number of passengers M of the target vehicle.

[0011] S500, obtaining the time T4 of the target person arriving at the transportation means in the target building corresponding to the preset optimal route from the target entrance;

[0012] S600, obtaining the time T5 when the target person arrives at the target work location by means of transportation in 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, where the pre-selected route is a route for the target vehicle to reach the target location other than the preset optimal route.

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

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

[0017] The present invention has at least the following beneficial effects: In summary, a building information list, an entrance information list and a preset personnel list information set in a specified area are obtained, the personnel vehicle monitored by the road camera at the j-th entrance is obtained as the target vehicle, and the time 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 are obtained, the preset optimal route for the target vehicle to reach the target location is obtained, and the time T2 from the road camera at the j-th entrance to the target entrance corresponding to the preset optimal route is obtained, the fixed number of passengers M of the target vehicle is obtained, and the time T3 consumed by the target personnel getting off the target vehicle is obtained based on the fixed number of passengers M of the target vehicle. , obtain the time T4 when the target person arrives at the target building transportation corresponding to the preset optimal route from the target entrance, obtain the time T5 when the target person takes the transportation to the target work location, if T0-T1>T2+T3+T4+T5, send the preset optimal route driving instruction to the target vehicle, if T0-T1≤T2+T3+T4+T5, send the pre-equipped route driving instruction to the target vehicle, the pre-equipped route is the route for the target vehicle to reach the target location except the preset optimal route; the present invention obtains the preset optimal route of the target vehicle, realizes the vehicle management of the designated area, ensures that the target person goes to work on time, and improves the experience of the target person. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0019] Figure 1 A flowchart of a method for sharing information based on a driving route provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0020] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only 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 those skilled in the art without creative work are within the scope of protection of the present invention.

[0021] The embodiment of the present invention provides a method for sharing information based on a driving route, the method being used to meet the time requirements of target personnel in a specified area, such as Figure 1 As shown, the method comprises the following steps:

[0022] S100, obtaining a list of building information in a specified area A = {A1, A2, ..., A i , …, A m}, entry information list B = {B1, B2, ..., B j , …, B n} and preset personnel list information set C = {C1, C2, ..., C r , …, C s}.

[0023] Specifically, the i-th building information A i At least includes the i-th building logo, the i-th building transportation information; the j-th entrance information B j At least including: the jth entrance sign, the jth entrance camera sign, the jth entrance road camera sign; the rth preset personnel list information C r At least including: the work position of each preset personnel in the rth preset personnel list, the work start time of each preset personnel, and the vehicle information of each preset personnel; wherein, the road camera is a camera installed on the road leading to the entrance, and the work positions of all preset personnel in the same preset personnel list are the same; the value range of i is 1 to m, m is the number of buildings in the specified area, the value range of j is 1 to n, n is the number of entrances to the specified area, and the value range of r is 1 to s, s is the number of preset personnel lists.

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

[0025] Specifically, the designated area may be a park, the building identification may be, for example, "Building H", "Building I", "Gate 15", etc., the means of transportation in the building may be, for example, an elevator, and the preset personnel list may be, for example, the personnel of a company.

[0026] S200, obtain the personnel vehicle monitored by the road camera at the j-th entrance as the target vehicle, and obtain 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, where the target location is the work position of the preset personnel corresponding to the target vehicle.

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

[0028] Specifically, those skilled in the art know that any method of using a camera to monitor a vehicle in the prior art falls within the protection scope of the present invention and will not be described in detail herein.

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

[0030] S300, obtaining a preset optimal route for the target vehicle to reach the target location, and obtaining the time T2 consumed by the target vehicle to reach the target entrance corresponding to the preset optimal route from the road camera at the j-th entrance. 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 according to actual needs; in one embodiment of the present invention, the preset optimal route for the target vehicle to reach the target location is obtained by an ant colony algorithm. It can be understood that T2 is the time it takes for the target vehicle to reach the target entrance from the position of the jth entrance road camera, and the target entrance is the entrance corresponding to the preset optimal route.

[0032] S400, obtaining the fixed number of passengers M of the target vehicle, and obtaining the target person getting off the target vehicle consuming time T3 based on the fixed number of passengers M of the target vehicle. It can be understood that the number of passengers of the target vehicle, such as a shuttle bus, is fixed, and therefore, it is not necessary to identify the number of people in the target vehicle, and the fixed number of passengers of the target vehicle can be known through the license plate number of the target vehicle.

[0033] Specifically, the historical time t3 consumed by a single person getting off the bus is obtained, thereby obtaining T3=M×t3.

[0034] S500, obtaining the time T4 for the target person to arrive at the transportation vehicle in 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 taken by the target person to walk from the target entrance to the target elevator, where the target elevator is a means of transportation within the target building corresponding to a preset optimal route.

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

[0037] Specifically, T5 is the time it takes for the target person to wait for the transportation in the target building and the time it takes to arrive at the target work location.

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

[0039] S800, if T0-T1≤T2+T3+T4+T5, send a pre-selected route driving instruction to the target vehicle, where the pre-selected route is a route other than the preset optimal route for the target vehicle to reach the target location. It can be understood that if T0-T1≤T2+T3+T4+T5, it is considered that the target person cannot reach the target location before the work start time T0, so an alternative route is immediately provided to the target vehicle.

[0040] In summary, a building information list, an entrance information list and a preset personnel list information set in a specified area are obtained, the personnel vehicle monitored by the road camera at the j-th entrance is obtained as the target vehicle, and the time when the road camera at the j-th entrance monitors the target vehicle, the target location and the work start time of the target vehicle are obtained, the preset optimal route for the target vehicle to reach the target location is obtained, and the time T2 from the road camera at the j-th entrance to the target entrance corresponding to the preset optimal route is obtained, the fixed number of passengers M of the target vehicle is obtained, and based on the fixed number of passengers M of the target vehicle, the time T3 consumed by the target personnel getting off the target vehicle is obtained, the time T4 time for the target personnel to reach the target building corresponding to the preset optimal route from the target entrance is obtained, and the time T5 time for the target personnel to arrive at the target work position by the transportation is obtained. 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 pre-equipped route driving instruction is sent to the target vehicle. The pre-equipped route is a route for the target vehicle to reach the target location except the preset optimal route.

[0041] The present invention obtains a preset optimal route for a target vehicle, and divides the time required for the entire preset optimal route into four parts: the time consumed by the target vehicle to reach a target entrance, the time consumed by a target person to get off the vehicle at the target entrance, the time consumed by the target person to walk from the target entrance to a vehicle in a target building, and the time consumed by the target person to take a vehicle in the target building. By adding up the time consumed by the four parts, it is judged whether the target person can arrive at the target location at the start time of work, thereby realizing vehicle management in a designated area, ensuring that the target person goes to work on time, and improving the experience of the target person.

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

[0043] S610, obtaining the number P1 of people waiting for transportation in the target building at time T1 and obtaining the time T6 when the waiting people complete taking the transportation in the target building.

[0044] Specifically, the image of the people waiting for the transportation in the target building can be obtained through the camera at the transportation in the target building, and the number of waiting people can be obtained by identifying the image of the people waiting for the transportation in the target building.

[0045] Furthermore, those skilled in the art know that any method for identifying quantity through images in the prior art falls within the protection scope of the present invention and will not be described in detail herein.

[0046] S620, if T2+T3+T4>T6, obtain the first number of rides roundup(k) and obtain T5 based on roundup(k) and the target location, where k×NM=0, roundup() is an upward rounding function, and N is the maximum number of people that the vehicle can carry at one time in the target building.

[0047] Specifically, if T2+T3+T4>T6, it is considered that when the target person arrives at the transportation in the target building, the waiting persons have all left by the transportation in the target building, so k is obtained and k is used to determine how many elevators the target person needs to take to reach the target location.

[0048] Specifically, T5=roundup(k)×f×T9, where f is the number of floors of the target location, and T9 is the time it takes for a vehicle in the target building to go up one floor without stopping.

[0049] 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.

[0050] It can be understood that if T2+T3+T4>T6, it is considered that when the target person arrives at the transportation in the target building, not all the waiting persons have left by the transportation in the target building. For the convenience of calculation, the maximum waiting time is obtained. It is considered that the waiting persons of the transportation in 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 the second number of rides is used to obtain T5, where f is the number of floors of the target location, and T9 is the time consumed by the transportation in the target building to go up one floor without stopping.

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

[0052] In summary, the number of people P1 waiting for transportation in the target building at T1 is obtained, and the time T6 when the waiting people complete taking the transportation in the target building is obtained; 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 judging the time when the target person arrives at the transportation in the target building and the time it takes for the waiting person to leave, the time when the target person takes the transportation in the target building to reach the target work location can be obtained more accurately.

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

[0054] S601, obtaining the distance D between the road camera at the jth entrance and the target entrance j .

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

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

[0057] S603, obtaining vehicles passing through the time period [T1-T7, T1].

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

[0059] Specifically, based on the license plate number of the passing vehicle, the fixed number of passengers of each passing vehicle is obtained, and the fixed number of passengers of all passing vehicles is added up to obtain the number of passing personnel P2. In the smart park, the passing vehicles are generally fixed shuttle buses with a fixed number of passengers. It can be understood that the passing vehicles in the [T1-T7, T1] time period are still traveling on the road from the road camera to the target entrance, which may cause the target personnel to wait for a while.

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

[0061] Specifically, S605 includes:

[0062] S6051, obtaining the time T8 when the passerby completes the transportation in the target building.

[0063] Specifically, the historical average riding time of the number of people P2 is obtained and 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 considered that when the target person arrives at the transportation in the target building, the waiting persons and the passing persons have all left by the transportation in 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 number of rides 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 person arrives at the transportation in the target building, not all waiting persons and passing persons have left by the transportation in the target building, so the third number of rides is obtained, and T5 is obtained based on the third number of rides.

[0068] In summary, the distance between the road camera at the jth entrance and the target entrance is obtained, the historical average speed is obtained, and based on D j and historical average vehicle speed, obtain the travel time T7, obtain the passing vehicles that pass through the time period [T1-T7, T1], obtain the number of passing personnel P2 based on the passing vehicles that pass through the time period [T1-T7, T1], obtain the time T8 when the passing personnel complete the transportation in the target building, if T2+T3+T4>T6+T8, obtain T5 based on roundup(k) and the target location, if T2+T3+T4≤T6+T8, obtain the third number of rides roundup(y) and obtain T5 based on roundup(y) and the target location. The present invention takes into account the vehicles that travel in front of the target vehicle and have not reached the target entrance, so as to more accurately obtain the waiting time of the target personnel in the transportation in the target building.

[0069] An embodiment of the present invention also provides a non-transitory computer-readable storage medium, which can be set in an electronic device to store at least one instruction or at least one program related to implementing a method in a method embodiment. 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 embodiment.

[0070] An embodiment of the present invention further provides an electronic device, comprising a processor and the aforementioned non-transitory computer-readable storage medium.

[0071] Although some specific embodiments of the present invention have been described in detail by way of example, it will be appreciated by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the present invention. It will also be appreciated by those skilled in the art that various modifications may be made to the embodiments without departing from the scope and spirit of the present invention. The scope of the present invention is defined by the appended claims.

Claims

1. A method for sharing information based on a driving route, the method being used to meet the time requirements of target personnel in a specified area, characterized in that: The method comprises the following steps: S100, obtaining a list of building information in a specified area A = {A1, A2, ..., A i , …, A m }, entry information list B = {B1, B2, ..., B j , …, B n } and preset personnel list information set C = {C1, C2, ..., C r , …, C s }; The i-th building information A i At least include the i-th building logo and the transportation information in the i-th building; The jth entry information B j At least including: the jth entrance sign, the jth entrance camera sign, the jth entrance road camera sign; the rth preset personnel list information C r At least including: the work position of each preset person in the rth preset person 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 the work positions of all preset persons in the same preset person list are the same; The value range of i is 1 to m, where m is the number of buildings in the specified area, the value range of j is 1 to n, where n is the number of entrances to the specified area, and the value range of r is 1 to s, where s is the number of preset personnel lists; S200, obtaining the personnel vehicle monitored by the road camera at the j-th entrance as the target vehicle, and obtaining 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, wherein 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 vehicle information; S300, obtaining a preset optimal route for the target vehicle to reach the target location, and obtaining the time T2 consumed from the road camera at the jth entrance to the target entrance corresponding to the preset optimal route, wherein the preset optimal route is the shortest route among several historical routes for vehicles to reach the target location; S400, obtaining a fixed number of passengers M of the target vehicle, and obtaining a target person getting off the target vehicle based on the fixed number of passengers M of the target vehicle. S500, obtaining the time T4 of the target person arriving at the transportation means in the target building corresponding to the preset optimal route from the target entrance; S600, obtaining the time T5 when the target person arrives at the target work location by means of transportation in 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, where the pre-selected route is a route for the target vehicle to reach the target location other than the preset optimal route.

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

3. The method for sharing information based on a driving route according to claim 2, characterized in that: S600 also includes: obtaining T5 through the following steps: S610, obtaining the number of people P1 waiting for transportation in the target building at time T1 and obtaining the time T6 when the waiting people complete taking the transportation in the target building; S620, if T2+T3+T4>T6, obtain the first number of rides roundup(k) and obtain T5 based on roundup(k) and the target location, where k×NM=0, roundup() is an upward rounding function, and N is the maximum number of people that the vehicle in the target building can carry at one time; 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 method for sharing information based on a driving route according to claim 3, characterized in that: S600 also includes: obtaining T5 through the following steps: S601, obtaining the distance D between the road camera at the jth entrance and the target entrance j ; S602, obtain the historical average vehicle speed v, and based on D j and the historical average vehicle speed v, to obtain the travel time T7; S603, obtaining vehicles passing through the time period [T1-T7, T1]; S604, based on the passing vehicles in the time period [T1-T7, T1], obtain the number of passing persons P2; S605, based on P1 and P2, obtain T5.

5. The method for sharing information based on a driving route according to claim 4, characterized in that: S605 includes: S6051, obtaining the time T8 of the passer-by taking the transportation means in 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 number of rides roundup(y) and obtain T5 based on roundup(y) and the target location, where y×N-P1-P2-M=0.

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

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

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

10. An electronic device, characterized in that: The invention comprises a processor and the non-transitory computer-readable storage medium as claimed in claim 9.

Images