KR20160054081A - Knowledge-base for total guidance of public transportand generating method thereof - Google Patents

Abstract

The present invention relates to a transit general information knowledge base comprising: stop group information SG (110) for storing stop groups by setting stops corresponding to a predetermined condition as one group; non-transfer route information ODG0 (120) for storing stop group information about the shortest distance between the stop group to which a starting point belongs and the stop group to which a destination belongs; one-time transfer route information ODG1 (130) for storing information about a route requiring one transfer among the routes between the stop group to which the starting point belongs and the stop group to which the destination belongs; two-time transfer route information ODG2 (140) for storing information about a route requiring two transfers among the routes between the stop group to which the starting point belongs and the stop group to which the destination belongs; three-time transfer route information ODG3 (150) for storing information about a route requiring three transfers among the routes between the stop group to which the starting point belongs and the stop group to which the destination belongs; and X-time (many times) transfer route information ODGX (172) for storing information about a route requiring X (many times) transfers among the routes between the stop group to which the starting point belongs and the stop group to which the destination belongs. The transit general information knowledge base according to the present invention can provide information about the route from the staring point to the destination by generating route data between the stop group to which the starting point belongs and the stop group to which the destination belongs after setting the stops corresponding to the predetermined condition as one group in advance, thereby significantly improving a response speed.

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method and apparatus for generating a public-

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a public transportation general information knowledge base and a knowledge base generation method, and more particularly, to a knowledge base for route information for each number of transit stations of a public transportation means, A general public knowledge base and a knowledge base generation method in which a suitable route can be selected and used.

Route discovery in complex structures, such as public transport, takes a fairly long time to obtain results as a solution to common network problems. Although the determination of the search speed is related to the knowledge base modeling, how to organize the network and what search algorithm to apply is also very important.

Intelligent Transport Systems (Intelligent Transport Systems), a next-generation transportation system for enhancing the efficiency of transportation facilities and enhancing safety by combining advanced technologies such as roads, vehicles, and signal systems with electronic, control and communication technologies, ), Which is a core technology in the field of traffic information, is being designed and implemented so that various types of traffic information can be conveniently provided to a desired person.

The applicant of the present invention generates path information between a start point and a destination point through research in a related field and stores the path information in a database and reads data stored in the database according to a predetermined algorithm using a communication means to quickly The user can select and use the desired route in a state in which the user is provided with various routes from the starting point to the destination by utilizing the processed knowledge base through the database, A comprehensive information base and a knowledge base generation method (see Patent Document 1).

However, as a result of providing the actual service by applying the knowledge base generation method, it has been found that the response speed is slowed when there are many stopping places to be searched for the start point or the destination point. That is, there is a problem that the response speed is slowed by generating the route data between the departure stoppings and the destination stops through the individual search in the case-by-case form and providing the information from the start point to the destination.

Korean Patent No. 10-0330116

Accordingly, the present invention has been made to solve the above-mentioned problems, and it is an object of the present invention to provide a method and system for providing public information that can be easily arrived from a user's own starting point to a destination in a most convenient way, A guidance knowledge base, and a knowledge base generation method.

According to an aspect of the present invention, there is provided a general public knowledge base comprising: a stop group information SG which sets and stores stops corresponding to certain conditions as a group; Route information ODG0 that stores each stop group information on the shortest distance between the stop group to which the departure place belongs and the stop group to which the destination belongs; The one-time transfer route information ODG1 passing through one of the routes between the stop group to which the departure place belongs and the stop group to which the destination belongs; Two transfer route information ODG2 passing through the route between the stop group to which the departure place belongs and the stop group to which the destination belongs twice; Three transfer route information ODG3 passing through three times among the route between the stop group to which the departure place belongs and the stop group to which the destination belongs; And X-times (many-times) transfer route information ODGX which is transferred X times (many times) among the route between the stop group to which the departure place belongs and the stop group to which the destination belongs.

Here, the stops corresponding to the certain condition are stoppers within a certain radius or stops in a constant interval lattice, the lattice is subdivided into a plurality of sub lattices if necessary, and the stops in the sub lattice are grouped into a group Can be set.

