Vehicle service monitoring method, electronic device and storage medium

Abstract

The present invention provides a vehicle service monitoring method, an electronic device and a storage medium, the method comprising: obtaining a plurality of position coordinates sent by a tag of a vehicle to be serviced within a target time period; determining a service area corresponding to each position coordinate according to a positional relationship between each position coordinate and a boundary point coordinate of each service area; determining a service time period corresponding to each service area according to an acquisition time of the plurality of position coordinates corresponding to each service area; sorting service area identifiers of the service area corresponding to each position coordinate according to an acquisition order of the plurality of position coordinates to obtain a service area identifier list; if an arrangement order of the plurality of service area identifiers in the service area identifier list conforms to a preset arrangement rule, outputting the service area identifier list and the plurality of service time periods to realize monitoring of the service time and service order of the entire vehicle service process, thereby greatly reducing manual intervention and improving the accuracy of data collection.

Description

Background Art

[0002] At present, the automobile industry has entered a state of stock market competition, and the importance of after-sales service in improving the profitability of brands and dealers has become increasingly prominent. The efficiency of after-sales service directly affects the dealer's service reception capacity, thereby affecting the dealer's after-sales revenue. Service efficiency also affects customer experience. Long service waiting time is an important factor affecting customer satisfaction. Therefore, improving service efficiency is an important way to improve service profitability.

[0003] In order to improve service efficiency, the service efficiency needs to be monitored first. Since the service items for each vehicle may be different, resulting in different total service time, and each service link is responsible for different positions, the entire service process needs to be split into links and measured to find the weak links and the corresponding responsible persons for improvement.

[0004] Existing monitoring methods for service links include manual clocking in and camera recognition. Manual clocking in means manually recording the start and end time of each service link to calculate the duration and efficiency; camera recognition means installing a smart camera at the service station to capture the vehicle license plate number to determine whether the vehicle enters or leaves the service station, thereby achieving the purpose of measuring the vehicle service time.

[0005] Among them, the manual clocking method increases the manual workload and reduces the working time available for customer service to a certain extent. On the other hand, the data reliability under manual operation is poor.

[0006] The application of camera recognition methods is to reduce human intervention and collect data through hardware and AI technology. However, due to the influence of light and angle on recognition accuracy, except for covering a large range in open areas (such as factory gates), its indoor coverage is very limited and cannot be applied to service monitoring of unlicensed vehicles. Summary of the invention

[0007] In view of the above technical problems, the technical solution adopted by the present invention is:

[0008] According to one aspect of the present application, a vehicle service monitoring method is provided, which is applied to a vehicle service monitoring system, wherein a spatial grid map corresponding to a target space is stored in the vehicle service monitoring system, wherein the spatial grid map includes a plurality of service areas, each service area corresponds to a unique service area identifier, and each service area includes a plurality of service sub-areas; the vehicle service monitoring system is connected to a visualization platform;

[0009] The vehicle service monitoring method described in this application comprises the following steps:

[0010] Step S100, obtaining a number of position coordinates sent by the vehicle tag to be serviced within a target time period;

[0011] The vehicle tag to be served is configured in the vehicle to be served; the start time of the target time period is the time when the vehicle to be served enters the target space, and the end time of the target time period is the time when the vehicle to be served leaves the target space; the position coordinates are the grid coordinates corresponding to the position of the vehicle tag to be served at the corresponding time in the spatial grid map;

[0012] Step S200, determining the service area corresponding to each position coordinate according to the positional relationship between each position coordinate and the coordinates of the boundary points of each service area;

[0013] Step S300, determining a service time period corresponding to each service area according to the acquisition time of a plurality of position coordinates corresponding to each service area;

[0014] Step S400: sorting the service area identifiers of the service areas corresponding to each position coordinate according to the acquisition order of the plurality of position coordinates to obtain a service area identifier list;

[0015] Step S500: If the arrangement order of the service area identifiers in the service area identifier list conforms to a preset arrangement rule, the service area identifier list and the service time periods are output.

[0016] In an exemplary embodiment of the present application, step S100 includes:

[0017] Step S110: Obtain the position coordinates sent by the vehicle tag to be serviced at each moving moment in the target time period to obtain a position coordinate list A = (A1, A2, ..., A m ,...,A n );A m =(A m1 ,A m2 ), where m = 1, 2, ..., n, and n is the number of moving moments in the target time period; A m A is the location coordinate sent by the vehicle tag to be served at the mth moving moment in the target time period; m1 A m The horizontal axis of m2 A m The vertical coordinate of the vehicle; the moving time is the time when the vehicle to be served moves.

[0018] In an exemplary embodiment of the present application, step S200 includes:

[0019] Step S210: Obtain the boundary point coordinates of each service sub-area to obtain a boundary point coordinate list set B1, B2, ..., B i ,...,B j; Where i = 1, 2, ..., j; j is the number of service areas; B i is the boundary point coordinate list set of the i-th service area;

