KR20160150212A

KR20160150212A - Techniques for matching the movement path of the carpool driver and rider

Info

Publication number: KR20160150212A
Application number: KR1020150087327A
Authority: KR
Inventors: 신봉조
Original assignee: (주)연결해; 신봉조
Priority date: 2015-06-19
Filing date: 2015-06-19
Publication date: 2016-12-29

Abstract

The present invention provides a method for checking whether a movement path of a driver is the same as or similar to a movement path of a rider after comparing the movement path of the driver with the movement path of the rider since the movement path of the driver, who supplies a carpool car, should be the same as the movement path of the rider, who uses the carpool car, in order to match the carpool. Thereby, the present invention can supply matching information to the driver and the rider when the movement paths are equal to each other or greater than a reference level.

Description

TECHNICAL FIELD [0001] The present invention relates to a traveling route matching method for a carpool driver and a passenger,

The present invention relates to a technique of comparing a moving route of a driver who wants to carry out a carpool and a traveling route of a user who wants to ride in a car motor vehicle, and matching copper lines with the same or similar users.

For the carpool service, the travel route is calculated between the departure location and the destination location in order to match the route of the driver and the passenger, and these routes are analyzed to analyze the similarity between the routes.

A navigation algorithm is used to calculate the movement path between the source and the destination. Since the present invention deals with route comparison, the description of the navigation algorithm is not included.

The movement path consists of a link and a set of nodes from the origin to the destination. The link and the node set are compared with each other to compare whether or not overlapping sections exist, and if there is a certain percentage Is it similar to checking for overlapping? Check if it is not. This is called the path matching comparison algorithm.

With this technology applied, it is possible to classify the start and destination locations into small tiles on the map, and compare the proximity of the tiles to the matching rate. At this time, the size of the tile is called a location tile matching algorithm in which the reference size is set to a small value when the road density is high, and the reference size is set to a large value when there are not many roads such as rural areas.

In the case of general path matching, there is a method of confirming whether the position of the origin of each route exists within the reference range or whether the position of the destination is within the reference range. However, in this case, if the source and destination are not similar, matching does not work. Another way is to compare whether the names of the departure and destination names are the same, or whether the administrative units of the addresses are the same, but this is also not a smart matching algorithm.

As described above, the present invention is devised to find the most similar matching between the movement paths of the driver and the passenger. As described above, by developing the route comparison matching algorithm and the position tile matching algorithm, We want to complete the matching and provide high-quality service.

In order to achieve the above object, the path comparison matching algorithm of the present invention is configured such that a vector composed of links and nodes is repeatedly constructed, and these paths are compared with each other. At this time, Quot; Algorithm "is used to produce a distribution of similar or identical vectors.

The location tile matching algorithm is a method of generating a tile centered on a starting point or a destination and confirming whether there is an overlapping section between each starting point or destination tile. For example, when the starting tile of the driver and the starting point of the occupant overlap each other Are considered to imply that they can meet each other in the overlapping interval without difficulty.

The tile size in the location tile matching algorithm should be small in urban areas and large in rural outskirts. The sum of the total lengths of the road links existing in the tile should be calculated so that the minimum reference distance The tile size is determined within the above length. For example, assuming that the reference distance is 2 km, and the road in the urban area is a checkerboard (or sperm-like) lattice, it is possible to consider blocks of 500 m in length and 500 m in length. It is considered to be a distance that the driver can move to. Also, if the roads such as rural areas are long and long, the tile size to satisfy the reference distance of 2 km may be a large size of 2 Km maximum and 2 Km long.

As described above, according to the algorithm implementation of the present invention, the driver can easily find a passenger who is the same as or similar to the desired route,

Conversely, the occupant can easily find a driver that is the same as or similar to his desired route.

By doing so, the driver and the passenger can easily match the paths to each other to carpool.

FIG. 1 is a diagram showing a start point and a destination point of A and B. FIG. Roads around each departure point and around the destination are displayed.
FIG. 2 shows roads between A and B origin and destination.
FIG. 3 is a diagram showing the moving path of A and the moving path of B in FIG. The movement path of A is indicated by a thick solid line in red, and the movement path of B is indicated by a dotted line of purple. There is a section where the movement path of A and B overlaps, but it is a part denoted by a circle at the center of the drawing.
Fig. 4 shows a case where the departure location and the destination are the same in Fig. 2, but the travel route is different. Here, the moving path of A is indicated by a thick solid line in blue, and the moving path of B is indicated by a dotted line of purple. Here, there is no section overlapping the movement path of A and B.
FIG. 5 is a diagram showing tiles at the origin and destination of A and B; FIG. When there are many roads nearby, the tiles become smaller, and when the roads are uneven, the tiles become larger like the destination of B.

Hereinafter, the configuration of the present invention will be described in detail with reference to the accompanying drawings. In the following description of the present invention, detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present invention rather unclear.

In the present invention, a route comparison matching algorithm and a location tile matching algorithm are described, and a method of comparing routes is provided.

