Method and device for determining vehicle stop point

Abstract

The present invention discloses a method and device for determining a vehicle stop point, and relates to the field of computer technology. A specific implementation of the method includes: obtaining the current position of a target vehicle; determining multiple adjacent stop points of the target vehicle according to the current position; determining the passenger flow of the station corresponding to each of the adjacent stop points, the passenger flow of the station is used to characterize the passenger flow in the process of moving the target vehicle from the current position to the adjacent stop point; according to the passenger flow of the station corresponding to each of the adjacent stop points, determining the recommended stop point of the target vehicle from the multiple adjacent stop points. This implementation can dynamically adjust the vehicle's driving route according to the passenger flow, and improve the service efficiency of the target vehicle.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a method and device for determining a vehicle stop point. Background Art

[0002] The unmanned vending trucks in the scenic area provide convenience for tourists, who can buy goods anytime and anywhere. Usually, the route of the unmanned vending truck is planned in advance. The unmanned vending truck drives along the predetermined route and sells goods at designated stops. After staying for a certain period of time, it goes to the next stop. The operation mode of the unmanned vending truck is fixed and single, and the sales efficiency is low. Summary of the invention

[0003] In view of this, an embodiment of the present invention provides a method and device for determining a vehicle stop point, which can dynamically adjust the route according to the passenger flow and improve the sales efficiency of an unmanned vending truck.

[0004] In a first aspect, an embodiment of the present invention provides a method for determining a vehicle stop point, comprising:

[0005] Get the current position of the target vehicle;

[0006] Determining a plurality of adjacent parking points of the target vehicle based on the current position;

[0007] Determine the passenger flow of each station corresponding to each of the adjacent stops, wherein the passenger flow of the station is used to characterize the passenger flow in the process of moving the target vehicle from the current position to the adjacent stop;

[0008] According to the station passenger flow corresponding to each of the adjacent stops, a recommended stop for the target vehicle is determined from the plurality of adjacent stops.

[0009] Optionally, determining the passenger flow of each of the adjacent stops includes:

[0010] Dividing the process of moving the target vehicle from the current position to the adjacent stop point into at least one sub-process;

[0011] Determine the process passenger flow of the target vehicle in each of the sub-processes;

[0012] The station passenger flow corresponding to each of the adjacent stops is determined according to the process passenger flow corresponding to each of the sub-processes.

[0013] Optionally, the process of moving the target vehicle from the current position to the adjacent stop point is divided into at least one sub-process, including:

[0014] Determining a travel time required for the target vehicle to move from the current position to the adjacent stop;

[0015] According to the moving time, the process of moving the target vehicle from the current position to the adjacent stop point is divided into at least one sub-process, each of the sub-processes corresponding to a preset time period;

[0016] The determining of the process passenger flow of the target vehicle in each of the sub-processes includes:

[0017] Dividing the area where the target vehicle moves into a plurality of grids;

[0018] Determine a plurality of target grids corresponding to each of the sub-processes;

[0019] Determine the grid passenger flow corresponding to each of the target grids;

[0020] The process passenger flow of the target vehicle in the sub-process is determined according to the grid flow corresponding to each of the target grids.

[0021] Optionally, determining a plurality of adjacent stop points of the target vehicle according to the current position includes:

[0022] Get the station location of each alternative stop;

[0023] For each candidate stop point: calculating the station distance between the target vehicle and the candidate stop point according to the current position of the target vehicle and the station position of the candidate stop point;

[0024] The candidate stop points whose station distance is less than the distance threshold are determined as the neighboring stop points of the target vehicle.

[0025] Optionally, obtaining the site location of each candidate stop includes:

[0026] Get station information for multiple stops;

[0027] Obtaining station information of at least one recent historical stop of the target vehicle;

[0028] The station information of the at least one most recent historical stop point is removed from the station information of the plurality of stop points to obtain the station information of the candidate stop point.

[0029] Optionally, before determining a plurality of adjacent stop points of the target vehicle according to the current position, the method further includes:

[0030] determining an inventory amount in the target vehicle;

[0031] When the inventory quantity meets the preset conditions, the replenishment warehouse is determined as the recommended stop point for the target vehicle.

[0032] Optionally, after determining the recommended stop point for the target vehicle from the plurality of adjacent stop points, the method further includes:

[0033] Determining whether there is a transfer stop between the current position of the target vehicle and the recommended stop;