[0020] B i =(B i1 ,B i2 ,...,B ic ,...,B id(i) ), c = 1, 2, ..., d(i), d(i) is the number of service sub-areas in the i-th service area, B ic is the coordinate list of the boundary points of the cth service sub-area in the ith service area;

[0021] B ic =(B ic1 ,B ic2 ,...,B ice ,...,B icf(ic) ); e = 1, 2, ..., f(ic); f(ic) is the number of boundary points of the cth service sub-area in the ith service area; B ice are the coordinates of the e-th boundary point of the c-th service sub-area in the ith service area;

[0022] B ice =(B ice1 ,B ice2 );B ice1 For B ice The horizontal axis of ice2 For B ice The vertical coordinate of

[0023] Step S220, traverse each position coordinate, if MIN(B ic11 ,B ic21 ,...,B ice1 ,...,B icf(ic)1 )<A m1 <MAX(B ic11 ,B ic21 ,...,B ice1 ,...,B icf(ic)1 ), and MIN(B ic12 ,B ic22 ,...,B ice2 ,...,B icf(ic)2 )<A m2 <MAX(B ic12 ,B ic22 ,...,B ice2 ,...,B icf(ic)2 ), then the i-th service area is determined as A mCorresponding service area; the cth service sub-area of ​​the ith service area is determined as A m The corresponding service sub-area; MIN() is a preset minimum value determination function; MAX() is a preset maximum value determination function.

[0024] In an exemplary embodiment of the present application, step S300 includes:

[0025] Step S310: Obtain the acquisition time of each position coordinate to obtain an acquisition time list K = (K1, K2, ..., K m ,...,K n ), where K m is the acquisition time of the mth position coordinate;

[0026] Step S320, traverse A1, A2, ..., A in sequence m ,...,A n , if A m The corresponding service area is the same as A m+1 If the corresponding service areas are the same, K m+1 Delete from the acquisition time list K to obtain the processed acquisition time list G = (G1, G2, ..., G a ,...,G b ); where a=1,2,...,b; b is the number of acquisition times obtained after processing; G a is the ath acquisition time obtained after processing;

[0027] Step S330: G g -G g-1 Determined to be G g-1 The initial time period of the service area where the corresponding location coordinates are located, t0-G b Determined to be G b The initial time period of the service area where the corresponding location coordinates are located, so as to obtain the initial time period list T = (T1, T2, ..., T a ,...,T b ), where g = 2, ..., b; t0 is the time when the vehicle to be served leaves the target space; T a G a The initial time period of the service area where the corresponding location coordinates are located;

[0028] Step S340: traverse the initial time period list T, if there is a a If the corresponding service areas have the same initial time period, the sum of several initial time periods corresponding to the same service area is determined as the service time period corresponding to the service area;

[0029] If the initial time period list T does not contain a If the corresponding service area has the same initial time period, then T a Determined as T a The service time period of the corresponding service area.

[0030] In an exemplary embodiment of the present application, step S500 further includes:

[0031] Step S510: If the arrangement order of several service area identifiers in the service area identifier list does not conform to the preset arrangement rule, the service area identifiers in the service area identifier list that do not conform to the preset arrangement rule are obtained in sequence to obtain a first service area identifier list E = (E1, E2, ..., E h ,...,E p ); wherein h = 1, 2, ..., p; p is the number of service area identifiers in the service area identifier list that do not conform to the preset arrangement rule; E h The hth service area identifier in the service area identifier list that does not conform to the preset arrangement rule;

[0032] Step S520: Get E h The service area identifiers corresponding to the ranks in the service area identifier list in the preset arrangement rule are obtained to obtain a second service area identifier list F=(F1, F2, ..., F h ,...,F p ), where F h For E h The service area identifiers corresponding to the ranks in the service area identifier list in the preset arrangement rule;

[0033] Step S530: Get F h Each service sub-area in the corresponding service area is in E h The service status of the corresponding service area at the start time of the service time period;

[0034] Step S540, set h=1;

[0035] Step S550: if h≤p, execute step S560; if h>p, output a service area identification list and several service time periods;

[0036] Step S560: h The start time of the service time period of the corresponding service area, if F h The service status of each service sub-area in the corresponding service area is in working state, then step S570 is executed; if F h If there is a service sub-area in a non-working state in the corresponding service area, step S580 is executed;

[0037] Step S570: add the items in the second service area identifier list F and E h Same service area ID and F h Replace and adjust the rank of h, set h=h+1, and execute step S550;

[0038] Step S580: output an alarm signal and the first service area identification list E.

[0039] In an exemplary embodiment of the present application, step S580 includes:

[0040] Step S581, determining the service sub-area as the service sub-area to be operated;

[0041] Step S582: Get the h At the start time of the service time period of the corresponding service area, the service waiting queue of the waiting service sub-area;

[0042] Step S583: if the rank of the vehicle to be served in the service waiting queue is greater than the preset rank threshold, execute step S570; if the rank of the vehicle to be served in the service waiting queue is less than or equal to the preset rank threshold, output an alarm signal and the first service area identification list E.

