Queue duration estimation method, device and related equipment based on vehicle data

Through the queuing time estimate method based on vehicle data, accurate queuing information is provided, and the problem of tourists waiting for vehicles in scenic spots is solved, and the game experience and scenic spot management efficiency is improved.

CN113780608BActive Publication Date: 2024-11-19JINGDONG CITY BEIJING DIGITS TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202011291760.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2020-11-18
Publication Date
2024-11-19
Estimated Expiration
2040-11-18

AI Technical Summary

Technical Problem

Due to the lack of accurate queue time information when tourists are waiting for vehicles in large scenic spots, blind waiting and waste of resources, reducing the gaming experience and reputation of the scenic spot.

Method used

Based on vehicle data, the queuing time estimate method is used to obtain the historical driving trajectory of the target vehicle, estimate the stay time, the number of guests on board and the number of guests down, calculate the minimum waiting number of vehicles and the estimated queuing time, and provide accurate queuing information.

Benefits of technology

Help tourists make reasonable waiting decisions, improve the gaming experience, save time, and enhance the reputation of the scenic spot.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113780608B_ABST
    Figure CN113780608B_ABST
Patent Text Reader

Abstract

The embodiments of the present disclosure provide a method, device, electronic device and readable medium for estimating the queuing time based on vehicle data, the method comprising: obtaining the historical driving trajectory of the target vehicle; determining the estimated stay time, estimated number of passengers boarding and estimated number of passengers disembarking of the target vehicle at a preset site based on the historical driving trajectory; receiving a request for estimating the duration of a target site among the preset sites, and determining the minimum number of waiting vehicles s based on the estimated number of passengers boarding, estimated number of passengers disembarking and the number of people in line at the target site; determining the estimated queuing time of the target site based on the minimum number of waiting vehicles s and the estimated stay time; and sending the estimated queuing time in response to the time estimation request. The method, device, electronic device and readable medium for estimating the queuing time based on vehicle data provided by the embodiments of the present disclosure can accurately estimate the estimated queuing time of each site based on vehicle data, thereby helping tourists make reasonable decisions on whether to wait in line.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of intelligent transportation technology, and in particular to a method, device, electronic device and computer-readable medium for estimating queue duration based on vehicle data. Background Art

[0002] With the rapid economic development and the improvement of people's living standards, comprehensive tourist attractions have become one of the popular choices for people's leisure, entertainment and vacation. However, no matter which large scenic spot in which city, it is always crowded during holidays. Queuing at the cable car boarding area, sightseeing bus waiting area, and entrance to popular sub-attractions often takes at least half an hour, or even most of the day. At the same time, because tourists do not know how long the queue will take, they may travel back and forth between various attractions and cannot make full use of their time to go to other places in the park for rest, dining, shopping, etc., which greatly reduces the experience of playing, easily affects the reputation of tourists at the scenic spot, and is not conducive to the long-term development of the scenic spot.

[0003] For the waiting areas for cable cars, sightseeing buses, shuttle buses, etc., most scenic spots currently only have waiting areas, and no vehicle information is provided to tourists in the waiting areas. A few scenic spots will provide a fixed vehicle schedule for tourists to refer to, but they cannot flexibly convey vehicle information based on the on-site vehicle situation. These may cause tourists to wait blindly or blindly choose the shuttle method between attractions, thus wasting time and reducing the travel experience.

[0004] Therefore, a new method, device, electronic device and computer-readable medium for estimating queue duration based on vehicle data is needed.

[0005] The above information disclosed in this Background section is only for enhancement of understanding of the background of the present disclosure and therefore it may contain information that does not constitute the prior art that is already known to one of ordinary skill in the art. Summary of the invention

[0006] In view of this, the embodiments of the present disclosure provide a method, device, electronic device and computer-readable medium for estimating queue time based on vehicle data, which can accurately estimate the estimated queue time for each station based on vehicle data, thereby helping tourists make reasonable decisions on whether to wait in line.

[0007] Other features and advantages of the present disclosure will become apparent from the following detailed description, or may be learned in part by the practice of the present disclosure.

[0008] According to a first aspect of an embodiment of the present disclosure, a method for estimating queuing time based on vehicle data is proposed, the method comprising: obtaining a historical driving trajectory of a target vehicle; determining an estimated stay time, an estimated number of passengers getting on and an estimated number of passengers getting off of the target vehicle at a preset site based on the historical driving trajectory; receiving a time estimation request for a target site among the preset sites, and determining a minimum number of waiting vehicles s based on the estimated number of passengers getting on, the estimated number of passengers getting off and the number of people queuing at the target site; determining an estimated queuing time at the target site based on the minimum number of waiting vehicles s and the estimated stay time; and sending the estimated queuing time in response to the time estimation request.

[0009] In an exemplary embodiment of the present disclosure, the method further includes: determining a trajectory location in the historical driving trajectory whose stay time is greater than a stay time threshold as a stay point; matching the coordinate information of the stay point with the coordinate information of the preset site to obtain the stay point corresponding to the preset site; and determining the stay time of the stay point corresponding to the preset site as the historical stay time of the target vehicle at the preset site.