The route information ODG0 without passing through the route can be generated using a Floyd algorithm of calculating the shortest distance at a time by calculating all the routes between the stop group to which the departure place belongs and the stop group to which the destination belongs.

In addition, the route information ODG1, ODG2, ODG3, ... ODGX to be transferred one or more times includes a view table virtually existing in the knowledge base in order to reduce the time occurring in the knowledge base input / output, And storing in the knowledge base only what is reasonable as an alternative path.

According to another aspect of the present invention, there is provided a method for generating a public transportation general knowledge base, the method comprising: generating stop group information SG by setting a group of stops corresponding to a predetermined condition as a group; Using the generated stop group information SG, generating information ODG0 about a route that has never been transferred between the stop group to which the start point belongs and the stop group to which the target point belongs; Inputting a passage number of each stop group of the generated route information ODG0 without transit; Generating one-way transfer route information ODG1 for the route to be transferred once using the generated route information ODG0 without passing through; Generating two-way transfer route information ODG2 by using the one-time transfer route information ODG1 and the route information ODG0 without passing through; And generating three times transfer route information ODG3 using the two transfer route information ODG2 and the route information ODG0 without passing through the route.

Here, the stops corresponding to the predetermined condition may be stops within a certain radius, stoppages in the constant-interval grid, the grid may be subdivided into a plurality of sub-grids, and the stops in the sub-grid may be set as one group .

The step of generating the route information ODG0 without passing through the steps includes: inputting a route line number between each stop group; Inputting a passage time between each stop group; Calculating the entire section using the Floyd algorithm, and storing the entire section in the path information ODG0 without transferring the allocated section.

In addition, it may further include inputting information on transfer time and route information to the transfer information data 160 for each transfer stop group.

In addition, the method includes the steps of: obtaining route information from the view table of each transfer route information ODGX generated in advance in the order of the elapsed time; Comparing whether the alternative route to the read route information is included within 5 or less; Determining whether the alternative path is less than or equal to 5 and comparing the optimal path with a specific value; Storing the ODG information in the route information ODGX for each transfer if the alternative path is 5 or less and is within a predetermined range from the optimum path; If the alternative path is not included in the path of 5 or less, or is not included within the specific range of the optimum path, it is determined that the path is not a valid path, and the path is returned without storing it in the transfer path information ODGX; And comparing and determining whether all ODGs have been processed.

According to the present invention, after setting stoppages corresponding to a certain condition as one group, route data between the stoppage group to which the departure point belongs and the stoppage group to which the destination belongs is generated to provide information that can arrive from the departure point to the destination, The response speed can be greatly improved in comparison with a method in which path data between stops and destination stops are separately generated in case-by-case form, thereby providing information that can be arrived from the source to the destination.

1 is a flowchart illustrating a process of forming a knowledge base of a public transportation comprehensive guide system according to an embodiment of the present invention;
FIG. 2 is a conceptual diagram of setting a stop group according to an embodiment of the present invention,
FIG. 3 is a conceptual diagram of setting a stop group according to another embodiment of the present invention,
FIG. 4 is a flowchart illustrating a process of forming information on a route without departing from a starting point to a target point of a public transportation comprehensive guide system according to an embodiment of the present invention; FIG.
FIG. 5 is a flowchart illustrating a process of forming transfer information on a transfer interval of the public transportation general information system according to an embodiment of the present invention; FIG.
6 is a flowchart illustrating a process of generating route information according to an increase in the number of transit times of the public transport comprehensive guidance system according to an embodiment of the present invention.

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

2 is a conceptual diagram illustrating the setting of a stop group according to an embodiment of the present invention. FIG. 3 is a diagram illustrating a concept of setting a stop group according to another embodiment of the present invention. FIG. 4 is a flowchart illustrating a process of forming information on a route without departing from a starting point to a target point of a public transportation general guidance system according to an embodiment of the present invention. FIG. FIG. 6 is a flowchart illustrating a process of forming transfer information on a transfer interval of the public transportation general guide system according to an embodiment of the present invention. FIG. 6 is a flowchart And a process of generating path information.

The public transportation general information knowledge base and the knowledge base generation method according to the present invention provide users with information that can easily arrive from their departure place to their destination in the most convenient way but apply the stopping group concept, And the response speed in the case of generating the route data between the stopping station groups can be remarkably improved.