FIG. 1 is a reference data for explaining a route comparison algorithm of the present invention. In FIG. 1, a starting point and a destination of a driver A are shown in a carpool, and a starting point and a destination of a driver B in a carpool are also shown. Both A and B hope for a carpool, and carpooling can be accomplished through comparative matching if there are companions with the same or similar routes.

If the origin and destination of A and B are as shown in Fig. 1, and the road network between the departure point and the destination is as shown in Fig. 2, the travel route of A and the travel route of B may be as shown in Fig.

In Fig. 3, the departure path of A is indicated by a thick solid line in red, and the movement path of B is indicated by a dotted line of purple. The overlapping sections of the movement paths of A and B are indicated by circles.

A circle is a path overlapping section of A and B, and the path overlapping section calculates the ratio of the overlapping section to the entire travel path, so that the paths of A and B are the same. Or almost similar? It is to judge whether it is different. When the ratio of the section where the movement path of A and the section of the movement path of B overlaps more than the reference value percentage, the path is judged to be similar, and the reference value here depends on the entire length.

In the case where the total path length is not more than a certain Km, the reference value is a few% and the number of several Km or more is a value that should be customized according to the actual experience value.

In order to compare the movement route of A and the movement route of B, each movement route data should be compared and analyzed. The route data includes information on the entire route and repeated information on the interval section.

The information of the movement route section is compared. The section interval is composed of a set of nodes and links.

A node refers to a specific point, and a link consists of a node and a node. The minimum unit consisting of nodes and links is called a vector, and the entire path from the origin to the destination consists of a repetition of many vectors rather than a single vector.

In order to compare the moving path of A and the moving path of B, one of the vectors existing in each path is sequentially inquired whether they are the same or not. If any one exists, it is checked whether the next vector exists repeatedly .

If two or more vectors are present in the same path, it is assumed that a path matching interval exists in the two paths. If the number of iteration vectors in the overlapping interval is larger, the two paths are considered to be similar to each other It will be possible.

5 is a diagram showing tiles at respective positions such as a start point and a destination. A tile is a range that regards a specific location as the same point. The composition of the tile may vary in size depending on the distribution of the road around the location. When there are many roads around, the size of the tiles is small, and when the roads around the roads are quiet, the size of the tiles increases.

The size of the tiles can vary, but the sum of the road lengths in the tiles is the same. If the reference value of the road length in the tile is 1 Km, the size of the square included within 1 Km is the size of the tile by combining the lengths of all the roads around the position such as the starting point and the destination.

For example, on a road such as Gangnam-gu or Jongro-gu in Seoul, which has a checkered pattern, if the size of the road is about 250m, the total length of the roads may be about 1Km. In the case of the starting point of A in FIG. 5, since there are three roads in the horizontal direction and three roads in the vertical direction, a total of six roads should be included within 1 Km, so that a tile having a width of about 166 m and a vertical length of about 166 m may be generated.

In the case of a rural road such as a rural road, a tile having a maximum size of 1 Km may be generated. In the case of the destination of FIG. 5B, there are two roads, one in the horizontal direction and the other in the vertical direction.

In Figure 5, it can be seen that the starting tile of A overlaps with the starting tile of B. If there is such a tile overlap interval, the origin of A and B is not exactly the same, but it is considered to be almost the same. Here, if the reference length of the road in the tile is 1 Km, the length of each block is about 80 m. Therefore, the distance between the departure point of A and B is about 320 m.

Also, in the tile overlap region of the drawing 5, the overlapping area of the starting point is small and the overlapping area of the tile at the destination is larger, which means that the larger the overlapping area of the tile is, the closer it is. The ratio of the overlapping area to the area of the tile is calculated, and the higher the overlapping area ratio of the tile, the more weight can be given.

Here, the weight is a value that requires customization in the service by applying the experience value in the carpool matching.

In order to compare paths, it is good to check whether there is a multiplexing section of each path. However, if there is a tile overlap between the source and the destination, it can be seen that the two paths are almost identical.

Therefore, when the path comparison is performed, the tile overlapping portion of the origin and destination is checked first. If the overlapping portion does not exist in both the origin and destination, then the path comparison is attempted.

The foregoing description is merely illustrative of the technical idea of the present invention, and various changes and modifications may be made by those skilled in the art without departing from the essential characteristics of the present invention. Therefore, the embodiments disclosed in the present invention are intended to illustrate rather than limit the scope of the present invention, and the scope of the technical idea of the present invention is not limited by these embodiments. The scope of protection of the present invention should be construed according to the following claims, and all technical ideas within the scope of equivalents should be construed as falling within the scope of the present invention.

Claims

In the present invention, a feature of a path comparison matching algorithm that compares similarities between respective vectors within a vector set of nodes and links to ascertain whether the paths are similar.

A method for determining the size of a tile in a location tile matching algorithm, which is a technique for confirming whether a starting point or a destination is the same or is close to each other.