KR102181755B1 - Server, method and computer program for correcting path - Google Patents

Abstract

The route correction server according to an embodiment of the present invention includes a construction unit that constructs road network information, a location information receiving unit that receives at least one location information from a user terminal, and is generated based on location information received according to the road network information. A route correction unit for correcting a movement route and a driving fee calculation unit for calculating a taxi operation fee based on the taxi rate information based on the corrected movement route, and the road network information includes at least one road link constituting a plurality of roads, and Includes connection points connecting road links.

Description

Server, method and computer program to calibrate the path {SERVER, METHOD AND COMPUTER PROGRAM FOR CORRECTING PATH}

The present invention relates to a server, a method, and a computer program for correcting a route, and more particularly, to a server, a method, and a computer program for correcting a route based on preset road network information.

In the conventional taxi fare calculation method, the fare is calculated according to the metering method according to the driving distance and driving time of the taxi.

On the other hand, in the case of taxi fare according to the mileage of the taxi, the conventional taxi fare management server receives the location information included on the movement route from the starting point where the passenger boarded to the point where the passenger got off in real time from the taxi terminal, and , After calculating the driving distance based on the received location information, the taxi fare is calculated.

However, since there may be errors in the location information transmitted from the taxi terminal, the taxi fare may be calculated incorrectly because the mileage of the taxi is not accurate.

Korean Registered Patent Publication No. 10-1939722 (registered on January 11, 2019)

An object of the present invention is to provide a method of correcting a moving path generated based on at least one location information received from a user terminal based on preset road network information.

In addition, according to the present invention, by calculating the taxi operation fee based on the corrected movement route, an appropriate fee is charged to the taxi user.

However, the technical problem to be achieved by the present embodiment is not limited to the technical problem as described above, and other technical problems may exist.

As a technical means for achieving the above-described technical problem, the route correction server according to an embodiment of the present invention comprises: a construction unit for constructing road network information; A location information receiver for receiving at least one location information from a user terminal; A path correction unit correcting a moving path generated based on the received location information according to the road network information; And a driving fee calculation unit that calculates a taxi driving fee according to taxi rate information based on the corrected movement route, wherein the road network information includes at least one road link constituting a plurality of roads and connecting the road link. Includes connection points.

A route correction method according to another embodiment of the present invention includes the steps of constructing road network information; Receiving at least one location information from a user terminal; Correcting a moving path for the received location information according to the road network information; And calculating a taxi operation fee according to taxi rate information based on the corrected moving route, wherein the road network information includes at least one road link constituting a plurality of roads and a connection point connecting the road link. Include.

A computer program stored in a medium including a sequence of instructions for correcting a route according to another embodiment of the present invention, when executed by a computing device, constructs road network information, receives at least one or more location information from a user terminal, Correcting a moving route for the received location information according to the road network information, calculating a taxi operation fee according to taxi rate information based on the corrected moving route, and the road network information configuring a plurality of roads. And a sequence of instructions including at least one road link and a connection point connecting the road link.

According to any one of the above-described problem solving means of the present invention, the present invention provides a method of correcting a moving path generated based on at least one location information received from a user terminal in real time based on preset road network information can do.

In addition, according to the present invention, by calculating the taxi operation fee based on the corrected movement route, the taxi user can be charged an appropriate fee for the taxi use.

1 is a configuration diagram of a path correction server according to an embodiment of the present invention.
2A to 2C are diagrams for explaining road network information according to an embodiment of the present invention.
3A to 3C are diagrams for explaining a method of correcting a path according to an embodiment of the present invention.
4A to 4F are diagrams for explaining a method of deriving a corrected movement path of a user terminal according to another embodiment of the present invention.
5 is a view for explaining a comparison before and after correction of a moving path according to an embodiment of the present invention.
6A to 6B are diagrams for explaining a method of managing a buffer storing location information of a plurality of user terminals according to an embodiment of the present invention.
7 is a flowchart illustrating a method of correcting a path according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those of ordinary skill in the art can easily implement the present invention. However, the present invention may be implemented in various different forms and is not limited to the embodiments described herein. In the drawings, parts irrelevant to the description are omitted in order to clearly describe the present invention, and similar reference numerals are assigned to similar parts throughout the specification.

