CN111998866B

CN111998866B - Method, apparatus, device and medium for setting vehicle entrance position for information point

Info

Publication number: CN111998866B
Application number: CN202010867701.0A
Authority: CN
Inventors: 贾乐乐; 许博严
Original assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Current assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Priority date: 2020-08-25
Filing date: 2020-08-25
Publication date: 2022-08-30
Anticipated expiration: 2040-08-25
Also published as: CN111998866A

Abstract

The application discloses a method, a device, equipment and a medium for setting a vehicle entrance position for an information point, and relates to the fields of big data, intelligent transportation and intelligent guidance. A concrete implementation is to set the position of the vehicle entrance for the information point by the following operations. Road network information and historical traffic information of a plurality of road sections around an information point are obtained first. And then setting a plurality of alternative entrance positions for the information point according to the positions of the road sections adjacent to the information point in the plurality of road sections. And then calculating a traffic cost value for each alternative entrance position according to the road network information of a plurality of road sections and the historical traffic information. And finally, selecting at least one alternative entrance position from the multiple alternative entrance positions as the vehicle entrance position of the information point according to the passing cost value.

Description

Method, apparatus, device and medium for setting vehicle entrance position for information point

Technical Field

The present application relates to the field of data processing, in particular to the field of big data, intelligent transportation and intelligent guidance, and more particularly to a method, apparatus, device and medium for setting a vehicle entrance position for an information point.

Background

Large points of information (POIs) in shopping malls, public facilities, etc. generally occupy a large area. When the information point is established or modified, a parking lot is generally provided for a user so as to meet the requirement of larger traffic flow brought by the setting of the information point.

In the correlation technique, whether this parking area can bring better experience and reduce traffic pressure for the user depends on the rationality that parking area entry position set up. The position of the parking lot entrance of the information point is set based on manual experience, and thus whether the setting of the position of the parking lot entrance is reasonable depends on the decision-making ability of the decision maker. The arrangement of parking lot entrances lacks effective theoretical basis and data support.

Disclosure of Invention

A method, apparatus, device, and storage medium for setting a vehicle entrance position with an information point for improving the rationality of the vehicle entrance position are provided.

According to a first aspect, there is provided a method of setting a vehicle entrance position for an information point, comprising: acquiring road network information and historical traffic information of a plurality of road sections around the information point; setting a plurality of alternative entrance positions for the information point according to the positions of road sections adjacent to the information point in the plurality of road sections; calculating a traffic cost value for each alternative entrance position according to the road network information and the historical traffic information of a plurality of road sections; and selecting at least one candidate entrance position from the plurality of candidate entrance positions as the vehicle entrance position of the information point according to the passing cost value.

According to a second aspect, there is provided an apparatus for setting a vehicle entrance position for an information point, comprising: the information acquisition module is used for acquiring road network information and historical traffic information of a plurality of road sections around the information point; the alternative position determining module is used for setting a plurality of alternative entrance positions for the information point according to the positions of road sections adjacent to the information point in the plurality of road sections; the traffic cost determination module is used for calculating a traffic cost value for each alternative entrance position according to the road network information and the historical traffic information of a plurality of road sections; and the entrance position determining module is used for selecting at least one alternative entrance position from the multiple alternative entrance positions as the vehicle entrance position of the information point according to the passing cost value.

According to a third aspect, there is provided an electronic device comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to cause the at least one processor to perform the method of setting a vehicle entrance position for an information point as described above.

According to a fourth aspect, there is provided a non-transitory computer-readable storage medium of computer instructions for causing a computer to perform the method of setting a vehicle entrance position for an information point as described above.

According to a fifth aspect, there is provided a computer program product comprising a computer program which, when executed by a processor, implements the above method.

The technical scheme according to the application improves the reasonableness and the accuracy of the vehicle entrance position setting at least partially.

It should be understood that the statements in this section do not necessarily identify key or critical features of the embodiments of the present disclosure, nor do they limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.

Drawings

The drawings are included to provide a better understanding of the present solution and are not intended to limit the present application. Wherein:

fig. 1 is a view of an application scenario of a method and an apparatus for setting a vehicle entrance position for an information point according to an embodiment of the present application;

FIG. 2A is a schematic flow chart diagram of a method for setting a vehicle entrance position for an information point according to an embodiment of the present application;

FIG. 2B is a schematic diagram of determining an alternate entry location according to an embodiment of the present application;

fig. 3A is a flowchart of calculating a transit cost value for each alternative entry location according to an embodiment of the present application;

FIG. 3B is a schematic illustration of a determined path to each alternate entry location according to an embodiment of the present application;

FIG. 4A is a flow chart of determining a transit time for each route according to an embodiment of the present application;

