KR101637605B1

KR101637605B1 - Apparatus and method for searching bidirectional route with pattern data

Info

Publication number: KR101637605B1
Application number: KR1020100117744A
Authority: KR
Inventors: 최원석; 임지수
Original assignee: 현대자동차주식회사; 기아자동차주식회사; 현대엠엔소프트 주식회사
Priority date: 2010-11-24
Filing date: 2010-11-24
Publication date: 2016-07-07
Also published as: KR20120056159A

Abstract

The present invention relates to a bidirectional route search apparatus and method using pattern data, and more particularly, to a bidirectional route search apparatus and method for searching for a forward route from a departure point to a destination direction using real time traffic information and pattern data, After searching for the paths, it searches for the final path using the pattern data for the candidate paths from the point where the forward path and the backward path meet to the destination, and searches for the optimal path with the minimum time. Apparatus and method therefor.
To this end, the present invention provides a bidirectional route search apparatus using pattern data, comprising: traffic information collection means for collecting travel time of each road section from a plurality of vehicles; Pattern data generation means for generating pattern data by averaging travel time collected by the traffic information collection means for each segment by time period and day of the week; Reverse path searching means for searching for candidate paths from a destination to a starting point based on a static cost; Searching for a forward path from the start point to the destination direction by using the pattern data generated by the pattern data generation means and searching for an optimal path using the pattern data on the candidate paths searched by the backward path search means A forward path search means for searching for a forward path; And control means for controlling the forward path search means to search for an optimal path for the candidate paths as the forward path search means and the reverse path search means intersect the candidate paths searched for by the forward path search means do.

Description

TECHNICAL FIELD [0001] The present invention relates to a bi-directional path search apparatus using pattern data,

The present invention relates to a bidirectional route search apparatus and method using pattern data, and more particularly, to a bidirectional route search apparatus and method for searching for a route in both directions using current and past patterned traffic information, The present invention relates to a bi-directional path search apparatus and method using pattern data for searching a path of a bi-directional path.

There are a route search method using real - time traffic information, a bi - directional route search method using static cost, and a unidirectional route search method using pattern data.

First, since the route search method using the real-time traffic information searches for the traffic situation near the destination based on the traffic information at the time of the search request, a lot of situations that do not correspond to the actual traffic situation .

Second, the bidirectional route search method using the static cost searches for the forward route from the departure place to the destination direction, searches the reverse route from the destination to the departure direction, and finally calculates the route from the departure place to the destination. And the toll, etc., so that the search range of the route is narrow as shown in FIG. 1 (a), but there is a problem that it is difficult to find an optimal route.

Third, since the unidirectional route search method using pattern data searches the route using the pattern data of the accumulated time according to the travel time for each section, it is possible to perform a better route search than the method using the static cost. However, (b), all the routes from the origin to the destination are searched in a unidirectional manner, so that the search range is very wide and the search time is long.

According to an aspect of the present invention, there is provided a method of searching for a forward path in a direction from a starting point to a destination using real-time traffic information and pattern data and searching for a reverse candidate path from a destination to a starting point based on a static cost. Way path searching apparatus using pattern data for searching for an optimal path by searching for a final path using pattern data for candidate paths from a point where a forward path and a reverse path meet to a destination, The purpose of the method is to provide.

The objects of the present invention are not limited to the above-mentioned objects, and other objects and advantages of the present invention which are not mentioned can be understood by the following description, and will be more clearly understood by the embodiments of the present invention. It will also be readily apparent that the objects and advantages of the invention may be realized and attained by means of the instrumentalities and combinations particularly pointed out in the appended claims.

According to another aspect of the present invention, there is provided a bidirectional route searching apparatus using pattern data, comprising: traffic information collecting means for collecting travel time of each road section from a plurality of vehicles; Pattern data generation means for generating pattern data by averaging travel time collected by the traffic information collection means for each segment by time period and day of the week; Reverse path searching means for searching for candidate paths from a destination to a starting point based on a static cost; Searching for a forward path from the start point to the destination direction by using the pattern data generated by the pattern data generation means and searching for an optimal path using the pattern data on the candidate paths searched by the backward path search means A forward path search means for searching for a forward path; And control means for controlling the forward path search means to search for an optimal path for the candidate paths as the forward path search means and the reverse path search means intersect the candidate paths searched for by the forward path search means do.

