KR20090112869A - Stop search method and system using road information - Google Patents

Abstract

A method and system for searching for stop information using road information are provided. More specifically, a method for searching for a stop located within a predetermined distance from a point set as a departure point and a destination point, and providing public transportation route information between the found stops. And a system is provided.

A method of providing a public transportation route based on a stop search using road information includes (a) searching for a departure stop within a first search distance from a departure point received from a user terminal, and (b) a second departure from the arrival point received from the user terminal. Searching for an arrival stop within a search distance and (c) searching for a public transportation route from the searched departure stop to the searched arrival stop, wherein the first search distance and the second search distance are actual road information. Is the basis.

Description

Stop search method and system using road information {SYSTEM AND METHOD FOR SEARCHING STATION INFORMATION BASED ON ROAD INFORMATION}

The present invention relates to a method and system for searching for stop information by using road information, and more particularly, to search for a stop located within a predetermined distance from a point set as a departure point and an arrival point, and to search public transportation route information between the found stops. It relates to a method and system for providing.

Services provided through the Internet provide convenience to users, and in particular, traffic information providing services are widely used.

In general, except for taxis and the like, which can freely select a route according to the intention of a driver or a passenger, public transportation such as a bus or a subway runs along a predetermined predetermined route. In order to use such public transportation, when a user inputs a departure point and a destination, a route providing service showing a route for reaching the destination is provided through wired or wireless Internet.

In the use of the route providing service, the user generally enters the starting point and the destination place based on the place of residence or the work place, not the stop, and moves from the original departure point to the departure stop in order to use the provided public transportation route. It is common to travel from the arrival stop to the final destination on foot.

When a departure point or arrival point is entered as a place other than a stop, a conventional public transportation route search service searches for a stop located within a predetermined radius around a departure point and a destination received from a user, and searches for a public transportation route based on the found stop. Searched and provided to the user.

As such, when mechanically searching for a stop located within a predetermined radius around the starting point and the arriving point, there is a problem that the fact that the stop must be accessible on foot is not considered at all. For example, if there are obstacles such as mountains, rivers, and roads without crosswalks near the departure or destination, stop information that does not consider their existence is searched for, so that the user cannot actually use the searched information. A problem occurred.

One embodiment of the present invention is to provide a method and system for providing public transportation route information using a stop searched based on the distance based on the actual road information.

Another object of the present invention is to provide a method and system for arranging and providing all public transportation route information from one or more departure stops to one or more arrival stops in order of priority.

As a technical means for achieving the above-described technical problem, the first aspect of the present invention is (a) searching for a departure stop within a first search distance from the origin received from the user terminal, (b) received from the user terminal Searching for an arrival stop within a second search distance from a destination and (c) searching for a public transport route from the searched departure stop to the searched arrival stop, wherein the first search distance and the second The search distance may provide a method for providing a public transportation route based on a stop search using road information, which is a distance based on actual road information.

In addition, a second aspect of the present invention is an input receiving unit for receiving a departure point, an arrival point and a search condition from a user terminal, searching for a departure stop within a first search distance based on the actual road information from the departure point, and from the arrival point to the actual road. A stop search unit for searching for an arrival stop within a second search distance based on the information, and a route search unit for arranging public transportation routes from the searched departure stop to the searched arrival stop according to the search condition and providing the user terminal with the search condition; A public transportation route providing system based on a stop search using road information may be provided.

According to the above-described problem solving means of the present invention, the departure stop and the arrival stop are searched based on the distance based on the actual road information, and the public transportation route information for the retrieved departure stop and the arrival stop may be provided.

In addition, according to the above-described problem solving means of the present invention, when one or more departure stops or arrival stops are searched, public transportation route information for all departure stops and arrival stops may be arranged in a predetermined priority order.

DETAILED DESCRIPTION Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art may easily implement the present invention. As those skilled in the art would realize, the described embodiments may be modified in various different ways, all without departing from the spirit or scope of the present invention. In the drawings, parts irrelevant to the description are omitted for simplicity of explanation, and like reference numerals designate like parts throughout the specification.

Throughout the specification, when a part is "connected" to another part, this includes not only "directly connected" but also "electrically connected" with another element in between. . In addition, when a part is said to "include" a certain component, it means that it can further include other components, without excluding the other components unless otherwise stated.