[0043] In an exemplary embodiment of the present application, after step S500, the vehicle service monitoring method further includes:

[0044] Step S600: Establish an association relationship between the service time period of the service area corresponding to each service area identifier in the service area identifier list and each service area identifier in the service area identifier list;

[0045] Step S610: Output the vehicle identification corresponding to the vehicle to be served, the service area identification list and the service time period of each service area to the visualization platform for display.

[0046] In an exemplary embodiment of the present application, the interval between adjacent boundaries of every two adjacent service areas is greater than a preset interval distance.

[0047] The present invention has at least the following beneficial effects:

[0048] The vehicle service monitoring method of the present invention determines the service area where each position coordinate is located according to the positional relationship between the position coordinates sent by the vehicle tag to be serviced within the target time period and the boundary point coordinates of each service area, determines the service time period corresponding to each service area according to the acquisition time of the several position coordinates corresponding to each service area, and sorts the service area identification of the service area corresponding to each position coordinate according to the acquisition order of the several position coordinates to obtain a service area identification list. If the arrangement order of the several service area identifications in the service area identification list meets the arrangement rule, the service area identification list and the several service time periods are output to realize the monitoring of the service time and service order of the whole process of vehicle service, which greatly reduces manual intervention and improves the accuracy of data collection. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0050] Figure 1 A flow chart of a vehicle service monitoring method provided by an embodiment of the present invention. DETAILED DESCRIPTION

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

[0052] A vehicle service monitoring method is applied to a vehicle service monitoring system. The vehicle service monitoring system is connected to a visualization platform.

[0053] The vehicle service monitoring system is used to count the service time of each service stage of the vehicle to be serviced and to determine whether the service process of the vehicle to be serviced complies with the specifications, so as to facilitate the staff to monitor the service quality of each vehicle. The vehicle to be serviced is a vehicle that requires vehicle service (such as repair service or maintenance service), and the service stage is the stage in the corresponding vehicle service process for the vehicle to be serviced (such as the vehicle inspection stage, vehicle maintenance stage, vehicle cleaning stage, etc. in the maintenance service).

[0054] The visualization platform (which may be a display screen) is used to receive and display the data information output by the vehicle service monitoring system so that the vehicle owner can view the service process of the vehicle to be serviced.

[0055] The vehicle service monitoring system stores a space grid map corresponding to the target space, the space grid map includes a number of service areas, each service area has a unique service area identifier, and each service area includes a number of service sub-areas.

[0056] The target space may be a place that provides services for vehicles (such as a vehicle maintenance center). The spatial grid map is obtained by plane scanning the target space and performing grid processing. The service area may be a place where a vehicle to be serviced is served at a certain service stage (such as the service area during the vehicle washing stage is the washing area of ​​a vehicle maintenance center). Each service stage corresponds to a service area (such as an inspection area corresponding to a vehicle inspection stage, a maintenance area corresponding to a vehicle maintenance stage, and a washing area corresponding to a vehicle washing stage). Each service area has a corresponding service area identifier (such as the service area identifier corresponding to the inspection area is 1, the service area identifier corresponding to the maintenance area is 2, and the service area identifier corresponding to the washing area is 3). Each service area includes several service sub-areas, and the service sub-areas may be workstations in the corresponding service area (such as a washing area includes three car washing workstations, that is, the washing area can provide washing services to three vehicles to be serviced at the same time, and each car washing workstation is a service sub-area in the service area corresponding to the washing area).

[0057] In order to make the subsequent location information of the vehicle to be served more accurate and reduce the positioning error, the interval between the adjacent boundaries of each two adjacent service areas is set to be greater than the preset interval distance (for example, if the inspection area and the maintenance area are adjacent, the interval between the two adjacent boundaries of the inspection area and the maintenance area is greater than 50 centimeters).

[0058] like Figure 1 As shown, the vehicle service monitoring method described in this application includes the following steps:

[0059] Step S100, obtaining a number of position coordinates sent by the vehicle tag to be serviced within a target time period;

[0060] The vehicle tag to be serviced is configured in the vehicle to be serviced, and the vehicle tag to be serviced may be a positioning tag that sends a position signal in real time.

[0061] The vehicle tag to be serviced can be placed in the vehicle to be serviced by the service personnel in the target space after the vehicle to be serviced enters the target space, so as to determine the specific location of the vehicle to be serviced by receiving the location signal sent by the vehicle tag to be serviced.

[0062] The start time of the target time period is the time when the vehicle to be served enters the target space, and the end time of the target time period is the time when the vehicle to be served leaves the target space.

[0063] The position coordinates are the grid coordinates corresponding to the position of the vehicle tag to be serviced at the corresponding time in the spatial grid map.