First, before describing the multipath generation algorithm corresponding to the main contents of the present invention, the Floyd algorithm which is a reference of the multipath generation algorithm will be described.

The Floyd algorithm is an algorithm that computes all the paths between all origins and destinations at once, and is known to be the most efficient algorithm for computing multiple paths simultaneously.

That is, if there are n positions, the number of paths calculated calculates n * (n-1) paths at the same time.

However, the Floyd algorithm has a drawback in that it can not provide various paths to the user since it derives only one optimum (shortest) distance between the selected source and destination.

Therefore, if the Floyd algorithm is slightly modified to define the multipath generation algorithm, the defined contents are as follows.

First, the multipath generation algorithm includes stop group information SG 110 storing and setting stoppages corresponding to certain conditions as a group, path information ODG0 120 without passing through path information according to the number of exchanges, The one-time transfer route information ODG1 130, the two-time transfer route information ODG2 140, and the three-time transfer route information ODG3 150.

At this time, as shown in FIG. 2, the stops corresponding to the certain condition may be stops having a certain radius, for example, within 500 meters.

Alternatively, the stops corresponding to the certain condition are stoppages in a constant interval lattice, as shown in Fig. 3, the lattice is subdivided into a plurality of sub lattices if necessary, and the stops in the sub lattice are grouped into one group Can be set. For example, the whole country is divided into lattices at regular intervals and set as one stop group for each lattice. If the number of stops belonging to one stop group is larger than the reference value, the stop group is further subdivided.

ODG1 140 is a path information for a case of not being transferred, ODG1 130 is a path information for a transfer once, ODG2 140 is path information for a case of 2 transfer, It is the path information for the case of 3 times of transfer.

Although it is not covered in the embodiment of the present invention, OD4, OD5 ... can be continuously generated on the basis of ODG3.

Returning to the multipath generation algorithm of the present invention, in order to separately provide the path information from the ODG0 to ODG3, the solution for all the paths must be calculated in advance, and the path is provided in real time in the pre-calculated state .

In the case of the ODG0 (120) which does not change once, it is necessary to calculate a path that can go to the shortest distance without changing once. It is preferable to use the existing Floyd algorithm as it is.

If you change more than once, use the view table to find all possible routes between the source and destination and store them in the DB.

At this time, it is possible to designate paths that can be alternative paths among a plurality of paths.

It also filters the searched paths and stores only those that are reasonable in the alternative path in the ODG table.

Therefore, hardware constraints can be reduced by using a view table that exists virtually without information on a plurality of paths.

The reason for using the view table for one or more changes is that if you consider all the paths because you have to calculate multiple paths, you will need memory and memory when you execute the algorithm. .

In other words, since it is necessary to control a large amount of data in order to reduce the time that occurs in the DB input / output unit, there is a problem that the program takes time to read and process the database and store it in the database. Therefore, it implements the algorithm by using the built-in view table and database stored procedure in the database to minimize the time required for input and output.

And the view table does not have all the data at once, but has temporary workspace. In the concept of a page, only the buffer size defined by the database system is temporarily generated and calculated.

The database built-in function is a function existing in the knowledge base. Since the function can be added by the user, the algorithm for processing and storing the view table is implemented in the database built-in function.

Views are simply data, and algorithms are embedded in database built-in functions.

When the calculation is completed, the next page is skipped, the current buffer is cleared, and the next value is stored in the buffer. Based on the path retrieved from the view table, the optimal path and the corresponding alternative path are filtered and stored in the knowledge base.

Unlike the view table, the stored data is stored in a table having physical memory. When the calculation for all the paths is completed, the algorithm is terminated and the end of the algorithm execution is notified.

In the case where there is a request from the service user, that is, a request for searching for a route from the origin to the destination, the process of accepting the request in the interface process and accessing the knowledge base through the search process is referred to as a search request Processing.

The above process will be described in detail with reference to FIGS. 1 to 6. FIG.