1 is a flowchart illustrating a flow of a public transportation route providing method using a stop search according to an embodiment of the present invention.

In step S105, a search request for public transportation route information is received from the user terminal, and a starting point and a destination for searching for the route are received. Departures and destinations received from the user terminal are not limited to public transport stops, for example, bus stops, subway stations, and the like, and may include all places such as a user's residence, working place, or tourist destination.

In addition, the user terminal is a terminal capable of wired or wireless communication, and may include, for example, a desktop, a notebook computer, a personal digital assistant (PDA), a cellular phone, a smartphone, a UMPC, and the like.

In step S110, a departure stop, which is a stop located within a first search distance from the departure point received in step S105, is searched. The first search distance is a distance based on actual road information, and the first search distance may be preset by the server or directly by the user terminal.

For example, when the departure point is an urban area, the first search distance may be initially set to 100 m, and when the departure point is an out-of-town area, the first search distance may be initially set to 300 m.

As in the related art, when searching for a stop located within a predetermined radius, a stop that is actually far from the starting point may be searched for by road conditions, for example, obstacles such as buildings, roads, and rivers. However, when searching for a stop located within a certain distance based on the actual road information as described above, it is possible to search for a stop that is actually easily accessible from the starting point.

As such, the departure stop is a stop located within the first search distance based on actual road information, not a stop located within a predetermined radius from the departure point, and thus can be searched in consideration of the ease of access from the departure point.

In step S115, it is determined whether the number of departure stops searched in step S110 is equal to or greater than the preset number of stops. That is, it is determined whether the number of departure stops located within the first search distance satisfies the preset number of stops.

In the case of downtown, especially downtown area, there are many stops in the narrow area, so there may be enough stops within the first search distance.However, in the case of a dwelling area or a small floating population, the stop density is low and the first search distance is initially set. The number of stops located within may be small.

Therefore, it is determined whether the number of departure stops searched in step S110 satisfies the number of stops required for the route search.

In step S120, when it is determined in step S115 that the number of departure stops is less than the preset number of stops, the first search distance is extended by the preset distance.

That is, when the number of departure stops searched in step S110 does not satisfy the number of stops required for the route search, the first search distance is gradually extended by a predetermined distance and the search range for the departure stops is expanded.

Thereafter, if it is determined in step S115 that the number of departure stops found is equal to or greater than the preset number of stops, the flow proceeds to step S125.

Until now, the first search distance is infinitely repeated until the number of searched departure stops is equal to or greater than the number of preset stops, but the present invention is not limited thereto. The maximum extension range of the first search distance may be preset by the server or the user.

For example, when the starting point is an urban area, the first search distance may be set to extend from 50 m up to 50 m until the required number of stops starts at 100 m. In addition, when the departure point is an out-of-town area, the first search distance may be set to extend from 1 m to 100 m until the required number of stops starts from 300 m.

In step S125, an arrival stop, which is a stop located within a second search distance from the destination received in step S105, is searched. Like the first search distance, the second search distance is a distance based on actual road information, and the second distance may be preset by the server or set from the user terminal. Therefore, the arrival stop which is actually easily accessible by foot from the arrival place can be retrieved.

In step S130, it is determined whether the number of arrival stops retrieved in step S125 is equal to or greater than the preset number of stops. That is, it is determined whether the number of arrival stops located within the second preset search distance satisfies the number of stops required for the route search.

In step S135, if it is determined in step S130 that the number of arrival stops is less than the predetermined number of request stops, the second search distance is extended by the preset distance.

That is, as in the search for the departure stop, if the number of arrival stops found in step S130 does not satisfy the number of stops required for the route search, the second search distance is gradually extended by a predetermined distance and for the arrival stop. Broaden your search.

Thereafter, if it is determined that the number of departure stops searched in step S130 is equal to or greater than the preset number of stops, the flow proceeds to step S140.

As in the case of the departure stop, the second search distance is not infinitely extended repeatedly, and the maximum extension range of the second search distance may be preset by the server or the user.

In step S140, it is determined whether a condition for path search is received from the user terminal.