FIG. 4B is a schematic illustration of the determination of the transit time for each route in FIG. 4A according to the present application;

FIG. 4C is a schematic illustration of the determination of the transit time for each route in FIG. 4A according to the present application;

FIG. 5 is a flow chart for determining a transit time for each route according to another embodiment of the present application;

FIG. 6A is a flow chart of determining a weighted sum of transit times for at least one route according to an embodiment of the present application;

FIG. 6B is a schematic illustration of determining a weight for each path according to an embodiment of the application;

FIG. 7 is a flow chart of a method of setting a vehicle entrance position for an information point according to another embodiment of the present application;

fig. 8 is a block diagram of the structure of an apparatus for setting a vehicle entrance position for an information point according to an embodiment of the present application; and

fig. 9 is a block diagram of an electronic device for implementing a method of setting a vehicle entrance position for an information point according to an embodiment of the present application.

Detailed Description

The following description of the exemplary embodiments of the present application, taken in conjunction with the accompanying drawings, includes various details of the embodiments of the application to assist in understanding, which are to be considered exemplary only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

The present application provides a method of setting a location of a vehicle entrance for an information point. Road network information and historical traffic information of a plurality of road sections around an information point are obtained first. And then setting a plurality of alternative entrance positions for the information point according to the positions of the road sections adjacent to the information point in the plurality of road sections. And then calculating a traffic cost value for each alternative entrance position according to the road network information and the historical traffic information of the plurality of road sections. And finally, selecting at least one alternative entrance position from the multiple alternative entrance positions as the vehicle entrance position of the information point according to the passing cost value.

Fig. 1 is a view of an application scenario of a method and an apparatus for setting a vehicle entrance position for an information point according to an embodiment of the present application.

As shown in fig. 1, a scenario 100 of the embodiment of the present application includes a user 110, a server 120, and a terminal device 130.

The user 110 may be, for example, a designer for planning a design information point, or a user of the terminal device 130.

The server 120 may be a server having a traffic information monitoring function or a traffic information storage function. In an embodiment, the server 120 may be a server with processing function, or the server 120 may be configured as a database server, or the server may be a server of a distributed system, or a server with a block chain. In an embodiment, the server 120 may also be a server that provides various services to client applications. The client application can be a traffic information monitoring client application, a map guiding client application or the like.

The terminal device 130 may be, for example, various electronic devices having a processing function and a display function, including but not limited to a smart phone, a tablet computer, a laptop portable computer, a desktop computer, and the like.

Illustratively, the terminal device 130 may interact with the server 120 through a network, for example, to obtain the road network information and the historical traffic information 142 from the server 120. The network may include various connection types, such as a wired communication network or a wireless communication network, among others. Alternatively, the network may be a local area network or a wide area network.

Illustratively, the terminal device 130 may be installed with various client applications and may be provided with a UI (user interface) interface through which the user 110 may enter the information point location 141 through the installed client applications. The information point can be large buildings such as shopping malls, schools, enterprise office buildings, government office buildings and the like, and a vehicle entrance is required to be arranged.

According to the embodiment of the present application, as shown in fig. 1, the terminal device 130 may obtain the vehicle entrance position 143 by analyzing and processing the information point position input by the user 110, the road network information and the historical traffic information acquired from the server 120, for example. The vehicle entrance position 143 may be fed back to the user 110 through a UI interface of the terminal device 130, for example, so that the user 110 can refer to the vehicle entrance position 143 as a reference for planning a construction plan or a modification plan of the information point.

It should be noted that the method for setting the vehicle entrance position for the information point provided in the embodiment of the present application may be generally executed by the terminal device 130. Accordingly, the apparatus for setting the vehicle entrance position for the information point provided by the embodiment of the present application may be generally disposed in the terminal device 130.

It should be understood that the number and types of terminal devices, servers, and users in fig. 1 are merely illustrative. There may be any number and type of terminal devices, servers, and users, as desired for an implementation.

A method for setting a vehicle entrance position for an information point according to an embodiment of the present application will be described in detail with reference to fig. 2A to 7 in conjunction with fig. 1.

Fig. 2A is a flowchart illustrating a method of setting a vehicle entrance position for an information point according to an embodiment of the present application.

As shown in fig. 2A, the method 200 of setting a vehicle entrance position for an information point of this embodiment may include operations S210 to S240.

Road network information and historical traffic information of a plurality of road segments around the information point are acquired in operation S210.

According to the embodiment of the application, the preset range with the position of the information point as the center can be determined according to the position of the information point input by the user. And then acquiring road network information and historical traffic information of a plurality of road segments within the preset range.