[0064] As a feasible embodiment, an image acquisition device (such as a camera) is set at the entrance of the target space, and a positioning base station is set in each service area of ​​the target space. When the vehicle to be serviced enters the target space, the image acquisition device will collect the characteristics of the vehicle to be serviced (such as model, grade, color, license plate, etc.) and notify the service personnel. After receiving the notification, the service personnel will bind the label of the vehicle to be serviced with the characteristic information of the vehicle to be serviced, and place the label of the vehicle to be serviced after the information is bound in the center of the vehicle to be serviced (such as hanging it on the rearview mirror inside the vehicle). The service personnel will guide the vehicle to be serviced to enter each service area in turn. The corresponding vehicle service is performed in the domain. During the process of the vehicle to be serviced performing the vehicle service, the positioning base station will receive the location signal sent by the tag of the vehicle to be serviced in real time, and transmit the location coordinates in the location signal to the vehicle service monitoring system. The vehicle service monitoring system determines the location of the vehicle to be serviced in the spatial grid map corresponding to the target space through the location coordinates. After the vehicle to be serviced completes all the vehicle services, the service personnel will take out the tag of the vehicle to be serviced from the vehicle to be serviced, and unbind the association relationship between the tag of the vehicle to be serviced and the vehicle to be serviced, so as to establish the association relationship between the tag of the vehicle to be serviced and the vehicle to be serviced when the next vehicle to be serviced performs the vehicle service.

[0065] Further, step S100 includes step S110:

[0066] Step S110: Obtain the position coordinates sent by the vehicle tag to be serviced at each moving moment in the target time period to obtain a position coordinate list A = (A1, A2, ..., A m ,...,A n );A m =(A m1 ,A m2 ), where m = 1, 2, ..., n, and n is the number of moving moments in the target time period; A m A is the location coordinate sent by the vehicle tag to be served at the mth moving moment in the target time period; m1 A m The horizontal axis of m2 A m The vertical coordinate of

[0067] The location signal sent by the tag of the vehicle to be served is real-time, and if the location coordinates in the location signal at the current moment have not changed compared with the location coordinates at the previous moment, it means that the vehicle to be served has not moved. Since the technical problem to be solved by this application is to monitor the process and service time of vehicle service, therefore, when the vehicle to be served has not moved, it means that the vehicle to be served is in a service state or a waiting service state at this time, and when the position of the vehicle to be served changes, it means that the vehicle to be served is about to move from the previous service area to the next service area. The service end time node corresponding to the previous service area and the service start node corresponding to the next service area in this process are the information required for the subsequent calculation of the service time, while the time node in the service state is not the information required by this application. Therefore, in order to reduce the data processing and storage amount of the location coordinates, the moving time is limited to the time when the vehicle to be served moves, that is, only the location coordinates sent by the tag of the vehicle to be served at the moving time are received and data processing is performed.

[0068] Step S200, determining the service area corresponding to each position coordinate according to the positional relationship between each position coordinate and the coordinates of the boundary points of each service area;

[0069] The service area corresponding to each location coordinate is the service area where the location coordinate is located.

[0070] Further, step S200 includes steps S210 to S220:

[0071] Step S210: Obtain the boundary point coordinates of each service sub-area to obtain a boundary point coordinate list set B1, B2, ..., B i ,...,B j ; Where i = 1, 2, ..., j; j is the number of service areas; B i is the boundary point coordinate list set of the i-th service area;

[0072] B i =(B i1 ,B i2 ,...,B ic ,...,B id(i) ), c = 1, 2, ..., d(i), d(i) is the number of service sub-areas in the i-th service area, B ic is the coordinate list of the boundary points of the cth service sub-area in the ith service area;

[0073] B ic =(B ic1 ,B ic2 ,...,B ice ,...,B icf(ic)); e = 1, 2, ..., f(ic); f(ic) is the number of boundary points of the cth service sub-area in the ith service area; B ice are the coordinates of the e-th boundary point of the c-th service sub-area in the ith service area;

[0074] B ice =(B ice1 ,B ice2 );B ice1 For B ice The horizontal axis of ice2 For B ice The vertical coordinate of

[0075] Step S220, traverse each position coordinate, if MIN(B ic11 ,B ic21 ,...,B ice1 ,...,B icf(ic)1 )<A m1 <MAX(B ic11 ,B ic21 ,...,B ice1 ,...,B icf(ic)1 ), and MIN(B ic12 ,B ic22 ,...,B ice2 ,...,B icf(ic)2 )<A m2 <MAX(B ic12 ,B ic22 ,...,B ice2 ,...,B icf(ic)2 ), then the i-th service area is determined as A m Corresponding service area; the cth service sub-area of ​​the ith service area is determined as A m The corresponding service sub-area; MIN() is a preset minimum value determination function; MAX() is a preset maximum value determination function.