[0010] In an exemplary embodiment of the present disclosure, determining the estimated stay time, the estimated number of passengers boarding and the estimated number of passengers disembarking of the target vehicle at a preset site based on the historical driving trajectory includes: determining the historical number of passengers before, the historical number of passengers and the historical number of passengers after the target vehicle at the preset site based on camera data acquired by a camera device in the target vehicle; determining the historical number of passengers disembarking of the target vehicle at the preset site based on the historical number of passengers before, the historical number of passengers and the historical number of passengers after the target vehicle at the preset site; and using a time series model to process the historical stay time, the historical number of passengers and the historical number of passengers disembarking, respectively, to obtain the estimated stay time, the estimated number of passengers boarding and the estimated number of passengers disembarking of the target vehicle at the preset site.

[0011] In an exemplary embodiment of the present disclosure, determining the minimum number of waiting vehicles s based on the estimated number of passengers boarding the target vehicle, the estimated number of passengers disembarking, and the number of people queuing at the target site includes: determining the target vehicle that will pass through the target site based on preset route information of the target vehicle; sorting the target vehicles that will pass through the target site based on the road network distance between the target vehicles that will pass through the target site and the target site to obtain a target vehicle sequence; determining the minimum number of waiting vehicles s based on the number of people queuing at the target site, the maximum passenger capacity of the target vehicle, the estimated number of passengers boarding, and the estimated number of passengers disembarking.

[0012] In an exemplary embodiment of the present disclosure, determining the minimum number of waiting vehicles s according to the number of people queuing at the target site, the maximum number of passengers accommodating the target vehicle, the estimated number of passengers boarding, and the estimated number of passengers disembarking includes: determining the current value of i; determining the total number of people that can be carried by the first i target vehicles in the target vehicle sequence at the target site according to the maximum number of passengers accommodating the target vehicle, the estimated number of passengers boarding, and the estimated number of passengers disembarking; when the total number of people that can be carried is less than the number of people queuing for the target vehicles, updating the current value of i according to a preset step size and then looping through the above steps; when the total number of people that can be carried is greater than or equal to the number of people queuing for the target vehicle, determining the current value of i as the minimum number of waiting vehicles s.

[0013] In an exemplary embodiment of the present disclosure, determining the estimated queuing time of the target site according to the minimum number of waiting vehicles s and the estimated stay time includes: determining the sth target vehicle in the target vehicle sequence according to the minimum number of waiting vehicles s; determining the travel time of the sth target vehicle to reach the target site according to the current travel data of the sth target vehicle in the target vehicle sequence; determining the total stay time at the site according to the estimated stay time of the sth target vehicle in the target vehicle sequence at the preset site; determining the estimated queuing time of the target site according to the travel time of the sth target vehicle in the target vehicle sequence and the sum of the stay time at the site.

[0014] In an exemplary embodiment of the present disclosure, determining the total stop time of the sth target vehicle at a preset stop based on the estimated stop time of the sth target vehicle in the target vehicle sequence includes: determining the passing stops based on the preset route information of the sth target vehicle in the target vehicle sequence; and determining the total stop time at the stop based on the sum of the estimated stop times of the sth target vehicle in the target vehicle sequence at the passing stops.

[0015] According to a second aspect of an embodiment of the present disclosure, a queuing time estimation device based on vehicle data is proposed, and the device includes: a data acquisition module, configured to acquire a historical driving trajectory of a target vehicle; a data estimation module, configured to determine an estimated stay time, an estimated number of passengers getting on and an estimated number of passengers getting off of the target vehicle at a preset site based on the historical driving trajectory; a vehicle number calculation module, configured to respond to a data acquisition request for a target site among the preset sites, and determine a minimum number of waiting vehicles s based on the estimated number of passengers getting on, the estimated number of passengers getting off and the number of people queuing at the target site; a time estimation module, configured to determine an estimated queuing time at the target site based on the minimum number of waiting vehicles s and the estimated stay time; and a request response module, configured to send the estimated queuing time in response to the data acquisition request.

[0016] According to the third aspect of an embodiment of the present disclosure, an electronic device is proposed, which includes: one or more processors; a storage device for storing one or more programs; when the one or more programs are executed by the one or more processors, the one or more processors implement any of the above-mentioned methods for estimating queuing time based on vehicle data.

[0017] According to a fourth aspect of an embodiment of the present disclosure, a computer-readable medium is provided, on which a computer program is stored. When the program is executed by a processor, the method for estimating the queuing time based on vehicle data as described in any one of the above items is implemented.

[0018] According to the method, device, electronic device and computer-readable medium for estimating the queuing duration based on vehicle data provided by certain embodiments of the present disclosure, the target vehicle's historical driving trajectory is used to make predictions, and the target vehicle's estimated stay duration, estimated number of passengers boarding and estimated number of passengers disembarking at a preset site can be predicted. When a request for estimating the duration of a target site among the preset sites is received, the minimum number of waiting vehicles s can be accurately calculated based on the estimated number of passengers boarding, estimated number of passengers disembarking and the number of people in line at the target site. Furthermore, the estimated queuing duration of the target site can be determined based on the minimum number of waiting vehicles s and the estimated stay duration, thereby helping tourists make reasonable decisions on whether to wait in line.

[0019] It is to be understood that the foregoing general description and the following detailed description are exemplary only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] The drawings herein are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the specification are used to explain the principles of the present disclosure. The drawings described below are only some embodiments of the present disclosure, and for ordinary technicians in this field, other drawings can also be obtained based on these drawings without creative work.