For example, the preset range centered on the position of the information point may be set according to the following rule. The method comprises the steps of obtaining a map from a server, positioning the map to obtain an information point position, and determining a preset range according to road network information around the information point position in the map. When the preset range is determined according to the road network information around the position of the information point, it may be set that at least a plurality of road segments capable of surrounding the position of the information point need to be included in the preset range.

For example, the preset range centered on the information point position may be set according to the following rule. The method comprises the steps of obtaining a map from a server, positioning the map to obtain the position of an information point, and finally, according to the distance input by a user, using the position of the information point as the center of a circle and using the input distance as a radius to define a preset range. Alternatively, it may be determined whether or not a plurality of links that can surround the position of the information point are included in the defined range by using the position of the information point as a center and an initial distance (for example, 1 meter, 2 meters, or the like) as a radius. If not, the radius is gradually increased by a preset step length (e.g., 0.5 meter, 1 meter, etc.) until the defined range includes a plurality of road segments that can surround the position of the information point, thereby obtaining a preset range. It is understood that the values of the initial distance and the preset step length are only taken as examples to facilitate understanding of the present application, and the present application does not limit the values.

According to the embodiment of the present application, the road network information of the plurality of road segments may include a relationship between the plurality of road segments, which may include, for example, a crossing relationship, a parallel relationship, a splicing relationship, and the like. The splicing relation refers to that two paragraphs are adjacent and spliced to form a road or form a long road section of the road. The road network information of the road section may further include, for example, a traveling direction and a traveling rule of the road section. The driving direction may include, for example, driving from east to west, driving from west to east, driving from south to north, and the like. The driving rules may include, for example, allowing straight travel, allowing right turns, allowing left turns, etc. According to the driving direction and the driving rule of the road sections, at least two road sections which are connected in sequence and reach the information point can be determined, and a path can be formed along the at least two road sections.

According to an embodiment of the present application, the historical traffic information of the road segment may include, for example, vehicles passing through the road segment, a driving direction and a driving time period of the vehicles passing through the road segment, a time point when the vehicles are driven into the road segment, a time point when the vehicles are driven out of the road segment, and the like, within a preset time period. The preset time period may be any time period, such as half a month, a quarter, a year, and the like, which is not limited in this application. In one embodiment, the historical traffic information for the road segment may include location-time information of the vehicle passing through the road segment, i.e., the location of each time point in the road segment during the period of time that the vehicle passed through the road segment.

In operation S220, a plurality of candidate entry positions are set for the information point according to positions of links adjacent to the information point among the plurality of links.

According to an embodiment of the present application, a road segment adjacent to an information point among a plurality of road segments may be determined according to whether a building exists between the road segment and the information point. Alternatively, a link, of the plurality of links, for which a vertical distance from a center position of the information point is smaller than a preset distance may be determined as a link adjacent to the information point. The position of the road segment adjacent to the information point is then determined as an alternative entry position.

In operation S230, a traffic cost value for each candidate entrance position is calculated according to the road network information and the historical traffic information of the plurality of road segments.

According to the embodiment of the application, for each alternative entrance position, the average congestion degree of the adjacent road sections of the alternative entrance position in a preset time period is determined according to the road network information and the historical traffic information of the multiple road sections, so as to determine the traffic cost value for the alternative entrance position. The congestion level may have a quantized congestion value, for example. The greater the congestion value, the more severe the congestion degree.

For example, the congestion value may be determined according to the width of the road of the adjacent road section. The larger the road width, the smaller the congestion value. Alternatively, the congestion value may be determined based on the travel time or the travel speed of the vehicle passing through the road segment. The longer the travel time period is, the smaller the travel speed is, the larger the congestion value is.

In operation S240, at least one candidate entrance position is selected from the plurality of candidate entrance positions as a vehicle entrance position of the information point according to the passage cost value.

According to the embodiment of the disclosure, the candidate entrance position with the smaller traffic cost value can be selected from the plurality of candidate entrance positions as the vehicle entrance position of the information point. One, two or three alternative entry positions may be selected as the vehicle entry position, depending on the actual requirements.

According to the embodiment of the disclosure, the multiple alternative entry positions can be sequenced according to the passing cost from low to high, and the alternative entry positions in sequence are obtained. The alternative entrance position that is ranked earlier in the selected entrance positions in the sequence is determined as the vehicle entrance position.

FIG. 2B is a schematic illustration of determining an alternate entry location according to an embodiment of the present application.