[0034] In the case where there is a transfer stop point between the current position and the recommended stop point, the transfer stop point is determined as the recommended stop point for the target vehicle.

[0035] In a second aspect, an embodiment of the present invention provides a device for determining a vehicle stop point, comprising:

[0036] A position acquisition module is used to obtain the current position of the target vehicle;

[0037] A first determining module, configured to determine a plurality of adjacent stopping points of the target vehicle according to the current position;

[0038] A passenger flow determination module, used to determine the passenger flow of each station corresponding to each adjacent stop, wherein the passenger flow of the station is used to characterize the passenger flow in the process of moving the target vehicle from the current position to the adjacent stop;

[0039] The second determining module is used to determine a recommended stop point for the target vehicle from the plurality of adjacent stop points according to the station passenger flow corresponding to each of the adjacent stop points.

[0040] In a third aspect, an embodiment of the present invention provides an electronic device, including:

[0041] one or more processors;

[0042] a storage device for storing one or more programs,

[0043] When the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any of the above embodiments.

[0044] In a fourth aspect, an embodiment of the present invention provides a computer-readable medium having a computer program stored thereon, wherein the program, when executed by a processor, implements the method described in any of the above embodiments.

[0045] An embodiment of the above invention has the following advantages or beneficial effects: determining the passenger flow of each adjacent stop point of the target vehicle, and then determining the recommended stop point of the target vehicle from multiple adjacent stops according to the passenger flow of each adjacent stop point. The method of the embodiment of the present invention can dynamically adjust the route according to the passenger flow in the area near the target vehicle, thereby improving the service efficiency of the target vehicle.

[0046] The further effects of the above-mentioned non-conventional optional manner will be described below in conjunction with specific implementation examples. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] The accompanying drawings are used to better understand the present invention and do not constitute an improper limitation of the present invention.

[0048] Figure 1 It is a flowchart of a method for determining a vehicle stop point provided by an embodiment of the present invention;

[0049] Figure 2 is a flow chart of another method for determining a vehicle stop point provided by an embodiment of the present invention;

[0050] Figure 3 is a flow chart of another method for determining a vehicle stop point provided by an embodiment of the present invention;

[0051] Figure 4 is a flow chart of another method for determining a vehicle stop point provided by an embodiment of the present invention;

[0052] Figure 5 is a schematic structural diagram of a device for determining a vehicle stop point provided by an embodiment of the present invention;

[0053] Figure 6 It is a schematic diagram of the structure of a computer system of a terminal device or a server suitable for implementing an embodiment of the present invention. DETAILED DESCRIPTION

[0054] The following is a description of exemplary embodiments of the present invention in conjunction with the accompanying drawings, including various details of the embodiments of the present invention to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present invention. Similarly, for clarity and conciseness, the description of well-known functions and structures is omitted in the following description.

[0055] Figure 1 FIG. 1 is a flow chart of a method for determining a vehicle stop point provided by an embodiment of the present invention. Figure 1 As shown, the method includes:

[0056] Step 101: Get the current position of the target vehicle.

[0057] The target vehicle is a vehicle that needs to dynamically plan its route. The target vehicle can be a sales vehicle, a performance vehicle, a rescue vehicle, or a publicity vehicle.

[0058] Step 102: Determine a plurality of adjacent stop points of the target vehicle according to the current position.

[0059] There are many ways to determine the adjacent stop points. For example, the stop points within a certain distance from the current position of the target vehicle are used as the adjacent stop points of the target vehicle. Alternatively, the distances between each candidate stop point and the current position are obtained respectively, and the stop points are sorted from short to long according to the distance, and a preset number of candidate stop points with short distances are selected as the adjacent stop points of the target vehicle.

[0060] Step 103: Determine the passenger flow at the station corresponding to each adjacent stop. The passenger flow at the station is used to characterize the passenger flow in the process of moving the target vehicle from the current position to the adjacent stop.

[0061] The station passenger flow represents the passenger flow encountered by the target vehicle in the process of moving the target vehicle from the current position to the adjacent stop. The more people flow on the path from the current position to the stop, the greater the station passenger flow corresponding to the stop. The fewer people flow on the path from the current position to the stop, the smaller the station passenger flow corresponding to the stop.

[0062] Step 104: Determine a recommended stop for the target vehicle from among a plurality of adjacent stops according to the passenger flow at the stops corresponding to each adjacent stop.