[0021] Figure 1 It is a system block diagram of a method and device for estimating queue duration based on vehicle data according to an exemplary embodiment.

[0022] Figure 2 The figure is a flow chart of a method for estimating queue duration based on vehicle data according to an exemplary embodiment.

[0023] Figure 3 The figure is a flow chart of a method for estimating queue duration based on vehicle data according to an exemplary embodiment.

[0024] Figure 4The figure is a flow chart of a method for estimating queue duration based on vehicle data according to an exemplary embodiment.

[0025] Figure 5 The figure is a data flow diagram of a method for estimating queuing time based on vehicle data according to an exemplary embodiment.

[0026] Figure 6 The present invention is a block diagram of a device for estimating queue duration based on vehicle data according to an exemplary embodiment.

[0027] Figure 7 A block diagram schematically shows an electronic device in an exemplary embodiment of the present disclosure. DETAILED DESCRIPTION

[0028] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in many forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that the present invention will be comprehensive and complete and fully convey the concepts of the example embodiments to those skilled in the art. The same reference numerals in the figures represent the same or similar parts, and thus their repeated description will be omitted.

[0029] The described features, structures or characteristics may be combined in one or more embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present invention. However, those skilled in the art will appreciate that the technical solution of the present invention may be practiced while omitting one or more of the specific details, or other methods, components, devices, steps, etc. may be adopted. In other cases, known methods, devices, implementations or operations are not shown or described in detail to avoid blurring various aspects of the present invention.

[0030] The accompanying drawings are only schematic illustrations of the present invention, and the same reference numerals in the drawings represent the same or similar parts, so their repeated description will be omitted. Some block diagrams shown in the accompanying drawings do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or in one or more hardware modules or integrated circuits, or in different networks and / or processor devices and / or microcontroller devices.

[0031] The flowcharts shown in the accompanying drawings are only exemplary and do not necessarily include all the contents and steps, nor must they be executed in the order described. For example, some steps can be decomposed, and some steps can be combined or partially combined, so the actual execution order may change according to actual conditions.

[0032] Exemplary embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

[0033] Figure 1 It is a system block diagram of a method and device for estimating queue duration based on vehicle data according to an exemplary embodiment.

[0034] The server 105 may be a server that provides various services, such as a background management server (only for example) that provides support for the queue time estimation system based on vehicle data operated by the user using the terminal devices 101, 102, and 103. The background management server may analyze and process the received data such as the queue time estimation request based on vehicle data, and feed back the processing result (such as the estimated queue time - only for example) to the terminal device.

[0035] The server 105 may, for example, obtain the historical driving trajectory of the target vehicle; the server 105 may, for example, determine the estimated stay time, estimated number of passengers boarding, and estimated number of passengers disembarking of the target vehicle at a preset site based on the historical driving trajectory; the server 105 may, for example, receive a request for estimating the duration of a target site among the preset sites, and determine the minimum number of waiting vehicles s based on the estimated number of passengers boarding, the estimated number of passengers disembarking, and the number of people queuing at the target site. The server 105 may, for example, determine the estimated queuing duration of the target site based on the minimum number of waiting vehicles s and the estimated stay time. The server 105 may, for example, send the estimated queuing duration in response to the duration estimation request.

[0036] The server 105 can be a physical server, or can be composed of multiple servers, a part of the server 105 can be used as a queuing time estimation task submission system based on vehicle data in the present disclosure, for obtaining tasks to be executed based on vehicle data queue time estimation commands; and a part of the server 105 can also be used as a queuing time estimation system based on vehicle data in the present disclosure, for obtaining historical driving trajectories of target vehicles; determining the estimated stay time, estimated number of boarding passengers and estimated number of disembarking passengers of the target vehicle at a preset station according to the historical driving trajectory; receiving a time estimation request for a target station among the preset stations, determining the minimum number of waiting vehicles s according to the estimated number of boarding passengers, the estimated number of disembarking passengers and the number of people queuing at the target station; determining the estimated queuing time of the target station according to the minimum number of waiting vehicles s and the estimated stay time; and sending the estimated queuing time in response to the time estimation request.

[0037] According to the method and device for estimating queuing time based on vehicle data provided by the embodiments of the present disclosure, the estimated queuing time at each station can be accurately estimated based on the vehicle data, thereby helping tourists make reasonable decisions on whether to queue or not.

[0038] Figure 2 It is a flowchart of a method for estimating the queuing time based on vehicle data according to an exemplary embodiment. The method for estimating the queuing time based on vehicle data provided in the embodiment of the present disclosure can be executed by any electronic device with computing and processing capabilities, such as terminal devices 101, 102, 103 and / or server 105. In the following embodiments, the server execution method is used as an example for illustration, but the present disclosure is not limited to this. The method 20 for estimating the queuing time based on vehicle data provided in the embodiment of the present disclosure may include steps S202 to S210. The data flow diagram of the method for estimating the queuing time based on vehicle data in the embodiment of the present disclosure can be, for example Figure 5 shown.

[0039] like Figure 2 As shown, in step S202, the historical driving trajectory of the target vehicle is obtained.

[0040] In the disclosed embodiment, the target vehicle may be a sightseeing vehicle in a scenic area. The historical driving trajectory may include coordinate information of the track locations that the target vehicle passed during driving in a preset historical time period. The historical driving trajectory may also include the length of time that the target vehicle stayed at the track locations that it passed.