As shown in fig. 2B, the plurality of links around the information point 220 include links 201 to 211. Where the road segment adjacent to the information point includes the road segment 203, the road segment 207, and the road segment 211, it may be determined that the candidate entry positions include a first candidate entry position 221 at a side of the information point close to the road segment 207, a second candidate entry position 222 at a side of the information point close to the road segment 203, and a third candidate entry position 223 at a side of the information point close to the road segment 211, for a total of three candidate entry positions. Three transit cost values are obtained by calculating respective transit cost values for the road segment 203, the road segment 207 and the road segment 211. By sequencing the three transit cost values, if the transit cost value of the road segment 207 is determined to be the minimum, the first candidate entrance position 221 on the side of the information point adjacent to the road segment 207 is determined as the vehicle entrance position.

Illustratively, in fig. 2B, segment 207 is in a crossing relationship with segment 211, segment 211 is in a parallel relationship with segment 205, and segment 211 is in a splicing relationship with segment 209. I.e., link 211 is a different link of the same road than link 209. Fig. 2B may include four roads, for example, the four roads are: a road including a section 201 and a section 203, a road including a section 202, a section 205, and a section 208, a road including a section 204, a section 211, and a section 209, and a road including a section 206, a section 207, and a section 210.

In summary, according to the embodiment of the application, the vehicle entrance position is determined according to the historical traffic information and the road network information of the plurality of road sections around the information point, so that the setting of the vehicle entrance position can meet the actual traffic demand, the user experience can be improved, and the passenger flow of the information point can be improved.

Fig. 3A is a flowchart of calculating a traffic cost value for each alternative entry location according to an embodiment of the present application.

As shown in fig. 3A, the operation of calculating the transit cost value for each candidate entry position in this embodiment may include, for example, operations S331 to S333.

At operation S331, at least one path to the alternative entry location is determined according to the road network information, each path including at least one of the plurality of road segments.

Each route to an alternative entry location may for example comprise at least two road segments, and the direction of travel needs to be changed at least once, to avoid a situation where a certain route in at least one route is part of another route.

In operation S332, a transit time for each of at least one route is determined according to historical traffic information of a plurality of road segments.

According to the embodiment of the application, the passing time length of the vehicle passing through each road section in the at least one road section can be determined according to the historical traffic information of the at least one road section included in each path, and the passing time length of the vehicle passing through the at least one road section is added to obtain the passing time length of each path.

According to the embodiment of the application, the passing time length of the vehicle passing through each route can be determined according to historical traffic information of a plurality of road sections and is used as the passing time length of each route.

In operation S333, a weighted sum of transit durations of at least one route is calculated as a transit cost value of the alternative entry location.

According to the embodiment of the application, the passing time length of each path can be weighted according to the congestion degree of each path. For example, the greater the degree of congestion, the greater the weight is set to the transit time length of the route.

FIG. 3B is a schematic illustration of a determined path to each alternate entry location according to an embodiment of the present application.

As shown in fig. 3B, for alternative entry locations in information point 320 that are on a side near road segment 307, the determined at least one path may include path 331, path 332, and path 333.

Illustratively, the principles of proximity may also be followed when determining a path to an alternate entry location. For example, for the path 334 in fig. 3B, assuming the vehicle is traveling on the segment 305 along the path 334, the vehicle is either turning left from the segment 301 to reach the segment 305, or going straight along the segment 302 to get the segment 305. If the vehicle travels in the direction indicated by the dashed arrow on road section 301 or travels in the direction indicated by the dashed arrow on road section 302, when a stop is required, the vehicle will generally navigate to the candidate entry location on the side close to road section 303 closest to the current location, but will not navigate to the candidate entry location on the side close to road section 307. Thus, path 334 is not part of the path to an alternative entry location near one side of road segment 307 contemplated by embodiments of the present application.

Fig. 4A is a flowchart of determining a transit time duration of a route according to an embodiment of the present application.

As shown in fig. 4A, in an embodiment, the operation of determining the passage duration of the route may include operations S4321 to S4323, for example.

In operation S4321, a route is divided into a plurality of sub-routes according to road network information of at least one road segment included in the route and a passing direction of the route.

According to an embodiment of the application, each sub-path obtained by dividing relates to at least one road segment. For example, each sub-path may involve only one road segment, or may involve two road segments having an intersection relationship.

In operation S4322, a transit time length of each of a plurality of sub-routes is determined according to historical traffic information of at least one road segment.

According to an embodiment of the present disclosure, for each sub-path, a plurality of vehicles traveling along the sub-path may be determined first according to a traveling direction of the vehicle of at least one road segment to which the sub-path relates. Then, based on the position-time information of each of the plurality of vehicles, a travel time period for each vehicle to pass through the sub-path is determined. And finally, calculating the average value of the running time of the plurality of vehicles passing through the sub-path as the passing time of the sub-path.

In operation S4323, the sum of the passage time periods of each sub-route in the route is calculated as the passage time period of the route.

