JP2005165080A - Route searching device and route searching method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To search for a most suitable transfer point while searching for a route to a destination from a departure point. <P>SOLUTION: Based on the locations of a departure point 3a and a destination 3b set by a user and a user's home 3c, a route to be followed by a car is searched and a transfer point 4c of public transportation is searched from the searched route by the car. A parking lot 5b, which is located within a prescribed range from the transfer point 4c, is searched. Then, a walking route from the parking lot 5b to the transfer point 4c is searched, a car route to the parking lot 5b from the departure point 3a is searched and a public transportation route to a transfer point 4e in the vicinity of the destination from a transfer point 4c is searched. Then, the searched walking route, the car route and the public transportation route are coupled to produce a candidate route. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a route search apparatus and a route search method that search for an optimal connection point when a route is searched by using walking, vehicles, and public transportation as a combination of each moving device.

  Patent Document 1 discloses a route search apparatus including a route search method that uses a vehicle and public transportation as a means of moving to a destination, and performs a route search for a rectangular area including all departure points, waypoints, and destinations. Are known.

JP 2000-161978 A

  However, in a conventional device that performs a route search for a rectangular area that includes all of the departure point, waypoints, and destination, a route search is performed based on road information and public transportation information in the target area. Therefore, the amount of information to be searched is large. For this reason, there has been a problem that the load of the search process is enormous, and further, the search takes a long time.

  The present invention relates to a route search apparatus and route search method for searching for a route by using walking, vehicles, and public transportation as a moving means, and combining the moving means, and a predetermined starting point, destination, and destination. A route by a vehicle connecting two points at home (hereinafter referred to as “first vehicle route”) is searched, and an area within a predetermined range is set along the searched first vehicle route. It is characterized by searching for a boarding / exiting location existing in the area as a connection point, and searching for a route to the destination based on the departure point, the destination, and the searched connection point.

  According to the present invention, the route from the departure point to the destination and from the home to the destination car is searched, and a boarding / exiting location existing within a predetermined range from each searched route is set as a transit point. As a result, when performing a route search, it is possible to narrow down the stations to be transferred in advance, reduce the processing load required for the route search, and shorten the processing time.

  FIG. 1 is a block diagram showing a hardware configuration of an information center and a route setting terminal on which an embodiment of a route search device according to the present invention is mounted. The information center 100 performs a route search based on various search conditions such as a departure point, a destination, and a home set by the user using the route setting terminal 200, and searches for an optimal connection point. The route setting terminal 200 is, for example, a personal computer installed at the user's home.

  The route setting terminal 200 displays a communication device 201 that communicates with the information center 100, an input device 202 for a user to input information necessary for route search, a route setting screen, and a route search result by the information center 100. A monitor 203; an external storage device 204 including a memory card slot or the like for storing data when data is exchanged with other route setting terminals; a clock 205 for acquiring the current time; and a control device 206. .

  The control device 206 displays a route setting screen on the monitor 203, holds the search conditions input by the user, and when the execution of the route search is instructed by the user, the input search conditions are sent to the information center. A route setting unit 206a for transmission is included. The path setting unit 206a is realized by the control device 206 executing a control program stored in the ROM 207 using the RAM 208 as a work area.

  The information center 100 that performs a route search based on the search conditions set by the route setting terminal 200 includes a traffic information acquisition device 101 that wirelessly acquires information such as traffic jam information and disruption of public transportation schedules, A clock 102 that acquires time, a communication device 105 that communicates with the route setting terminal 200, and a route search device 106 that performs a route search based on the search conditions received from the route setting terminal 200 are provided.

  The route search device 106 includes a control device 107, a public transportation route database 108 that stores route information of various transportation facilities, a pedestrian map database 109 that stores a map used when moving on foot, and an automobile ( A road map database 110 for storing road maps used for route guidance when traveling by vehicle), a traffic jam prediction database 111 for storing traffic jam prediction information predicted from past statistical information, a parking lot position, A parking lot database 112 that stores a charge system and a timetable database 113 that stores a timetable of public transportation are provided.

  The control device 107 includes a route search unit 107a that searches for a route that matches the search condition received from the route setting terminal 200 by referring to the various databases. The route search unit 107a is realized by the control device 107 executing a control program stored in the ROM 103 using the RAM 104 as a work area.

  Hereinafter, in the route search device according to the present embodiment, walking, automobiles, and public transportation are used as moving means to the destination, and when searching for the route to the destination, connection points for connecting the automobile and public transportation are provided. Explore. Then, a route that travels from the departure point to the destination via the connection point is searched and provided to the user. In the present embodiment, it is assumed that the user is in a car at the departure point, moves to the transfer point searched from the departure point, and stops at the parking lot near the transfer point. Then, change to public transportation (train) and search for a route as if traveling to the destination. In addition, there is a section that needs to be moved on foot, for example, from a parking lot to a transit point while moving from the departure place to the destination.

  FIG. 2 is a flowchart of search condition setting processing on the route setting terminal 200 and route determination processing after route search, which are performed in advance when performing the route search. In step S10, it is determined whether or not the input of search conditions by the user has been completed. Here, the user inputs the following information as a search condition.

  First, the user registers the home position in advance using the input device 202. Home here is a place where you park your car on a daily basis. Next, if there is a place other than the departure point, destination, and destination that the user wants to stop during the trip, the place is input as a waypoint. If the departure place is not designated, a preset home is set as the departure place.

  Next, conditions for route search are input. Search conditions include, for example, car priority, public transport priority, charge priority, time priority, express stop station priority, a station within a radius of 2 km from the departure point, a station that arrives within 10 minutes from the departure point, and a radius from the station There are parking lots within 1 km, parking lots within 5 minutes on foot from the station, departure time, stay time at the destination, arrival time at the destination, etc. In addition, it is possible to limit the type of public transportation to only railroads or buses. Note that the search conditions listed here are merely examples, and other search conditions may be input.

  When the operator inputs the search condition and presses the “search” button displayed on the monitor 203, the route setting unit 206a determines that the input of the search condition is completed. If it is determined in step S10 that the input of the search condition by the user has been completed, the process proceeds to step S20, and the search condition input to the information center 100 is transmitted via the communication device 201.

  After transmitting the search conditions, a route search is performed by the information center 100 as described later, and the search result is transmitted to the route setting terminal 200. If it is determined in step S30 that the route search terminal 200 has received the route search result from the information center 100, the process proceeds to step S40.

  In step S40, the search result received in step S30 is displayed on the monitor 203. At this time, when a plurality of routes are included as route candidates in the received search result, all of them are displayed on the monitor 203.

  In step S50, the route setting unit 206a determines whether or not the route has been confirmed by the user. The user determines whether or not to set the search result displayed in step S40 as a route, and when setting as a route, presses the “route confirmation” button displayed on the monitor 203. Thereby, in step S60, the route setting unit 206a determines the route as a confirmed route. When a plurality of routes are displayed as candidates on the monitor 203 in step S40, the user selects a candidate to be set as a route, and then presses a “route confirmation” button.

  The determined route is transmitted from the route search terminal 200 to the information center 100 and stored in the RAM 104 on the information center 100. When performing route guidance based on the determined route, the route is downloaded from the information center 100 to a navigation system, a PDA terminal, or a mobile phone installed in a vehicle, and route guidance is performed on each terminal. Is called. Alternatively, route data determined by a memory card or the like via the external storage device 204 of the route search terminal 200 may be passed to a navigation system, a PDA terminal, a mobile phone, etc., and route guidance may be performed on each terminal.

  Hereinafter, a route search process performed in the information center 100 will be described with reference to FIGS. When the information center 100 receives the route search condition from the route setting terminal 200, the information center 100 executes the following processing. First, in FIG. 3, the route search unit 107a refers to the road map database 110, and routes 3d and 3e by automobiles from the starting point 3a to the destination 3b designated by the user and from the home 3c to the destination 3b. Explore. In FIG. 3, only one route is searched for by car from the departure point 3a to the destination 3b and from the home 3c to the destination 3b. However, when a plurality of routes are searched, This route is targeted.

  If the waypoint has been set by the user, the route by the car going from the departure point 3a to the destination 3b via the waypoint and the route by the car from the home 3c to the destination 3b are searched. . In the following description, it is assumed that no transit point is set. However, even when a transit point is set, the same process as described below is performed on the route to include the transit point. Route search is possible.

  In FIG. 4, a predetermined area along the paths 3d and 3e is set for the paths 3d and 3e searched for in FIG. 3, and a station in the area is searched as a connection point. The predetermined region is an assembly (plane) of line segments having a certain length orthogonal to the route at the midpoint. The length of the line segment is specified in advance by the user on the route setting terminal 200, for example, 2 km. Unless otherwise specified by the user, the system shall set automatically. FIG. 4 shows that the station 4c is searched in the predetermined area 4a along the route 3d, and the stations 4d and 4e are searched in the predetermined area 4b along the route 3e. 4c, 4d, and 4e are set as transfer points.

  In FIG. 5, the parking points existing in the range designated in advance by the user in the route setting terminal 200 with reference to the parking lot database 112 for the connection points 4 c, 4 d and 4 e searched in FIG. 4. A car park (for example, a parking lot within a radius of 1 km from the station) is searched. FIG. 5 shows that the parking lot 5b is searched for within the range 5a set by the user with respect to the transfer point 4c in FIG. In FIG. 5, only a search example for the connection point 4c is shown as a specific example, but the same search is performed for the other connection points searched in FIG.

  Similarly, in the following description, for the sake of simplification of explanation, the processing executed for the transfer point 4c and the parking lot 5b will be described. However, in practice, all the transfer points and the respective parking lots are described. It is assumed that the process described below is executed.

  In FIG. 6, pedestrian map data is read from the pedestrian map database 109, and a walking route that exists while moving from the departure place to the destination is searched. Here, a walking route (hereinafter referred to as walking route) 6a between the parking lot 5b and the transfer point 4c searched in FIG. 5 is searched. In FIG. 6, only one route is searched for the walking route 6a connecting the transfer point 4c and the parking lot 5b. However, when there are a plurality of walking routes, all routes are searched.

  In FIG. 7, road map data is read from the road map database 110, and a route by a car from the departure point 3a to the transfer point parking lot 5b (hereinafter referred to as a car route) is searched. At the same time, for the searched automobile route, the required time is calculated based on the traffic jam prediction of the route with reference to the traffic jam prediction database 111. In the example shown in FIG. 7, it indicates that two automobile routes indicated by reference numerals 7a and 7b have been searched.

  In FIG. 8, the public transportation route database 108 is referred to calculate a route such as a route (hereinafter referred to as a public transportation route) 8a from the transit point 4c to 4e and a public transportation fare. At the same time, the required time is also calculated by referring to the timetable database 113.

  As described above, the final route shown in FIG. 9 is obtained by combining the walking route, the automobile route, and the public transportation route searched in FIGS. In FIG. 9, the vehicle travels from the departure point 3a on the automobile route 7b to the parking lot 5b. After parking the car in the parking lot 5b, walk along the walking path 6a to the transfer point 4c. The public transportation route 8a is moved from the connection point 4c using public transportation, and arrives at the connection point 4e. When the final destination 3b is in front of the transit point 4e station, the route search is completed by the above processing.

  In this embodiment, it is assumed that the user is in a car at the time of departure place 3a. However, when it is necessary to move on foot from the place of departure 3a to a place where the car is stopped. The walking route is also searched for the section. Further, when it is necessary to walk from the transfer point 4e near the destination to the destination 3b, the walking route of the section is also searched at the time of FIG.

  The search for the route shown in FIG. 9 is also performed when the connecting point whose explanation is omitted above is other than 4c, and all the routes assumed when going from the departure point to the destination are searched. From all these routes, conditions set by the user in advance, such as “parking fee less than 1000 yen”, “public transportation fee less than 3000 yen” and “arrival at destination at 12:00” are satisfied. Only the route is extracted and set as a route candidate. If the user has previously specified a condition such as “the route with the least amount of money” or “the route with the shortest required time”, only the corresponding route is extracted.

  The route candidate is transmitted to the route setting terminal 200 via the communication device 105. As described above, in step S50 of FIG. 2, the user selects an arbitrary route from the route candidates on the route setting terminal 200. Thus, the route is determined.

  FIG. 10 is a flowchart of route search processing in the present embodiment, which is processed in the information center 100 described above. The process shown in FIG. 10 is executed as a program that is activated when a search condition is received from the route setting terminal 200. Hereinafter, the flow of processing will be described in detail according to the flowchart of FIG.

  In step S110, on the basis of the departure place, destination and home designated by the user, a route by car from the departure place to the destination and from the home to the destination is searched with reference to the road map database 110. In addition, when a plurality of paths are detected in each section, all the detected paths are targeted.

  In step S120, for the route by the car searched in step S110, a station existing in a predetermined area along each route is searched. The term “within a predetermined area” refers to a range of a line segment having a certain length (for example, 2 km) orthogonal to the route set by the user at the route setting terminal 200 at a midpoint. In step S130, it is determined whether or not there is a station in a predetermined area for each route. If it is determined that there is no station, the process proceeds to step S140. In step S140, the search range is expanded until the nearest station is searched outside the range specified by the search conditions. If it is determined in step S130 that a station has been searched, in step S150, all searched stations are set as transfer points.

  In step S160, the parking lots around each connection point are searched for all the connection points set in step S150. When searching for a parking lot, the parking lot data is read from the parking lot database 112, and a parking lot within a range corresponding to the search condition input by the user, for example, within a radius of 1 km from the station, is searched.

  In step S170, it is determined whether there is a parking lot within the range corresponding to the search condition from each connection point. If it is determined that the parking lot does not exist within the range corresponding to the search condition, in step S180, the search range is expanded until the nearest parking lot is searched outside the range specified by the search condition.

  When a parking lot is searched in step S160, a route by a car from the departure point to the parking lot (hereinafter referred to as an automobile route), a route from the parking lot to a connecting point (hereinafter referred to as a walking route), and between the connecting points. A route by public transportation (hereinafter referred to as a public transportation route) and a route by walking from a connection point near the destination to the destination are searched. Details will be described below.

  In step S190, the pedestrian map data 109 is read from the pedestrian map database 109, and the walking route of the walking section existing while moving from the departure place to the destination is searched. In the present embodiment, a walking route between a parking lot near the connection point and the connection point is searched. When there are a plurality of routes in the same section, all routes are searched similarly.

  In step S200, road map data is read from the road map database 110, and an automobile route is searched while moving from the departure place to the destination. Here, the automobile route from the departure place to the parking lot near the transfer point is searched. Further, the traffic jam prediction data is read from the traffic jam prediction database 111, and the estimated travel time of the automobile route is calculated. Here, if there are a plurality of automobile routes, all routes are searched.

  In step S210, the respective data are read from the public transport route database 108 and the timetable database 113, and the public transport route between connecting points is searched. Similarly to the above, when there are a plurality of public transportation routes, all routes are searched. Also, the public transportation fee is calculated from the public transportation search result.

  In step S220, the walking route, the automobile route, and the public transportation route searched above are combined to complete the route from the starting point to the destination. When a plurality of routes are searched in any of the processes of steps S190 to S210, a plurality of routes from the departure point to the destination are also created. In step S230, the parking lot data is read from the parking lot database 112, and the parking charges for all the routes created in step S220 are calculated.

  In step S240, route candidates are determined for all routes created in step S220 based on the search conditions specified by the user. As described above, for example, route candidates based on the search conditions are extracted in consideration of a parking lot fee, a public transportation fee, or a required time. If the search conditions are "parking fee less than 1000 yen", "public transport fee less than 3000 yen", or "arrival at destination at 12:00", only routes that satisfy these conditions are extracted. And a route candidate. If the user has previously specified a condition such as “the route with the least amount of money” or “the route with the shortest required time”, only the corresponding route is extracted.

  In step S250, the route candidate extracted in step S240 is transmitted to the route setting terminal 200 via the communication device 105. Thereafter, in step S50 of FIG. 2 as described above, the user selects an arbitrary route from the route candidates on the route setting terminal 200, and the route is determined.