According to another aspect of the present invention, there is provided a bi-directional route search method using pattern data, comprising: collecting travel time of each road section from a plurality of vehicles; Generating pattern data by averaging the travel time required for each section collected by the traffic information collecting means for each time period and day of the week; A forward path searching step of searching for a forward path from a starting point to a destination direction by using the pattern data generated by the pattern data generating means; Searching for a candidate path from the destination to the departure direction based on a static cost; And searching for an optimal path for the candidate paths as the forward path search means crosses the forward paths that the forward path search means has searched for and the candidate paths searched for by the backward path search means.

The present invention predicts traffic congestion using traffic information pattern data and searches for an optimal route that takes the least amount of time based on the predicted traffic congestion.

According to the present invention, the forward path is searched from the source to the destination using the real-time traffic information and the pattern data, the reverse candidate paths are searched from the destination to the origin based on the static cost, The search for the final path using the pattern data for the candidate paths from the point where it meets the destination to the destination can search the optimal path with the minimum time.

BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is an explanatory diagram of a conventional route search method,
FIG. 2 is a block diagram of a bi-directional path searching apparatus using pattern data according to an embodiment of the present invention.
3 is a diagram for explaining a bidirectional route search process using pattern data according to an embodiment of the present invention.
4 is a flowchart illustrating a bi-directional path search method using pattern data according to an embodiment of the present invention.

BRIEF DESCRIPTION OF THE DRAWINGS The above and other objects, features and advantages of the present invention will become more apparent from the following detailed description of the present invention when taken in conjunction with the accompanying drawings, It can be easily carried out. In the following description, well-known functions or constructions are not described in detail since they would obscure the invention in unnecessary detail. Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings.

2 is a block diagram of a bi-directional path searching apparatus using pattern data according to an embodiment of the present invention.

2, the bidirectional route searching apparatus using pattern data according to the present invention includes a traffic information collecting unit 21, a pattern data generating unit 22, a reverse route searching unit 23, (24), and a control unit (25).

Referring to the respective components, the traffic information collection unit 21 collects the travel time of each road section from a plurality of vehicles. In this case, the section is a unit link of a certain length, and the intersection of the road and the place where the large convenience facility is located can be divided into shorter sections than the normal section.

The pattern data generating unit 22 generates pattern data by averaging travel time collected by the traffic information collecting unit 21 for each segment by time period and day of the week. At this time, the pattern data generation unit 22 considers the holiday season, the season (autumn leaves, skiing, etc.) as well as statutory holidays as the weight.

The backward path search unit 23 searches for a candidate path from the destination to the origin based on the static cost. At this time, the static cost is generally used in the route search, including the distance, the road type, the toll, and the like.

Here, a lane capable of moving from a departure place to a destination is referred to as an upper line, and a lane capable of moving from a destination to a departure place is referred to as a down line, and the reverse route means an up line rather than a down line.

That is, the backward path search unit 23 searches backward for a lane in which the vehicle can move from the departure point to the destination.