[0076] If A m1 ≤MIN(B ic11 ,B ic21 ,...,B ice1 ,...,B icf(ic)1 ) or A m1 ≥MAX(B ic11 ,B ic21 ,...,B ice1 ,...,B icf(ic)1 ) or A m2 ≤MIN(B ic12 ,B ic22 ,...,B ice2 ,...,B icf(ic)2 ) or Am2 ≥MAX(B ic12 ,B ic22 ,...,B ice2 ,...,B icf(ic)2 ), then A m The corresponding position is not in any service area, indicating that the vehicle to be served is in A m The corresponding acquisition time is located on the moving path from the previous service area to the next service area.

[0077] Step S300, determining a service time period corresponding to each service area according to the acquisition time of a plurality of position coordinates corresponding to each service area;

[0078] The service time period corresponding to the service area is the total service time of the vehicle to be serviced when the vehicle service is performed in the service area.

[0079] Further, step S300 includes steps S310 to S340:

[0080] Step S310: Obtain the acquisition time of each position coordinate to obtain an acquisition time list K = (K1, K2, ..., K m ,...,K n ), where K m is the acquisition time of the mth position coordinate;

[0081] Step S320, traverse A1, A2, ..., A in sequence m ,...,A n , if A m The corresponding service area is the same as A m+1 If the corresponding service areas are the same, K m+1 Delete from the acquisition time list K to obtain the processed acquisition time list G = (G1, G2, ..., G a ,...,G b ); where a=1,2,...,b; b is the number of acquisition times obtained after processing; G a is the ath acquisition time obtained after processing;

[0082] If A m The corresponding service area is the same as A m+1 If the corresponding service areas are the same, it means that the vehicle to be served is in A m The corresponding acquisition time to A m+1 The service phase in the time period corresponding to the acquisition time has not changed, indicating that the vehicle to be served is in A m+1 The corresponding acquisition time is still in A m The corresponding service stage at the acquisition time, since this application needs to determine the total service time of each service area, and the vehicle to be served is in Am+1 The corresponding acquisition time has not yet ended A m The corresponding service stage at the acquisition time, therefore, it is necessary to continue to determine the end time of the service stage, so A m+1 The corresponding acquisition time K m+1 It is deleted from the acquisition time list K. Therefore, after processing, each acquisition time in the acquisition time list G is the service start time or service end time of each service stage, which is convenient for the subsequent determination of the service time of each service area.

[0083] Step S330: G g -G g-1 Determined to be G g-1 The initial time period of the service area where the corresponding location coordinates are located, t0-G b Determined to be G b The initial time period of the service area where the corresponding location coordinates are located, so as to obtain the initial time period list T = (T1, T2, ..., T a ,...,T b ), where g = 2, ..., b; t0 is the time when the vehicle to be served leaves the target space; T a G a The initial time period of the service area where the corresponding location coordinates are located;

[0084] Step S340: traverse the initial time period list T, if there is a a If the corresponding service areas have the same initial time period, the sum of several initial time periods corresponding to the same service area is determined as the service time period corresponding to the service area;

[0085] There are several initial time periods with the same service area in the initial time period list T, which means that the vehicle to be serviced has successively undergone the same service stage during the service process (for example, the vehicle to be serviced first underwent the maintenance stage, then the quality inspection stage, and then the maintenance stage). Therefore, in order to count the total service time of each service stage, it is necessary to add up the initial time periods of the same service stage to obtain the total service time of the service stage, that is, the service time period of the service area corresponding to the service stage.

[0086] If the initial time period list T does not contain a If the corresponding service area has the same initial time period, then T a Determined as T a The service time period of the corresponding service area.

[0087] Step S400: sorting the service area identifiers of the service areas corresponding to each position coordinate according to the acquisition order of the plurality of position coordinates to obtain a service area identifier list;

[0088] Step S500: if the arrangement order of the service area identifiers in the service area identifier list conforms to a preset arrangement rule, then output the service area identifier list and the service time periods;

[0089] If the arrangement order of several service area identifications in the service area identification list conforms to the preset arrangement rule, it means that the service process of the vehicle to be served conforms to the normal process specification, and the overall service process and the service time of each service stage are output.

[0090] Further, step S500 also includes steps S510 to S580:

[0091] Step S510: If the arrangement order of several service area identifiers in the service area identifier list does not conform to the preset arrangement rule, the service area identifiers in the service area identifier list that do not conform to the preset arrangement rule are obtained in sequence to obtain a first service area identifier list E = (E1, E2, ..., E h ,...,E p ); wherein h = 1, 2, ..., p; p is the number of service area identifiers in the service area identifier list that do not conform to the preset arrangement rule; E h The hth service area identifier in the service area identifier list that does not conform to the preset arrangement rule;

[0092] Step S520: Get E h The service area identifiers corresponding to the ranks in the service area identifier list in the preset arrangement rule are obtained to obtain a second service area identifier list F=(F1, F2, ..., F h ,...,F p ), where F h For E h The service area identifiers corresponding to the ranks in the service area identifier list in the preset arrangement rule;

[0093] Step S530: Get F h Each service sub-area in the corresponding service area is in E h The service status of the corresponding service area at the start time of the service time period;