[0041] In an exemplary embodiment, a trajectory location in a historical driving trajectory whose stay time is greater than a stay time threshold can be determined as a stay point; the coordinate information of the stay point is matched with the coordinate information of a preset site to obtain the stay point corresponding to the preset site; and the stay time of the stay point corresponding to the preset site is determined as the historical stay time of the target vehicle at the preset site.

[0042] The preset station can be a sightseeing bus station in the scenic area. The historical stay time of the target vehicle at the preset station can be divided according to the preset time period. Each stay point can be represented by sp = {lat sp , lng sp ,stime sp}, where lat sp is the latitude of the station point sp, lng sp is the longitude of the station point sp, stime sp is the dwell time of the dwell point sp. The historical dwell time is the time that the target vehicle in the historical driving trajectory stops at the preset station within the preset time period to wait for passengers to get on and off.

[0043] In step S204, the estimated stay time, the estimated number of boarding passengers, and the estimated number of disembarking passengers of the target vehicle at a preset station are determined based on the historical driving trajectory.

[0044] In the disclosed embodiment, the estimated dwell time is the estimated time that the target vehicle stops at a preset station within a preset time period to wait for passengers to get on and off.

[0045] In an exemplary embodiment, the number of passengers before, the number of passengers after, and the number of passengers at a preset station in history can be determined based on the camera data acquired by the camera device in the target vehicle; the number of passengers leaving the target vehicle at the preset station in history can be determined based on the number of passengers before, the number of passengers after, and the number of passengers at the preset station in history. And the estimated stay time, the estimated number of passengers boarding, and the estimated number of passengers leaving the target vehicle at the preset station can be determined based on the number of passengers before, the number of passengers, and the number of passengers at the preset station in history.

[0046] The camera data acquired by the camera device in the target vehicle may include the camera data of the target vehicle before arriving at the preset station, during the historical stay time, and after leaving the preset station. By performing image processing and face detection (or pedestrian detection) on the camera data, the number of passengers before the target vehicle at the preset station, the number of passengers after the target vehicle, and the number of passengers after the target vehicle at the preset station can be obtained. Assume that during the historical driving process of the target vehicle, the number of passengers before the target vehicle at each preset station is represented as pass before , the number of guests in history is represented as Up, and the number of guests after history is represented as Pass after , then the target vehicle has the number of historical passengers Down at the preset station = pass after -pass before +Up.

[0047] Among them, when determining the estimated stay time, estimated number of boarding passengers and estimated number of disembarking passengers of the target vehicle at the preset site according to the historical number of passengers before, the historical number of passengers and the historical number of passengers after at the preset site, the time series model can be used to process the historical stay time, the historical number of passengers and the historical number of disembarking passengers respectively to obtain the estimated stay time, estimated number of boarding passengers and estimated number of disembarking passengers of the target vehicle at the preset site.

[0048] The historical stay time ST, the historical number of passengers Up and the historical number of passengers leaving Down can be modeled in time series to obtain the trend, periodicity and seasonality of the target vehicle in these three aspects in each preset time period during the historical driving process, so as to obtain the estimated stay time estST, the estimated number of passengers picking up estUp and the estimated number of passengers leaving estDown of the target vehicle in a specified time period in the future.

[0049] In the embodiment of the present disclosure, in steps S202 to S204, it is possible to estimate the estimated duration of stay, the estimated number of passengers boarding, and the estimated number of passengers disembarking of the target vehicle at the preset site. The algorithm input may include the historical driving trajectory of the target vehicle, the maximum passenger capacity, the number of passengers boarding at each preset site during each preset time period (which can be obtained through the ticket gate), the site identification of the preset site, and the longitude and latitude information (coordinate information) of the preset site. The historical driving trajectory may include the vehicle identification (ID) of the target vehicle, the longitude and latitude information, and the number of passengers at each moment obtained by the camera. Then, the estimated duration of stay, the estimated number of passengers boarding, and the estimated number of passengers disembarking of the target vehicle at each preset site during the preset time period can be output.

[0050] In step S206, a request for estimating the duration of a target station among preset stations is received, and the minimum number of waiting vehicles s is determined according to the estimated number of passengers getting on and off the target vehicle and the number of people queuing at the target station.

[0051] In the embodiment of the present disclosure, the duration estimation request may be, for example, when a visitor A is to A The minimum number of waiting vehicles s can be generated when the decision is made whether to go to the queue area of ​​the preset station X (i.e. the target station) to queue up for the sightseeing bus (for example, it can be accurate to seconds). A The number of target vehicles that the last visitor in the queue area of ​​target station X needs to wait for when he queues to the first one in the queue.

[0052] In step S208, the estimated queuing time at the target station is determined according to the minimum number of waiting vehicles s and the estimated stay time.

[0053] In the embodiment of the present disclosure, the time T can be determined according to the minimum number of vehicles s. A The estimated stay time of the target vehicle that the last tourist in the queue area of ​​the target site X is about to take and the current driving data of the target vehicle are calculated to obtain the time required for the target vehicle to travel to the target site, that is, the estimated queue time.

[0054] In step S210, the estimated queuing duration is sent in response to the duration estimation request.

[0055] In the embodiment of the present disclosure, after sending the estimated queuing time, the decision time T A The estimated waiting time is displayed on information screens, mini-programs, official accounts, etc. at various preset stations or prominent locations within the viewing area.