As described above, according to the present embodiment, the following operational effects can be obtained.
(1) A route from the departure point to the destination and from the home by the destination car was searched, and a station existing within a predetermined area from each searched route was set as a connection point. Thereby, it is possible to search for connection points without performing a route search of a complicated road network, and to further narrow down the stations to be transferred in advance when performing a route search. As a result, the processing load required for route search can be reduced and the processing time can be shortened.
(2) Since the connection point is searched based on the conditions set in advance by the user, it is possible to search for the connection point according to the user's request.
(3) A walking route, an automobile route, and a public transportation route are searched, and these are combined to create a route candidate. Thereby, a total route from the departure place to the destination can be provided to the user.
(4) Furthermore, since a route search including a route point is performed when a route point exists, the user can grasp all routes including the route point in advance.

  In this embodiment, move from the departure point to the parking lot in the vicinity of the transfer point by car, move from the parking lot to the transfer point on foot, and move from the transfer point to the nearest station of the destination by public transport. However, it was decided to move from the transfer point near the destination to the destination on foot. However, the present invention is not limited to this, and it can search for all possible movement routes and provide them to the user as a search result.

  Although public transportation has been described as a train, it is not limited to this, and it may be a ship or an airplane.

  The route from the departure point to the destination and the route from the home to the destination by the automobile was searched, and stations that exist within a predetermined range from each searched route were set as transfer points. However, the connection point may be searched based on the route of the vehicle from either the departure point only to the destination or from the home only to the destination. In addition, the section for searching for a route by car is not limited to the above, and may be a section connecting any other point such as a transit point set by the user.

  When searching for a station to be a transfer point, it was decided to search all the stations that exist within the range of a predetermined area from the route of each car from the departure point to the destination and from the home to the destination. Only a specific station may be searched for such as “the closest station from the route”.

  When the station and the parking lot do not exist within the predetermined range, the search range is expanded and the search is performed again. In this case, the system may automatically expand the range, notify the user that the station and parking lot are not within the specified range, and prompt the user to change the range condition to be searched. May be.

-Modification 1-
In the above embodiment, the route from the departure point to the destination and the route from the home to the destination car is searched, and a station existing within a predetermined area from each searched route is set as a connection point. On the other hand, in Modification 1, a connection point is searched for by the processes shown in FIGS.

  In FIG. 11, a straight line 11a connecting the points of the starting point 3a and the destination 3b is calculated, and a center point 11b of the straight line 11a connecting the points is calculated. Then, as shown in FIG. 12, with respect to the calculated center point 11b, a station within a range of conditions set by the user, for example, “within a radius of 2 km from the center point” is referred to the public transport route database 108. Search for a transfer point. FIG. 12 shows that the connection point 12b is searched for within the range 12a of the condition set by the user.

  If there is no connection point within the range of the condition set by the user, the search range is outside the range specified by the search condition, that is, until the closest connection point is searched, as in the above embodiment. To spread.

  As described above, the parking point within the predetermined range is searched for the connecting point 12b searched for in FIG. 12, and further, the walking route, the car route, and the public transportation route are searched, so that the destination can be obtained. Search for a route to the ground.

  As described above, according to the search for the connection point according to the first modification, the transfer point can be searched based on the center point of the straight line connecting the departure point and the destination, so that the connection point can be determined without performing a complicated route network route search. Search can be performed and the time required for the search can be shortened.

-Modification 2-
In the second modification, when the waypoint is set by the user, the connection point is searched by the processes shown in FIGS. 13 and 14. In FIG. 13, straight lines 13b, 13c, and 13d connecting the points of the starting point 3a, the destination 3b, and the waypoint 13a are calculated, and a rectangular center of gravity point 13e surrounded by the straight lines connecting these points is calculated. To do. Then, as shown in FIG. 14, the public transport route database 108 is set with respect to the calculated center-of-gravity point 13e as a transit point within a range of conditions set by the user, for example, a station “within a radius of 2 km from the center of gravity point” Browse and search. FIG. 14 shows that the connection point 14b is searched for within the range 14a of the condition set by the user.

  If there is no connection point within the range of the condition set by the user, the search range is outside the range specified by the search condition, that is, until the closest connection point is searched, as in the above embodiment. To spread.

  For the connecting point 14b searched in FIG. 14, as in the first modification, a parking lot within a predetermined range is searched, and further, a walking route, a car route, and a public transportation route are searched for. Search for a route from the ground to the destination.

  In Modification 2, when there are a plurality of waypoints, or when there are a plurality of points to be connected by straight lines, such as when the home is set as the final destination, all the points may be connected by straight lines, Arbitrary points may be connected by a straight line. When connecting arbitrary points with a straight line, the system may automatically select the target points or allow the user to select them.

  As described above, according to the search for the connection point according to the second modification, the transfer point is searched based on the center of gravity of the rectangle surrounded by the straight line connecting the departure point, the destination, the waypoint, and the home. As a result, it is possible to search for connection points without performing a route search of a complicated road network, and the time required for the search can be shortened.

  The correspondence between the constituent elements of the claims and the embodiment will be described. The first vehicle route search means, the second vehicle route search means, the area setting means, the transit point search means, the route search means, the parking lot search means, the walking route search means, and the public transportation route search means are the route search unit 107a. It corresponds to. The route setting terminal 200 corresponds to condition setting means. Note that the present invention is not limited to the configurations in the above-described embodiments as long as the characteristic functions of the present invention are not impaired.

It is a block diagram which shows the hardware constitutions of the information center and route setting terminal which mount one Embodiment of the route search apparatus by this invention. It is a flowchart figure of the search condition setting process on the route setting terminal 200, and the route determination process after the route search. It is a figure which shows the specific example about the search of the path | route by the motor vehicle which connects a departure place and a destination, and a home and a destination. It is a figure which shows the specific example which searches the station which exists in the predetermined area along the path | route by the motor vehicle which connects a departure place and a destination, and a home as a transfer point. It is a figure which shows the specific example when searching for the parking lot in a predetermined range from the transfer point. It is a figure which shows the specific example when searching the walk route from a parking lot to the transfer point. It is a figure which shows the specific example when searching the motor vehicle path | route to a departure point or a connecting point. It is a figure which shows the specific example when searching for the public transport route from the transfer point to the transfer point near the destination. It is a figure which shows the specific example when producing the candidate of all the routes by combining a walk route, a motor vehicle route, and a public transport route. It is a flowchart figure of the route search process processed in the information center 100. FIG. It is a figure which shows the specific example of the center point calculation in the modification 1. FIG. It is a figure which shows the specific example of the connection point search in the modification 1. FIG. It is a figure which shows the specific example of the gravity center calculation in the modification 2. It is a figure which shows the specific example of the connection point search in the modification 2. FIG.

Explanation of symbols

100 Information Center 101 Traffic Information Acquisition Device 102, 205 Clock 105, 201 Communication Device 106 Route Search Device 107, 206 Control Device 107a Route Search Unit 108 Public Transportation Route Database 109 Pedestrian Map Database 110 Road Map Database 111 Congestion Prediction Database 112 parking lot database 113 timetable database 200 route setting terminal 203 monitor 204 external storage device 206a route setting unit

Claims (4)

In a route search device that uses walking, vehicles, and public transportation as moving means, and searches for a route by combining the moving means,
A first vehicle route search means for searching for a route (hereinafter referred to as a “first vehicle route”) by a vehicle connecting the two points of the starting point and the destination specified in advance and the destination and the home;
An area setting means for setting an area within a predetermined range along the first vehicle path searched by the first vehicle path searching means;
A connection point search means for searching as a connection point a boarding / exiting location existing in the area set by the area setting means;
A route search apparatus comprising: route search means for searching for a route to a destination based on the departure point, the destination, and the connection point searched by the connection point search means. The route search device according to claim 1,
Parking lot search means for searching for a parking lot existing within a predetermined range from each transfer point with respect to at least one or more transfer points searched by the transfer point search means,
Second vehicle route search means for searching for a movement section by a vehicle existing in the route to the destination and searching for a route of the movement section by the vehicle (hereinafter referred to as “second vehicle route”); ,
A walking route searching means for searching a moving section by walking existing in the route to the destination and searching for a route of the moving section by walking (hereinafter referred to as “walking route”);
Public transportation route search for searching for a travel section by public transport existing in the route to the destination and searching for a travel section by the public transport (hereinafter referred to as “public transport route”) And means
The route search device, wherein the route search means searches for a route from a starting point to a destination by combining the searched second vehicle route, walking route, and public transportation route. In the route search device according to claim 1 or 2,
It further has a condition setting means for setting in advance conditions for performing a route search,
The connecting point search means searches for connecting points based on the conditions set by the condition setting means,
The route search device characterized in that the route search means searches for a route based on the condition set by the condition setting means. In a route search method in which walking, vehicles, and public transportation are used as moving means, and a route is searched by combining each moving means,
Search for a route by a vehicle (hereinafter referred to as the “first vehicle route”) connecting the two points of the designated starting point and destination, and the destination and home,
A predetermined range of area is set along the searched first vehicle route,
Search for boarding / exiting locations within the set area as transit points,
A route search method, wherein a route to a destination is searched based on the departure point, the destination, and the searched connection point.

Images