[0094] Step S540, set h=1;

[0095] Step S550: if h≤p, execute step S560; if h>p, output the service area identification list and several service time periods, and execute step S600;

[0096] Step S560: h The start time of the service time period of the corresponding service area, if Fh The service status of each service sub-area in the corresponding service area is in working state, then step S570 is executed; if F h If there is a service sub-area in a non-working state in the corresponding service area, step S580 is executed;

[0097] Step S570: add the items in the second service area identifier list F and E h Same service area ID and F h Replace and adjust the rank of h, set h=h+1, and execute step S550;

[0098] Step S580: output an alarm signal and the first service area identification list E.

[0099] As another feasible embodiment of the present application, step S580 includes steps S581 to S583:

[0100] Step S581, determining the service sub-area as the service sub-area to be operated;

[0101] Step S582: Get the h At the start time of the service time period of the corresponding service area, the service waiting queue of the waiting service sub-area;

[0102] Step S583: if the rank of the vehicle to be served in the service waiting queue is greater than the preset rank threshold, execute step S570; if the rank of the vehicle to be served in the service waiting queue is less than or equal to the preset rank threshold, output an alarm signal and the first service area identification list E.

[0103] If the arrangement order of several service area identifiers in the service area identifier list does not conform to the preset arrangement rules, it means that the service process of the vehicle to be serviced does not conform to the normal process specifications (for example, the normal service process is vehicle maintenance service, tire maintenance service, sheet metal maintenance service, but the arrangement order of the service stages corresponding to several service area identifiers in the service area identifier list is tire maintenance service, sheet metal maintenance service, vehicle maintenance service). At this time, it is necessary to obtain the service status of the corresponding service area in the normal service process, such as obtaining the service status of the service sub-area corresponding to the vehicle maintenance service. If each service sub-area corresponding to the vehicle maintenance service has its own In the service waiting queue of a service sub-area where other vehicles are being served or no vehicle is being served, the vehicle to be served is ranked relatively late. At this time, in order to shorten the waiting time of the vehicle to be served, the service stages of the vehicle to be served are allowed to be replaced in sequence. It first goes to a service area with less waiting time or no waiting time for service, and then returns to the replaced service area for service. Therefore, in this case, it is also considered that the service process of the vehicle to be served complies with the normal process specifications. In other cases, it is considered that the service process of the vehicle to be served does not comply with the normal process specifications, and an alarm signal and a first service area identification list E are output to prompt the service personnel or users.

[0104] Step S600: Establish an association relationship between the service time period of the service area corresponding to each service area identifier in the service area identifier list and each service area identifier in the service area identifier list;

[0105] Step S610: Output the vehicle identification corresponding to the vehicle to be served, the service area identification list and the service time period of each service area to the visualization platform for display.

[0106] Users and service personnel can view the location of the vehicle to be serviced and the current service stage in real time on the visualization platform.

[0107] The vehicle service monitoring method of the present invention is based on positioning technology. According to the positional relationship between a plurality of position coordinates sent by a tag of a vehicle to be serviced within a target time period and the coordinates of the boundary points of each service area, the service area where each position coordinate is located is determined (the service link where the vehicle is located is identified by self-collecting vehicle positioning data through a positioning device and drawing an electronic fence). According to the acquisition time of the plurality of position coordinates corresponding to each service area, the service time period corresponding to each service area is determined. According to the acquisition order of the plurality of position coordinates, the service area identifiers of the service area corresponding to each position coordinate are sorted to obtain a service area identifier list. If the arrangement order of the plurality of service area identifiers in the service area identifier list conforms to the arrangement rule, the service area identifier list and the plurality of service time periods are output to realize the monitoring of the service time and service sequence of the entire vehicle service process, which greatly reduces manual intervention, improves the accuracy of data collection, and achieves the purpose of real-time and accurate monitoring of the time efficiency of each link in the entire service process.

[0108] Compared with the prior art, the workload of manual participation required by the present invention is almost negligible, and does not affect the development of business. At the same time, the current indoor positioning technology has achieved a positioning accuracy of 10-30cm, which is more than enough for application in automobile after-sales service scenarios, and compared with the camera recognition method of the prior art, the present invention is not easily affected by environmental interference and has the characteristics of high reliability. Since the service timeliness monitoring of the present invention is based on positioning technology, there is no requirement for whether the vehicle has a license plate. It only needs to bind the positioning tag to the vehicle, which can basically meet all scenarios, and the coverage and anti-interference of the positioning signal are also much greater than the camera recognition method. Using UWB-AOA positioning technology, while ensuring accuracy, one base station can cover a radius of 20 meters, so only a small amount of equipment needs to be deployed to meet the monitoring needs of all areas of the target space, so the hardware cost required by the present invention is also relatively low.

[0109] An embodiment of the present invention further provides a computer program product, which includes program code. When the program product is run on an electronic device, the program code is used to enable the electronic device to execute the steps of the method according to various exemplary embodiments of the present invention described above in this specification.