A user may simply request a search for a route, but may request a search for a route subject to preferred public transportation, shortest time, minimum transfer, minimum fare, shortest distance or waypoint.

Therefore, in step S140, it is determined whether such a search condition is received together with the search request received in step S105.

In step S145, when it is determined in step S140 that the search condition is received from the user terminal, the received search condition is set as a condition for the search of the public transportation route.

In step S150, the public transit route is searched from the departure stop searched in step S110 to the arrival stop searched in step S125, and information on the searched public transportation route is provided to the user terminal.

The public transportation route information provided to the user terminal may include not only the public transportation route from the departure stop to the arrival stop, but also the route from the departure point to the departure stop and the route from the arrival stop to the destination.

Accordingly, the user may search for the departure stop and the arrival stop even if the departure point and the arrival stop are inputted separately, and receive the public transportation route information.

If multiple departure and arrival stops have been retrieved, a route from each departure stop to the arrival stop may be retrieved and provided. For example, when M (M is a natural number) departure stops and N (N is a natural number) arrival stops are retrieved, M × N or more public transport routes may be retrieved and provided. The reason why MxN or more public transportation routes are searched is that there may be a plurality of routes from the same departure stop to the same arrival stop.

In addition, when a search condition is set in operation S145, priorities of the path information may be determined according to the search condition, and a list of the path information may be provided in alignment according to the determined priority.

In other words, when a plurality of departure and arrival stops are searched, and thus a plurality of routes are searched, the searched routes may be provided to the user terminal in a sorted order according to a preset order or a search condition received from the user terminal. For example, the searched route may be provided based on the distance between the departure point and the departure stop, the distance between the arrival destination and the arrival stop, the total travel time, the fare, the moving distance, and the number of transfers.

2 is a diagram illustrating a stop searched based on actual road information according to an embodiment of the present invention.

The departure stop searched according to one embodiment of the present invention includes an A1 stop 111 and does not include an A2 stop 121 and an A3 stop 131. The reason is that the stop A1 111 is located within the first search distance from the departure point 101, and the stop A2 121 and the stop A3 131 are located at a position exceeding the first search distance from the departure point 101. Because it is a stop that exists. The distance 112 from the departure point 101 to the A1 stop 111, the distance 122 to the A2 stop 121 and the distance 132 to the A3 stop 131 are based on actual road information, respectively. Because it is.

As shown, in the case of simply searching based on the radius from the departure point 101, the stop A1 111 is located farther from the departure point 101 than the stops A2 121 and A3 131.

However, when based on the first search distance, that is, the distance based on the actual road information, due to the actual road situation from the starting point 101 to each stop, for example, road layout or obstacles such as buildings, mountains, and rivers, The distance 112 from the departure point 101 to the A1 stop 111 is compared with the distance 122 from the departure point 101 to the A2 stop 121 and the distance 132 from the A3 stop 131 to the departure point 101. ) Closest to

Therefore, according to an embodiment of the present invention, unlike the prior art considering only the radius, there is an effect that the stop that the user can reach by actually walking is searched.

Similarly, the arrival stops retrieved according to one embodiment of the present invention include a B2 stop 221 and do not include a B1 stop 211. This is because the B2 stop 221 is a stop existing within the second search distance from the departure point 201, and the B1 stop 211 is a stop existing at a position exceeding the second search distance from the departure point 201. . This is because the distance 222 from the departure point 201 to the B2 stop 221 and the distance 211 from the B1 stop 211 are based on actual road information, respectively.

Even in the case of an arrival stop, when the radius from the destination 201 is based, the stop B2 221 is located farther from the destination 201 than the stop B1 211, but the distance based on the actual road information is determined. As a reference, the distance 212 from the destination 201 to the B1 stop 211 is located at a closer distance than the distance 122 from the destination 201 to the B2 stop 221.

3 is a diagram illustrating a public transportation route searched according to a departure stop and arrival stop searched according to an embodiment of the present invention.

Departure stops 310 retrieved in one embodiment of the present invention are A1, A2 and A3, arrival stop 330 is B1 and B2. In this case, the path 320 from the departure stop 310 to the arrival stop 330 may include A1-B1, A1-B2, A2-B1, A2-B2, A3-B1, and A3-B2.