FIG. 4B is a schematic diagram of the determination of the transit time for each route in FIG. 4A according to the present application.

As shown in fig. 4B, for the route 431, the traffic direction is indicated by an arrow, the route 431 includes a road segment 409 and a road segment 407, and the road segment 409 and the road segment 407 are in a crossing relationship. According to the passing direction of the route 431, the route 431 firstly turns right from the road section 409 to the road section 407, and turns around to continue to travel on the road section 407 after traveling to the end of the road section 407 far away from the road section 409. Therefore, the route 431 may be divided into a sub-route 4311, a sub-route 4312, and a sub-route 4313, each of which relates to a road segment, according to the traveling direction of the route 431 and the road network information of the road segment 409 and the road segment 407. This embodiment may determine a plurality of vehicles traveling along sub-path 4311 according to the traveling direction of the vehicle passing through segment 409, and then determine the traveling time period for each vehicle passing through sub-path 4311 according to the position-time information of each vehicle of the plurality of vehicles. An average value of the travel time periods of the plurality of vehicles passing through the sub-path 4311 is calculated as the travel time period of the sub-path 4311. Similarly, the travel time periods of sub-path 4312 and sub-path 4313 may be calculated.

FIG. 4C is a schematic diagram of the determination of the transit time for each route in FIG. 4A according to the present application.

As shown in fig. 4C, for the route 431, the traffic direction is indicated by an arrow, the route 431 includes a road segment 409 and a road segment 407, and the road segment 409 and the road segment 407 are in a crossing relationship. According to the passing direction of the route 431, the route 431 firstly turns right from the road section 409 to the road section 407, and turns around to continue to travel on the road section 407 after traveling to the end of the road section 407 far away from the road section 409. Path 431 may be divided into sub-path 4311 ', sub-path 4312', sub-path 4313 ', and sub-path 4314'. Compared with the dividing method in fig. 4B, the dividing method takes the part of the route that the vehicle passes through when traveling along the route and changing the traveling direction as a sub-route, so that the determined passing time of each route is more accurate. Wherein sub-path 4311 'relates to segment 409, sub-path 4312' relates to segment 409 and segment 407, sub-path 4313 'relates to segment 407, and sub-path 4314' relates to segment 407. This embodiment may determine a plurality of vehicles traveling along sub-path 4312 'according to the traveling direction of the vehicle passing through section 409 and the traveling direction of the vehicle passing through section 407, and then may determine the traveling time period for each vehicle passing through sub-path 4312' according to the position-time information of each vehicle of the plurality of vehicles. The average value of the travel time periods of the plurality of vehicles passing through the sub-path 4312 'is calculated, which is the travel time period of the sub-path 4312'. Similarly, the travel time periods of sub-path 4311 ', sub-path 4313 ' and sub-path 4314 ' may be calculated.

For example, when the path is divided into a plurality of sub-paths in fig. 4C, the turning position and the u-turn position in the path may be determined first. And then taking a section of the path between the position of the predetermined distance before the turn and the position of the predetermined distance after the turn as a first sub-path. And taking a road section between the position with the preset distance before the U-turn and the position with the preset distance after the U-turn in the path as a second sub-road section. And finally, dividing the paths left in the road section except the first sub-road section and the second sub-road section according to the related road sections, so that each sub-path only relates to one road section in the sub-paths obtained by dividing the left paths.

Fig. 5 is a flow chart for determining a transit time for a route according to another embodiment of the present application.

As shown in fig. 5, in another embodiment, the operation of determining the passage time length of the route may be, for example, operations S5321 to S5323.

In operation S5321, a plurality of vehicles passing through a route in a traffic direction of the route are determined according to a traveling direction of the vehicles. It may be that a plurality of vehicles whose travel paths include the path are determined according to the traveling direction of the vehicle. It will be appreciated that for each road it is possible to include vehicles with directions of travel in two opposite directions. The operation S5321 is to select a vehicle in a passing direction in which a traveling direction is along a route when passing each road when determining a plurality of vehicles.

In operation S5322, for each of a plurality of vehicles, a travel time period during which the vehicle passes through a route is determined according to time-position information of the vehicle. And determining the driving time length required for the vehicle to reach the end position of the route from the start position of the route according to the time-position information of each vehicle, wherein the driving time length is taken by the vehicle to pass through the route.

In operation S5323, an average of the traveling time periods of the plurality of vehicles passing through the route is calculated as the passage time period of the route.

Fig. 6A is a flow chart of determining a weighted sum of transit times for at least one route according to an embodiment of the application.

As shown in fig. 6A, the operation of determining the weighted sum of the passage time periods of at least one route may include operations S6331 to S6333.