[0110] In addition, although the steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.

[0111] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the implementation of the present disclosure.

[0112] In an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.

[0113] It will be appreciated by those skilled in the art that various aspects of the present invention may be implemented as a system, method or program product. Therefore, various aspects of the present invention may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as a "circuit", "module" or "system".

[0114] The electronic device according to this embodiment of the present invention is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0115] The electronic device is presented in the form of a general-purpose computing device. The components of the electronic device may include, but are not limited to: the at least one processor mentioned above, the at least one storage device mentioned above, and a bus connecting different system components (including storage devices and processors).

[0116] The storage stores program codes, which can be executed by the processor, so that the processor executes the steps according to various exemplary embodiments of the present invention described in the above “Exemplary Method” section of this specification.

[0117] The memory may include readable media in the form of volatile memory, such as random access memory (RAM) and / or cache memory, and may further include read only memory (ROM).

[0118] The storage may also include a program / utility having a set (at least one) of program modules, such program modules including but not limited to: an operating system, one or more application programs, other program modules and program data, each of which or some combination may include the implementation of a network environment.

[0119] The bus may represent one or more of several types of bus structures including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures.

[0120] The electronic device may also communicate with one or more external devices (e.g., keyboards, pointing devices, Bluetooth devices, etc.), one or more devices that enable a user to interact with the electronic device, and / or any device that enables the electronic device to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface. Furthermore, the electronic device may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) via a network adapter.

[0121] In an exemplary embodiment of the present disclosure, a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of the present specification is stored. In some possible implementations, various aspects of the present invention can also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to execute the steps according to various exemplary embodiments of the present invention described in the above "Exemplary Method" section of the present specification.

[0122] The program product may use any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0123] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0124] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.

[0125] Program code for performing the operations of the present invention may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).

[0126] In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to an exemplary embodiment of the present invention, and are not intended to be limiting. It is easy to understand that the processes shown in the above-mentioned figures do not indicate or limit the time sequence of these processes. In addition, it is also easy to understand that these processes can be performed synchronously or asynchronously, for example, in multiple modules.

[0127] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

[0128] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed by the present invention should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims

1. A vehicle service monitoring method, characterized in that: Applied to a vehicle service monitoring system, wherein a space grid map corresponding to a target space is stored in the vehicle service monitoring system, wherein the space grid map includes a plurality of service areas, and each of the service areas corresponds to a unique service area identifier; The method comprises the following steps: Step S100, obtaining a number of position coordinates sent by a tag of a vehicle to be serviced within a target time period; the tag of the vehicle to be serviced is configured in the vehicle to be serviced; the start time of the target time period is the time when the vehicle to be serviced enters the target space, and the end time of the target time period is the time when the vehicle to be serviced leaves the target space; Step S200, determining the service area corresponding to each of the position coordinates according to the positional relationship between each of the position coordinates and the coordinates of the boundary points of each of the service areas; Step S300, determining a service time period corresponding to each service area according to the acquisition time of the plurality of position coordinates corresponding to each service area; Step S400: sorting the service area identifiers of the service areas corresponding to each of the position coordinates according to the acquisition order of the plurality of position coordinates to obtain a service area identifier list; Step S500: if the arrangement order of the service area identifiers in the service area identifier list conforms to a preset arrangement rule, output the service area identifier list and the service time periods; Wherein, the step S100 includes step S110: Step S110: Obtain the location coordinates sent by the vehicle tag to be serviced at each moving moment in the target time period to obtain a location coordinate list A=(A1, A2, ..., A m ,...,A n );A m =(A m1 ,A m2 ), where m=1,2,...,n; n is the number of moving moments in the target time period; A m A is the position coordinates sent by the tag of the vehicle to be served at the mth moving moment in the target time period; m1 A m The horizontal axis of m2 A m The moving time is the time when the vehicle to be serviced moves; Wherein, the step S300 includes steps S310 to S340: Step S310: Obtain the acquisition time of each position coordinate to obtain an acquisition time list K=(K1, K2, ..., K m ,...,K n ), where K m is the acquisition time of the mth position coordinate; Step S320, traverse A1, A2, ..., A in sequence m ,...,A n , if A m The corresponding service area is the same as A m+1 If the corresponding service areas are the same, K m+1 Delete from the acquisition time list K to obtain the processed acquisition time list G=(G1, G2, ..., G a ,...,G b ); where a=1,2,...,b; b is the number of acquisition times obtained after processing; G a is the ath acquisition time obtained after processing; Step S330: G g -G g-1 Determined to be G g-1 The initial time period of the service area where the corresponding location coordinates are located, t0-G b Determined to be G b The initial time period of the service area where the corresponding location coordinates are located, so as to obtain the initial time period list T=(T1, T2, ..., T a ,...,T b ); where g=2,...,b; t0 is the time when the vehicle to be served leaves the target space; T a G a The initial time period of the service area where the corresponding location coordinates are located; Step S340: traverse the initial time period list T, if the initial time period list T contains a If the corresponding service areas have the same initial time period, the sum of several initial time periods corresponding to the same service area is determined as the service time period corresponding to the service area; If the initial time period list T does not contain a If the corresponding service area has the same initial time period, then T a Determined as T a The service time period of the corresponding service area.