Throughout the specification, when a part is said to be "connected" to another part, this includes not only "directly connected" but also "electrically connected" with another element interposed therebetween. . In addition, when a part "includes" a certain component, it means that other components may be further included rather than excluding other components unless specifically stated to the contrary.

In the present specification, the term "unit" includes a unit realized by hardware, a unit realized by software, and a unit realized using both. Further, one unit may be realized using two or more hardware, or two or more units may be realized using one hardware. Meanwhile,'~ unit' is not meant to be limited to software or hardware, and'~ unit' may be configured to be in an addressable storage medium or configured to reproduce one or more processors. Thus, as an example,'~ unit' refers to components such as software components, object-oriented software components, class components and task components, processes, functions, properties, and procedures. , Subroutines, segments of program code, drivers, firmware, microcode, circuits, data, databases, data structures, tables, arrays and variables. The components and functions provided in the'~ units' may be combined into a smaller number of elements and'~ units', or may be further divided into additional elements and'~ units'. In addition, components and'~ units' may be implemented to reproduce one or more CPUs in the device.

1 is a configuration diagram of a path correction server 10 according to an embodiment of the present invention.

Referring to FIG. 1, the path correction server 10 according to an embodiment of the present invention includes a construction unit (not shown), a location information receiving unit 100, a path correction unit 110, a speed measurement unit 120, and filtering. It may include a unit 130, a storage unit 140, and a running fee calculation unit 150. Here, the path correction unit 110 may include a candidate point search unit 112, a probability calculation unit 114, a candidate point selection unit 116, and a derivation unit 118. However, the configuration of the path correction server 10 according to an embodiment of the present invention may be different from that of FIG. 1.

Hereinafter, FIG. 1 will be described with reference to FIGS. 2A to 6D.

)는 방향이 있는 선분으로 도로 형상을 기술하는데 이용된다. 각 도로 링크 마다 식별 정보가 설정되어 있으며, 각 도로 링크는 시작점 및 끝점(연결점)에 대한 위치 정보를 포함할 수 있다. The construction unit (not shown) may build road network information. Here, the preset road network information may include at least one road link constituting a plurality of roads and a connection point connecting the road links. The road network information may be composed of a graph G(N, L) with a direction. Here, N may include a set of vertices indicating connection points connecting road links, and L may include a set of road links. Referring to Figure 2c, the road link (

) Is a line segment with a direction and is used to describe the shape of the road. Identification information is set for each road link, and each road link may include location information for a start point and an end point (connection point).

)는 사용자 단말의 위치에 따른 위도 정보 및 경도 정보와 함께 해당 위치 정보가 전송된 시간 정보를 더 포함할 수 있다. 일정 시간 간격으로 사용자 단말로부터 수신된 위치 정보에 따라 복수의 위치 정보로 구성된 사용자 단말의 이동 경로에 대한 궤적 정보가 생성될 수 있다.The location information receiving unit 100 may receive at least one location information from a user terminal installed in a moving vehicle. Here, the user terminal may be, for example, a taxi meter installed in a taxi or a mobile terminal of a taxi driver. For example, the location information receiving unit 100 may receive location information (eg, coordinate information including latitude and longitude) corresponding to the location of the user terminal at predetermined time intervals from the user terminal. 2A, location information received from a user terminal (

) May further include time information at which the corresponding location information is transmitted along with latitude information and longitude information according to the location of the user terminal. Trajectory information on a moving path of the user terminal composed of a plurality of location information may be generated according to the location information received from the user terminal at a predetermined time interval.

When the user terminal passes through a GPS shaded area such as a tunnel, the location information receiver 100 may receive location information of the user terminal including an error.