In operation S6331, for each of at least one path, a traffic density of each segment of the path is determined according to historical traffic information of each segment of the path.

In operation S6332, for each segment of the at least one route, a weight of a transit time length of the route is calculated according to a traffic density of each segment of the route.

According to the embodiment of the application, the average value of the traffic flow density of at least one road section included in the route can be calculated as the weight of the passing time length of the route.

In operation S6333, a weighted sum of the passage time periods of at least one route is calculated according to the calculated weights.

Illustratively, the weight of the transit time duration of each path is multiplied by the transit time duration of each path to obtain a product for each path, resulting in at least one product. And finally, adding the at least one product to obtain the weighted sum of the transit time of the at least one path.

Fig. 6B is a schematic diagram of determining a weight of each path according to an embodiment of the present application.

According to an embodiment of the present application, the historical traffic information of the road segment includes the number of vehicles passing through the road segment and the driving direction within a preset period. The traffic density of each road section in the passing direction along the path may be determined according to the number and the driving direction of vehicles passing through each road section within a preset time period.

For example, as shown in fig. 6B, for the road segment 607 allowing bidirectional driving, the vehicles passing through the road segment 607 may be classified into a first group of vehicles passing through the road segment 607 in the first direction 641 and a second group of vehicles passing through the road segment 607 in the second direction 642 according to the driving directions of the vehicles passing through the road segment 607 within a preset period of time. The first direction 641 is opposite to the second direction 642. For the previously described path 331, a first traffic density of the road segment 607 in the direction of travel along the path is determined based on the number of vehicles in the first group, and a second traffic density of the road segment 607 in the direction of travel along the path is determined based on the number of vehicles in the second group.

For example, as shown in fig. 6B, for the road segment 608 allowing one-way driving, since the direction in which the road segment 608 allows vehicles to drive only includes the direction 643, the traffic flow density of the road segment 608 in the passing direction along the path 333 described above may be determined according to the number of vehicles passing through the road segment 608 within the preset time period.

For example, the number of vehicles passing through the road section in the passing direction of the road section along the route in each road section within the preset range may be taken as the traffic density. The traffic density can also be calculated according to the preset linear relation and the number of vehicles passing through the road sections in the passing direction of the path in the preset range of each road section.

Fig. 7 is a flowchart of a method of setting a vehicle entrance position for an information point according to another embodiment of the present application.

As shown in fig. 7, the method 700 of setting a vehicle entrance position by an information point of this embodiment may include not only the operations S210 to S240 described above but also the operations S750 to S760.

In operation S750, a position of a road intersection related to at least one route to the vehicle entrance position of the information point is determined based on the road network information.

In operation S760, the position of the intersection is determined as a guide card setting position.

Illustratively, assume that the determined vehicle entrance location is the previously described side adjacent road segment 307. As for the route 331 described above, it can be known from the road network information that the intersection of the road involved by the route 331 includes the intersection of the road belonging to the road segment 307 and the road belonging to the road segment 307, and then the position of the intersection of the road involved by the route 331 can be determined as the junction of the road segment 307 and the road segment 309. And the joint is used as a guide card setting position. The guide sign here may have information indicating that the vehicle is turning right to reach the entrance of the parking lot, for example.

As for the path 332 described above, as can be seen from the road network information, the intersection where the path 332 relates to includes the intersection of the road belonging to the road segment 310 and the road belonging to the road segment 309, and then the position of the intersection where the path 332 relates to is the connection location of the road segment 310 and the road segment 309 may be determined. And the joint is used as a guide card setting position. The guidance sign here may have information indicating that the vehicle is going straight to reach the entrance of the parking lot, for example.

According to the embodiment of the application, the arrangement of the guide board can guide the user to travel along at least one path aiming at the vehicle entrance, so that the user can be prevented from moving around, and the user experience is improved.

Fig. 8 is a block diagram of the structure of an apparatus for setting a vehicle entrance position for an information point according to an embodiment of the present application.

As shown in fig. 8, the apparatus 800 for setting a vehicle entrance position for an information point of this embodiment may include an information acquisition module 810, an alternative position determination module 820, a traffic cost determination module 830, and an entrance position determination module 840.

The information obtaining module 810 is configured to obtain road network information and historical traffic information of a plurality of road segments around an information point. In an embodiment, the information obtaining module 810 is configured to perform the operation S210 described above, which is not described herein again.

The candidate position determining module 820 is configured to set a plurality of candidate entry positions for the information point according to positions of road segments adjacent to the information point in the plurality of road segments. In an embodiment, the alternative location determining module 820 is configured to perform the operation S220 described above, which is not described herein again.