2. The method according to claim 1, characterized in that Each of the service areas includes a plurality of service sub-areas; Wherein, the step S200 includes: Step S210: Obtain the boundary point coordinates of each service sub-area to obtain a boundary point coordinate list set B1, B2, ..., B i ,...,B j ; Wherein, i=1,2,...,j; j is the number of the service areas; B i is a list of boundary point coordinates of the ith service area; B i =(B i1 ,B i2 ,...,B ic ,...,B id(i) ), c = 1, 2, ..., d(i), d(i) is the number of service sub-areas in the i-th service area; B ic is a list of boundary point coordinates of the cth service sub-area in the ith service area; B ic =(B ic1 ,B ic2 ,...,B ice ,...,B icf(ic) ); e = 1, 2, ..., f (ic); f (ic) is the number of boundary points of the c-th service sub-area in the ith service area; B ice are the coordinates of the e-th boundary point of the c-th service sub-area in the ith service area; B ice =(B ice1 ,B ice2 );B ice1 For B ice The horizontal axis of ice2 For B ice The vertical coordinate of Step S220, traverse each of the position coordinates, if MIN(B ic11 ,B ic21 ,...,B ice1 ,...,B icf(ic)1 )<A m1 <MAX(B ic11 ,B ic21 ,...,B ice1 ,...,B icf(ic)1 ), and MIN(B ic12 ,B ic22 ,...,B ice2 ,...,B icf(ic)2 )<A m2 <MAX(B ic12 ,B ic22 ,...,B ice2 ,...,B icf(ic)2 ), then the i-th service area is determined as A m The corresponding service area; the cth service sub-area of ​​the i-th service area is determined as A m The corresponding service sub-area; MIN() is a preset minimum value determination function; MAX() is a preset maximum value determination function.

3. The method according to claim 1, characterized in that: The step S500 further includes: Step S510: If the arrangement order of several service area identifiers in the service area identifier list does not conform to the preset arrangement rule, the service area identifiers in the service area identifier list that do not conform to the preset arrangement rule are obtained in sequence to obtain a first service area identifier list E=(E1, E2, ..., E h ,...,E p ); wherein h=1,2,...,p; p is the number of service area identifiers in the service area identifier list that do not conform to the preset arrangement rule; E h The hth service area identifier in the service area identifier list that does not conform to the preset arrangement rule; Step S520: Get E h The service area identifiers whose ranks in the service area identifier list correspond to the service area identifiers in the preset arrangement rule are used to obtain a second service area identifier list F=(F1, F2, ..., F h ,...,F p ), where F h For E h The service area identifiers corresponding to the ranks in the service area identifier list in the preset arrangement rule; Step S530: Get F h Each service sub-area in the corresponding service area is in E h The service status of the corresponding service area at the start time of the service time period; Step S540, set h=1; Step S550: if h≤p, execute step S560; if h>p, output the service area identification list and several service time periods; Step S560: h The start time of the service time period of the corresponding service area, if F h The service status of each service sub-area in the corresponding service area is in working state, then step S570 is executed; if F h If there is a service sub-area in a non-working state in the corresponding service area, step S580 is executed; Step S570: add the second service area identifier list F and E h Same service area ID and F h Replace and adjust the rank of h, set h=h+1, and execute step S550; Step S580: output an alarm signal and the first service area identification list E.

4. The method according to claim 3, characterized in that The step S580 includes: Step S581, determining the service sub-area as the service sub-area to be operated; Step S582: Get the h At the start time of the service time period of the corresponding service area, the service waiting queue of the waiting service sub-area; Step S583: If the rank of the vehicle to be served in the service waiting queue is greater than the preset rank threshold, execute step S570; if the rank of the vehicle to be served in the service waiting queue is less than or equal to the preset rank threshold, output an alarm signal and the first service area identification list E.

5. The method according to claim 4, characterized in that The vehicle service monitoring system is connected to a visualization platform; Wherein, after step S500, the method further includes: Step S600: establishing an association relationship between the service time period of the service area corresponding to each service area identifier in the service area identifier list and each service area identifier in the service area identifier list; Step S610: Output the vehicle identification corresponding to the to-be-serviced vehicle, the service area identification list, and the service time period of each service area to the visualization platform for display.

6. The method according to claim 5, characterized in that The interval between adjacent boundaries of each two adjacent service areas is greater than a preset interval distance.

7. A non-transitory computer-readable storage medium, wherein at least one instruction or at least one program is stored in the storage medium, and the at least one instruction or the at least one program is loaded and executed by a processor to implement the vehicle service monitoring method as described in any one of claims 1-6.

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

Images