First, the structure (kind) of the knowledge base includes stop group information SG (110) which sets and stores stops corresponding to certain conditions as a group; Route information ODG0 (120) which stores each stop group information on the shortest distance between a stop group to which the departure place belongs and a stop group to which the destination belongs; One-time transfer route information ODG1 (130) passing through the route between the stop group to which the departure place belongs and the stop group to which the destination belongs; Two transfer route information ODG2 (140) passing through the route between the stop group to which the departure place belongs and the stop group to which the destination belongs; Three transfer route information ODG3 (150) passing through three times among the route between the stop group to which the departure place belongs and the stop group to which the destination belongs; And an X-times (many-time) transfer route information ODGX 172 which is transferred X times (a plurality of times) among the routes between the stop group to which the departure place belongs and the stop group to which the destination belongs.

The stops corresponding to the predetermined condition may be stops having a certain radius, for example, within 500 m.

Alternatively, the stops corresponding to the certain condition are stoppages in a constant interval lattice, the lattice may be subdivided into a plurality of sub lattices if necessary, and the stops in the sub lattice may be set as one group. For example, the whole country is divided into lattices at regular intervals and set as one stop group for each lattice. If the number of stops belonging to one stop group is larger than the reference value, the stop group is further subdivided.

The route information ODG0 (120) that has not been transferred once is generated using a Floyd algorithm of calculating the shortest distance at one time by calculating all the routes between the stop group to which the departure place belongs and the stop group to which the destination belongs, The path information ODG1, ODG2, ODG3, ... ODGX (130,140,150,172) transferring more than one times includes a view table virtually existing in the knowledge base in order to reduce the time occurring in the knowledge base input / output, Only the appropriate path is stored in the knowledge base.

The above-described knowledge base (ODG) generation method (S110) comprises: generating (S120) stop group information SG by setting the stops corresponding to a certain condition as a group using the Floyd algorithm; Using the generated stop group information SG, a step (S130) of generating information ODG0 about a route that has never been transferred between the stop group to which the start point belongs and the stop group to which the target point belongs; A step (S140) of inputting a passage number of each stop group of the generated route information ODG0 without transit; A step (S150) of generating one-time transfer route information ODG1 related to the route to be transferred once using the generated route information ODG0 without passing through; A step (S160) of generating two transfer route information ODG2 by using the one-time transfer route information ODG1 and the route information ODG0 without passing through; And a step (S170) of generating three times transfer route information ODG3 using the two transfer route information ODG2 and the route information ODG0 without transfer.

The step S130 of generating the route information ODG0 120 without the transfer is a step S131 of inputting a route number of each stop, a step S132 of inputting a passage time between each stop, (S133) of calculating the entire section by using the route information ODG0 (120) without passing through the allocated route.

And inputting the information on the transfer time and the route information to the transfer information path information 20 for each transfer stop (S180).

(S191) of fetching route information in the order of the elapsed time from the view table 170 of each transfer route information ODGX 172 generated in advance, and a step (S191) of judging whether the alternative route to the read route information is within 5 (S193) comparing the optimal route with the optimal route if the alternative route is equal to or less than 5, determining whether the alternative route is within a specific value, (Step S194) of storing the ODG information in the transfer-specific route information ODGX 172, and if it is determined that the alternative route is not included within 5 or less than the optimum route, Information ODGX 172, and a step of comparing (S195) whether or not all the ODGs have been processed.

In step S192, it is determined whether the alternative path is included in the fifth grade or not.

In step S193, it is determined whether the optimal path is within a specific range. If the optimal path is compared with the optimal path, it is determined that the path does not need to be used because the path is too long.

The general public knowledge base and knowledge base generation method according to the present invention are applied to all public transportation means such as a train, a bus, a public transit, and a flight.

As described above, when the present invention is applied, first, the stopping points corresponding to certain conditions are set as one group, and then the route data between the stopping group of the departure place and the stopping group of the destination is generated, It is possible to greatly improve the response speed in comparison with the conventional method of generating the route data between the departure stops and the destination stops separately in case-by-case form and providing information that can arrive from the origin to the destination.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments. And various modifications, alterations, and changes may be made without departing from the scope of the present invention.