The passage cost determination module 830 is configured to calculate a passage cost value for each candidate entrance position according to the road network information and the historical traffic information of the multiple road segments. In an embodiment, the passage cost determining module 830 is configured to perform the operation S230 described above, which is not described herein again.

The entrance position determining module 840 is configured to select at least one candidate entrance position from the multiple candidate entrance positions as a vehicle entrance position of the information point according to the passage cost value. In an embodiment, the entry position determining module 840 is configured to perform the operation S240 described above, which is not described herein again.

There is also provided, in accordance with an embodiment of the present application, an electronic device, a readable storage medium, and a computer program product. The computer program product comprises a computer program which, when executed by a processor, may implement the method of any of the embodiments described above.

As shown in fig. 9, is a block diagram of an electronic device 900 of a method for setting a vehicle entrance position for an information point according to an embodiment of the present application. The electronic device 900 is intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device 900 may also represent various forms of mobile devices, such as personal digital assistants, cellular telephones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the applications described and/or claimed herein.

As shown in fig. 9, the electronic device 900 includes: one or more processors 901, memory 902, and interfaces for connecting the various components, including a high-speed interface and a low-speed interface. The various components are interconnected using different buses and may be mounted on a common motherboard or in other manners as desired. The processor may process instructions for execution within the electronic device, including instructions stored in or on the memory to display graphical information of a GUI on an external input/output apparatus (such as a display device coupled to the interface). In other embodiments, multiple processors and/or multiple buses may be used, along with multiple memories and multiple memories, as desired. Also, multiple electronic devices may be connected, with each device providing portions of the necessary operations (e.g., as a server array, a group of blade servers, or a multi-processor system). Fig. 9 illustrates an example of a processor 901.

Memory 902 is a non-transitory computer readable storage medium as provided herein. Wherein the memory stores instructions executable by the at least one processor to cause the at least one processor to perform the method of setting a vehicle entrance position for an information point provided herein. The non-transitory computer-readable storage medium of the present application stores computer instructions for causing a computer to execute the method of setting a vehicle entrance position for an information point provided by the present application.

The memory 902, which is a non-transitory computer-readable storage medium, may be used to store non-transitory software programs, non-transitory computer-executable programs, and modules, such as program instructions/modules corresponding to the method for setting a vehicle entrance position for an information point in the embodiments of the present application (e.g., the information acquisition module 810, the alternative position determination module 802, and the entrance position determination module 803 shown in fig. 8). The processor 901 executes various functional applications of the server and data processing, i.e., a method of setting a vehicle entrance position for an information point in the above-described method embodiments, by executing a non-transitory software program, instructions, and modules stored in the memory 902.

The memory 902 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application program required for at least one function; the storage data area may store data created from use of an electronic device that sets a vehicle entrance position for an information point, and the like. Further, the memory 902 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, memory 902 may optionally include memory located remotely from processor 901, which may be connected via a network to an electronic device that sets a vehicle entry location for a kiosk. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The electronic device of the method of setting a vehicle entrance position for an information point may further include: an input device 903 and an output device 904. The processor 901, the memory 902, the input device 903 and the output device 904 may be connected by a bus or other means, and fig. 9 illustrates the connection by a bus as an example.

The input device 903 may receive input numeric or character information and generate key signal inputs related to user settings and function control of an electronic apparatus that sets a vehicle entrance position for an information point, such as an input device of a touch screen, a keypad, a mouse, a track pad, a touch pad, a pointing stick, one or more mouse buttons, a track ball, a joystick, or the like. The output devices 904 may include a display device, auxiliary lighting devices (e.g., LEDs), tactile feedback devices (e.g., vibrating motors), and the like. The display device may include, but is not limited to, a Liquid Crystal Display (LCD), a Light Emitting Diode (LED) display, and a plasma display. In some implementations, the display device can be a touch screen.

Various implementations of the systems and techniques described here can be realized in digital electronic circuitry, integrated circuitry, application specific ASICs (application specific integrated circuits), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.

These computer programs (also known as programs, software applications, or code) include machine instructions for a programmable processor, and may be implemented using high-level procedural and/or object-oriented programming languages, and/or assembly/machine languages. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and/or device (e.g., magnetic discs, optical disks, memory, Programmable Logic Devices (PLDs)) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to a programmable processor.

To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user may provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), Wide Area Networks (WANs), and the Internet.

The computer system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.

It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present application may be executed in parallel, sequentially, or in different orders, and the present invention is not limited thereto as long as the desired results of the technical solutions disclosed in the present application can be achieved.

The above-described embodiments should not be construed as limiting the scope of the present application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A method of setting a vehicle entrance position for an information point, comprising:

acquiring road network information and historical traffic information of a plurality of road sections around an information point;