Meanwhile, in the case of a GPS shaded area such as a tunnel, errors in the location information of the user terminal appear severe. For this reason, before correcting the movement path for the location information of the user terminal, a comparison between the movement speed of the user terminal and a preset speed (for example, the maximum speed that a taxi vehicle can produce), You need to filter the location information. Referring to FIG. 2B, a red line represents trajectory information on a moving path of a user terminal following a plurality of location information collected from a user terminal. Location information collected from the user terminal may cause abnormalities for various reasons as shown in FIG. 2B. If such location information is used as it is, a false conclusion is reached that the taxi vehicle in which the user terminal is located has moved much faster than it actually is. Therefore, it is necessary to filter only normal location information among location information collected from a user terminal.

The speed measurement unit 120 may measure the moving speed of the user terminal based on the location information of the user terminal and previous location information of the location information. For example, the speed measurement unit 120 calculates the movement speed of the user terminal based on the movement distance and movement time between the second position information corresponding to the current position of the user terminal and the first position information corresponding to the current position. Can be measured.

Before the path correction unit 110 corrects the moving path, the filtering unit 130 may perform pre-processing by pre-filtering the position information having a high probability of an error among the previously received position information based on speed. Accordingly, in the present invention, since position information including a possibility of an error can be excluded in correcting a moving path, an error resulting therefrom can be reduced.

For example, when the moving speed of the user terminal measured with respect to the received location information exceeds a preset speed, the filtering unit 130 may exception the location information as abnormal information. In this case, the path correction unit may correct the moving path by excluding the exception-processed position information among the received position information. Specifically, when the moving speed of the user terminal measured with respect to the received second location information of the user terminal exceeds a preset speed (eg, 200 km/h), the filtering unit 130 converts the second location information to abnormal information. You can handle exceptions as For another example, when the moving speed of the user terminal measured with respect to the received third location information of the user terminal does not exceed a preset speed, the filtering unit 130 may filter the third location information as normal information. have. In this case, the path correction unit may store position information corresponding to normal information among the received position information in a buffer, and correct the moving path using the stored position information.

When the moving speed of the user terminal measured with respect to the received location information does not exceed a preset speed, the storage unit 140 may store the location information as normal information in a buffer. In one embodiment, when the location information corresponding to normal information is received from the user terminal in the first state (that is, when the number of location information stored in the buffer is greater than or equal to a preset number, it is defined as a stable state), the storage unit 140 May not store the location information corresponding to the normal information in the buffer, but may be directly transferred to the path correction unit 110. If, in the second state (that is, when the number of position information stored in the buffer is less than the preset number, it is defined as an unstable state), the storage unit 140 receives the position information corresponding to the normal information from the user terminal. It is possible to store a plurality of location information corresponding to the normal information up to a preset threshold value. When the buffer reaches the threshold, the storage unit 140 may transmit a plurality of location information corresponding to the normal information stored in the buffer to the path correction unit 110 at once.

The path correction unit 110 may correct the movement path generated based on the received location information of the user terminal based on the estimated road network information.

이 주어지면, 후보점 탐색부(112)는사용자 단말의 위치 정보(301)로부터 기설정된 거리 내에 위치하는 후보 도로 링크(303, 305, 307)를 탐색할 수 있다. 이 후, 후보점 탐색부(112)는 사용자 단말의 위치 정보(301)로부터 후보 도로 링크(303, 305, 307) 각각에 내린 수선의 발 지점(309, 311, 313)을 후보점으로 선정할 수 있다. The candidate point search unit 112 searches for at least one road link located within a preset distance from the received location information of the user terminal, and searches for at least one candidate point corresponding to each location information from the searched road link. I can. For example, referring to FIG. 3A, trajectory information on a moving path of a user terminal (T)=

Given this, the candidate point search unit 112 may search for candidate road links 303, 305, and 307 located within a preset distance from the location information 301 of the user terminal. After that, the candidate point search unit 112 selects the starting points 309, 311, and 313 of the repairs dropped on each of the candidate road links 303, 305, and 307 from the location information 301 of the user terminal as a candidate point. I can.