[0063] A variety of recommendation strategies can be set according to the needs to determine the recommended stop point for the target vehicle. For example, the stop point with the largest passenger flow at the station can be used as the recommended stop point for the target vehicle. The stop point with the smallest passenger flow at the station can be used as the recommended stop point for the target vehicle. It is also possible to select the station passenger flow closest to the preset passenger flow from the station passenger flow corresponding to each adjacent stop point, and use the adjacent stop point corresponding to the station passenger flow as the recommended stop point for the target vehicle, etc.

[0064] In the embodiment of the present invention, the passenger flow of each stop corresponding to each adjacent stop of the target vehicle is determined, and then the recommended stop of the target vehicle is determined from multiple adjacent stops according to the prediction recommendation strategy and the passenger flow of each stop corresponding to each adjacent stop. The method of the embodiment of the present invention can dynamically adjust the route according to the passenger flow in the area near the target vehicle, thereby improving the sales efficiency of the sales truck.

[0065] Figure 2 FIG. 1 is a flow chart of another method for determining a vehicle stop point provided by an embodiment of the present invention. Figure 2 As shown, the method includes:

[0066] Step 201: Obtain the current position of the target vehicle.

[0067] Step 202: Determine a plurality of adjacent stop points of the target vehicle based on the current position.

[0068] Step 203: Divide the process of moving the target vehicle from the current position to the adjacent stop point into at least one sub-process.

[0069] There are many ways to divide the process of moving the target vehicle from the current position to the adjacent stop into at least one sub-process. The moving time required for the target vehicle to move from the current position to the adjacent stop can be determined first; based on the moving time, the process of moving the target vehicle from the current position to the adjacent stop can be divided into at least one sub-process, each of which corresponds to a preset time period. For example, it takes 30 minutes for the target vehicle to move from the current position to the first stop, and the preset time period is set to 5 minutes, then the process of moving the target vehicle from the current position to the first stop can be divided into 6 sub-processes. The first sub-process is the distance traveled by the target vehicle in the first 5 minutes, the second sub-process is the distance traveled by the target vehicle in the second 5 minutes, and so on.

[0070] Alternatively, the distance between the current position and the adjacent stop point may be determined first, and the process of moving the target vehicle from the current position to the adjacent stop point may be divided into at least one sub-process. For example, if the distance between the current position and the second stop point is 500 meters, the process of moving the target vehicle from the current position to the second stop point may be divided into five sub-processes. The first sub-process is the distance from 0 to 100 meters from the current position, the second sub-process is the distance from 100 to 200 meters from the current position, and so on.

[0071] Step 204: Determine the process passenger flow of the target vehicle in each sub-process.

[0072] Divide the area where the target vehicle moves into multiple grids; determine multiple target grids corresponding to each sub-process; determine the grid passenger flow corresponding to each target grid; and determine the process passenger flow of the target vehicle in the sub-process according to the grid flow corresponding to each target grid. The grid can be set as needed. For example, the grid can be 10m*10m, 5m*10m, 8m*12m, etc. Each sub-process can correspond to one or more target grids, and the process passenger flow of the target vehicle in the sub-process can be determined according to the grid flow corresponding to each target grid. For example, the mean of the grid flow corresponding to each target grid, the maximum value of the grid flow corresponding to each target grid, the mode of the grid flow corresponding to each target grid, the sum of the grid flow corresponding to each target grid, etc. can be used as the process passenger flow in the sub-process.

[0073] Step 205: Determine the station passenger flow corresponding to each adjacent stop according to the process passenger flow corresponding to each sub-process.

[0074] The process of the target vehicle moving from the current position to the adjacent stop is divided into at least one sub-process, and the mean, maximum, minimum, mode, sum, etc. of the passenger flow corresponding to each sub-process can be used as the station passenger flow corresponding to the adjacent stop.

[0075] Step 206: Determine a recommended stop for the target vehicle from among the plurality of adjacent stops according to the passenger flow at the stops corresponding to the adjacent stops.

[0076] In the embodiment of the present invention, the process of moving the target vehicle from the current position to the adjacent stop point is first divided into at least one sub-process, and then the station passenger flow corresponding to each adjacent stop point is determined according to the process passenger flow corresponding to each sub-process. The method of the embodiment of the present invention can more accurately determine the station passenger flow corresponding to each adjacent stop point, thereby more accurately determining the recommended stop point that meets the demand.