setting a plurality of alternative entrance positions for the information point according to the positions of road sections adjacent to the information point in the plurality of road sections;

calculating a traffic cost value for each alternative entrance position according to the road network information and the historical traffic information of the plurality of road sections; and

selecting at least one candidate entrance position from the plurality of candidate entrance positions as the vehicle entrance position of the information point according to the passing cost value,

wherein, the calculating the traffic cost value for each alternative entrance position according to the road network information and the historical traffic information of the plurality of road sections comprises: for each of the alternative entry locations there is a corresponding entry location,

determining at least one path to the alternative entry location according to the road network information, wherein each path comprises at least one road segment in the plurality of road segments;

determining the passing time length of each route in the at least one route according to the historical traffic information of the plurality of road sections; and

and calculating the weighted sum of the passage time of the at least one path to be used as the passage cost value of the alternative entrance position.

2. The method of claim 1, wherein determining a weighted sum of transit times for the at least one path comprises:

for each of the at least one path,

determining the traffic flow density of each road section in the path according to the historical traffic information of each road section in the path;

calculating the weight of the passing time of the path according to the traffic flow density of each road section in the path; and

calculating a weighted sum of transit times for the at least one route according to the calculated weights.

3. The method of claim 1, wherein the historical traffic information for a road segment includes travel direction and time-location information for vehicles traversing the road segment; determining a transit time for each of the at least one route comprises: for each of said paths, the path is,

determining a plurality of vehicles passing through the path along the passing direction of the path according to the driving direction of the vehicles;

for each vehicle of the plurality of vehicles, determining a travel period of the vehicle through the path according to time-location information of the vehicle; and

and calculating the average value of the running time lengths of the plurality of vehicles passing through the route as the passing time length of the route.

4. The method of claim 1, wherein determining a transit time for each of the at least one route comprises: for each of the paths, the path is,

dividing the path into a plurality of sub-paths according to the road network information of at least one road section included in the path and the passing direction of the path, wherein each sub-path relates to at least one road section;

determining the passing time of each sub-path in the plurality of sub-paths according to the historical traffic information of at least one road section related to each sub-path; and

and calculating the sum of the passage time of each sub-path in the path as the passage time of the path.

5. The method of claim 4, wherein the historical traffic information for a road segment includes direction of travel and location-time information for vehicles traversing the road segment; determining a transit time for each of the plurality of sub-paths comprises: for each of the sub-paths, the path is,

determining a plurality of vehicles travelling along the sub-path according to the travelling direction of the vehicles travelling through at least one road segment involved by the sub-path;

determining a travel time period for each vehicle to travel through the sub-path according to the position-time information of each vehicle in the plurality of vehicles; and

and calculating the average value of the running time lengths of the plurality of vehicles passing through the sub-path as the passing time length of the sub-path.

6. The method of claim 2, wherein the historical traffic information of the road segment includes the number of vehicles passing through the road segment and the driving direction within a preset time period; the determining the traffic flow density of each road section in the path according to the historical traffic information of each road section in the path comprises:

and determining the traffic flow density of each road section in the passing direction along the path according to the number and the running direction of the vehicles passing through each road section in the preset time period.

7. The method of claim 2 or 6, wherein calculating the weight for the transit time of the path comprises:

and calculating the average value of the traffic flow density of at least one road section included in the path as the weight of the passing time of the path.

8. The method of claim 1, further comprising:

determining the position of a road intersection related to at least one path of the vehicle entrance position reaching the information point according to the road network information; and

and determining the position of the road intersection as the setting position of the guide board.

9. An apparatus for setting a vehicle entrance position for an information point, comprising:

the information acquisition module is used for acquiring road network information and historical traffic information of a plurality of road sections around the information point;

the alternative position determining module is used for setting a plurality of alternative entrance positions for the information point according to the positions of road sections adjacent to the information point in the plurality of road sections;

the traffic cost determination module is used for calculating a traffic cost value for each alternative entrance position according to the road network information and the historical traffic information of the plurality of road sections; and

an entrance position determining module, configured to select at least one candidate entrance position from the multiple candidate entrance positions as a vehicle entrance position of the information point according to the transit cost value,

wherein the passage cost determination module is specifically configured to: for each alternative entry location:

determining the passing time of each path in the at least one path according to the historical traffic information of the plurality of road sections; and

and calculating the weighted sum of the passage time of the at least one path to be used as a passage cost value of the alternative entrance position.

10. An electronic device, comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-8.

11. A non-transitory computer readable storage medium having stored thereon computer instructions for causing a computer to perform the method of any one of claims 1-8.

12. A computer program product comprising a computer program which, when executed by a processor, implements the method according to any one of claims 1-8.