The probability calculator 114 may calculate a first probability (emission probability) for a distance between the searched at least one candidate point and the location information of the user terminal. Here, the first probability is a probability indicating how much the searched at least one candidate point matches the location information of the user terminal, and may be calculated based on a distance between the at least one candidate point and corresponding location information. In this case, the first probability is calculated as the distance between the location information and the candidate point is closer.

)와 탐색된 후보점(

) 간 거리의 정규분포 N(

,

)를 통해 제 1 확률을 계산할 수 있다. 제 1 확률은 [수학식 1]과 같이, 위치 정보를 기준으로 이전 위치 정보 또는 이후 위치 정보를 고려하지 않고, 해당 위치 정보가 실제 도로 링크 상에 있는 후보점에 얼마나 가까이 있는지 여부만을 나타낸다. Probability calculation unit 114 is the location information of the user terminal (

) And the searched candidate point (

) Normal distribution of distances N(

,

) Can be used to calculate the first probability. As shown in [Equation 1], the first probability indicates only how close the corresponding location information is to a candidate point on an actual road link without considering the previous location information or the subsequent location information based on the location information.

[Equation 1]

이고, 굵은 선(315)은 고속도로를 나타내고, 가는 선(317)은 일반도로를 나타낸다고 가정한다. Meanwhile, since the first probability does not consider the relationship between the previous location information and the subsequent location information based on the location information of the user terminal, the matching between the corresponding location information and the candidate point may be erroneous. 3B, a trajectory of a moving path of a user terminal is

And, a thick line 315 represents a highway, and a thin line 317 represents a general road.

에 대한 제 1 후보점(321) 및 제 2 후보점(327) 각각과

간 거리에 대한 제 1 확률에 따라서

와 가장 가까이에 있는 제 1 후보점이

에 대한 최종 후보점으로 결정될 수 있다.

For each of the first candidate points 321 and the second candidate points (327) and

According to the first probability for the inter-distance

The first candidate point closest to and

Can be determined as a final candidate for

에 대하여 사용자 단말이 이전에 위치한

와 이후에 위치한

가 고속도로 상에 있다는 것을 알고 있다면,

에는 제 2 후보점(327)이 최종 후보점으로 매칭되어야 한다. 택시 차량은 가급적 우회하는 경로를 선택하지는 않는다는 사실에 기초하여 후보점을 결정해야한다. 이러한 직관을 이용하기 위해서 도로 네트워크 정보의 연결성이 후보점 결정에 반영되어야 한다. But,

For the user terminal previously located

And located after

If you know that is on the highway,

The second candidate point 327 should be matched to the final candidate point. Taxi vehicles should determine candidate points based on the fact that they do not choose a detour route as much as possible. In order to use this intuition, the connectivity of road network information must be reflected in the determination of candidate points.

) 의 이전 위치 정보(

)에 대하여 탐색된 이전 후보점들과의 모든 부분 경로에 대한 최단 거리를 현 위치 정보 및 이전 위치 정보 간의 거리와 비교를 통해 산출될 수 있다. 제 2 확률은 이웃하는 이전 위치 정보 및 현재 위치 정보 간의 거리와 이전 위치 정보에 대응하는 후보점 및 현재 위치 정보에 대응하는 후보점 간의 도로 네트워크 상의 최단 거리의 차이가 적을수록 높은 확률을 가질 수 있다. 이러한, 제 2 확률은 [수학식 2]에 기초하여 계산될 수 있다. The probability calculator 114 may further calculate a second probability (transition probability) according to the connectivity of the road network information with respect to the distance between the location information of the user terminal and the previous location information of the location information. Here, the second probability is the location information (

) Of previous location information (

) May be calculated by comparing the distance between the current location information and the previous location information with the shortest distances for all partial routes with the previous candidate points searched for ). The second probability may have a higher probability as the difference between the distance between neighboring previous location information and current location information and the shortest distance on the road network between a candidate point corresponding to the previous location information and a candidate point corresponding to the current location information is smaller. . This second probability may be calculated based on [Equation 2].

[Equation 2]

는

,

사이의 직선거리와

와

사이의 도로네트워크 상 최단 거리의 차의 절대값이다. here,

Is

,

The straight line distance between

Wow

It is the absolute value of the difference between the shortest distance on the road network.