[0056] According to the method for estimating the queuing duration based on vehicle data provided by the embodiment of the present disclosure, the target vehicle's historical driving trajectory is used for prediction, and the estimated stay duration, estimated number of passengers boarding, and estimated number of passengers disembarking of the target vehicle at the preset site can be predicted. When a request for estimating the duration of a target site among the preset sites is received, the minimum number of waiting vehicles s can be accurately calculated based on the estimated number of passengers boarding, the estimated number of passengers disembarking, and the number of people in the queue at the target site. Furthermore, the estimated queuing duration of the target site can be determined based on the minimum number of waiting vehicles s and the estimated stay duration, thereby helping tourists make reasonable decisions on whether to wait in line.

[0057] In an exemplary embodiment, the time series model may obtain a period of [T A -T w , T A -1] The number of tourists at each scenic spot in each period during this period of history. Among them, T w is the time window parameter, the unit can be, for example, day, T w The larger the value, the better the prediction effect. Generally, T w =90. Decomposing the time series into three terms, namely, seasonal term, trend term and cycle term, it can be expressed in two forms of addition or multiplication, namely: t =S t +T t +R t and t =S t *T t *R t Among them, S t is the seasonal term, T t is the trend term, R t is a periodic term. If the amplitude of seasonal fluctuations or the fluctuation of trend periodic terms does not change with the change of the level of the time series, then the additive model is the most appropriate. When the change of the seasonal term or trend periodic term is proportional to the level of the time series, then the multiplicative model is more appropriate. In the embodiment of the present disclosure, since the seasonal fluctuation amplitude and periodic fluctuation of the three data to be modeled change little with the level of the time series, it is more appropriate to use the additive model.

[0058] Commonly used time series decomposition algorithms include, but are not limited to, autoregressive moving average model (ARMA) model, seasonal extraction method (SEATS decomposition method), X11 decomposition method, STL decomposition method, etc. The decomposed time series can be expressed as: in is the seasonally adjusted part. To forecast a decomposed time series, we need to forecast the seasonal terms separately. and seasonally adjusted The seasonal term is usually assumed to be constant, or to change very slowly, so it can be predicted by simply using the estimate of the seasonal term for the last year. That is, any non-seasonal forecasting method can be used to forecast the seasonally adjusted component. For example, a random walk with drift can be used, or cubic exponential smoothing can be used.

[0059] In the embodiment of the present disclosure, the indicator can be predicted using, for example, a triple exponential smoothing method (Holt-Winters). The Holt-Winters method includes a prediction equation and three smoothing equations: one for level l t , one for trend b t , one for the seasonal component s t , and the corresponding smoothing parameters are α, β, and γ. m is used to represent the seasonal frequency, that is, the number of seasonal cycles contained in a year. In the scenario of the embodiment of the present disclosure, a day is regarded as a seasonal change cycle, and the operating period of the target vehicle in a day is [T s , T e ], the unit is minutes. If the time period is divided into hours, there are a total of time period, i.e.

[0060] The smoothing parameters and initial estimates of the components are obtained by minimizing the root mean square error (RMSE).

[0061] In an exemplary embodiment, in step S208, the sth target vehicle in the target vehicle sequence may be determined according to the minimum number of waiting vehicles s; the travel time for the sth target vehicle to reach the target station may be determined according to the current travel data of the sth target vehicle in the target vehicle sequence. Determine the total stop time at the preset stop based on the estimated stop time of the sth target vehicle in the target vehicle sequence According to the travel time of the sth target vehicle in the target vehicle sequence and the total time spent at the site Determine the estimated queue time at the target site.

[0062] Among them, the current driving data of the target vehicle can be expressed as Info on ={lng, lat, speed, time, pass}, which respectively represent the longitude, latitude, speed, time, and number of passengers of the target vehicle at the current moment. Travel time It represents the time it takes for the sth target vehicle in the target vehicle sequence to reach the target station X. The travel time is equal to the time it takes for the sth target vehicle to reach the target station X at time T A The road network distance from the target site X and the current speed of the sth target vehicle in the target vehicle sequence sratio.

[0063] The total time spent at a specific station When the target vehicle sequence is s, the passing sites can be determined according to the preset route information of the sth target vehicle in the target vehicle sequence; the total stop time at the passing sites can be determined according to the sum of the estimated stop times of the sth target vehicle in the target vehicle sequence at the passing sites.

[0064] Among them, the sth target vehicle in the target vehicle sequence needs to stop at q passing stations before stopping at the target station X, then Where j∈(0,q] represents the jth preset station that the sth target vehicle in the target vehicle sequence needs to pass before arriving at the target station X, T j Indicates the moment when the jth preset station is passed, ST j It is the estimated stay time of the sth target vehicle in the target vehicle sequence at the jth preset station.

[0065] Determine the estimated waiting time waitTime at the target site X X When , it can be obtained according to the following formula:

[0066]

[0067] In an exemplary embodiment, the estimated queue time waitTime can be calculated in real time according to the actual operation status of the target vehicle. X For example, the actual arrival time of the target vehicle that has arrived at the target station and the estimated arrival time of the target vehicle that has not arrived at the target station can be used to obtain And according to waitTime sum Estimated waiting time waitTime x Make corrections.