[0077] Figure 3 FIG. 1 is a flow chart of another method for determining a vehicle stop point provided by an embodiment of the present invention. Figure 3 As shown, the method includes:

[0078] Step 301: Obtain the current position of the target vehicle.

[0079] Step 302: Obtain the station location of each candidate stop.

[0080] Step 303: For each candidate stop point: according to the current position of the target vehicle and the stop position of the candidate stop point, the stop distance between the target vehicle and the candidate stop point is calculated.

[0081] Step 304: Determine the candidate stop points whose station distance is less than the distance threshold as the neighboring stop points of the target vehicle.

[0082] The distance threshold can be set according to specific needs. For example, the distance threshold can be 500 meters, 1000 meters, 2500 meters, etc. According to the distance threshold, the stop point whose distance to the target vehicle is less than the distance threshold is determined as the neighboring stop point of the target vehicle.

[0083] Step 305: Determine the passenger flow at the station corresponding to each adjacent stop point, where the passenger flow at the station is used to characterize the passenger flow in the process of moving the target vehicle from the current position to the adjacent stop point.

[0084] Step 306: Determine a recommended stop for the target vehicle from among the plurality of adjacent stops according to the passenger flow at the stops corresponding to the adjacent stops.

[0085] In the embodiment of the present invention, a distance threshold is set, and the stop points whose distance to the target vehicle is less than the distance threshold are determined as the adjacent stop points of the target vehicle. Compared with the method of using all candidate stop points as adjacent stop points, the movement process of the target vehicle can be better and more accurately controlled while reducing the amount of calculation of the system.

[0086] In one embodiment of the present invention, the station location of each candidate stop point is obtained, including: obtaining the station information of multiple stops; obtaining the station information of at least one recent historical stop point of the target vehicle; removing the station information of the at least one recent historical stop point from the station information of the multiple stops to obtain the station information of the candidate stop point. The recent historical stop point is the stop point where the target vehicle has moved most recently. For example, the station information of 3 or 5 recent historical stops can be recorded, and these recent historical stops can be removed from the multiple stops to obtain the candidate stop point, which can prevent the target vehicle from moving back and forth only between a few stops with a large passenger flow.

[0087] In one embodiment of the present invention, before determining the multiple adjacent stops of the target vehicle according to the current position, the method further includes: determining the inventory of the target vehicle; and determining the replenishment warehouse as the recommended stop of the target vehicle when the inventory meets the preset conditions. The preset conditions can be set according to specific needs, such as the preset conditions can be that the inventory of the first product is less than 10, the inventory of the second product is less than 30, etc. When the inventory meets the preset conditions, the target vehicle needs to be moved to the replenishment warehouse for replenishment.

[0088] In one embodiment of the present invention, after determining the recommended stop point of the target vehicle from the plurality of adjacent stops, the method further includes: determining whether there is a transfer stop point between the current position of the target vehicle and the recommended stop point; if there is a transfer stop point between the current position and the recommended stop point, determining the transfer stop point as the recommended stop point of the target vehicle. If there is a transfer stop point between the current position and the recommended stop point, determining the transfer stop point as the recommended stop point can better and more meticulously control the movement of the target vehicle.

[0089] To make the solution of the embodiment of the present invention easier to understand, the following explanation is based on the unmanned vending truck as the target vehicle. The solution of the embodiment of the present invention targets the special scene of the park, combines the distribution data of tourists in the park, and dynamically plans the route of the unmanned vending truck to achieve more efficient dispatch of the unmanned vending truck and serve a wider range of tourists in the park. Figure 4 FIG. 1 is a flow chart of another method for determining a vehicle stop point provided by an embodiment of the present invention. Figure 4 As shown, the method of the embodiment of the present invention includes the following steps:

[0090] Step S01: Neighboring stop query: spatial neighbor query algorithm, querying the current unmanned vending truck’s available parking locations.

[0091] The model input for this step: the current location of the unmanned vending truck (lng, lat), the list of available stops for the unmanned vending truck lng is longitude information, lat is latitude information. The model output of this step: a list of available stops within 500m of the current location D val .

[0092] Considering that the list of available stops for unmanned vending trucks is usually small, the specific operation at this stage is: enumerate each stop where the unmanned vending truck can stop (lng i ,lat i ), calculate the distance d between the stop and the current position, and determine whether the distance d is within 500m. If so, retain the stop. The distance d is calculated as follows:

[0093]

[0094] Step S02: Grid thermal prediction: Use the spatiotemporal AI prediction algorithm to model time dependency and spatial dependency and predict the thermal performance of each grid for 30 minutes in the future.

[0095] The model input of this step: the historical passenger flow distribution of the scenic spot. The model output of this step: the predicted passenger flow distribution of the scenic spot every 5 minutes in the next 30 minutes X f ∈R 6×1×n×m ;

[0096] Divide the scenic area into grids with a granularity of 10m*10m. The scenic area can be divided into n*m grids. Count the historical passenger flow distribution X∈R of each grid L×1×n×m , L is the number of sub-processes; use sliding windows to construct training samples. At time t, the input of the sample is X input =(X t ,X t-1 ,…,X t-l+1 ), the label of the sample is (X t+1 ,X t+2, ,…,X t+6 ). The prediction model can be set according to the needs, such as the simplified STResNet model. The model is trained using the BP algorithm. After the model training is completed, the recent traffic data is used to extract features:

[0097] X input =(X L ,X L-1 ,…,X L-l+1 ),

[0098] Then use the network's feedforward calculation to get the predicted value X f .

[0099] Step S03: Query the status of the unmanned vending truck: Based on the inventory status of the unmanned vending truck and the estimated future passenger flow, decide whether it is necessary to return to the destination for replenishment.

[0100] Since the unmanned vending truck is limited by the inventory status, when the inventory reaches the sales threshold, the next route is no longer planned, but the unmanned vending truck is directly sent back to the warehouse for replenishment. At this time, the inventory status of the unmanned vending truck is not necessarily 0, because it is considered that there may still be a certain amount of orders when the unmanned vending truck returns.

[0101] Step S04: Calculate the passenger flow of the candidate stop point: Calculate the estimated passenger flow from the current location to the target location based on the unmanned vending truck road network, the speed of the unmanned vending truck, and the predicted passenger flow in the next 30 minutes.

[0102] Model input: the available stops obtained in step S01, and the prediction of future passenger flow obtained in step S03. Model output: the estimated passenger flow at each available stop.

[0103] For each dockable site, the truck is grouped according to the grids it passes within 5 minutes based on its speed, and the predicted passenger flow of each grid in the future time period is counted. The average of the grids passing within 5 minutes is then calculated, and the passenger flow within 30 minutes is summed up as the estimated passenger flow for the dockable site.

[0104] Step S05: Due to the road network constraints and considering the user experience, we screen all the available stop sites. The screening mainly meets the following rules: maintain the three historical stop site tables and exclude the sites in the stop site table;

[0105] Considering the road network constraints, the nearest station is given priority. That is, if reaching station B will pass through station A, station A will be given priority as the next stop.

[0106] Step S05: Select the stop with the largest passenger flow as the recommended stop. Select the stop with the largest passenger flow as the recommended next stop.

[0107] The solution of the embodiment of the present invention proposes a method for dynamically planning the routes of unmanned vending trucks in scenic spots. The planning scheme integrates the operation data of unmanned vending trucks and the thermal data of tourists in the park. It can increase the service width and breadth of unmanned vending trucks in the scenic spot, reflect the intelligence level of the park, improve the turnover rate of commodity sales, and increase sales of the scenic spot.

[0108] Figure 5 FIG. 1 is a schematic diagram of a structure of a device for determining a vehicle stop point provided by an embodiment of the present invention. Figure 5 As shown, the device comprises:

[0109] The position acquisition module 501 is used to acquire the current position of the target vehicle;

[0110] A first determination module 502 is used to determine a plurality of neighboring stop points of the target vehicle according to the current position;

[0111] A passenger flow determination module 503 is used to determine the passenger flow of each station corresponding to each of the adjacent stops, wherein the passenger flow of the station is used to characterize the passenger flow in the process of moving the target vehicle from the current position to the adjacent stop;

[0112] The second determining module 504 is configured to determine a recommended stop for the target vehicle from the plurality of neighboring stops according to the passenger flow of the stations corresponding to the neighboring stops.

[0113] Optionally, the passenger flow determination module 503 is specifically used for:

[0114] Dividing the process of moving the target vehicle from the current position to the adjacent stop point into at least one sub-process;

[0115] Determine the process passenger flow of the target vehicle in each of the sub-processes;

[0116] The station passenger flow corresponding to each of the adjacent stops is determined according to the process passenger flow corresponding to each of the sub-processes.

[0117] Optionally, the passenger flow determination module 503 is further configured to:

[0118] Determining a travel time required for the target vehicle to move from the current position to the adjacent stop;

[0119] According to the moving time, the process of moving the target vehicle from the current position to the adjacent stop point is divided into at least one sub-process, each of the sub-processes corresponding to a preset time period;

[0120] Dividing the area where the target vehicle moves into a plurality of grids;

[0121] Determine a plurality of target grids corresponding to each of the sub-processes;

[0122] Determine the grid passenger flow corresponding to each of the target grids;

[0123] The process passenger flow of the target vehicle in the sub-process is determined according to the grid flow corresponding to each of the target grids.

[0124] Optionally, the first determining module 502 is specifically configured to:

[0125] Get the station location of each alternative stop;

[0126] For each candidate stop point: calculating the station distance between the target vehicle and the candidate stop point according to the current position of the target vehicle and the station position of the candidate stop point;

[0127] The candidate stop points whose station distance is less than the distance threshold are determined as the neighboring stop points of the target vehicle.

[0128] Optionally, the first determining module 502 is specifically configured to:

[0129] Get station information for multiple stops;

[0130] Obtaining station information of at least one recent historical stop of the target vehicle;

[0131] The station information of the at least one most recent historical stop point is removed from the station information of the plurality of stop points to obtain the station information of the candidate stop point.

[0132] Optionally, the second determining module 504 is further configured to:

[0133] determining an inventory amount in the target vehicle;

[0134] When the inventory quantity meets the preset conditions, the replenishment warehouse is determined as the recommended stop point for the target vehicle.

[0135] Optionally, the second determining module 504 is further configured to:

[0136] Determining whether there is a transfer stop between the current position of the target vehicle and the recommended stop;

[0137] In the case where there is a transfer stop point between the current position and the recommended stop point, the transfer stop point is determined as the recommended stop point for the target vehicle.

[0138] An embodiment of the present invention provides an electronic device, including:

[0139] one or more processors;

[0140] a storage device for storing one or more programs,

[0141] When one or more programs are executed by one or more processors, the one or more processors implement the method of any of the above embodiments.

[0142] Reference below Figure 6 , which shows a schematic diagram of the structure of a computer system 600 of a terminal device suitable for implementing an embodiment of the present invention. Figure 6 The terminal device 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.

[0143] like Figure 6 As shown, the computer system 600 includes a central processing unit (CPU) 601, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 602 or a program loaded from a storage part 608 into a random access memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the system 600 are also stored. The CPU 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0144] The following components are connected to the I / O interface 605: an input section 606 including a keyboard, a mouse, etc.; an output section 607 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 608 including a hard disk, etc.; and a communication section 609 including a network interface card such as a LAN card, a modem, etc. The communication section 609 performs communication processing via a network such as the Internet. A drive 610 is also connected to the I / O interface 605 as needed. A removable medium 611, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 610 as needed, so that a computer program read therefrom is installed into the storage section 608 as needed.

[0145] In particular, according to the embodiments disclosed in the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 609, and / or installed from the removable medium 611. When the computer program is executed by the central processing unit (CPU) 601, the above-mentioned functions defined in the system of the present invention are executed.

[0146] It should be noted that the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-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 of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer 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. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0147] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0148] The modules involved in the embodiments of the present invention may be implemented by software or hardware. The modules described may also be set in a processor, for example, they may be described as: a position acquisition module, a first determination module, a passenger flow determination module, and a second determination module. The names of these modules do not, in some cases, constitute limitations on the modules themselves, for example, the position acquisition module may also be described as a "module for acquiring the current position of the target vehicle".

[0149] As another aspect, the present invention further provides a computer-readable medium, which may be included in the device described in the above embodiment; or may exist independently without being assembled into the device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by a device, the device includes:

[0150] Get the current position of the target vehicle;

[0151] Determining a plurality of adjacent parking points of the target vehicle based on the current position;

[0152] Determine the passenger flow of each station corresponding to each of the adjacent stops, wherein the passenger flow of the station is used to characterize the passenger flow in the process of moving the target vehicle from the current position to the adjacent stop;

[0153] According to the station passenger flow corresponding to each of the adjacent stops, a recommended stop for the target vehicle is determined from the plurality of adjacent stops.

[0154] According to the technical solution of the embodiment of the present invention, the passenger flow of each adjacent stop point of the target vehicle is determined, and then the recommended stop point of the target vehicle is determined from multiple adjacent stops according to the passenger flow of each adjacent stop point. The method of the embodiment of the present invention can dynamically adjust the route according to the passenger flow in the area near the target vehicle, thereby improving the sales efficiency of the sales truck.

[0155] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for determining a vehicle stop point, characterized in that: include: Get the current position of the target vehicle; Determining a plurality of adjacent parking points of the target vehicle based on the current position; Determine the passenger flow of each station corresponding to each of the adjacent stops, wherein the passenger flow of the station is used to characterize the passenger flow in the process of moving the target vehicle from the current position to the adjacent stop; Determining a recommended stop for the target vehicle from the plurality of adjacent stops according to the passenger flow of the stops corresponding to each of the adjacent stops; The determining of the passenger flow of each of the adjacent stops includes: Dividing the process of moving the target vehicle from the current position to the adjacent stop point into at least one sub-process; Determine the process passenger flow of the target vehicle in each of the sub-processes; The station passenger flow corresponding to each of the adjacent stops is determined according to the process passenger flow corresponding to each of the sub-processes.

2. The method according to claim 1, characterized in that The process of moving the target vehicle from the current position to the adjacent stop point is divided into at least one sub-process, including: Determining a travel time required for the target vehicle to move from the current position to the adjacent stop; According to the moving time, the process of moving the target vehicle from the current position to the adjacent stop point is divided into at least one sub-process, each of the sub-processes corresponding to a preset time period; The determining of the process passenger flow of the target vehicle in each of the sub-processes includes: Dividing the area where the target vehicle moves into a plurality of grids; Determine a plurality of target grids corresponding to each of the sub-processes; Determine the grid passenger flow corresponding to each of the target grids; The process passenger flow of the target vehicle in the sub-process is determined according to the grid flow corresponding to each of the target grids.

3. The method according to claim 1, characterized in that The step of determining a plurality of adjacent stopping points of the target vehicle according to the current position includes: Get the station location of each alternative stop; For each candidate stop point: calculating the station distance between the target vehicle and the candidate stop point according to the current position of the target vehicle and the station position of the candidate stop point; The candidate stop points whose station distance is less than the distance threshold are determined as the neighboring stop points of the target vehicle.

4. The method according to claim 3, characterized in that The step of obtaining the station location of each candidate stop point includes: Get station information for multiple stops; Obtaining station information of at least one recent historical stop of the target vehicle; The station information of the at least one most recent historical stop point is removed from the station information of the plurality of stop points to obtain the station information of the candidate stop point.

5. The method according to claim 1, characterized in that Before determining a plurality of adjacent stop points of the target vehicle according to the current position, the method further includes: determining an inventory amount in the target vehicle; When the inventory quantity meets the preset conditions, the replenishment warehouse is determined as the recommended stop point for the target vehicle.

6. The method according to claim 1, characterized in that After determining the recommended stop point of the target vehicle from the plurality of adjacent stop points, the method further includes: Determining whether there is a transfer stop between the current position of the target vehicle and the recommended stop; In the case where there is a transfer stop point between the current position and the recommended stop point, the transfer stop point is determined as the recommended stop point for the target vehicle.

7. A device for determining a vehicle stop point, characterized in that: include: A position acquisition module is used to obtain the current position of the target vehicle; A first determining module, configured to determine a plurality of adjacent stopping points of the target vehicle according to the current position; A passenger flow determination module, used to determine the passenger flow of each station corresponding to each adjacent stop, wherein the passenger flow of the station is used to characterize the passenger flow in the process of moving the target vehicle from the current position to the adjacent stop; A second determination module is used to determine a recommended stop point for the target vehicle from the plurality of adjacent stops according to the station passenger flow corresponding to each of the adjacent stops; The passenger flow determination module is specifically used to: divide the process of moving the target vehicle from the current position to the adjacent stop point into at least one sub-process; Determine the process passenger flow of the target vehicle in each of the sub-processes; The station passenger flow corresponding to each of the adjacent stops is determined according to the process passenger flow corresponding to each of the sub-processes.

8. 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 6.

9. 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 6 is implemented.

Images