The probability calculator 114 may further calculate a second probability based on at least one of road characteristic information and speed limit attribute information about a road on which the taxi vehicle in which the user terminal is located is actually traveling. Accordingly, the present invention does not simply select a candidate point using only a probabilistic value, but may select a candidate point by reflecting characteristics of the road on which the vehicle is actually traveling and the surrounding traffic environment. For example, the probability calculation unit 114 is a road characteristic including information on whether or not a taxi vehicle is traveling in one way, such as a highway in which an up line and a down line are separated, or a general passage near a residential area The information can be used to calculate the second probability. In this case, in the case of using road characteristic information on a road on which the taxi vehicle can move in the reverse direction, the second probability may be lowered. For another example, the probability calculation unit 114 may provide information on the moving speed of the taxi vehicle being driven and the speed limit attribute information set on the road on which the taxi vehicle is driving (for example, the speed of the vehicle is the road located around the kids zone. It is set to be suggested to be less than 20 km/h) and can be used to calculate the second probability. In this case, as the difference between the moving speed of the taxi vehicle and the speed limit attribute information increases, the second probability may decrease.

The probability calculator 114 may calculate a second probability based on a product of a probability calculated from Equation 2, a probability calculated from characteristic information of a road, and a probability calculated from speed limiting attribute information of a road.

와

각각에 대한 후보점이 제 1 후보점(321) 및 제 2 후보점(327)이라면, 제 1 후보점(321)로부터 제 2 후보점(327)으로의 제 2 확률은

및

사이의 실경로가 제 1 후보점(321) 및 제 2 후보점(327) 사이의 최단 거리가 될 확률을 의미한다. Referring to Figure 3b, neighboring on the moving path of the user terminal

Wow

If the candidate points for each are the first candidate point 321 and the second candidate point 327, the second probability from the first candidate point 321 to the second candidate point 327 is

And

It means a probability that the real path between the first candidate points 321 and the second candidate points 327 will be the shortest distance.

,

, ..

) 에 대하여 탐색된 후보점의 집합과 시간별 각 위치 정보에 대하여 이웃하는 후보점들 간의 최단 거리를 나타내는 링크로 구성될 수 있다. 이 때, 위치 정보별 각 집합에 포함된 후보점들은 각 위치 정보에 대한 제 1 확률에 기초하여 탐색된 후보점이고, 시간별로 후보점들을 연결하는 링크는 제 2 확률에 기초하여 도출된 연결성 정보를 나타낸다. The path correction unit 110 is based on the first probability and the second probability calculated for the at least one candidate point searched in response to the location information and the location information of the user terminal received at regular intervals. Can generate a candidate graph for. Referring to FIG. 3C, the candidate graph shows location information of a user terminal received by time (

,

, ..

) And a link indicating the shortest distance between neighboring candidate points for each location information by time. At this time, the candidate points included in each set for each location information are candidate points searched based on the first probability for each location information, and the link connecting the candidate points by time uses the connectivity information derived based on the second probability. Show.

The candidate point selector 116 may select a candidate point corresponding to each location information from among at least one candidate point searched based on the calculated first probability and second probability.

The derivation unit 118 may correct the movement path for the location information by using the road link where the selected candidate point is located, and derive the corrected movement path.

A method of deriving a corrected movement path of a user terminal will be described for a moment with reference to FIGS. 4A to 4F.

Referring to FIG. 4A, when the user terminal is moving according to the recommended movement path information determined based on information on the departure and destination input by the user, when t=1, first location information where the user terminal is located ( 401) and when t=2, it is assumed that the second location information 403 in which the user terminal is located, and when t=3, the third location information 405 in which the user terminal is located are collected from the user terminal.

4B and 4C, the route correction server 10 is within a preset distance from each of the first location information 401, the second location information 403, and the third location information 405 received for each time period. At least one candidate point may be searched from at least one located road link.

The route correction server 10 searches for a candidate point 407 for the first location information 401 on a first road link located within a preset distance from the first location information 401, and detects the second location information 403 ) To search for candidate points 409 and 411 for the third road link located within a preset distance and the second location information 403 located on the fourth road link, and preset from the third location information 405 Candidate points 413 and 415 for the fifth road link located within the distance and the second location information 403 located on the seventh road link may be searched.

The route correction server 10 may derive a map matching graph using candidate points searched for each time period. The route correction server 10 may derive a map matching graph indicating a moving direction between the candidate points over time for each candidate point searched for each road link by time. In this case, the map matching graph may be stored in the buffer of the storage unit 140.

4D, the path correction server 10 provides a first probability (probability according to the distance between candidate points searched according to location information and location information) and a second probability (neighborhood) for candidate points searched for each time period. A probability according to connectivity of road network information based on the distance between the location information and the distance between neighboring candidate points) may be calculated. The path correction server 10 may calculate a first probability for each candidate point searched for each time period, and calculate a second probability for a link connecting neighboring candidate points.

4E to 4F, the path correction server 10 may calculate a final probability for each of a plurality of candidate paths based on a first probability calculated for each candidate point and a second probability calculated for each connecting link of each candidate point. I can. For example, in the case of a candidate route moving to the first road link -> the fourth road link -> the seventh road link, the final probability for the corresponding candidate route may be calculated as 0.9 x 0.7 x 0.6 x 0.8 x 0.7. .

The path correction server 10 selects a candidate path 417 having the highest final probability value among the final probabilities calculated for each of a plurality of candidate paths, and uses the selected candidate path 417 as a corrected optimal movement path 419 of the user terminal. Can be used as.

5 is a diagram for describing a comparison between before and after correction of a moving path of a user terminal.

Referring to FIG. 5, it is assumed that four pieces of location information from t=0 to t=3 are collected from the user terminal (501). Here, the solid line represents the road network, the red dot represents the location information, and the blue line represents the estimated driving route of the user terminal.

Thereafter, after three new location information is received at t=4, t=5, t=6, if correction for the moving path is not made, it is a case of connecting to a nearby link as shown in reference numeral 505, at t=3. A somewhat awkward path to t=4 by making a U-turn can be calculated. In actual taxi vehicle operation, it is very unlikely to make a U-turn more than once by making a short U-turn.

On the other hand, when correction for the moving path is performed as shown in reference numeral 503, the location information received at t=3 is analyzed as a GPS error, and overlapping sections such as t=2~t=3 are removed. It can be seen that the route with the highest probability of actually driving a taxi vehicle is returned to the optimal route.

Returning to FIG. 1 again, the driving fee calculation unit 150 may calculate a taxi driving fee according to the taxi rate information based on the corrected movement route. Here, the taxi rate information may include information on a local time rate and information on a distance rate. The time rate information for each region includes rate information on the total travel time of the taxi according to the departure time and arrival time of the taxi, and the distance rate information by region is the total travel distance of the taxi according to the departure and arrival locations of the taxi. May include rate information.

For example, the operation fee calculation unit 150 calculates the taxi operation fee for the corrected travel route according to the basic fare notified by taxi business area (e.g., Seoul, Seongnam, etc.), per distance rate information, and hourly rate information. Can be calculated. The driving fare calculation unit 150 may accumulate the taxi driving fare by multiplying the travel distance and travel time calculated based on the corrected travel path per distance unit by taxi rate information (a rate per distance and an hourly rate). Information on the taxi operation fee calculated in this way is transmitted to the user terminal and/or the passenger terminal, and if the taxi is running, the taxi operation fee is updated by repeating the above-described travel route correction process, and the updated operation fee is used by the user. It may be transmitted to the terminal and/or the passenger terminal.

6A to 6B are diagrams for explaining a method of managing a buffer storing location information of a plurality of user terminals according to an embodiment of the present invention.

6A to 6B, in a situation where there are tens of thousands of taxis nationwide, and long-distance driving for several hours by taxi is possible, map matching graphs according to movement routes of a plurality of user terminals are all stored and maintained in a buffer (memory). And management is limited in terms of capacity. To solve this problem, an algorithm that uses a small buffer capacity in the following manner is required.

6A, when a map matching graph is derived using candidate points searched for each time period, when all candidate points of the last slice are connected to the same parent node, the parent node from the last slice of the map matching graph The section up to the slice corresponding to the candidate point may be set as a window, and a plurality of candidate points included in the corresponding window may be managed and stored in window units through the set window. For example, since all six candidate points at t = 7 corresponding to the candidate points of the last slice are connected from the candidate points at t = 1 corresponding to the parent node, t = 1 to t in the map matching graph Candidate points corresponding to =7 may be set as one window.

6B shows two consecutive windows. The last candidate points positioned at the far right of the second window 63 are all concatenated from candidate points corresponding to the same parent node (candidate points positioned at the lower left of the second window 63). Therefore, even if any of the last candidate points of the second window 63 is selected, the optimum path (optimum corrected movement path) of the first window 61 connected to the candidate point corresponding to the parent node does not change. Does not. Therefore, even if the section set as the first window 61 of the map matching graph is removed from the buffer, the optimal path for the moving path of the user terminal does not change, so the path correction server 10 of the present invention is The first window 61 set in the section corresponding to the determined route among the windows of is removed from the memory and buffer, and the second window 63 set in the section corresponding to the undefined route can be maintained in the memory and the buffer. have. That is, according to the present invention, only a window set in a section corresponding to an unconfirmed route among the map matching graphs is left, so that even if a taxi runs for a long time, a buffer larger than a certain size may not be occupied.

7 is a flowchart illustrating a method of correcting a path according to an embodiment of the present invention.

Referring to FIG. 7, in step S701, the path correction server 10 may receive at least one or more location information from a user terminal. For example, the user of the user terminal may be provided with a route guidance service from the origin to the destination where the current location is located using a navigation (e.g., a navigation attached to a vehicle or a navigation app installed on the user terminal). The vehicle is operated according to the route guidance service, and the location of the user terminal is moved according to the operation of the vehicle. The location information of the user terminal that is moved in this way may be transmitted from the user terminal to the path correction server 10 for each preset period. Accordingly, the route correction server 10 of the present invention may correct the route in real time as the location information of the user terminal is received in real time. In step S703, the path correction server 10 may correct the movement path generated based on the received location information based on preset road network information. Here, the road network information may include at least one road link constituting a plurality of roads and a connection point connecting the road links. In step S705, the route correction server 10 may calculate a taxi operation fee according to the taxi rate information based on the corrected moving route.

Embodiments of the present invention may also be implemented in the form of a recording medium including instructions executable by a computer, such as a program module executed by a computer. Computer-readable media can be any available media that can be accessed by a computer, and includes both volatile and nonvolatile media, removable and non-removable media. Also, the computer-readable medium may include a computer storage medium. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. The above description of the present invention is for illustrative purposes only, and those of ordinary skill in the art to which the present invention pertains will be able to understand that it can be easily modified into other specific forms without changing the technical spirit or essential features of the present invention. will be. Therefore, it should be understood that the embodiments described above are illustrative in all respects and not limiting. For example, each component described as a single type may be implemented in a distributed manner, and similarly, components described as being distributed may also be implemented in a combined form.

Although the methods and systems of the present invention have been described in connection with specific embodiments, some or all of their components or operations may be implemented using a computer system having a general-purpose hardware architecture.

The above description of the present invention is for illustrative purposes only, and those of ordinary skill in the art to which the present invention pertains will be able to understand that it can be easily modified into other specific forms without changing the technical spirit or essential features of the present invention. will be. Therefore, it should be understood that the embodiments described above are illustrative in all respects and not limiting. For example, each component described as a single type may be implemented in a distributed manner, and similarly, components described as being distributed may also be implemented in a combined form.

The scope of the present invention is indicated by the claims to be described later rather than the detailed description, and all changes or modified forms derived from the meaning and scope of the claims and their equivalent concepts should be interpreted as being included in the scope of the present invention. do.

Claims (15)