As such, when the departure stop is M (M is a natural number) and the arrival stop is N (N is a natural number), a public transport route from M × N departure stops to the arrival stop may be searched. Further, in the case where transfers are to be made in the middle, a much larger number of public transportation routes than M × N can be retrieved.

4 is a block diagram showing the configuration of a public transportation route providing system using a stop search according to an embodiment of the present invention.

Public transportation route providing system according to an embodiment of the present invention includes an input receiving unit 410, a stop search unit 420, a route search unit 430 and a database 440.

The input receiver 410 receives a search request for a public transport route from a user terminal, and receives a departure point and a destination for route search. In addition, the input receiving unit 410 receives a condition of the route search from the user terminal. The search conditions may include preferred public transportation, shortest time, minimum transfer, minimum fare, shortest distance or waypoint, as described above.

The stop search unit 420 searches for a departure stop within a first search distance from the departure point, and searches for an arrival stop within a second search distance from the arrival point. The first search distance and the second search distance are distances based on actual road information, and may be preset by the server or set by the user terminal.

The actual road information is road information reflecting road conditions, for example, obstacles such as buildings, fences, and rivers. Therefore, when searching for the departure stop and the arrival stop using the first search distance and the second search distance, the departure stop and the arrival stop may be searched in consideration of the distance actually moved by the user.

When the number of departure stops searched by the stop search unit 420 is smaller than the number of preset stops, the stop search unit 420 expands the first search distance by the predetermined distance step by step and searches for the departure stops again. The maximum extension range of the first search distance may be preset by the server or set by the user terminal. The stepped extension distance and the maximum extension range of the first search distance may vary depending on the type or location of the starting point. For example, the outlying area may have a relatively larger stepped distance and maximum extension range than the urban area.

In addition, when the number of arrival stops retrieved by the stop retrieving unit 420 is smaller than the number of preset stops, the stop retrieving unit 420 similarly expands the second retrieval distance by the predetermined distance step by step again. Search. The maximum extension range of the second search distance may be preset by the server or set by the user terminal, and the stepped extension distance and the maximum extension range may vary according to the type or location of the destination.

The route search unit 430 searches all public transportation routes from the departure stop searched by the stop search unit 420 to the arrival stop. When a plurality of departure stops or arrival stops are searched, all routes corresponding to the found departure stop and arrival stop may be searched, and the searched route may include transfer information between heterogeneous public transportation means.

In addition, when the input receiving unit 410 receives a search condition, the path search unit 430 may search for a path that satisfies the search condition, determine a priority among the plurality of paths, and provide the same to the user. .

The database 440 stores information such as stops, actual road information, and public transportation information, and stores the departure and arrival stops searched by the stop search unit 420 and the public transportation route information searched by the route search unit 430. Save it.

The database 440 according to an embodiment of the present invention may be an integrated public transportation database incorporating all databases between heterogeneous public transportation. A common element between heterogeneous public transport information may be a global positioning system (GPS) coordinate value. Each public transportation information, for example, city bus traffic information and subway traffic information, may exist in a separate database, and may indicate a different method, name, and the like. GPS coordinate values may be included in common.

When all public transportation information is constructed based on GPS coordinate values as described above, the integrated public transportation database between heterogeneous public transportation means can be generated using the GPS coordinate values as common elements. That is, geographic information included in the database for each public transportation, for example, stop information, may be collected and arranged based on GPS coordinate values. In this case, GPS coordinate values within a certain range, for example, 5 meters may be collected. The stop having can be set to the same stop. In addition, a stop having a GPS coordinate value within a preset range, for example, 30 meters, may be set as a transferable stop.

Therefore, even if the information stored in each public transportation database has a different name or format, when collecting and organizing the information based on GPS coordinate values, the database for each public transportation without modifying the existing database may be used. You can create an integrated public transport database that includes.

The integrated public transportation database may include information on each public transport stop, route, distance, time and fare information, and the information about each stop is not only the GPS coordinate values described above, but also the name of the administrative district where the stop is located and the stop. May include a name.

As such, when an integrated public transportation database is established, stop information that can be transferred between different means of transportation may be generated. Transferable stops may be classified and managed in consideration of administrative district names, stop names and GPS coordinate values. For example, if a particular subway station and bus station contain the same administrative area name and additionally have the same station name or the distance by GPS coordinate values is within 100 meters, such subway station and bus station are transferable stops. Can be set and information about it generated.

In addition, even when the radial distance based on the GPS coordinate value is within 100 meters, when there is no crosswalk in the middle, or when there is a river or the like, there may be a case where transfer is practically impossible. Therefore, in this case, transfer information must be generated in consideration of the name of the administrative region and the name of the stop in addition to the GPS coordinate values.

An embodiment 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 the 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. In addition, computer readable media may include both computer storage media and communication media. 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. Communication media typically includes computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave, or other transmission mechanism, and includes any information delivery media.

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 hardware architecture.

The foregoing description of the present invention is intended for illustration, and it will be understood by those skilled in the art that the present invention may be easily modified in 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 exemplary in all respects and not restrictive. For example, each component described as a single type may be implemented in a distributed manner, and similarly, components described as distributed may be implemented in a combined form.

The scope of the present invention is shown by the following claims rather than the above description, and all changes or modifications derived from the meaning and scope of the claims and their equivalents should be construed as being included in the scope of the present invention. do.

1 is a flow chart showing the flow of a public transport route providing method using a stop search according to an embodiment of the present invention,

2 is a diagram illustrating a stop searched based on actual road information according to an embodiment of the present invention;

3 is a diagram illustrating a route searched according to a departure point, a departure stop, an arrival stop, and an arrival point according to an embodiment of the present invention;

Figure 4 is a block diagram showing the configuration of a public transport route providing system using a stop search according to an embodiment of the present invention.

Claims (14)

In the public transport route providing method based on the stop search using the road information, (a) searching for a departure stop within a first search distance from a departure point received from a user terminal, (b) searching for an arrival stop within a second search distance from the destination received from the user terminal; and (c) searching for a public transport route from the searched departure stop to the searched arrival stop Including, And the first search distance and the second search distance are distances based on actual road information. The method of claim 1, Step (a) is (a1) if the number of the searched departure stops is less than a predetermined number, step of expanding the first search distance by a predetermined distance and searching for a departure stop Public transport route providing method comprising a. The method of claim 2, In the step (a1), wherein the first search distance is extended only to a predetermined maximum extension range. The method of claim 3, wherein And the maximum extension range varies with the location of the origin. The method of claim 1, Step (b) is (b1) if the number of searched arrival stops is less than a preset number, step-by-step expanding the second search distance by a predetermined distance and searching for an arrival stop. Public transport route providing method comprising a. The method of claim 5, wherein In the step (b1), the second search distance is extended only to a predetermined maximum extension range. The method of claim 6, And the maximum extension range varies with the location of the destination. The method of claim 1, In step (c), when the search condition is received from the user terminal including at least one of preferred public transportation means, shortest travel time, minimum transfer, minimum fare, shortest distance, and waypoint, public transportation based on the search condition. Providing a route to the user terminal. The method of claim 8, The public transportation route, public transportation route providing method comprising the transfer information between heterogeneous public transportation means. The method of claim 9, The transfer information is generated on the basis of the administrative zone name of the stop, the stop name and the GPS coordinate value of the stop. In the public transportation route providing system based on the stop search using road information, An input receiver for receiving a starting point, a destination point, and a search condition from a user terminal; A stop search unit for searching for a departure stop within a first search distance based on actual road information from the departure point, and searching for an arrival stop within a second search distance based on the actual road information from the destination; Route search unit for arranging the public transport route from the searched departure stop to the searched arrival stop according to the search conditions to provide to the user terminal Public transportation route providing system comprising a. The method of claim 11, And if the number of the searched departure or arrival stops is less than a preset number, the stop search unit re-searches the departure stop or arrival stop by extending the first search distance or the second search distance. The method of claim 11, The search condition comprises at least one of preferred public transportation, shortest travel time, minimum transfer, minimum fare, shortest distance and waypoint. The method of claim 11, Integrated public transport database containing transfer information between heterogeneous public transport More, The transfer information is generated on the basis of the administrative zone name of the stop, the stop name and the GPS coordinate value of the stop.

Images