[0068] Figure 3 FIG. 1 is a flow chart showing a method for estimating the queuing time based on vehicle data according to an exemplary embodiment. Figure 3 As shown, the queuing time estimation method based on vehicle data provided by the embodiment of the present disclosure may include steps S302 to S306 when "determining the minimum number of waiting vehicles s based on the estimated number of passengers getting on the target vehicle, the estimated number of passengers getting off the target vehicle and the number of people queuing at the target station".

[0069] In step S302, a target vehicle that will pass through a target site is determined according to preset route information of the target vehicle.

[0070] In the embodiment of the present disclosure, the preset route information of the target vehicle is, for example, a fixed driving route of the target vehicle pre-set in the landscape area and preset stations along the way. Each target vehicle may include offline driving information Info off={line, cap}, where line represents the preset driving route of the target vehicle, and cap represents the maximum passenger capacity of the target vehicle. The target vehicle that will pass through the target site can be determined based on the current driving data of the target vehicle and the preset route information of the target vehicle. The target vehicle that includes the target site in the preset route information but has not yet arrived at the target site can be determined by determining the target vehicle that will pass through the target site through the longitude and latitude of the target vehicle at the current moment and the preset route information of the target vehicle.

[0071] In step S304, the target vehicles that will pass through the target site are sorted according to the road network distance between the target vehicles that will pass through the target site and the target site to obtain a target vehicle sequence.

[0072] In the embodiment of the present disclosure, the road network distance between the target vehicle that will pass through the target site and the target site can be obtained based on the road network information of the place where the target vehicle is located (such as a landscape area), such as Figure 5 The road network information can be expressed as Route = {r1, r2, ..., r k , ..., r K}, r k Indicates the kth road section in the road network, which consists of K road sections in total. Among them, the longitude and latitude of the target vehicle that will pass through the target site, the longitude and latitude of the target site, and the road network information in the park can be used to determine the road network distance between the target vehicle that will pass through the target site and the target site. The target site can be represented as Info p ={id, loc, waitNum}, which respectively represent the site ID, longitude and latitude of the target site and the number of people waiting at the current moment. Among them, the road network distance is the actual distance from the target vehicle to the target site along the route information preset in the road network information, rather than the Euclidean straight line distance between two points. Among them, when sorting, the target vehicle sequence can be obtained by sorting from small to large according to the road network distance.

[0073] In step S306, the minimum number of waiting vehicles s is determined according to the number of people queuing at the target station, the maximum number of passengers that the target vehicle can accommodate, the estimated number of boarding passengers, and the estimated number of unloading passengers.

[0074] In an exemplary embodiment, if Figure 4 As shown, step S306 may include the following steps S402 to S408.

[0075] In step S402, the current value of i is determined.

[0076] In the embodiment of the present disclosure, during the first execution, the value of i may be initialized to 1, for example.

[0077] In step S404, the total number of passengers that can be carried by the first i target vehicles in the target vehicle sequence at the target station is determined according to the maximum passenger capacity, the estimated number of boarding passengers, and the estimated number of unloading passengers of the target vehicle.

[0078] In the embodiment of the present disclosure, the current number of passengers of the i-th target vehicle before stopping at the target station X can be expressed as The number of passengers that the i-th target vehicle can carry when it stops at the target station X can be expressed as cap i -pass i +estDown i , among which, cap i is the maximum passenger capacity of the i-th target vehicle in the target vehicle sequence, pass i is the number of passengers when the i-th target vehicle in the target vehicle sequence stops at the target station X, estDown i is the estimated number of passengers for the i-th target vehicle in the target vehicle sequence at the target station X.

[0079] In step S406, when the total number of people that can be carried is less than the number of people in the queue of the target vehicle, the current value of i is updated according to the preset step size and the above steps are executed in a loop.

[0080] In the embodiment of the present disclosure, the total number of people that can be carried is less than the number of people in the queue of the target vehicle, which can be expressed as follows:

[0081]

[0082] In step S408, when the total number of persons that can be carried is greater than or equal to the number of persons in the queue of the target vehicle, the current value of i is determined as the minimum number of waiting vehicles s.

[0083] According to the queuing time estimation method based on vehicle data provided by the embodiment of the present disclosure, when determining the estimated queuing time, the target vehicle's dwelling time is added as a factor, so that the estimated queuing time obtained can be made more accurate. The current driving data of the target vehicle, such as speed, frequency, and full load, is used in combination with the current number of people queuing at the site to estimate the waiting time of the last tourist in the current waiting queue at the target site, thereby helping tourists make reasonable decisions on whether to wait in line. By analyzing the historical driving trajectory of the target vehicle, the target vehicle's dwelling time, the number of passengers boarding and the number of passengers disembarking at different preset sites at different time periods are mined, thereby accurately guiding the estimation of the time it takes for the target vehicle to arrive at the target site.

[0084] It should be clearly understood that the present disclosure describes how to form and use specific examples, but the principles of the present disclosure are not limited to any details of these examples. On the contrary, based on the teachings of the contents disclosed in the present disclosure, these principles can be applied to many other embodiments.

[0085] Those skilled in the art will appreciate that all or part of the steps for implementing the above embodiments are implemented as a computer program executed by a central processing unit (CPU). When the computer program is executed by the central processing unit (CPU), the above functions defined by the above method provided by the present disclosure are executed. The program may be stored in a computer-readable storage medium, which may be a read-only memory, a disk or an optical disk, etc.