In the route correction server for correcting the moving route of the vehicle when calculating the driving fee according to the movement of the vehicle,
A construction unit for building road network information;
A location information receiver for receiving at least one location information from a user terminal;
A path correction unit correcting a moving path generated based on the received location information according to the road network information; And
A service fee calculation unit that calculates a taxi service fee according to the taxi rate information based on the corrected travel route
Including,
The road network information includes at least one road link constituting a plurality of roads and a connection point connecting the road links,
The path correction unit
A candidate point search unit for searching for at least one road link located within a preset distance from the location information and searching for at least one candidate point corresponding to the respective location information from the searched road link;
A first probability (emission probability) for a distance between the searched at least one candidate point and the location information, and a second probability according to the connectivity of the road network information to a distance between the location information and previous location information of the location information a probability calculation unit that further calculates (transition probability); And
A candidate point selection unit for selecting a candidate point corresponding to the respective position information among the searched at least one candidate point based on the first probability and the second probability,
The route correction unit corrects the moving route using a road link in which a candidate point corresponding to each of the selected location information is located.
delete delete The method of claim 1,
The second probability is,
The route correction server, which is further calculated based on at least one of road characteristic information and speed limit attribute information about a road on which the vehicle is running.
The method of claim 4,
The road characteristic information includes at least one of information on whether one-way passage and whether two-way passage on the road is carried out.
The method of claim 4,
The second probability is calculated according to a speed difference value between a moving speed of the vehicle and speed limit attribute information set on a road on which the vehicle is traveling.
In the method of correcting the movement route of the vehicle when calculating the driving fee according to the movement of the vehicle,
Building road network information;
Receiving at least one location information from a user terminal and correcting a movement path generated based on the received location information according to the road network information; And
Calculating a taxi operation fee according to taxi rate information based on the corrected movement route
Including,
The road network information includes at least one road link constituting a plurality of roads and a connection point connecting the road links,
Correcting the movement path
Searching for at least one road link located within a preset distance from the location information; And
Searching for at least one candidate point corresponding to the location information from the searched road link;
A first probability (emission probability) for a distance between the searched at least one candidate point and the location information, and a second probability according to the connectivity of the road network information to a distance between the location information and previous location information of the location information further calculating (transition probability);
Selecting a candidate point corresponding to the respective position information among the searched at least one candidate point based on the first probability and the second probability, and
And correcting the movement path using a road link in which a candidate point corresponding to each of the selected location information is located.
delete delete The method of claim 7,
The second probability is,
The route correction method, which is further calculated based on at least one of road characteristic information and speed limit attribute information on a road on which the vehicle is running.
The method of claim 7,
The road characteristic information includes at least one of information on whether one-way traffic and whether two-way traffic on the road is carried out.
The method of claim 10,
The second probability is calculated according to a speed difference value between the moving speed of the vehicle and speed limit attribute information set on a road on which the vehicle is traveling.
The method of claim 7,
Measuring a moving speed of the user terminal based on the location information and previous location information of the location information;
When the measured movement speed exceeds a preset speed, exception processing the location information as abnormal information; And
Correcting the movement path by excluding the exception-processed location information among the received location information
That further comprises a path correction method.
The method of claim 13,
Storing the location information as normal information when the measured movement speed does not exceed a preset speed; And
Correcting the movement path using the stored location information
That further comprises a path correction method.
In the computer program stored in a medium containing a sequence of instructions for correcting the movement path of the vehicle when calculating the driving fee according to the movement of the vehicle,
When the computer program is executed by a computing device,
Build road network information,
Receiving at least one location information from a user terminal and correcting a movement path generated based on the received location information according to the road network information,
Calculate a taxi operation fee according to the taxi rate information based on the corrected movement route,
The road network information includes a sequence of instructions including at least one road link constituting a plurality of roads and a connection point connecting the road links,
The sequence of commands to correct the movement path is
Searching for at least one road link located within a preset distance from the location information,
Searching for at least one candidate point corresponding to each location information from the searched road link,
A first probability (emission probability) for a distance between the searched at least one candidate point and the location information, and a second probability according to the connectivity of the road network information to a distance between the location information and previous location information of the location information (transition probability) is further calculated,
Selecting a candidate point corresponding to each location information from among the searched at least one candidate point based on the first probability and the second probability,
A computer program stored in a medium comprising a sequence of instructions for correcting the moving path using a road link in which a candidate point corresponding to each of the selected location information is located.

Images