The forward path search unit 24 searches for a route from the origin to the destination based on the real-time traffic information collected by the traffic information collection unit 21. [ At this time, the forward route search unit 24 searches for a route based on the real-time traffic information up to a point where the real-time traffic information can reach the optimum time (for example, 15 to 30 minutes).

The forward path search unit 24 searches for a path from the source to the destination using the pattern data generated by the pattern data generator 22. [ At this time, the forward path search unit 24 searches the path using the pattern data from a point where the real-time traffic information can reach the optimum time (for example, 15 minutes to 30 minutes).

In addition, the forward path search unit 24 searches for a path using the pattern data from the point where the forward path that has been searched from the source to the destination direction and the candidate path that is searched by the backward path search unit 23 intersects, Search.

The controller 25 controls the forward path search unit 24 and the reverse path search unit 23 to search the candidate paths using the pattern data as the forward path and the reverse path search unit 23 search for the forward path, Controls the search unit 24, and searches for the final route from the origin to the destination.

FIG. 3 is an explanatory diagram of a bidirectional route search process using pattern data according to an embodiment of the present invention.

As shown in FIG. 3, S denotes a starting point, G denotes a destination, A denotes a point at which real-time traffic information can be reached for an optimal time (for example, 15 to 30 minutes), B denotes a forward path search point And the point at which the reverse path search point meets. In this case, the point B is not the point determined according to the reference but the point where the forward path search and the reverse path search are naturally encountered in the process of searching.

First, the forward path search unit 24 searches for a path using the real time traffic information from the point S to the point A (301), and then searches for a path using the pattern data up to point B (302).

Then, the reverse path search unit 23 searches for a candidate path based on the static cost from the point G to the point B (303).

Thereafter, the forward path search unit 24 searches for a path using the pattern data on the candidate paths searched by the backward path search unit 23 (304). That is, an optimal path is selected from the candidate paths to the G point.

Through this process, the optimal path is finally searched for from point S to point G (305).

4 is a flowchart illustrating a bi-directional path search method using pattern data according to an embodiment of the present invention.

First, the traffic information collection unit 21 collects the travel time of each road section from a plurality of vehicles (401).

Thereafter, the pattern data generating unit 22 generates pattern data by averaging travel time collected by the traffic information collecting unit 21 for each segment by time period and day of the week (402).

Thereafter, the forward path search unit 24 searches for a forward path from the source to the destination using the pattern data generated by the pattern data generator 22 (403).

Thereafter, the reverse path search unit 23 searches for candidate paths from the destination to the source direction based on the static cost (404).

Thereafter, the forward path search unit 23 searches for an optimal path for the candidate paths according to the intersection of the candidate paths searched by the reverse path search unit 23 and the forward path searched by the reverse path search unit 23 (step 405).

Meanwhile, the method of the present invention as described above can be written in a computer program. And the code and code segments constituting the program can be easily deduced by a computer programmer in the field. In addition, the created program is stored in a computer-readable recording medium (information storage medium), and is read and executed by a computer to implement the method of the present invention. And the recording medium includes all types of recording media readable by a computer.

It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the spirit or scope of the invention. The present invention is not limited to the drawings.

21: traffic information collecting unit 22: pattern data generating unit
23: reverse path search unit 24: forward path search unit
25:

Claims

A traffic information collecting means for collecting travel time required for each road section from a plurality of vehicles;
Pattern data generation means for generating pattern data by averaging travel time collected by the traffic information collection means for each segment by time period and day of the week;
Reverse path searching means for searching for candidate paths from a destination to a starting point based on a static cost;
Searching for a forward path from the start point to the destination direction by using the pattern data generated by the pattern data generation means and searching for an optimal path using the pattern data on the candidate paths searched by the backward path search means A forward path search means for searching for a forward path; And
And a control unit for controlling the forward path search unit to search for an optimal path for the candidate paths as the forward path search unit searches for the forward path and the reverse path search unit searches for the candidate path,
Wherein the pattern data includes at least one of the pattern data and the pattern data.

The method according to claim 1,
Wherein the forward path search means comprises:
And searching for a forward path based on the real-time traffic information collected by the traffic information collecting means from the starting point to a predetermined point.

3. The method according to claim 1 or 2,
Wherein the pattern data generating means comprises:
Wherein at least one of a statutory holiday, a holiday holiday season, and an event season is applied to the pattern data as a weight.

The traffic information collecting means collecting the time required for passage of each road from a plurality of vehicles;
Generating pattern data by averaging the travel time required for each section collected by the traffic information collecting means for each time period and day of the week;
A forward path searching step of searching for a forward path from a starting point to a destination direction by using the pattern data generated by the pattern data generating means;
Searching for a candidate path from the destination to the departure direction based on a static cost; And
Searching for an optimal path for the candidate paths as the forward path search means crosses the candidate paths searched by the backward path search means and the forward path searched for by the reverse path search means,
The method comprising the steps of:

5. The method of claim 4,
The forward path search step may include:
Searching a forward path based on the real-time traffic information collected by the traffic information collecting means from the starting point to a predetermined point; And
Searching for a forward path using the pattern data generated by the pattern data generation means after the predetermined point
The method comprising the steps of: