JP2007093334A - Route guide system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To search an optimum route considering such regulation conditions as being closed in a specific time zone. <P>SOLUTION: As data used for route search, a map DB250, a time table DB252, and a user DB254 are provided. The map DB250 contains a network data indicating a path with nodes and links. The time table DB252 contains regulation conditions for passing the links such as departure time of transportation means and a specific closed time zone. The user DB254 contains moving velocities capable of being adopted by each user. A server 200 changes stepwise the moving velocities capable of being adopted by a user and searches a route for each moving velocity. In this manner, a user can obtain a plurality of kinds of search results including a status avoiding restriction due to regulation conditions by moving with quick walk and the user can select an optimum route whose load and effect of moving with quick walk are evaluated. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a route search and guidance technique in the case where there are restricted places where passage is permitted and the direction of passage varies depending on time.

  There has been proposed a route guidance device for searching for and guiding an optimum route from a specified departure place to a destination for a vehicle or a pedestrian. The route guidance device refers to network data in which paths are represented by nodes and links, and searches for a route that minimizes the evaluation value assigned to each link, that is, the total cost. In the route searching device for pedestrians, a technique for searching for a route by including a public transportation such as a train or a ferry in the passage has been proposed (see Patent Documents 1 to 3).

  In the case of including public transportation, by setting the cost based on the required time, a route with the shortest required time is searched. Since public transportation has a predetermined departure time, when using public transportation, useless waiting time may occur in relation to the departure time. Patent Documents 1 to 3 disclose a technique for searching for the shortest arrival route in consideration of the waiting time of each public transport by providing a public transport timetable as a database.

JP-A-8-166248 JP 2001-165683 A JP 2001-280992 A

  As described above, route search including public transportation is greatly affected by waiting time, and hence the time required to reach the destination, depending on the arrival time of the transportation starting point, for example, a station or a bus stop. However, in the prior art, the arrival time is obtained on the assumption that each link moves at a preset moving speed. Therefore, when the arrival time at the station or the like is slightly delayed from the departure time, a great waiting time is generated, and another alternative route may be selected. Considering that there is a possibility that the route to the station or the like may be in time for the departure time by slightly rushing the route, such a route is not necessarily optimal.

  Such a problem is not limited to the use of transportation. For example, whether roads that are prohibited from passing by time, roads that change the direction of one-way traffic, and intersections where restrictions such as turning right or left are lifted are similarly determined whether or not the point of restriction is reached immediately before the regulation is switched. Depending on the search result, the search result may be greatly affected. In view of these problems, the present invention has an object to make it possible to search for a more preferable route in consideration of a range of moving speeds that can be taken by a user and a range of other moving conditions.

  The present invention can be configured as a route search device that accepts designation of a departure point, a departure time, and a destination and searches for a route between them. Any of a vehicle and a pedestrian may be targeted. The route search uses network data in which paths are represented by nodes and links. Restriction conditions are attached to at least some of the nodes and links included in the network data, and traffic modes that can be taken when passing through the nodes and links are restricted according to time. Examples of the restriction conditions include a restriction that the vehicle cannot be used unless a predetermined departure time is reached, such as a transportation facility, a traffic restriction that changes according to time, a one-way traffic, a right-left turn prohibition, and the like.

  In the present invention, as a condition for performing a route search using the network data described above, a plurality of types of search conditions having different movement conditions that affect the required travel time of at least some links are set, and each search condition is set. The route corresponding to each is searched. Examples of the movement condition that affects the travel time include a moving speed when a link is traveled, a departure delay time and an arrival delay time of a transportation facility on a link representing a public transportation facility. In the present invention, even when a route search is performed using a single network data, various results can be obtained such as when the above-mentioned restriction conditions can or cannot be avoided by performing a route search by changing these conditions in a plurality of ways. Can be obtained. Therefore, the user can know an appropriate route by comparing these various results as compared with the case of using a uniform moving speed or the like. However, the present invention is not limited to the case of using a single network data. For example, a plurality of types of network data such as network data for pedestrians, network data for bicycles, and network data for vehicles are used. A route search may be performed. In this case, it is not necessary to set a plurality of types of search conditions for each network data used, and a plurality of types of search conditions may be set for at least one type of network data.

  The search conditions described above can be arbitrarily set, but it is preferable to include a condition that minimizes the travel time of at least some of the links. The search result under this search condition is the search at the fastest moving speed or the search without any delay in transportation, that is, the best effort result, the most likely possibility of avoiding the restriction condition, and the optimal route It is because there is a high possibility of obtaining. Further, according to the present invention, it is possible to evaluate the effect and necessity of best effort by performing a route search under a search condition different from the best effort such as a search condition with a slow moving speed. For example, as a result of route search when the moving speed is fast and when the moving speed is slow, only a difference occurs in the waiting time of the transportation system, and if the result that there is no difference in the actual required time is obtained, fast moving It is possible to determine that there is no need to move at a speed.

  The movement conditions that affect the travel time may include voluntary conditions that can be adjusted by the user's intention and involuntary conditions that cannot be adjusted by the user's intention. For example, the moving speed of the link corresponds to the former, and the delay of transportation means the latter. In such a case, it is preferable to set the search condition by changing the voluntary condition and the involuntary condition independently. For example, when two types of values are assumed as the voluntary condition and two types of values are assumed as the involuntary condition, four types of search conditions are set by changing both of them independently. However, the voluntary condition and the involuntary condition may be linked to each other, and for example, two types of search conditions may be set, in which both conditions require the shortest travel time and conditions that provide the longest travel time.

  The route search can use a method such as Dijkstra's method that searches for a route that minimizes the sum of the costs using a cost set according to the distance of each link or the required travel time. The route search device calculates the predicted time to reach each node on the assumption that it has departed from the departure place at the specified time, and costs the waiting time required to pass each link based on the regulation conditions. It may be reflected. By doing so, it is possible to realize a route search in consideration of the waiting time. The cost according to the waiting time is preferably reflected on the link to which the regulation condition is attached. When the required travel time is used as the cost of each link, it can be reflected in the cost by adding a waiting time. During this addition, the waiting time may be multiplied by a predetermined weight value.

  The present invention can be applied to various regulatory conditions. The traffic restrictions that change depending on the use time and time of the transportation system exemplified above are examples of conditions in which passage of the link is permitted when a predetermined time is reached. In contrast, the restriction condition may include a restriction on prohibition of traffic in a predetermined time zone. For example, such a restriction that traffic is closed at a predetermined time during the night, such as a station yard or a passage in a building, cannot pass. When the traffic prohibition restriction is included, according to the present invention, it is possible to search for a route that can pass through the restriction point before the passage is prohibited by performing the route search at various moving speeds. On the other hand, at a time when the traffic prohibition restriction is released, it is possible to obtain a route that passes through the restricted portion after waiting for the release of the traffic restriction.

  In the present invention, the cost attached to each link may be set on the basis of the distance, so that the route search with priority to the distance, that is, the route with the shortest distance may be searched. The route search device of the present invention converts a waiting time into a distance based on a predetermined rule and reflects it in the cost even when performing a route search with distance priority. This is because a route in which an extremely long waiting time is generated at a restriction point in the middle of the route is not necessarily appropriate even though the route search is prioritized by distance. As described above, the adverse effect can be avoided by converting the waiting time into a distance and reflecting it in the cost. Although the conversion formula from waiting time to distance can be set arbitrarily, it can be set as the product of waiting time and moving speed, for example. This product may be further multiplied by a weight value.

  The route search under a plurality of types of search conditions may be performed unconditionally or may be performed under a certain condition. As an example of the latter, for example, a required value of the total required time from the starting point to the destination can be used. In this aspect, first, search conditions are set separately for normal search conditions and other search conditions. The normal search condition is a search condition in which the movement condition is defined as a normal value in advance, and can be arbitrarily set. As an example, it is possible to use a movement condition that allows the user to move with the least burden. The route search device performs a route search under normal search conditions. Then, when the total required time obtained as a result of the search exceeds the above-mentioned required value, a route search is performed under a search condition different from the normal search condition. When the total required time falls within the required value, route search under other search conditions is omitted. Since the normal search condition is the search condition that is most easily used by the user, if a route that satisfies the required value under the normal search condition can be obtained, there is a high possibility that the route search result under other search conditions will not be used effectively. . The above-described aspect pays attention to this point. By adopting such an aspect, there is an advantage that a route according to the user's request can be efficiently obtained while unnecessary route search is omitted.

  In the above aspect, the required value may directly specify the total required time, or may specify the departure time and the target arrival time. Various methods can be used to determine whether the result of the normal search condition satisfies the required value. For example, it may be determined based on the magnitude relationship between the total required time and the requested value directly, or before and after the predicted arrival time obtained based on the specified departure time and the target arrival time set as the requested value You may make it judge by. On the contrary, it is also possible to reversely calculate the departure time for arriving at the destination at the target arrival time, and take a method of determining the time after this time and the current time.

  The present invention can also be configured as a route guidance device that provides the user with the result of the route search described above and displays the route to the destination specified on the map. The route as a result of the route search described above includes a restriction on the arrival time to at least some of the nodes. When displaying the route, the route guidance device changes the display mode of the route according to the moving speed required for each link based on the restriction on the arrival time. The display mode may be changed according to a parameter substantially synonymous with the moving speed, for example, the remaining time until the arrival time. By doing so, the user can know the required moving speed, so that it is possible to avoid troubles due to the regulation conditions as expected during route search. For example, it is possible to avoid the adverse effect that the user's moving speed is too slow and is delayed to the departure time of the train by clearly indicating to the user the location where walking with hurry is required. is there.

  The change in the display mode described above may be performed based on a search condition such as a moving speed assumed at the time of route search, for example. Also, from the route search result, the limit time to reach each node is obtained, the lower limit value of the movement speed required to reach this time is obtained, and the display mode is changed according to this movement speed. You may make it make it. According to this aspect, it is possible to guide the optimum route while suppressing the load during movement.

  In the present invention, routes are obtained corresponding to a plurality of types of search conditions. The route guidance device may have a function of displaying a list of all these routes, but it is preferable to select and display any route during guidance. This selection may be performed automatically by the route guidance device based on a predetermined selection condition such as the shortest required time, or may be selectable by the user. In the latter case, it is preferable that the arrival time to the destination predicted for each route corresponding to a plurality of types of search conditions is presented to the user as a guide when selecting a route. In addition, a search condition and a load related to movement, for example, a distance required to move at the maximum movement speed may be presented.

  Various methods can be used to change the display mode. For example, the background color of the map may be changed according to the moving speed. Further, characters, numerical values, marks, graphs, etc. suggesting the moving speed may be displayed on a part of the screen. Moreover, it is preferable to change a display control part for every link on a path | route. By doing so, the user can easily grasp the request for the moving speed at each location visually.

  The route guidance device may also be able to display the contents of the regulation conditions. A restriction condition such as a train timetable may be displayed in advance on a part of the guidance display screen, or the restriction condition is displayed when a user performs a predetermined operation such as clicking a station. You may do it. By displaying the restriction conditions in this way, the user can know the meaning of the moving speed requested from the route guidance device.

  The present invention may be configured as a route guidance device of the following mode as a mode in which a combination of a plurality of search conditions is performed during route guidance. In this configuration, the route guidance device inputs a route search result obtained using the network data described above. This route search result may not take into account the regulation conditions. That is, it may be a route search result obtained on the premise that it is always possible to ignore the restriction condition. The route guidance device further inputs a range of moving speeds that the user can take when moving along the route. Then, when the route is moved by changing the moving speed within the specified range based on the current position and time, is there a difference in the traffic mode at at least one of the nodes or links to which the restriction condition is attached? Judge whether or not. The difference in the mode of travel means that whether or not the traffic is allowed to change due to the regulation and that the departure time of the train or the like to be used is different for transportation such as a train. This determination can be made by referring to at least one of the route search result and the network data. When using the route search result obtained in consideration of the regulation conditions, the target time to reach the regulation node etc. in order to avoid regulation etc. will be included. What is necessary is just to judge whether it is in time. When using the route search result obtained without considering the restriction conditions, refer to the restriction conditions included in the network data and determine whether the above-described change in the traffic mode occurs by changing the moving speed. do it. As a result of this determination, when a difference in traffic mode occurs, the route guidance device notifies the user to that effect.

  By doing so, the user can easily know how much the moving speed affects the traffic mode when moving on the searched route. When a difference occurs in the traffic mode according to the moving speed, the user may take measures such as increasing the moving speed according to his / her request. Conversely, when it is known that there is no difference in the way of travel, the user can take the most reasonable movement speed without getting impatient.

  In the aspect of determining whether or not the change of the traffic mode occurs, the above notification may be performed under the following conditions, for example. First, for a plurality of moving speeds within a specified range, a required time obtained from the distance to the destination and the moving speed and a predicted required time obtained in consideration of the regulation conditions are obtained. Then, the route guidance apparatus performs the above-described notification when the latter change in the estimated required time exceeds the former required time, that is, the change in the required time when the restriction condition is not taken into consideration. For example, if restrictions are applied to multiple places, even if it is different whether or not the restrictions can be avoided depending on the moving speed at any place, it will eventually be time to reach the destination due to other restrictions. There is also the possibility that differences will not occur. In the above aspect, in consideration of such a situation, the user is notified only when the required time to the destination exceeds the change in the required time resulting from the difference in the moving speed. It is possible to easily determine whether it can be said that the relationship is useful.

  The present invention need not necessarily have all of the features described above. The above-described features can be omitted or combined as appropriate. In addition to the configuration as the above-described route search device and route guide device, the present invention can also adopt a route search method for performing route search by a computer and a route guide method for performing route guidance. The present invention can also take the form of a computer program for realizing these functions and a recording medium on which the computer program is recorded. Recording media include flexible disks, CD-ROMs, magneto-optical disks, IC cards, ROM cartridges, punch cards, printed matter printed with codes such as bar codes, computer internal storage devices (memory such as RAM and ROM), and Various media that can be read by a computer, such as an external storage device, can be used.

Embodiments of the present invention will be described in the following order.
A. System configuration:
B. data structure:
C. Route search:
C1. Route search processing example (1):
C2. Route search processing example (2):
C3. Route search processing example (3):
C4. Route search process:
C5. Variation:
D. Route guidance process:
E. Second embodiment:

A. System configuration:
FIG. 1 is an explanatory diagram showing a configuration of a route guidance system as an embodiment. In the present embodiment, a configuration example as a route guidance system for pedestrians is shown, but it can also be configured as a route guidance system for vehicles. The route guidance system is configured by connecting a terminal 100 using a mobile phone and a server 200 via a network INT. The network INT is a network using wireless communication, but may be limited such as a LAN or an intranet, or may be a wide area such as the Internet. As the terminal 100, a mobile phone, a so-called vehicle navigation device, a PDA, a personal computer having a network communication function, and the like can be used. When configured as a route guidance system for pedestrians, it is desirable that the vehicle navigation device be removed from the vehicle and portable.

  The terminal 100 has a function for transmitting instructions necessary for route search and route guidance to the server 200 in accordance with user operations. In the figure, functional blocks of the terminal 100 are also shown. The terminal 100 incorporates a microcomputer having a CPU, a RAM, and a ROM as a control device, and this CPU executes software stored in the ROM to constitute each functional block shown in the figure. These functional blocks can be configured in hardware as well as in software.

  The communication unit 120 has a function of communicating with the server 200 via the network INT. The GPS 140 detects the latitude and longitude of the current position of the terminal 100 using a global positioning system. The command input unit 130 inputs commands related to route search and route guidance based on a user operation on a switch or the like. Examples of commands include designation of a route search destination, selection of a guidance route, and the like, as shown. The display control unit 150 displays these command input menus on the display of the terminal 100 or displays a map based on the route guidance data received from the server 200. The main control unit 110 controls the overall functions of the terminal 100 by performing overall control of the functional blocks described above.

  Based on commands from the terminal 100, the server 200 performs route search and route guidance while referring to various databases. In the figure, examples of functional blocks and databases for realizing these functions are shown. Each functional block is configured by software by a computer program executed by the CPU of the server 200, but may be configured by hardware.

  There are three types of databases used by the server 200: a map DB 250, a timetable DB 252, and a user DB 254. These may be prepared as individual databases, or at least a part of them may be further subdivided or integrated with each other. The map DB 250 has network data in which paths are represented by nodes and links, and drawing data including polygons and character data for map drawing. In the present embodiment, at least some of the nodes and links include ones whose allowed traffic modes change with time. Examples of the restrictive conditions include public transportation where the departure time is defined, and a passage in a station premises that is closed at a predetermined time. The timetable DB 252 is a database that records this regulation condition. The data structures of the map DB 250 and the timetable DB 252 will be described later.

The user DB 254 stores bibliographic registration information such as a user ID and a name, as well as settings relating to a moving speed when the user walks and requests regarding route search such as distance priority / time priority. In the figure, the contents of the user DB 254 are illustrated as registered contents regarding the moving speed. In this embodiment, the moving speed is registered in combination with the movable distance. In the example in the figure, the normally used moving speed (hereinafter sometimes referred to as “normal speed”) is “4 km / h”, which indicates that there is no restriction on the distance that can be moved. “5 km / h”, which is a little faster, can move up to 3 km, and “10 km / h”, which is a rush, can move up to 0.5 km. Such information can be registered and changed by the user operating the terminal 100. In the example in the figure, three types of movement speeds are registered, but more movement speeds may be registered. Further, the relationship between the moving speed and the movable distance may be registered or corrected depending on the link attribute such as uphill / flat / downhill. By doing so, it is possible to move up to 10 minutes on the downhill, but it is possible to reflect the cardiopulmonary load due to a gradient such as a limit of 2 minutes on the uphill.
Furthermore, these registered values may be switched according to weather conditions such as rainy weather / sunny weather, clothing conditions such as athletic shoes / high heels / clothes / Japanese clothes, and the amount of luggage.

  The communication unit 220 controls communication with the terminal 100 via the network INT. The route search unit 230 searches for a route between the departure point and the destination designated by the user with reference to the above-described three types of databases. The route search unit 230 can search for a route corresponding to each condition by changing search conditions such as a moving speed into a plurality of types in accordance with an instruction from the user. In addition, by referring to the timetable DB 252, the route search is performed in consideration of the above-described restriction conditions. The route search method will be described later.

  The route guidance unit 240 generates route guidance data for displaying and guiding the searched route on a map, and transmits the route guidance data to the terminal 100. As described above, the route search is performed based on various search conditions, and is also performed in consideration of the regulation conditions. The route guidance unit 240 realizes guidance display reflecting these conditions. The route guidance method will be described later.

B. data structure:
FIG. 2 is an explanatory diagram showing the data structures of the map DB 250 and the timetable DB 252. For the map DB 250, only the structure of network data for route search is illustrated. As illustrated in the center of the figure, the network data includes nodes N1 to N8 and links L1 to L9. The links L1 to L9 represent passages through which pedestrians can pass, and the nodes N1 to N8 represent end points or connection points of the links L1 to L9.

  The map DB 250 stores the above-mentioned data regarding nodes and links as node data 250N and link data 250L, respectively. As shown in the figure, the link data 250L records information such as a link ID, shape, timetable, speed regulation, distance, and the like. The shape is point sequence data representing the coordinates (latitude, route) of the point through which the link passes. The coordinates may include information indicating the height. In the example in the figure, four points including nodes N2 and N7 are stored for the link L9. In this embodiment, the node ID is stored for the node, and the position is obtained by referring to the node data 250N. However, the coordinates may be stored for the node as well as other passing points. . The timetable represents a link to information stored in the timetable DB. In the example L9 in the figure, since there is no restriction condition that changes according to the time, “none” is registered in the item of the timetable. As will be described later, when a restriction condition that changes according to time is attached, such as links L3, L4, and L6, the “timetable ID” that is an index of data stored in the timetable DB 252 is set. Will be stored. The speed restriction represents an upper limit speed when passing through the link. The distance is a section distance of the link.

  The contents of the link data 250L can be arbitrarily set, and some of the information may be omitted, or various attribute information not illustrated here may be stored. For example, route types such as stairs and slopes, presence / absence of equipment such as guardrails and street lamps, and the like can be stored as attribute information. When such attribute information is prepared, it is possible to execute a route search that reflects the desired items for the route such as “I want to avoid stairs” and “I want to give priority to a route with a guardrail”. . For example, if there is a request that “I want to avoid stairs”, the possibility of selecting a stairs can be suppressed by increasing the cost of the link where the attribute information of “stairs” is recorded. It becomes possible, and it becomes possible to search for the route according to the request.

  In the node data 250N, information such as a node ID, a position, a timetable, and traffic restrictions is recorded as illustrated. The position of the node is recorded in latitude and longitude coordinates. The coordinates may include information indicating the height. The timetable represents a link to information stored in the timetable DB 252 as with the link data 250L. Traffic restrictions are fixed traffic restrictions that do not change with time, such as prohibition of turning left or right. For example, for the node N4 in the figure, when the traffic coming from the N3 direction and turning left in the N6 direction is prohibited, the data may be stored in the traffic regulation column in the form of “N3 → N4 → N6”. . The recording method of the traffic regulation information is not limited to this, and various formats can be adopted.

  The timetable DB 252 stores information such as timetable ID, regulation, time, start delay, end delay, and the like. The timetable ID is identification data for uniquely indicating each registered information. The restriction represents restriction information indicated by the timetable ID. In the figure, the data when the entrances G1 to G3 of the station are closed between 0:30 am and 4:30 am and the links L3, L4 and L6 in the station are impassable are illustrated. In this case, since the passage is impossible, “block” is stored in the “regulation” column, and the time when the block is closed is stored in the time column. When the road is closed in a plurality of time zones, a plurality of time zones can be stored in the time column. The start delay indicates the possibility that the start time (0:30 in the example in the figure) is delayed, and the end delay indicates the possibility that the end time is delayed. Regarding the closure of the station, the start delay and end delay are set to “None” because they are closed as prescribed. This data with “timetable ID = 1” is applied to the links L3, L4, and L6. Accordingly, “1” is stored in the “timetable” column of the data corresponding to these link IDs of the link data 250L. A plurality of timetable IDs may be stored in the timetable column of the link data.

  In the timetable DB 252, various restrictions can be stored in addition to the above-mentioned restrictions on “block”. For example, in this embodiment, the departure time of a transportation facility such as a train is also regarded as a kind of restriction condition in the sense that the time zone in which the route can pass is limited, and is managed by the timetable DB 252. In this case, the “regulation” column indicates, for example, “transportation” by storing “train arrival / departure”, and the “time” column stores a timetable composed of departure time and arrival time. Can do. You may make it store in the format of the departure time and the time required to the passage station on the way. In the case of transportation, departure time and arrival time may be delayed. The departure time delay can be recorded in the “start delay” and the arrival time delay can be recorded in the “end delay”. As will be described later, these times are values considered during route search and can be set arbitrarily, but as an example, they can be set based on the average delay time or the maximum delay time within a predetermined period in the past. it can.

C. Route search:
A route search process in the present embodiment will be described. First, after describing the processing outline based on some specific examples, a flowchart for realizing the route search processing will be described.

C1. Route search processing example (1):
FIG. 3 is an explanatory diagram showing a route search processing example (1). FIG. 3A illustrates the configuration of nodes and links that are targets of route search. The route shown in FIG. 2 is shown in a simplified manner. As described above, the links L3 and L6 are subjected to a regulation condition that is closed at 0:30 to 4:30 am. In the figure, the distance of each link is also shown. Let us consider a case where, using such network data, the departure point N1 departs at 0:22 am and a route with the shortest required time toward the destination N8 is searched. The route search is assumed to be performed by the Dijkstra method with a required time as a cost.

  In this embodiment, the route search is executed at a plurality of types of movement speeds. This moving speed is set for the object registered in the user DB 254. In the example of FIG. 3, an example in which the maximum speed is 5 km / h and the normal speed is 4 km / h is shown. You may perform by three or more types of moving speeds. An intermediate movement speed can also be set by appropriately interpolating between the maximum speed and the normal speed registered in the user DB 254. However, it is preferable that these movement speeds include the maximum movement speed that can be taken by the user under the condition that a distance greater than the distance between the departure place and the destination can be moved.

  FIG. 3B shows the route search result SIM1 at the maximum speed (5 km / h). Since the distance of the link L1 from the node N1 to N2 is 0.3 km, the required time is 3.6 minutes, and the arrival time is predicted to be 0:25:36. Thereafter, the route is divided into a route toward the node N3 and a route toward the node N7 through the link L9. Since the link L2 from the node N2 to the node N3 is 0.3 km, the total required time to the node N3 is 7.2 minutes, and the arrival time is predicted to be 0:29:12. From the node N3, the road is closed at 0:30. However, in this case, the road does not meet this restriction condition, so it can be passed as it is. Accordingly, when the required time and arrival time to each node are obtained in the same procedure, the required time to node N7 is 18 minutes and the arrival time is 0:40:00.

  On the other hand, the restriction condition is not set for the route branching from the node N2 and passing through the link L9, so that the route can pass as it is. Since the distance of the link L9 is 1.5 km, the required time is 21.6 minutes, and the arrival time at the node N7 is obtained as 0:43:36. As a result, the route “N2 → N3 → N4 → N5 → N7”, that is, the route passing through the station premises, is selected as the route having a short required time from the two routes from the nodes N2 to N7. When this route is taken, the required time to the destination N8 is 21.6 minutes, and the arrival time is calculated as 0:43:36.

  FIG. 3C shows the route search result SIM2 at the normal speed. Since the moving speed is 4 km / h, the time required to pass through each link is longer than the search result SIM1 at the maximum speed. Therefore, as shown in the search result SIM2, the required time to the node N2 is predicted to be 4.5 minutes and the arrival time is predicted to be 0:26:30. From here, like the search result SIM1, it branches into two routes. When the route toward the node N3 is taken, the arrival time of the node N3 is predicted to be 0/31: 00. At this time, the time 0:30 when the links L3 and L6 are closed is past. Therefore, this route cannot go further.

  A route that branches at the node N2 and passes through the link L9 can be passed because there is no restriction condition. Therefore, as a search result at the normal speed, a route of “node N1 → N2 → N7 → N8” is obtained, the required time is 31.5 minutes, and the arrival time at the destination N8 is predicted to be 0:53:30. Is done. From the above results, it can be seen that if you move at the maximum speed, you can pass through the station safely, and you can reach the destination 10 minutes earlier than if you moved at the normal speed.

C2. Route search processing example (2):
FIG. 4 is an explanatory diagram showing a route search processing example (2). Here, an example of route search processing when using public transportation is shown. FIG. 4A illustrates the configuration of nodes and links that are targets of route search. For convenience of explanation, a simple route without branching will be described as an example. In this processing example, the link L12 between the nodes N12 and N13 is a train, and the departure time is defined. The contents of the timetable DB corresponding to the link L12 are shown in the figure. In this example, it is assumed that four trains depart between 10:00 and 10:30 as illustrated. It is assumed that the required time between the nodes N12 and N13 is 20 minutes in either case.

  First, consider a case where the departure point N11 departs at 9:58 minutes. The upper part of FIG. 4B shows a route search result when moving at a maximum speed, that is, a moving speed of 5 km / h. Under this search condition, the time required for the nodes N11 to N12 is 6.0 minutes, and the arrival time of the node N12 is predicted to be 10:04. According to the timetable DB, the departure time of the train is 10:05, so the waiting time is 1 minute (the waiting time is indicated by a frame in the figure). In the route search, this waiting time is added as a cost for the link L12 between the nodes N12 to N13. Accordingly, the required time to the node N13 is 27.0 minutes, the arrival time is 10:25, the required time to the destination N14 is 33.0 minutes, and the arrival time is 10:31.

  The lower part of FIG. 4B shows a route search result when moving at a normal speed, that is, a moving speed of 4 km / h. Under this search condition, as shown in the figure, the arrival time at the node N12 is predicted to be 10:05:30. According to the timetable DB, the departure time of the train is 10:10, so the waiting time is 4.5 minutes. As a result, the required time to the destination N14 is predicted to be 39.5 minutes, and the arrival time is predicted to be 10:37:30. When moving at a normal speed, a single train is delayed compared to when moving at a maximum speed, so a difference of 6.5 minutes occurs in the arrival time.

  Although there is no branch in FIG. 4A, for example, when there is a branch path from N12 to N13, the required time may be shorter for the branch path depending on the waiting time. In such a case, the branch route is selected as the route with the shortest required time. In the above example, the processing example in which the waiting time is simply added to the required time is shown, but the cost used for route search does not necessarily need to match the actual required time, so the waiting time is multiplied by a weight value. May be added. By doing this, it is possible to obtain a route search result that avoids a route in which a waiting time occurs even in a short time.

  As described above, when the timetable DB shown in FIG. 4A is used, the waiting time is reflected in the required time or the cost of route search. Since the waiting time varies depending on the departure time of the train, even if the search is performed at the same moving speed, the search result varies depending on the time of departure from the departure place. FIG. 4B also shows the search results when the departure place departs at 10:03. When moving at the maximum speed, the arrival time at the node N12 is 10:09, and the waiting time is 1 minute. Therefore, the search result is 33.0 minutes as in the case of departure at 9:58 minutes, and the arrival time is predicted to be 10:36. On the other hand, when moving at the normal speed, the waiting time is 19.5 minutes because the arrival time at the node N12 is predicted to be 10:10:30. As a result, the required time to the destination N14 is 54.5 minutes, and the arrival time is predicted to be 10:57:30.

  Thus, when departing at 9:58, the difference in required time between moving at the maximum speed and moving at the normal speed was 6.5 minutes, whereas at 10:03 In the case of departure, the difference between the two will increase to 21.5 minutes. If the route search is performed at both the maximum speed and the normal speed and the result is provided to the user, the user can determine the significance of rushing to the node N12 himself. For example, when the departure time is 9:58, a user who does not care about shortening the time by about 6.5 minutes does not need to hurry in time for an early train, and selects a search result at a normal speed. be able to. On the other hand, if the departure time is 10:03, it can be seen that there will be a difference of 21.5 minutes. Therefore, the user selects the search result at the maximum speed and can make a quick train even if it is somewhat unreasonable. It is possible to make a judgment that it is better to hurry.

C3. Route search processing example (3):
FIG. 5 is an explanatory diagram showing a route search processing example (3). Here, taking as an example a case where two types of public transportation are selected and used, an example of route search processing in consideration of the delay time of public transportation is shown. FIG. 5A illustrates the configuration of nodes and links that are targets of route search. Two types of routes were used: train routes and bus routes. The train is link L23 and the bus is link L27. The departure time of the train is given by the timetable DB 252 [21], and the departure time of the bus is given by the timetable DB 252 [22]. In order to avoid complication of the drawing, only one type of departure time is shown here. As for the train, both the start delay and the end delay are “none”, and as shown in the timetable DB 252 [21], the train is operated at a departure time of 10:00 and an arrival time of 10:20. For the bus, the start delay is “none”, but the end delay is set to “5”. Therefore, although the bus departs at the departure time 9:55 shown in the timetable DB 252 [22], the arrival time may be 10:23 as specified or may be delayed to about 10:28. Become.

  In this example, for two types of pedestrian movement speeds, maximum speed and normal speed, if you do not consider the delay of the bus, consider the two cases when you consider the delay, and search the route with a total of four types of search conditions Do. Search conditions can be set arbitrarily. For example, only the best case of “moving speed = maximum speed, no bus delay” and the worst case of “moving speed = normal speed, considering bus delay” are used. It may be set as a search condition. However, since the delay of the bus cannot be adjusted by the user's intention, as shown in FIG. 5, it is more preferable to set the search condition by independently changing the moving speed and the delay of the bus. Obtainable.

  FIG. 5B shows the search result at the maximum speed. Here, the display of the required time is omitted, and only the arrival time is shown assuming that it departed at 9:40. In the route 1 using the train, the arrival time at the train station N23 is 9:56. Therefore, it is possible to get on the train with a waiting time of 4 minutes, and the arrival time at the destination N26 is calculated as 10:36. In route 2 using the bus, the arrival time at the stop N27 is predicted to be 9:52. Therefore, you can get on the bus with a waiting time of 3 minutes. If the bus is not delayed, it can arrive at the stop N28 at 10:23 and the destination N26 at 10:35. If the bus is delayed, it can arrive at the stop N28 at 10:34 and the destination N26 at 10:40.

  FIG. 5C shows a search result at a normal speed. In the route 1 using the train, the arrival time at the train station N23 is 9:59:57. Therefore, it is possible to get on the train with almost no waiting time, and the arrival time at the destination N26 is calculated as 10:39:57. In the route 2 using the bus, the arrival time at the stop N27 is predicted to be 9:55, and it is possible to get on the bus without waiting time. If the bus is not delayed, it can arrive at the stop N28 at 10:23 and the destination N26 at 10:38. If the bus is delayed, it can arrive at the stop N28 at 10:28 and the destination N26 at 10:43.

  From the above results, it can be seen that when the bus is operated without delay, it can arrive at the destination one or two minutes earlier than when using the train at both the maximum speed and the normal speed. On the other hand, it can be seen that when the bus is delayed, the vehicle arrives at the destination three to four minutes later than when using the train at both the maximum speed and the normal speed. By providing these results to the user, the user can determine whether to take a route using a train or a route using a bus, taking into account the risk of delaying bus operation. .

C4. Route search process:
FIG. 6 is a flowchart of route search processing. 6 is a processing example for realizing the route search specifically shown in FIGS. This process is a process executed by the route search unit 230 (see FIG. 1) of the server 200, and is a process executed by the CPU of the server 200 in terms of hardware.

  First, the CPU inputs a user ID, a departure place, and a destination designation from the terminal 100 (step S10). In addition, the user's request regarding the route search may be input. For example, as shown in FIGS. 3 to 5, the user may be able to specify whether the route search is performed under a plurality of types of search conditions having different moving speeds or the route search is performed under any one of the search conditions. . In addition, it is possible to specify a request regarding a moving load for avoiding stairs and hills and a safety request for giving priority to a passage where guardrails and street lamps are provided.

  Next, a plurality of types of moving speeds are set as search conditions (step S12). As described above with reference to FIG. 3, the moving speed can be set with reference to the user DB 254. Then, a route search is executed using any of the moving speeds set in this way (step S20). The main contents of route search are shown in the figure. The route search by the Dijkstra method includes a step of searching for a route branching from a node, a step of calculating a cost to reach each node, and setting a label recording the cost and the previous route. The cost between a plurality of routes is compared based on the label, and the step of sequentially selecting the route having the minimum cost is repeatedly executed. Since a specific processing method by the Dijkstra method is well known, detailed description is omitted here. In the figure, only processing unique to this embodiment is shown. Therefore, these processes do not necessarily have to be performed according to the illustrated procedure, and are appropriately reflected in the process of performing the process by the Dijkstra method.

  First, the CPU sets the cost of each link based on the time required for movement (step S21). 3 to 5, the route search method has been described on the assumption that the required time is calculated by dividing the distance of each link by the moving speed and the required time is used as a cost. Thus, the required time itself may be used as the cost, or the cost may be calculated by performing a predetermined calculation using the required time.

  In the route search process, if there is a link with a restriction condition, the timetable DB is read (step S22), and the waiting time at the node on the departure side is reflected in the cost (step S23). . This process is performed when reflecting the time immediately before the restriction of road closure is released (see FIG. 3), the departure time of the transportation facility (FIGS. 4 and 5), etc. in the route search. As described with reference to FIGS. 4 and 5, the waiting time can be obtained as a difference between the predicted arrival time at the node on the departure side and the departure time recorded in the timetable DB. As described with reference to FIG. 4, the waiting time is reflected on the link to which the regulation condition is attached. As described above, the cost may be obtained by multiplying the waiting time by a unique weight value or the like.

  In addition, when there is a link for which “end delay” is set in the timetable DB, the search condition is divided into two cases, when the end delay is taken into consideration and when it is not taken into account, and the required time for each case. And the cost is set based on the required time (step S24). The CPU uses the cost set above to search for a route having the minimum cost (step S25). If there is a link for which “end delay” is set, routes corresponding to the two search conditions described above are obtained. This corresponds to the processing in FIG. 5 in which two results are obtained with different required times and arrival times depending on whether the bus operation is delayed or not.

  The CPU repeatedly executes the above processing until it completes all the moving speeds set in step S12 (step S30), outputs the result, and ends the route search processing. Through the above processing, it is possible to obtain routes corresponding to a plurality of types of search conditions, such as travel speeds, that require different travel times for links while reflecting the various restriction conditions shown in FIGS.

  In the example of FIG. 6, only “end delay” is shown, but even when a start delay exists, it can be handled in the same manner as the end delay. That is, the search conditions are divided into two types, when the start delay is not considered and when the start delay is considered, and the time information recorded in the timetable DB is corrected according to each case. As a result, for example, the departure time of the train is delayed or the time when the road is closed is delayed, and even when the moving speed is slow, there is a possibility that the train will be ready in time. On the other hand, when the departure time is delayed due to the start delay, a waiting time that should not occur originally occurs, and a demerit that the required time becomes longer may occur. If there is a start delay, the route search may be performed by reflecting this waiting time on the cost.

C5. Variation:
(1) FIG. 6 shows a processing example in which a cost is set based on a required time and a route search is performed with time priority. This embodiment can also be applied to distance-first route search. In this case, the cost of each link is set based on the distance instead of the process of step S21 in FIG. In steps S23 and S24, the waiting time and end delay are converted into distance based on a predetermined rule and reflected in the cost. Although the conversion formula from waiting time etc. to distance can be set arbitrarily, it can be made into the product of waiting time etc. and movement speed, for example. This product may be further multiplied by a weight value.

  When performing a route search with distance priority, the CPU searches for a route that minimizes the cost set in the above-described procedure (step S25). By doing so, it is possible to obtain a route with the shortest distance while avoiding a route that causes excessive waiting time.

(2) FIG. 6 shows an example in which the route search is repeatedly executed unconditionally for all the moving speeds set in step S12. On the other hand, as a modification, this repetition may be performed only under certain conditions. As shown in FIG. 1, in this embodiment, “normal speed” (4 km / h in FIG. 1) and other speeds are registered as moving speeds that the user can take. The normal speed is a movement speed that is easy for the user to use in the sense that the load during movement is the smallest. In the route search, this point is emphasized, and the process of step S20 in FIG. 6 is first executed at a normal speed. Prior to the determination in step S30, the estimated arrival time at the destination when moving at the normal speed is obtained, and it is determined whether or not this time is later than the target time designated in advance by the user. The target time may be input together with the departure place in the process of step S10, for example. If it is determined that the destination can be reached by the target time even when moving at the normal speed, step S30 is skipped, the route search at another moving speed is omitted, and the result is output (step S32). This is because, when a result satisfying the user's request is obtained at a moving speed that is easy to use, the possibility of effective use is low even if a route search at another moving speed is performed. On the other hand, only when it is determined that the target time cannot be reached at the normal speed, the route search at another moving speed is executed according to the determination in step S30. According to the process of the modified example, there is an advantage that it is possible to avoid changing the moving speed unnecessarily and to efficiently execute a route search.

D. Directions:
FIG. 7 is a flowchart of route guidance processing. In this process, guidance data for presenting the result of the route search process described in FIG. 6 to the user is generated and transmitted to the terminal 100. The route guidance can be performed by screen display of the terminal 100 or voice output. The route guidance process is a process executed by the route guide unit 240 of the server 200, and is a process executed by the CPU of the server 200 in terms of hardware.

  In this process, the CPU reads the route search result and presents the list to the user (step S50). The presentation screen DISP1 displayed on the terminal 100 is illustrated on the right side of the figure. As described with reference to FIG. 6, in this embodiment, a plurality of routes are obtained as search results under a plurality of search conditions. The presentation screen DISP1 displays a list of these multiple routes. In the present embodiment, information such as the time required for each route, the type of transportation used, and the load index is presented. The load index is a ratio of a portion that is required to move at the maximum moving speed in all routes. The ratio may be obtained based on the required time or may be obtained based on the distance. These pieces of information are presented as judgment materials when the user selects a route to be guided from a plurality of routes. The presentation screen DISP1 is merely an example, and information other than those listed here may be further presented, or some of them may be omitted. A method of displaying a plurality of routes on a map can also be adopted. In this case, it is preferable to change the display mode such as color-coding the route according to information to be used as a user's judgment information such as required time and load index.

  When the user selects a route to be guided on the presentation screen DISP1, the CPU reads the guidance data of the selected route (step S52). In the example of FIG. Since 1 is selected, route data corresponding to this is read. The method for selecting the route to be guided can be arbitrarily set.

  When a route is selected, the CPU sets a required value for the moving speed for each part of the route (step S55). As shown in the route search examples in FIGS. 3 to 5, when there is a part with a restriction condition such as a road closure depending on the time zone in the middle of the route, the restriction by the restriction condition is avoided and the route is avoided. In order to pass, it may be required to move quickly in advance. In order to perform route guidance reflecting the request for the moving speed in this way, the CPU calculates the moving speed required for each location in step S55.

  The movement location required at each location can be set by various methods. For example, the search conditions used during the route search may be applied as they are. In addition, it calculates the arrival time for each node that is necessary for passing the route by avoiding the restrictions due to the restriction conditions, and again sets the travel speed required to realize this arrival time regardless of the search conditions. You may make it ask. When moving at the maximum speed, there is a possibility that an unnecessary waiting time may occur in relation to the regulation conditions, but such waiting time can be reduced by obtaining the required moving speed again. As a result, it is possible to realize efficient movement with low movement load and reduced waiting time.

  When the required value of the moving speed is set, the CPU inputs the current position from the terminal 100 (step S54), and displays a route guidance screen according to the moving speed required at each location (step S56). The guide screen DSIP2 is illustrated in the figure. The black circle in the figure is the current position PP. On the guidance screen, a map including the current position PP is displayed as shown in the figure, and routes R1 to R3 are displayed there. In this embodiment, as described above, the display pattern is changed according to the moving speed required at each location. A route R1 in the figure indicates that movement at a fast walk faster than the normal speed is requested by cross hatching. The route R2 represents a location to which a regulation condition such as a road closure depending on time is attached. The route R3 indicated by the arrow indicates that the movement at the normal speed is sufficient, and no restriction condition is attached. These display modes are not limited to those exemplified here, and can be arbitrarily set.

  The user's current position PP is on a route R1 that is required to move fast. In the example shown in the figure, the area A is a station STA, and has a restriction condition that it is closed at 0:30 to 4:30 am. The reason why rapid walking is required on the route R1 is to pass the station premises while avoiding traffic closure due to this regulation condition. In this embodiment, when the current position PP is in a place where a moving speed faster than the normal speed is required, a display such as hatching is given to the route, and the user is encouraged to move fast. The sub window W1 is also displayed. In the sub-window W1, the heart mark blinks quickly to prompt that a quick walk is requested. The faster the required movement speed, the faster the heart symbol blinks. In the sub-window W1, a margin time allowed for avoiding restrictions due to the regulation conditions is also displayed. In the example shown in the figure, it is required to reach the area A within 4 minutes and 20 seconds. By displaying the current position PP and the sub window W1 on the map, the user can move without excessive load while appropriately adjusting his / her moving speed.

  In the present embodiment, the part to which the regulation condition is attached as in the area A is clickable, and is displayed in a display mode different from that of a normal building, such as thin hatching. When the user clicks on the area A, a pop-up window W2 is displayed, and the regulation conditions are displayed as shown. Similarly, for the station STA, a train timetable may be displayed as a restriction condition.

  Although the route R2 indicates that the restriction condition is attached, the fast walking is not necessarily requested. Also, the route R3 needs to be moved at a normal speed. Therefore, when the current position PP is on the routes R2 and R3, the sub window W1 is not displayed. As described above, displaying the sub window W1 only when moving at a high speed is required, there is an advantage that the user's attention can be more reliably alerted when a high speed is required. The CPU repeatedly executes the above processing until it reaches the destination (step S58).

  According to the route guidance system of the present embodiment described above, since the route search is performed under a plurality of search conditions with different moving speeds and the like, the optimum route is included, including a situation where the user hurries to avoid restrictions due to the restriction conditions. Can be searched. In addition, it is possible to present the user with judgment materials for judging the usefulness of movement at the maximum speed by performing route search even under search conditions other than the most ideal search conditions such as the maximum movement speed. Become. The user can select a preferable route for himself / herself after evaluating both the effect of moving at the maximum speed and the moving load.

  Further, in the route guidance system of the present embodiment, route guidance reflecting the moving speed required for each route is performed in consideration of the regulation conditions. Therefore, the user can travel along the guided route while avoiding the restriction due to the restriction condition according to the assumption at the time of route search. In addition to the search conditions at the time of route search, it is possible to avoid unnecessary waiting time and unnecessary increase in moving load by re-determining the moving speed required at each location during guidance.

E. Second embodiment:
In the first embodiment, an example in which a plurality of search conditions with different moving speeds are considered when performing a route search is shown. In the second embodiment, a processing example in the case where a plurality of search conditions are considered at the time of route guidance is shown. The configuration and data configuration of the server 200 are the same as in the first embodiment.

  FIG. 8 is a flowchart of route guidance processing in the second embodiment. Similar to the first embodiment, the process is executed by the CPU of the server 200. When the process is started, the CPU reads the route search result (step S60). As the route search result, the result obtained in consideration of the restriction condition as in the first embodiment can be used, but here, the case where the result obtained by ignoring the restriction condition is used is illustrated. That is, in the route search process prior to the route guidance process, the server 200 searches for a route between the departure point and the destination designated by the user without considering the restriction conditions. This route can be performed under arbitrary conditions such as minimum required time and shortest distance using the Dijkstra method, for example.

  Next, the CPU inputs the current position and the range of the moving speed of the user (step S62). The range of the moving speed can be read from the user DB 254 (see FIG. 1). In the following description, a case where the normal speed (4 km / h in the example of FIG. 1) is specified as the lower limit value of the moving speed and the slightly fastest (5 km / h in the example of FIG. 1) is specified as the upper limit value will be described as an example. . As the range of the moving speed, an upper limit value and a lower limit value designated by the user by operating the terminal 100 may be input.

  For each of the lower limit value and the upper limit value of the moving speed, the CPU determines whether or not the passage mode of the node or link to which the restriction condition is applied changes when passing through the route, and the result is given to the user. Notification is made (step S64). On the right side of the figure, an example of processing for determining the traffic mode is illustrated.

  Consider a case where a train is used between A station and B station on the route from the departure point to the destination. A link between the A station and the B station is restricted in traffic depending on the departure time of the train (hereinafter referred to as “time restriction”). In the example in the figure, the departure times of the five trains Tr1 to Tr5 are indicated by respective line segments. The hatching between the trains Tr1 and Tr2 and Tr3 and Tr4 may be ignored here.

  In this state, it is assumed that the departure place departs at time Td1. When moving at a normal speed of 4 km / h, as shown by the solid line, the train Tr1 is not used in time and the train Tr2 is used, and the destination arrives at the time Ta2. When moving at a speed of 5 km / h, the train Tr1 can be used as indicated by the broken line, and the destination arrives at the time Ta1. As described above, when the vehicle departs at time Td1, the time restriction link, that is, the train used between the A station and the B station differs depending on the moving speed. In this example, it is determined that the traffic mode changes in the sense that the time of passing the time regulation link changes according to the moving speed.

  On the other hand, consider a case where the vehicle departs at time Td2. In this case, as shown in the drawing, the train Tr4 is used regardless of the moving speed, and the destination arrives at the time Ta3. Therefore, since the time for passing the time restriction link does not change according to the moving speed, it is determined that the passage mode does not change.

  The above determination can be made by the following method. First, based on the departure time of the departure place, the CPU obtains an estimated arrival time at each node according to each moving speed. Next, the predicted arrival time and the restriction condition are compared to determine whether or not the restriction link is allowed to pass, and the time at which the restriction link is allowed to pass for each moving speed is obtained. When the search result considering the regulation condition is input in step S60, as described in the first embodiment, the target arrival time for passing the vehicle while avoiding the regulation is obtained. It is only necessary to determine whether or not the vehicle can pass by comparing the predicted arrival time with the target arrival time. When a search result that does not take into account the restriction condition is input in step S60, the timetable DB (see FIGS. 1 and 2) is referred to at the time of the above determination to determine the presence / absence of the restriction condition and whether or not traffic is permitted. . In the example of FIG. 8, an example in which the change in the traffic mode is determined based on the departure place is shown, but the change in the traffic mode can also be determined based on the current position and the current time by the same processing.

  A similar determination can be made for “time regulation” that allows traffic only during a certain period of time. For example, in the example of FIG. 8, it is assumed that the section between the A station and the B station is not a train but a restricted place such as a drawbridge that is not allowed to pass in the hatched time zone. If you depart at time Td1, if you move at 5 km / h, you can pass through the restricted area before it becomes impassable, but if you move at 4 km / h, wait until the time of Tr2 due to time restrictions. Since it becomes possible to pass only from the side, a change will arise in a traffic mode. On the other hand, when the vehicle departs at time Td2, it is necessary to wait until the time of Tr4 regardless of the moving speed, so that the traffic mode does not change. Thus, the presence or absence of the change of the traffic mode can be similarly performed for the time regulation.

  When it is determined that the change of the traffic mode occurs according to the moving speed, the CPU notifies the user to that effect. For example, when a change occurs, a method of displaying the sub window W1 shown in FIG. 7 can be adopted. In addition to the display, the CPU performs route guidance display using the screen display indicated by DISP2 in FIG. 7 (step S66). The CPU repeatedly executes the above processing until it arrives at the destination (step S68).

  According to the route guidance process of the second embodiment, it is possible to notify the user whether or not the traffic mode changes due to the change in the moving speed. When it is informed that a change occurs in the traffic mode, it means that if the user hurries up, the restricted part can be efficiently passed, and the user may adjust the moving speed based on his / her own judgment. If not notified, it means that it is not necessary to hurry to avoid regulation, and the user can move at an unreasonable speed without feeling unnecessarily impatient.

  In the second embodiment, since the moving speed is taken into consideration at the time of route guidance, there is an advantage that the route search process can be performed with a relatively light load. In addition, even when the departure time is undecided or indeterminate, the route guidance system can be practically used in that it can realize guidance that can efficiently avoid restrictions in consideration of the range of moving speeds that can be taken by the user. Can be improved.

  In 2nd Example, the example which judges the change of a traffic mode on the basis of the present position was shown (refer FIG. 8). According to this processing, the determination of the traffic mode is performed every moment as the user moves. At the time of actual route guidance, for example, in FIG. 8, even when the departure time is different from the departure point at time Td3, even if the time of departure differs depending on the traveling speed, If the user travels at a speed (10 km / h) during this period, the train Tr5 may come in time regardless of the moving speed. In this case, according to the process of the second embodiment of determining the change in the traffic mode with reference to the current position, it is determined that there is a change in the traffic mode at the beginning of the departure, but it is determined that there is no change from the middle. The result is notified to the user. Therefore, the user can move at a normal speed with a reasonable margin from the middle, and practical route guidance can be realized.

  In the second embodiment, an example in which notification is given unconditionally when there is a change in the traffic mode is shown. On the other hand, even if there is a change in the way of travel along the route, only when a significant change occurs, taking into account the effect on the arrival time at the destination, Good. Such processing examples will be described below as modified examples.

  FIG. 9 is an explanatory diagram illustrating a processing example of a traffic mode determination as a modified example. The example in the case of guiding the route using a train between A station and B station and between C station and D station was shown. In this route, there are two time restriction links.

  Consider a case where the departure place departs at time Td11. In the figure, the train Tr2 is used when moving at 4 km / h as shown by the solid line, but the train Tr1 can be used when moving at 5 km / h as shown by the broken line. In FIG. 9, in a section other than the train, the solid line uniformly represents movement at 4 km / h, and the broken line represents movement at 5 km / h.

  As described above, since the trains used between the A station and the B station differ depending on the moving speed, when the time regulation link departs at the time Td11, the traffic mode changes. However, after that, regardless of whether the trains Tr1 and Tr2 are used, the train Tr12 is used between the C station and the D station, and as a result, the arrival time at the destination becomes Ta11. I understand. That is, when the departure place departs at time Td11, the arrival time at the destination does not change even if the moving speed is changed. In this case, the change of the traffic mode between the A station and the B station cannot be said to be a meaningful change in consideration of the influence on the arrival time at the destination.

  Next, consider a case where the vehicle departs at time Td12. In this case, the train used at station A is divided into Tr3 and Tr4 depending on the moving speed. Moreover, the train used at station C is also divided into Tr12 and Tr13, and the arrival time at the destination is significantly different from Ta11 and Ta12. Accordingly, when the departure place departs at time Td12, the change in the moving speed brings about a meaningful change in the traffic mode at the restriction point in the middle, considering the influence on the arrival time at the destination. .

  In the modification, when a change in the traffic mode occurs in step S64 in FIG. 8, it is further determined whether or not the change is significant, and the user is notified only when the significant change occurs. Execute the process. In determining whether it is significant, for example, it can be used as a criterion whether or not the change in the required time to the destination exceeds the difference that should be caused by the change in the moving speed. First, the difference in required time is calculated when the distance from the departure point to the destination is 4 km / h, 5 km / h, and the moving speed of each train without considering the restriction conditions. And when the change of the arrival time obtained in consideration of the regulation condition exceeds this difference, it is determined that the change of the traffic mode is significant. As another method, even if the difference in predicted arrival time at the destination obtained when the moving speed is changed exceeds a predetermined value, it may be determined that the change in the traffic mode is significant. good.

  What is ultimately important for the user is the arrival time at the destination. According to the process of the modified example, it is possible to notify the user of the influence of the moving speed in consideration of this point, and the practicality can be further improved.

  As mentioned above, although the various Example of this invention was described, it cannot be overemphasized that this invention is not limited to these Examples, and can take a various structure in the range which does not deviate from the meaning. The present embodiment can be applied not only to the route guidance system for pedestrians but also to the route guidance system for vehicles. In the present embodiment, a system including the server 200 and the terminal 100 is illustrated. However, the function of the server 200 can be incorporated in the terminal 100 and configured as a stand-alone device.

It is explanatory drawing which shows the structure of the route guidance system as an Example. It is explanatory drawing which shows the data structure of map DB250 and timetable DB252. It is explanatory drawing which shows the example of a route search process (1). It is explanatory drawing which shows the route search process example (2). It is explanatory drawing which shows route search process example (3). It is a flowchart of a route search process. It is a flowchart of a route guidance process. It is a flowchart of the route guidance process in 2nd Example. It is explanatory drawing which shows the process example of the traffic mode judgment as a modification.

Explanation of symbols

DESCRIPTION OF SYMBOLS 100 ... Terminal 110 ... Main control part 120 ... Communication part 130 ... Command input part 140 ... GPS
DESCRIPTION OF SYMBOLS 150 ... Display control part 200 ... Server 220 ... Communication part 230 ... Route search part 240 ... Route guidance part 250 ... Map DB
250L ... Link data 250N ... Node data 252 ... Timetable DB
254 ... User DB

Claims (16)

A route search device,
A designation input unit that accepts designation of departure place, departure time and destination,
A network data reference unit that refers to network data that is represented by a node and a link, and that has at least a part of the node and the link attached with a restriction condition that restricts a traffic mode that can be taken according to time;
A search condition setting unit that sets a plurality of types of search conditions having different movement conditions that affect the travel time required for at least some links, as a condition when performing a route search using the network data;
A route search device comprising: a route search unit that searches for routes corresponding to the plurality of types of search conditions between the departure point and the destination using the network data. The route search device according to claim 1,
The route search device, wherein the search condition includes a condition that the time required for passage of at least some links is the shortest. The route search device according to claim 1 or 2,
The movement conditions include an involuntary condition that can be adjusted by the user's intention and an involuntary condition that cannot be adjusted by the user's intention,
The route search device, wherein the search condition setting unit sets the search condition by independently changing the voluntary condition and the involuntary condition. The route search device according to any one of claims 1 to 3,
Each link has a cost according to the distance or travel time of the link,
An arrival time prediction unit for obtaining an estimated time to reach each of the nodes;
A waiting time reflecting unit for reflecting the waiting time required according to the predicted time in the cost in order to pass each link based on the regulation condition;
The route search unit is a route search device that searches for a route that minimizes the sum of the reflected costs. The route search device according to claim 4,
The route search device in which the restriction condition includes a passage prohibition restriction in a predetermined time zone. The route search device according to claim 4 or 5, wherein
The cost is set based on distance,
The said waiting time reflection part is a route search apparatus which performs the said reflection by converting the said waiting time into distance based on a predetermined rule. The route search device according to any one of claims 1 to 6,
The designation input unit further inputs a required value of the total required time from the departure place to the destination,
The route search unit, as one of the search conditions, searches for the route under a normal search condition in which the movement condition is defined as a normal value in advance, and the total required time obtained as a result of the search is the required value A route search device that executes a route search according to a search condition different from the normal search condition. A route guidance device that displays a route to a specified destination on a map,
By using the network data that expresses the passages by nodes and links, and at least a part of the nodes and links is attached with a restriction condition that restricts the traffic modes that can be taken according to the time of day. A route input unit for inputting a route obtained in a state including constraints on arrival time;
A route guidance device comprising: a display control unit that performs display by changing a display mode of the route according to a moving speed required for each link based on a restriction on the arrival time. The route guidance device according to claim 8,
The route is obtained corresponding to each of a plurality of types of search conditions having different movement conditions that affect the travel time of at least some links,
At least one of the predicted arrival time to the destination or the total required time to the destination for each route corresponding to the plurality of types of search conditions is presented to the user and the route to be guided is selected. Has a selection reception part,
The display control unit is a route guidance device that performs the display on the selected route. The route guidance device according to claim 8 or 9, wherein
The said display control part is a route guidance apparatus which changes a display mode for every link on the said route according to the said moving speed. A route guidance device according to any one of claims 8 to 10,
The said display control part is the route guidance apparatus which can display the content of the said regulation conditions collectively. A route guidance device that displays a route to a specified destination on a map,
A route is expressed by a node and a link, and a route search result obtained by using network data to which a restriction condition for restricting a traffic mode that can be taken according to the time is input to at least a part of the node and the link. A route input unit;
A designation input unit for inputting a range of moving speeds that the user can take when moving along the route;
With reference to at least one of the route search result and the network data, the restriction condition is attached when the route is moved while changing the moving speed within the designated range with reference to the current position and time. A traffic mode determining unit that determines whether or not a difference in the traffic mode occurs in at least one of the nodes or links;
A route guidance apparatus provided with the alerting | reporting part which alert | reports to that effect when the difference of this traffic mode arises. The route guidance device according to claim 12, wherein
The traffic mode determination unit further predicts the required travel distance obtained by considering the distance to the destination, the travel time obtained from the travel speed, and the restriction conditions for a plurality of travel speeds within the specified range. And determining whether or not the change in the estimated required time accompanying the change in the moving speed exceeds the change in the required time,
The alerting | reporting part is a route guidance apparatus which performs the said alerting | reporting when the change of the said estimated required time exceeds the change of the said required time, when the said difference arises. A computer program for searching a route by a computer,
A designated input subprogram that accepts designation of the starting point and destination;
As a condition for route search using the network data, a path is represented by a node and a link, and at least a part of the node and the link is provided with a regulation condition that regulates a traffic mode that can be taken according to time. A network data reference subprogram for referencing network data,
A search condition setting subprogram for setting a plurality of types of search conditions having different movement conditions that affect the travel time of at least some links;
A computer program comprising: a route search subprogram for searching for routes corresponding to the plurality of types of search conditions between the departure point and the destination using the network data. A computer program for displaying a route to a destination specified on a map by a computer,
By using the network data that expresses the passages by nodes and links, and at least a part of the nodes and links is attached with a restriction condition that restricts the traffic modes that can be taken according to the time of day. A route input subprogram that inputs a route obtained in a state including constraints on arrival time;
A computer program comprising: a display control subprogram for performing display by changing a display mode of the route according to a moving speed required for each link based on a restriction on the arrival time. A computer program for displaying a route to a destination specified on a map by a computer,
A route is expressed by a node and a link, and a route search result obtained by using network data to which a restriction condition for restricting a traffic mode that can be taken according to the time is input to at least a part of the node and the link. A route entry subprogram;
A specified input subprogram that inputs a range of moving speeds that the user can take when moving along the route;
With reference to at least one of the route search result and the network data, the restriction condition is attached when the route is moved while changing the moving speed within the designated range with reference to the current position and time. A traffic mode determination subprogram for determining whether or not a difference in the traffic mode occurs in at least one of the nodes or links;
A computer program comprising a notification subprogram for notifying the user of a difference in the traffic mode.