Therefore, the embodiments disclosed in the present invention and the accompanying drawings are intended to illustrate and not to limit the technical spirit of the present invention, and the scope of the technical idea of the present invention is not limited by these embodiments and the accompanying drawings . The scope of protection of the present invention should be construed according to the following claims, and all technical ideas within the scope of equivalents should be construed as falling within the scope of the present invention.

110: SG 120: ODG0
130: ODG1 140: ODG2
150: ODG3 160: Transfer information
170: ODGX view table 172: ODGX

Claims (11)

As a knowledge base for comprehensive information on traffic information,
Stop group information SG (110) storing and setting stoppages corresponding to certain conditions as a group;
Route information ODG0 (120) which stores each stop group information on the shortest distance between a stop group to which the departure place belongs and a stop group to which the destination belongs;
One-time transfer route information ODG1 (130) passing through the route between the stop group to which the departure place belongs and the stop group to which the destination belongs;
Two transfer route information ODG2 (140) passing through the route between the stop group to which the departure place belongs and the stop group to which the destination belongs;
Three transfer route information ODG3 (150) passing through three times among the route between the stop group to which the departure place belongs and the stop group to which the destination belongs;
And an X-times (many-time) transfer route information ODGX (172) which is transferred X times (a plurality of times) through a route between a stop group to which the departure place belongs and a stop group to which the destination belongs. Base. The method according to claim 1,
Wherein the stops corresponding to the predetermined condition are stops within a certain radius. The method according to claim 1,
The stops corresponding to the predetermined condition are the stops in the constant interval lattice,
Wherein the grid is subdivided into a plurality of sub-grids if necessary, and stops in the sub-grid are set as one group. The method according to claim 1,
The path information ODG0 120 without passing through the route is generated using a Floyd algorithm of calculating the shortest distance at one time by calculating all the paths between the stop group to which the departure place belongs and the stop group to which the destination belongs Traffic Information General Information Knowledge Base. The method according to claim 1,
The route information ODG1, ODG2, ODG3, ..., ODGX (130, 140, 150, and 172), which are transferred one or more times, incorporates a view table virtually existing in the knowledge base to reduce time generated in the knowledge base input / output, And storing in the knowledge base only what is appropriate as an alternative route. As a method for generating a traffic information comprehensive guidance knowledge base,
Generating stop group information SG by setting the stops corresponding to certain conditions as a group;
Using the generated stop group information SG, generating information ODG0 about a route that has never been transferred between the stop group to which the start point belongs and the stop group to which the target point belongs;
Inputting a passage number of each stop group of the generated route information ODG0 without transit;
Generating one-way transfer route information ODG1 for the route to be transferred once using the generated route information ODG0 without passing through;
Generating two-way transfer route information ODG2 by using the one-time transfer route information ODG1 and the route information ODG0 without passing through;
And generating three times transfer route information ODG3 using the two transfer route information ODG2 and the route information ODG0 without passing through the route. The method of claim 6,
Wherein the stops corresponding to the predetermined condition are stops within a certain radius. The method of claim 6,
The stops corresponding to the predetermined condition are the stops in the constant interval lattice,
Wherein the grid is subdivided into a plurality of sub-grids, and stops in the sub-grid are set as one group. The method of claim 6,
The step of generating the route information ODG0 without passing through the route includes:
Inputting a route line number between each stop group;
Inputting a passage time between each stop group;
Calculating a total interval using the Floyd algorithm, and storing the calculated total interval in the route information ODG0 without passing through the allocated transfer. The method of claim 6,
Further comprising the step of inputting information on the transfer time and the route information in the transfer information data (160) for each transfer stop group. The method of claim 6,
Fetching route information from the view table of each transfer path information ODGX generated in advance in the order of the elapsed time;
Comparing whether the alternative route to the read route information is included within 5 or less;
Determining whether the alternative path is less than or equal to 5 and comparing the optimal path with a specific value;
Storing the ODG information in the route information ODGX for each transfer if the alternative path is 5 or less and is within a predetermined range from the optimum path;
If the alternative path is not included in the path of 5 or less, or is not included within the specific range of the optimum path, it is determined that the path is not a valid path, and the path is returned without storing it in the transfer path information ODGX;
Further comprising the step of comparing and determining whether all ODGs have been processed.

Images