[0086] In addition, it should be noted that the above figures are only schematic illustrations of the processes included in the method according to the exemplary embodiments of the present disclosure, and are not intended to be limiting. It is easy to understand that the processes shown in the above 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.

[0087] The following are embodiments of the device disclosed herein, which can be used to execute the method embodiments disclosed herein. For details not disclosed in the device embodiments disclosed herein, please refer to the method embodiments disclosed herein.

[0088] Figure 6 is a block diagram of a queue duration estimation device based on vehicle data according to an exemplary embodiment. Figure 6 The queuing duration estimation device 60 based on vehicle data provided in the embodiment of the present disclosure may include: a data acquisition module 602, a data estimation module 604, a vehicle number calculation module 606, a duration estimation module 608 and a request response module 610.

[0089] In the queuing duration estimation device 60 based on vehicle data, the data acquisition module 602 may be configured to acquire the historical driving trajectory of the target vehicle.

[0090] The data estimation module 604 may be configured to determine the estimated duration of stay, the estimated number of boarding passengers, and the estimated number of disembarking passengers of the target vehicle at a preset station based on the historical driving trajectory.

[0091] The vehicle number calculation module 606 can be configured to respond to a data acquisition request for a target site among the preset sites, and determine the minimum waiting vehicle number s based on the estimated number of boarding passengers, the estimated number of unboarding passengers, and the number of people queuing at the target site.

[0092] The duration estimation module 608 may be configured to determine the estimated queue duration at the target station according to the minimum number of waiting vehicles s and the estimated stay duration.

[0093] The request response module 610 may be configured to send an estimated queuing time in response to a data acquisition request.

[0094] According to the queuing duration estimation device based on vehicle data provided by the embodiment of the present disclosure, the target vehicle's historical driving trajectory is used for prediction, and the estimated stay duration, estimated number of passengers boarding, and estimated number of passengers disembarking of the target vehicle at the preset site can be predicted. When a duration estimation request for a target site among the preset sites is received, the minimum number of waiting vehicles s can be accurately calculated based on the estimated number of passengers boarding, the estimated number of passengers disembarking, and the number of people in the queue at the target site. Furthermore, the estimated queue duration of the target site can be determined based on the minimum number of waiting vehicles s and the estimated stay duration, thereby helping tourists make reasonable decisions on whether to queue.

[0095] Refer to the following Figure 7 An electronic device 700 according to this embodiment of the present invention will be described. Figure 7 The electronic device 700 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0096] like Figure 7 As shown, the electronic device 700 is in the form of a general computing device. The components of the electronic device 700 may include but are not limited to: at least one processing unit 710, at least one storage unit 720, and a bus 730 connecting different system components (including the storage unit 720 and the processing unit 710).

[0097] The storage unit stores program codes, which can be executed by the processing unit 710, so that the processing unit 710 performs the steps of various exemplary embodiments of the present invention described in the above “Exemplary Method” section of this specification. For example, the processing unit 710 can perform the following steps: Figure 2 Step S202 shown in: obtaining the historical driving trajectory of the target vehicle; step S204: determining the estimated stay time, estimated number of passengers boarding and estimated number of passengers disembarking of the target vehicle at a preset site based on the historical driving trajectory; step S206: receiving a time estimate request for a target site among the preset sites, and determining the minimum number of waiting vehicles s based on the estimated number of passengers boarding, estimated number of passengers disembarking of the target vehicle and the number of people queuing at the target site; step S208: determining the estimated queuing time at the target site based on the minimum number of waiting vehicles s and the estimated stay time; step S210: sending the estimated queuing time in response to the data acquisition request.

[0098] The storage unit 720 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 7201 and / or a cache storage unit 7202 , and may further include a read-only storage unit (ROM) 7203 .

[0099] The storage unit 720 may also include a program / utility 7204 having a set (at least one) of program modules 7205, such program modules 7205 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 an implementation of a network environment.

[0100] Bus 730 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

[0101] The electronic device 700 may also communicate with one or more external devices 800 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 700, and / or communicate with any device that enables the electronic device 700 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 750. Furthermore, the electronic device 700 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 760. As shown, the network adapter 760 communicates with other modules of the electronic device 700 via a bus 730. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 700, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0102] 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 terminal device, or a network device, etc.) to execute the method according to the implementation of the present disclosure.

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

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

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

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

[0107] 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).

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

[0109] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The specification and examples are to be considered exemplary only, and the true scope and concept of the present disclosure are indicated by the claims.

Claims

1. A method for estimating queuing time based on vehicle data, characterized in that: include: Obtain the historical driving trajectory of the target vehicle; Determine the estimated stay time, estimated number of boarding passengers, and estimated number of disembarking passengers of the target vehicle at a preset station according to the historical driving trajectory; Receive a time estimation request for a target station among the preset stations, determine a target vehicle that will pass through the target station according to preset route information, and determine a minimum number of waiting vehicles s according to the estimated number of passengers boarding the target vehicle, the estimated number of passengers disembarking, and the number of people queuing at the target station; Determine the estimated queuing time at the target site according to the minimum number of waiting vehicles s and the estimated stay time; Sending the estimated queuing duration in response to the duration estimation request; Wherein, determining the estimated stay time, estimated number of boarding passengers and estimated number of disembarking passengers of the target vehicle at the preset station according to the historical driving trajectory comprises: determining the estimated stay time, estimated number of boarding passengers and estimated number of disembarking passengers of the target vehicle at the preset station according to the historical stay time, historical number of passengers and historical number of disembarking passengers of the target vehicle at the preset station; The method of determining the estimated queuing time of the target site according to the minimum number of waiting vehicles s and the estimated stay time includes: determining the sth target vehicle in the target vehicle sequence according to the minimum number of waiting vehicles s, and determining the estimated queuing time of the target site according to the current driving data of the sth target vehicle in the target vehicle sequence and the estimated stay time at a preset site.

2. The method according to claim 1, characterized in that Also includes: Determine a trajectory location in the historical driving trajectory where the stay time is greater than the stay time threshold as a stay point; Matching the coordinate information of the station point with the coordinate information of the preset site to obtain the station point corresponding to the preset site; The stay time of the stay point corresponding to the preset station is determined as the historical stay time of the target vehicle at the preset station.

3. The method according to claim 2, characterized in that Determining the estimated stay time of the target vehicle at a preset station, the estimated number of boarding passengers, and the estimated number of unboarding passengers according to the historical driving trajectory includes: Determine the number of passengers before, the number of passengers in history, and the number of passengers after history of the target vehicle at the preset site according to the camera data acquired by the camera device in the target vehicle; Determine the historical number of passengers of the target vehicle at the preset station according to the historical number of passengers before, the historical number of passengers and the historical number of passengers after the target vehicle at the preset station; The historical stay time, the historical number of passengers picked up, and the historical number of passengers disembarking are processed respectively using a time series model to obtain the estimated stay time, the estimated number of passengers picked up, and the estimated number of passengers disembarking of the target vehicle at the preset site.

4. The method according to claim 1, characterized in that Determining the minimum number of waiting vehicles s according to the estimated number of boarding passengers of the target vehicle, the estimated number of unboarding passengers, and the number of people queuing at the target station includes: Sorting the target vehicles that will pass through the target site according to the road network distance between the target vehicles that will pass through the target site and the target site to obtain a target vehicle sequence; The minimum number of waiting vehicles s is determined according to the number of people queuing at the target site, the maximum number of passengers that the target vehicle can accommodate, the estimated number of passengers boarding, and the estimated number of passengers leaving.

5. The method according to claim 4, characterized in that Determining the minimum number of waiting vehicles s according to the number of people queuing at the target station, the maximum number of passengers that the target vehicle can accommodate, the estimated number of boarding passengers, and the estimated number of unloading passengers includes: Determine the current value of i; Determine the total number of passengers that can be carried by the first i target vehicles in the target vehicle sequence at the target station according to the maximum passenger capacity of the target vehicle, the estimated number of boarding passengers, and the estimated number of unboarding passengers; When the total number of people that can be carried is less than the number of people in the queue of the target vehicle, the current value of i is updated according to a preset step length and the above steps are executed in a loop; When the total number of persons that can be carried is greater than or equal to the number of persons in the queue of the target vehicle, the current value of i is determined as the minimum number of waiting vehicles s.

6. The method according to claim 1, characterized in that Determining the estimated queuing time of the target station according to the minimum number of waiting vehicles s and the estimated stay time includes: Determine the travel time of the sth target vehicle to the target site according to the current travel data of the sth target vehicle in the target vehicle sequence; Determine the total stop time at the preset stop according to the estimated stop time of the sth target vehicle in the target vehicle sequence; The estimated queuing time of the target station is determined according to the travel time of the sth target vehicle in the target vehicle sequence and the sum of the stay time at the station.

7. The method according to claim 6, characterized in that Determining the total stop time of the sth target vehicle at a preset stop according to the estimated stop time of the sth target vehicle in the target vehicle sequence includes: Determine the passing site according to the preset route information of the sth target vehicle in the target vehicle sequence; The total stop time at the stop is determined according to the sum of the estimated stop times of the sth target vehicle in the target vehicle sequence at the stop.

8. A queue time estimation device based on vehicle data, characterized in that: include: A data acquisition module configured to acquire a historical driving trajectory of a target vehicle; A data estimation module is configured to determine an estimated stay time, an estimated number of boarding passengers, and an estimated number of disembarking passengers of the target vehicle at a preset station according to the historical driving trajectory; a vehicle number calculation module, configured to respond to a data acquisition request for a target station among the preset stations, determine a target vehicle that will pass through the target station according to preset route information, and determine a minimum waiting vehicle number s according to the estimated number of passengers boarding the target vehicle, the estimated number of passengers disembarking, and the number of people queuing at the target station; A duration estimation module, configured to determine an estimated queuing duration at the target station according to the minimum number of waiting vehicles s and the estimated stay duration; A request response module, configured to send the estimated queuing time in response to a data acquisition request; The data acquisition module is configured to determine the estimated stay time, estimated number of boarding passengers and estimated number of disembarking passengers of the target vehicle at the preset site according to the historical stay time, historical number of passengers and historical number of disembarking passengers of the target vehicle at the preset site; The duration estimation module is configured to determine the sth target vehicle in the target vehicle sequence according to the minimum number of waiting vehicles s, and determine the estimated queuing duration at the target site according to the current driving data of the sth target vehicle in the target vehicle sequence and the estimated stay duration at the preset site.

9. An electronic device, characterized in that: include: one or more processors; A storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 7.

10. A computer readable medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.