WO2006062004A1

WO2006062004A1 - Route search device, route search method, route search program, and recording medium

Info

Publication number: WO2006062004A1
Application number: PCT/JP2005/021849
Authority: WO
Inventors: Chihiro Hirose
Original assignee: Pioneer Corporation
Priority date: 2004-12-10
Filing date: 2005-11-29
Publication date: 2006-06-15
Also published as: JPWO2006062004A1; JP4233581B2

Abstract

A route search device having a road information acquisition section (101) for acquiring both information on traffic-restricted roads and information on roads, out of the traffic-restricted roads, through which specific vehicles can pass; a vehicle information acquisition section (102) for acquiring information on whether a vehicle falls into the specific vehicles; and a route search section (103) for searching for a route to a destination waypoint based on the following information: the information on the traffic-restricted roads acquired by the road information acquisition section (101), the information on the roads through which the specific vehicles can pass, and the information on whether the vehicle falls into the specific vehicles acquired by the vehicle information acquisition section (102).

Description

Specification

Route search device, route search method, route search program, and recording medium

The present invention relates to a route search device, a route search method, a route search program, and a recording medium that search for a route. However, the use of the present invention is not limited to the above-described route search device, route search method, route search program, and recording medium.

Background art

[0002] Conventionally, in the route search performed in car navigation, etc., the information from each point (for example, road distance, traffic jam information, tolls, etc.) that has been memorized in advance is used for the purpose from the current point. Evaluate various routes to the point. Of these routes, the route with the best evaluation is selected as the optimum route, and the selected optimum route is displayed as the traveling route (see, for example, Patent Document 1 below).

[0003] The information on each point includes road type, width information, etc., and the route search is performed so that roads where traffic is restricted (hereinafter referred to as traffic restricted roads) are not included in the route. , Ru Restricted roads are roads that are closed to vehicles, roads that are restricted for time periods such as school zones, time zone restrictions, and snow cover periods. Temporary traffic regulations can also be taken into account by VICS (Vehicle Information and Communication System) information acquired sequentially.

[0004] Patent Document 1: Japanese Patent Laid-Open No. 06-309595

Disclosure of the invention

Problems to be solved by the invention

[0005] Even if it is a road that is generally inaccessible, such as vehicle closure, it is possible for a resident who is in the vicinity of the road to be able to pass, or to get a permit. May be able to pass. According to Patent Document 1 mentioned above, the exception of these restricted traffic roads cannot be considered. For this reason, a problem that the route search considering the correct traffic conditions cannot be performed for the user is given as an example.

Means for solving the problem [0006] In order to solve the above-described problems and achieve the object, the route search device according to the invention of claim 1 is configured to identify information on a traffic-restricted road in which vehicle traffic is restricted and the traffic-restricted road. Obtained by road information obtaining means for obtaining information on a road through which the vehicle can pass, vehicle information obtaining means for obtaining information on whether or not the vehicle corresponds to the specific vehicle, and obtained by the road information obtaining means On the basis of the information on the restricted traffic road, the information on the road on which the specific vehicle can pass, and the information on whether or not the specific vehicle is acquired by the vehicle information acquisition means, Route search means for searching for a route to the destination point.

[0007] Further, the route search method according to the invention of claim 8 relates to information on a restricted road where traffic of vehicles is restricted and a road on which a specific vehicle can pass among the restricted traffic. A road information acquisition step for acquiring information, a vehicle information acquisition step for acquiring information on whether or not a vehicle corresponds to the specific vehicle, and a traffic restriction road acquired by the road information acquisition step. The route to the destination point is determined based on the information and information on the road on which the specific vehicle can pass, and information on whether or not the power corresponds to the specific vehicle acquired in the vehicle information acquisition step. And a route search step for searching.

[0008] A route search program according to the invention of claim 9 causes a computer to execute the route search method according to claim 8.

[0009] Further, a recording medium according to the invention of claim 10 is readable by a computer recording the route search program according to claim 9.

Brief Description of Drawings

[0010] FIG. 1 is a block diagram showing a functional configuration of a route search apparatus according to an embodiment.

FIG. 2 is a flowchart showing a route search processing procedure of the route search device.

FIG. 3 is a block diagram of a hardware configuration of the route search apparatus according to the first embodiment.

FIG. 4 is a block diagram showing a functional configuration of the route search apparatus.

FIG. 5 is a diagram showing an example of a display screen when registering a residence. [FIG. 6] FIG. 6 is a diagram showing an example of a display screen displaying a list of locations registered as residences.

FIG. 7 is a flowchart illustrating an example of a route search processing procedure performed by the route search unit.

[FIG. 8] FIG. 8 is a flowchart showing a detailed procedure of the process performed in step S707 of FIG.

FIG. 9 is an explanatory diagram showing an example of a route searched by route search processing.

FIG. 10 is an explanatory diagram showing an example of a route searched by route search processing.

FIG. 11 is an explanatory diagram showing another example of a route searched by route search processing.

[FIG. 12] FIG. 12 is a flowchart showing a processing procedure for identifying a cause of failure in route search.

FIG. 13 is a diagram showing an example of a display screen indicating that the destination point cannot be reached.

FIG. 14 is a block diagram of a functional configuration of the route search apparatus according to the second embodiment.

[FIG. 15] FIG. 15 is a flowchart showing a residence information acquisition processing procedure when a residence is newly registered.

[FIG. 16] FIG. 16 is a flowchart showing the detailed procedure of the process performed in step S707 of FIG.

Explanation of symbols

100 route search device

101 Road information acquisition unit

102 Vehicle information acquisition unit

103 Route search unit

104 Notification unit

411 Map information storage

412 Resident Registration Department

413 Residential Memory Department 414 Current location information acquisition unit

415 point input section

416 Route search unit

417 display

BEST MODE FOR CARRYING OUT THE INVENTION

Hereinafter, preferred embodiments of a route search device, a route search method, a route search program, and a recording medium according to the present invention will be described in detail with reference to the accompanying drawings.

[0013] (Embodiment)

(Functional configuration of the route search device 100)

FIG. 1 is a block diagram showing a functional configuration of a route search apparatus according to the embodiment. First, a functional configuration of the route search apparatus 100 that is useful for the embodiment will be described. The route search apparatus 100 includes a road information acquisition unit 101, a vehicle information acquisition unit 102, a route search unit 103, and a notification unit 104.

[0014] The road information acquisition unit 101 acquires information on a restricted road where traffic of the vehicle is restricted and information on a road on which a specific vehicle can pass among the restricted road. “Vehicles with restricted traffic” are roads that are closed to vehicles, roads that are restricted by time of day! /, Roads that limit the size of vehicles that can pass, and roads that are restricted. is there. In addition, “a road where a specific vehicle can pass” means a road that is restricted from being used as a restricted traffic road, and for certain vehicles, the road that can be passed with the restricted traffic removed. It is.

[0015] The vehicle information acquisition unit 102 acquires information regarding whether or not a vehicle corresponds to the specific vehicle. “Information on whether or not the force is applicable to a specific vehicle” is, for example, information on whether the vehicle is permitted to pass or information on whether the size of the vehicle is below the limit.

[0016] The route search unit 103 includes information on the restricted traffic road acquired by the road information acquisition unit 101, information on a road on which a specific vehicle can pass, and the specific information acquired by the vehicle information acquisition unit 102. The route to the destination point is searched based on information on whether or not the force is applicable to the vehicle. “Based on” means, for example, that the vehicle corresponds to a specific vehicle In this case, the route to the destination including the road that the specific vehicle can pass is searched, and if not, the route to the destination is searched without including the road that the specific vehicle can pass. It is to be.

[0017] When the route search unit 103 searches for a route to the destination point, the notification unit 104 notifies the user if the route to the destination point cannot be searched because the route does not correspond to a specific vehicle. . “Unable to search for a route to the destination” means that the route to the destination cannot be obtained because there is no road to reach the destination. The notification unit 104 notifies the user when the route to the destination point cannot be searched because the vehicle does not correspond to the specific vehicle and the specific vehicle cannot pass through the road.

[0018] (Route search processing procedure of route search device 100)

FIG. 2 is a flowchart showing a route search processing procedure of the route search device. Next, the procedure of the route search process of the route search device 100 will be described. First, the route search device 100 0 obtains information on roads that are restricted by the road information acquisition unit 101 and roads that can be used by specific vehicles (road information). Obtain (Step S201). Next, the vehicle information acquisition unit 102 acquires information about whether the vehicle is a force corresponding to a specific vehicle (information about the vehicle) (step S202).

Next, the route search unit 103 determines whether the vehicle is a specific vehicle (step S 203). When it corresponds to a specific vehicle (step S203: Yes), the route to the destination point including the road through which the specific vehicle can pass is searched (step S204), and the processing according to this flowchart is terminated. On the other hand, when the vehicle does not correspond to the specific vehicle (step S203: No), the route to the destination point is searched without including the road through which the specific vehicle can pass (step S205).

[0020] Then, it is determined whether or not the force to search for the route to the destination point is obtained due to the force not corresponding to the specific vehicle (step S206). More specifically, it is determined whether or not the route to the destination point cannot be obtained and the cause is that the route was searched without including a road on which a specific vehicle can pass. [0021] If the route to the destination point cannot be searched due to lack of power corresponding to a specific vehicle (step S206: Yes), the notification unit 104 notifies the fact (step S207), and The process according to the flowchart ends. On the other hand, if the route to the destination point can be searched, or if the cause of the failure to find the route is not the force that does not correspond to the specific vehicle (step S 206: No), The process ends.

[0022] As described above, according to the route searching device 100 according to the embodiment, it is determined whether or not the vehicle is capable of passing a road on which a specific vehicle can pass among the restricted traffic roads. The route to can be searched. For this reason, it is possible to search for a route that takes into account the correct traffic conditions by appropriately using the road through which each vehicle can pass.

Example 1

[0023] (Hardware configuration of route search device 300)

First, the hardware configuration of the route search device according to the first embodiment will be described. In the following examples, the restricted road is a resident-only road that can only be accessed by those who live in the vicinity.

FIG. 3 is a block diagram of the hardware configuration of the route search apparatus according to the first embodiment. In Fig. 3, the route search device 300 includes a CPU 301, a ROM 302, a RAM 303, an HDD (node disk drive) 304, an HD (node disk) 305, and a CDZDVD drive 306. CDZDVD307 as an example of a possible recording medium, input iZF (interface) 308, input key 309, remote control 310, video iZF (interface) 311, display (or touch panel) 312 and audio IZF313 , Speaker 314, microphone 315, communication IZF (interface) 316, GPS Resino 317, moving speed sensor 318, angular speed sensor 319, mileage sensor 320, and tilt sensor 321. Yes. Each component 301 to 321 is connected by a bus 330.

Here, the CPU 301 governs overall control of the route search apparatus 300. The ROM 302 stores programs such as a boot program. The RAM 303 is used as a work area for the CPU 301. The HDD 304 controls read / write of data to the HD 305 according to the control of the CPU 301. HD305 is the data written under the control of HDD304. Remember.

Also, the CD / DVD drive 306 controls the read / write of data to the CD / DVD 307 according to the control of the CPU 301. The CDZDVD307 is a detachable recording medium from which recorded data is read according to the control of the CDZDVD drive 310. Further, a writable recording medium can be used as the CDZDVD307. This removable recording medium may be the power of CDZDVD307, CD-ROM (CD-R, CD-RW), MO, memory card, or the like.

In addition, the input IZF 308 inputs data transmitted from an input key 309 for inputting characters, numerical values, various instructions, and the like, or a remote controller 310 having a part or all of the input keys 309. Although not shown, an output IZF is provided as necessary, and a scanner that optically reads characters and images and a printer that prints characters and images can be connected via the output IZF. Further, data from sensors 318 to 321 described later are input.

The video IZF 311 is connected to a video display (or touch panel) 312. Specifically, the video IZF 311 is, for example, a graphic controller that controls the entire display (or touch panel) 312, a buffer memory such as a VRAM (Video RAM) that temporarily stores image information that can be displayed immediately, and the like. It consists of a control IC that controls the display (or touch panel) 312 based on the image data output from the graphic controller.

The display (or touch panel) 312 displays icons, cursors, menus, windows, or various data such as characters and images. For example, a CRT, a TFT liquid crystal display, a plasma display, or the like can be adopted as the display 312. Also, when the touch panel 312 is pressed and Z is not pressed, data is input to the input IZF308.

[0030] The audio IZF 313 is connected to an audio output speaker. Specifically, the audio IZF313 is, for example, a DZA converter that performs DZA conversion of audio digital data, an amplifier that amplifies audio analog signals output from the DZA converter, and AZD that converts audio analog data. It is composed of a converter and a force. In addition, the speech force 314 outputs sound. The microphone 315 inputs sound from the outside. [0031] Further, the communication IZF 316 is a communication module that performs wireless communication with a communication server (not shown) via a base station (not shown). Communication IZF316, for example, has the same configuration as a general-purpose mobile phone, and may adopt a TDMA, TDD or CDMA configuration of PDC (Parsonal Digital Cellular Telecommunicaition System) system, PHS (Parsonal Handyphone System) system, etc. it can. In addition, the communication IZF316 may adopt a configuration of wired connection (interface connection) to a general-purpose mobile phone and the input IZF308, or a configuration of a wireless connection system in which a general-purpose mobile phone and the input IZF308 are provided with a weak wireless transceiver. Oh ,.

[0032] The GPS receiver 317 receives a radio wave of a GPS satellite (not shown) and obtains the current position of the main body of the route search device 300.

The movement speed sensor 318 detects the movement speed of the route search device 300. When the route search device 300 is installed in a vehicle, it is detected from the output shaft of the transmission. Also, the angular velocity sensor 319 detects the angular velocity when the host vehicle is rotating, and outputs angular velocity data and relative direction data. The mileage sensor 320 calculates the number of pulses per one rotation of the wheel by counting the number of pulses of a predetermined number of pulses output as the wheel rotates, and based on the number of pulses per one rotation. Outputs mileage data. The inclination sensor 321 detects the inclination angle of the road surface and outputs inclination angle data.

[0034] (Functional configuration of route search apparatus 300)

FIG. 4 is a block diagram showing a functional configuration of the route search apparatus. In FIG. 4, the route search device 300 includes a map information storage unit 411, a residence registration unit 412, a residence storage unit 413, a current location information acquisition unit 414, a location input unit 415, and a route search unit 416. , And a display unit 417.

The map information storage unit 411 stores map information. The map information includes background data that represents features (features) such as buildings, rivers, and the ground surface, and road shape data that represents the shape of the road. It is drawn on.

The background data includes background shape data representing the shape of the background and background type data representing the type of the background. The background shape data is, for example, representative points of features, polylines , Polygons, feature coordinates, etc. The background type data includes, for example, text data representing the name and address of a feature, a telephone number, and type data of a feature such as a building, a river, and the ground surface.

[0037] The road shape data is a road network having a plurality of nodes and links connecting the nodes. The node indicates an intersection where a plurality of roads such as a three-way crossing such as a T-junction, a crossroad, and a five-way crossing. The link indicates a road. Some links have shape interpolation points, and curved roads can be expressed by these shape interpolation points.

[0038] The road shape data further includes traffic condition data. The traffic condition data includes, for example, the presence or absence of traffic lights or pedestrian crossings for each node, the presence or absence of highway entrances and junctions, the length (distance) for each link, vehicle width, direction of travel, road type ( Information on expressways, toll roads, general roads, etc.).

[0039] The traffic condition data includes information on whether each node is a resident-only road or a resident-only road depending on a time zone. Here, resident-only roads are roads that can only be accessed by those who live nearby. In addition, information on roads where users are restricted and roads where use is restricted depending on the time of day (for example, a star zone) is also included.

[0040] In addition to the configuration included in the map information storage unit 411, the information related to the resident exclusive road may be stored in a database in which only information related to the resident exclusive road is extracted. In that case, for example, a serial number is assigned to each node stored in the map information storage unit 411, and a database in which only the node number of the resident exclusive road is extracted is created.

[0041] Specifically, the map information storage unit 411 realizes its function by, for example, the RAM 303 or the HD D305 shown in FIG. Note that the map information storage unit 411 may be provided outside the route search apparatus 300. In that case, the route search apparatus 300 acquires map information via the network through, for example, the communication IZF 316 shown in FIG.

The residence registration unit 412 receives the residence registration of the user of the route search device 300. Here, the place of residence is a place that has a certain relationship, such as a place of work or a home, in addition to the place where you actually live, and where the user is qualified to use the resident-only road around it. It is a place. In addition, the residence storage unit 413 stores information on the residence registered by the residence registration unit 412.

[0043] Specifically, the residence registration unit 412 realizes its function by, for example, the input IZF 308 shown in FIG. Further, the residence storage unit 413 specifically realizes its function by, for example, the RAM 303 or the HDD 305 shown in FIG.

FIG. 5 is a diagram illustrating an example of a display screen when registering a residence. On the display screen, a map display 500 is displayed, and a cursor 501 indicating the designated point is displayed. In the upper right of the screen, an address display 502 of the point indicated by the cursor 501 is displayed. The user moves the cursor 501 to the location to be registered as the residence and presses the “Yes” button 511 on the confirmation display 510 to perform the residence registration. To register a different location, press the “No” button 512 to specify another location.

[0045] As shown in FIG. 5, the residence is set by moving the cursor 501 on the map display 500, entering an address or telephone number, or being registered as a destination. You may specify a point. Further, a place where the vehicle is stopped for a certain period of time may be recognized as a residence. You can register multiple residences, such as homes, offices, and homes. In this case, each point is distinguished by giving an appropriate name.

FIG. 6 is a diagram showing an example of a display screen displaying a list of locations registered as residences. The user can display a list of locations registered as residences, check these locations, and cancel registration.

[0047] List of registered residence locations 601 (601a to 601e) displays a list of locations registered as residences (hereinafter referred to as "residence registration locations"). In the illustrated example, “Home”, “Parent”, “Workplace”, “My sister's house”, and “My son's house” are listed as the residence registration points.

[0048] When any one of the registered residence registration point list display 601 is selected, a map display 602 of the selected point is displayed on the right side of the screen. In the example shown in the figure, the “work place” display 601c is selected. When the “Search” button 611 is pressed, a route to the selected residence registration point is searched. When the “delete” button 612 is pressed, the selected residence registration point is deleted and the registration as the residence is cancelled. Also, click the “Add” button 613 When pressed, the display switches to the display screen for registering the residence shown in FIG.

Returning to the description of FIG. 4, the current location information acquisition unit 414 acquires current location information of the route search device 300. Specifically, for example, the GPS positioning data obtained by the GPS receiver 317 shown in FIG. 3 and the absolute direction data of the traveling direction of the own vehicle are used as a moving speed sensor 318, an angular speed sensor 319, a travel distance sensor 320, and an inclination sensor. The current point information is obtained by correcting each data obtained from 321. This current position information includes the three-dimensional information (longitude, latitude, height) of the route search device 300 and the traveling direction, as well as data related to speed and acceleration. For example, the current location information acquisition unit 414 realizes its function by the GPS receiver 317 and the input IZF 308 shown in FIG.

[0050] The point input unit 415 receives an input of an arbitrary point. The user sets an origin point (start point), a destination point (end point), a transit point, and the like of a route searched by the route search unit 416 described later by inputting an arbitrary point into the point input unit 415.

[0051] The point is input by, for example, designating an arbitrary point of map information displayed on the display unit 417 described later. Alternatively, it may be performed by inputting information specifying one point on the map information such as address and latitude / longitude. Specifically, the point input unit 415 realizes its function by, for example, the input IZF 308 shown in FIG.

[0052] The route search unit 416 searches for a route from the departure point to the destination point. In general, there are many routes connecting the departure point and the destination point, but the route search unit 416 uses the traffic condition data stored in the map information storage unit 411, VICS information acquired via the communication IZF316, etc. To find the best route. Specifically, for example, the route search unit 416 realizes its function by the CPU 301 executing the program recorded in the ROM 302, RAM 303, HD 305, CD / DVD 307, etc. shown in FIG. .

The display unit 417 displays the route searched by the route search unit 416 together with the background data stored in the map information storage unit 411. Specifically, the display unit 417 displays the searched route and background data on the display 312 under the control of the video IZF 311 shown in FIG.

[0054] With the configuration as described above, the route search device 300 allows the route from the departure point to the destination point. Searches and displays the searched route. Of the configuration of the route search device 100 that is relevant to the embodiment, the road information acquisition unit 101 is based on the map information storage unit 411, and the vehicle information acquisition unit 102 is based on the residence registration unit 412 and the residence storage unit 413. The route search unit 103 realizes its function by the route search unit 416 and the notification unit 104 by the display unit 417.

(Route search processing procedure by route search unit 416)

FIG. 7 is a flowchart showing an example of a route search processing procedure performed by the route search unit. A route search process performed by the route search unit 416 will be described. The processing shown below is a route search method generally called the Dijkstra method. When the user starts the route search by specifying the departure point and the target point, the route search process shown in FIG. 7 is started. In the following, for convenience of description, only the route search for the starting point force is shown. At the same time, the same processing is performed from the destination point to shorten the time required for the route searching process.

[0056] First, a link (road) that is closest to the departure point is added as a candidate (step S701). Here, candidates indicate link candidates that will be part of the route to be finally searched. The closest is that even if the departure point does not face the road, if there is a link within a certain range centered on the specified departure point, that link is added to the candidate. is there.

[0057] Next, it is determined whether or not there is one or more candidate links (step S702). If there is one or more candidates (step S702: Yes), that is, if there are links around the departure point, select the link with the lowest accumulated cost (hereinafter referred to as link L) among the candidates. (Step S703).

Here, the cost is an index for evaluating each route by numerically adding elements included in a route that is generally determined as an “optimum route”. For example, factors such as congestion, straightness, fee, number of right (left) turns, and width of the link are evaluated numerically. The accumulated cost is calculated by weighting each element with a coefficient and adding them together.

[0059] In addition, when searching for a route, it is possible to set what items (for example, time, fee, etc.) the user should prioritize. At this time, the user prioritizes matters. By changing the weighting coefficient value of each item, the accumulated cost is varied even on the same route, and the route search according to the setting of the priority item is performed! /.

[0060] Returning to the explanation of FIG. 7, in step S702, when there is no candidate (step S702: No), that is, when there is no road around (for example, when the ocean is designated as the departure point). As a search failure (step S704), the processing according to this flowchart is terminated.

[0061] Next, in step S703, link L is selected, and when the link reaches the destination point (step S705: Yes), the search is terminated (step S706), and the processing according to this flowchart is terminated.

[0062] On the other hand, when the link does not reach the destination point (step S705: No), one of the other links connected to the link (hereinafter referred to as the link Cn (n = l, 2, 3 · · ·) )) Is determined as a candidate (step S707). The procedure for determining whether to add link Cn to the candidate will be described later.

[0063] If not added to the candidate (step S707: No), the process proceeds to step S709. On the other hand, when adding to the candidate (step S707: Yes), the cost of the link Cn is calculated and added to the candidate (step S709).

[0064] Next, it is determined whether there is another link Cn + 1 connected to the link L (step S709).

If there is another link Cn + 1 (step S709: Yes), link Cn + 1 is read as link Cn (step S710), the process returns to step S705, and the subsequent processing is repeated. On the other hand, if there is no other link Cn + 1 (step S709: No), the candidate link Cn is read as link L (step S711), the process returns to step S702, and the subsequent processing is repeated.

[0065] By repeating the above processing, a route from the departure point to the destination point is searched. In addition, the above processing is performed in parallel from the departure point and the destination point, preventing the candidate links from spreading indefinitely and reducing the time required for route search.

FIG. 8 is a flowchart showing a detailed procedure of the process performed in step S707 of FIG. In step S707, the ability to determine whether to link to a candidate is shown in the flowchart of FIG. Step S801 to Step S803 Force S This is a judgment regarding route search in consideration of a resident exclusive road. Also, after step S804 Is a judgment regarding other road conditions. First, it is determined whether the determination target link is a resident-only road (step S801). If it is a residential road! (Step S801: No), go to Step S804.

[0067] On the other hand, if the road is a resident-only road (step S801: Yes), it is determined whether it is a road that faces any of the registered residential areas (step S802). This is the power that determines that the user is qualified to travel on the resident-only road if the road is facing the registered residence.

[0068] If it is a road that faces the registered residence! / Somewhere (Step S802: Yes), the user determines that he / she is qualified to pass the resident-only road. Then, the process proceeds to step S804. On the other hand, if the road does not face any of the registered residences (step S802: No), it is determined whether the immediately preceding candidate link is a resident-only road (step S803).

[0069] Such a determination is made in order to determine the resident-only road, directly facing the residential area. If the destination point (one starting point for route search) is a registered point of residence, the first candidate link is the resident-only road. For this reason, if the link to be judged is a resident-only road that is permitted to pass, the immediately preceding candidate link is also a resident-only road. As a result, it is possible to determine whether the user can pass even on a resident-only road that does not directly face the residence.

[0070] If the immediately preceding candidate link is a resident-only road (step S803: Yes), the user has the qualification to pass the resident-only road, and the process proceeds to step S804. On the other hand, if the immediately preceding candidate link is not a resident-only road (step S803: No), the user is qualified to pass through the resident-only road and is not added to the candidate (step S805). ), The process according to this flowchart is terminated.

Next, in step S804, it is determined whether or not the determination target link is prohibited from passing.

(Step S804). If the traffic is not prohibited (step S804: No), it is determined whether it is a one-way reverse run (step S806). In the case of one-way reverse running (step S806: No), it is determined whether the time regulation / seasonal regulation is met (step S807). In case of time regulation / seasonal regulation (step S807: No), it is determined that the link is accessible. In addition to the candidates (step S808), the process according to this flowchart is terminated.

[0072] On the other hand, either one is prohibited (Step S804: Yes), one-way reverse running (Step S806: Yes), or time regulation or seasonal regulation (Step S807: Yes). If this is the case, it is determined that the link is not allowed to pass, so that it is not added as a candidate (step S805), and the processing according to this flowchart ends.

FIG. 9 and FIG. 10 are explanatory diagrams showing an example of a route searched by the route search process. In Fig. 9, the route from the starting point S indicated by the triangle mark to the destination point G1 indicated by the cube is searched. The destination point G1 is the user's residence. In addition, links 901 to 903 indicated by dotted lines are residents-only roads.

[0074] The route search is performed in parallel from the departure point S and the destination point G1. The first candidate link on the destination point G1 side is link 901. Therefore, the link 901 becomes step S802: Yes in FIG. 8 described above. Therefore, if it does not correspond to the item judged after step S804, it becomes a candidate.

[0075] Subsequently, when it is determined whether or not the link 902 connected to the link 901 is a candidate, step S8 02: No power Since the immediately preceding candidate link 901 is a residential road, step S803: Yes. Therefore, if it does not correspond to the item judged after step S804, it becomes a candidate. As a result of repeating such processing, the route searched is a route using a resident-only road as shown by the thick line R1 in FIG.

FIG. 11 is an explanatory diagram showing another example of the route searched by the route search process.

In Fig. 11, the route from the starting point S indicated by the triangle mark to the destination point G2 indicated by the cube is searched. The shape of the link is the same as in FIGS. The departure point S is also in the same position as in Figs. Moreover, the link shown with the dotted line is a resident exclusive road.

[0077] When a route is searched under such conditions, the resident-only road faces the gap between the departure point S and the destination point G2, and therefore the route is not used. It's a bit tricky to explore. That is, a route as indicated by the thick line R2 in the figure is searched.

[0078] (Process when route search fails)

Next, the processing when the route to the destination point cannot be searched because the resident exclusive road cannot be passed will be described. From destination S shown in Figure 9 to destination When searching for a route to the point Gl, a person who has not registered the destination point G1 as a residence cannot search for a route. That is, the route search fails.

[0079] In this case, the route search failed because there was a resident-only road in the middle of the route, for other reasons, for example, there are no roads to the destination due to remote islands, It is not possible to judge whether it has failed. In addition, if the cause of the route search failure is not specified, the user cannot take appropriate measures. Therefore, if the route search fails, the process shown in Fig. 12 is performed to identify the cause of the route search failure.

FIG. 12 is a flowchart showing a processing procedure for identifying the cause of the route search failure. If the route search fails (step S1201), all the resident exclusive roads are allowed to pass and the route search is performed again (step S 1202). If a route to reach the target point is found by searching for the route again (step S 1203: Yes), a message indicating that the destination point cannot be reached without following the resident exclusive route is displayed (step S1203). S 1204).

FIG. 13 is a diagram showing an example of a display screen indicating that the destination point cannot be reached. A message 1301 is displayed indicating that it is not possible to reach the destination from the departure point without passing through the residential road. The message 1301 instructs the user to change the destination point or register the destination point as a residence.

[0082] Returning to the description of FIG. 12, if a route to reach the destination point is not searched (step S1 203: No), a message indicating that the route cannot be searched for other reasons is displayed (step S 1205). The process according to this flowchart ends. Other reasons include traffic restrictions as described above, or when there is no road to the destination.

Through the processing as described above, the route search device 300 identifies the cause of the route search failure and prompts the user to take appropriate measures. As a result, the user can take a suitable measure and perform a route search again to obtain a route to the destination point.

[0084] As described above, according to the route search device 300 according to the first embodiment, when a departure point or a destination point is registered as a residence, a resident-only road through which a user can pass is considered. Route search can be performed. As a result, a route search can be performed in consideration of the correct traffic conditions for the user. [0085] If the route search fails, the cause is identified and appropriate processing is prompted to the user. As a result, even when a route to the destination point cannot be obtained due to a cause such as the inability to correctly set the traffic condition, an appropriate process can be performed to obtain a route to the destination point.

Example 2

[0086] The route search apparatus according to the first embodiment determines whether or not a link where the residential area power registered by the user is also a resident-only road can be passed. In the route search device according to the second embodiment, a resident-only road that a user can pass in advance is registered in a database, and the route of a link that is a resident-only road is determined depending on whether or not it is registered in the database during route search. Judgment is made.

[0087] Thereby, even if the destination is not a residence, if there is a resident-only road that can be reached on the way to the destination, a route search using that road can be performed. In the following description, description of the same configuration as in the first embodiment will be omitted.

The route search device 1400 includes a residential area registration unit 1401, a residential area information acquisition unit 1402, an accessible road storage unit 1403, a map information storage unit 1411, a current location information acquisition unit 1414, and a local point input unit 1415. In addition, a route search unit 1416, a display unit 1417, and a force are also configured. In addition to the configuration of the route search device 300 (see FIG. 4) according to the first embodiment, the route search device 1400 is provided with a residence information acquisition unit 1402 and a passable road storage unit 1403.

[0089] The residence information acquisition unit 1402 acquires, from the map information storage unit 1411, information on the resident-only road around the registered residence, when the user's residence is registered by the residence registration unit 1401. . Then, information on the resident exclusive road that the user can pass is stored in the passable road storage unit 1403.

The accessible road storage unit 1403 stores, as a database, information on residential roads that can be accessed by the user acquired by the residence information acquisition unit 1402. The data structure of the database is arbitrary. For example, a unique ID is assigned to each link, and the ID of the link that can be accessed is stored. [0091] The route search unit 1416 includes the traffic condition data stored in the map information storage unit 1411, traffic jam information acquired via the communication IZF316 (see Fig. 3), and the accessible road storage unit 1403. A route from the departure point to the destination point is searched using the stored information on the resident exclusive road through which the user can pass.

[0092] In the configuration of the route searching device 100 according to the embodiment, the road information acquisition unit 101 is based on the map information storage unit 1411, the vehicle information acquisition unit 102 is the residential area registration unit 1401, and the residential area information acquisition. The route search unit 103 is realized by the route search unit 1416 and the notification unit 104 is realized by the display unit 1417 by the unit 1402 and the accessible road storage unit 1403.

FIG. 15 is a flowchart showing a residence information acquisition processing procedure when a residence is newly registered. The processing of the residence information acquisition unit 1402 at the time of residence registration will be described. When the residential area registration unit 1401 registers the residential area (Step S1 501), the residential area information acquisition unit 1402 determines whether the link L facing the registered residential area is a resident-only road (Step S1501). S 1502).

When link L is a resident-only road (step S 1502: Yes), it is registered in the accessible road storage unit 1403 as a resident-only road that can pass through link L (step S 150 3). On the other hand, when the link L is not a resident exclusive road (step S 1502: No), the processing according to this flowchart is terminated. Next, it is determined whether another link Cn (n = l) connected to the link L is a resident-only road (step S1504).

[0095] If the link Cn is not a resident exclusive road (step SI 504: No), the process proceeds to step SI 506. On the other hand, if the link Cn is a resident-only road (step S 1504: Yes), it is registered in the accessible road storage unit 1403 as a resident-only road that can pass through the link Cn (step S 1505).

Then, in step S 1506, it is determined whether there is another link Cn + 1 connected to link L (step S 1506). If link Cn + 1 exists (step S1506: Yes), link Cn + 1 is read as link Cn (step S1507), and the processing after step S1504 is repeated. On the other hand, if there is no link Cn + 1 (step S1506: No), the processing according to this flowchart is terminated. By the procedure as described above, the residence information acquisition unit 1402 acquires information on a resident-only road through which the user can pass and stores it in the passable road storage unit 1403. When there is a resident-only road during the route search, the route search device 1400 determines whether the road can pass based on the information stored in the passable road storage unit 1403.

Next, route search processing performed by the route search unit 1416 will be described. The outline of the route search process performed by the route search unit 1416 is the same as the route search process of the route search apparatus 300 according to the first embodiment described with reference to FIG. 7, but the link is performed in step S707 of FIG. The process for determining whether to add to the candidate is different, and will be described below.

FIG. 16 is a flowchart showing a detailed procedure of the process performed in step S707 of FIG. First, it is determined whether the determination target link is a resident-only road (step S 1601). If it is not a residential road (Step S1601: No), the process proceeds to Step S1603.

[0100] On the other hand, if the road is a resident-only road (step S1601: Yes), it is determined whether the road is a resident-only road (step S1602). Specifically, the determination is made based on whether or not the determination target link is stored in the accessible road storage unit 1403. If the road is a resident-only road that allows traffic (step S1602: Yes), the process proceeds to step S1603. On the other hand, if the road is not a resident-only road (No at Step S1602), the link is not accepted as a candidate that cannot be passed (Step S1604), and the processing according to this flowchart is terminated.

[0101] Next, in step S1603, it is determined whether the determination target link is a prohibited road (step S1603). If the road is not prohibited (step S 1603: No), it is determined whether it is a one-way reverse run (step S 1605). If it is not a one-way reverse run (step S1605: No), it is determined whether the time regulation / seasonal regulation is met (step S1606). If the time regulation / seasonal regulation is not met (step SI 606: No), the link is determined to be a passable link and the candidate is accepted (step S1607), and the processing according to this flowchart is terminated.

[0102] On the other hand, if the road is prohibited (Step S 1603: Yes), if it is a one-way reverse run (Step S 1605: Yes), if it is a time regulation / seasonal regulation (Step SI 606: If any of the cases corresponds to “Yes”, it is determined that the link is not allowed to pass and is not added as a candidate (step S1604), and the processing according to this flowchart ends.

[0103] As described above, the route search apparatus 1400 according to the second embodiment acquires information on the resident-only road that can be breached by the residence information acquisition unit 1402 in advance. For this reason, even if a location registered as a place of residence is not set as a departure point or destination point, a resident-only road through which a user can pass can be used as a route search candidate.

Note that the route search method described in the present embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. This program is recorded on a computer-readable recording medium such as a hard disk, a flexible disk, a CD-ROM, an MO, or a DVD, and is executed by being read by the computer. The program may be a transmission medium that can be distributed via a network such as the Internet.

Claims

The scope of the claims

[1] Road information acquisition means for acquiring information on a restricted road where traffic of the vehicle is restricted and information on a road on which the specific vehicle is allowed to pass among the restricted road, and the vehicle is the specific road Vehicle information acquisition means for acquiring information on whether or not the force corresponds to a vehicle;

Information on the restricted traffic road acquired by the road information acquisition means, information on the road on which the specific vehicle can pass, and information on whether or not the power corresponding to the specific vehicle is acquired by the vehicle information acquisition means And a route search means for searching for a route to the destination point based on

A route search apparatus comprising:

[2] The road through which the specific vehicle can pass is a resident-only road through which the vehicle owned by the resident can pass.

2. The route search device according to claim 1, wherein the vehicle information acquisition unit acquires information regarding whether or not the vehicle owned by the resident is a force corresponding to a vehicle that can pass through the resident exclusive road. .

[3] The vehicle information acquisition means acquires information on a place of residence of the owner of the vehicle,

3. The route search device according to claim 2, wherein the route search means searches for a route to the destination including a resident exclusive road facing the residence.

[4] The road through which the specific vehicle can pass is a road exclusively for a permitted vehicle in which only vehicles permitted to pass can pass.

2. The route search device according to claim 1, wherein the vehicle information acquisition unit acquires information regarding whether or not the vehicle is a force corresponding to a vehicle that can pass through the permitted vehicle exclusive road.

[5] The vehicle information acquisition means acquires information on a road on which the vehicle is permitted to pass, and the route search means includes a route to the destination including the road on which the vehicle is allowed to pass. 5. The route search device according to claim 4, wherein the route search device searches.

6. The route search device according to claim 1, wherein the vehicle information acquisition means can hold in advance a plurality of information related to roads on which the specific vehicle can pass.

[7] When the vehicle information acquisition unit cannot acquire information indicating that the vehicle corresponds to the specific vehicle and cannot search for a route to the destination point by the route search unit, a notification unit that notifies the fact is provided. The route search device according to any one of claims 1 to 6, wherein the route search device is provided.

[8] A road information obtaining step for obtaining information on a restricted road where traffic of the vehicle is restricted and information on a road on which the specific vehicle is allowed to pass among the restricted road; and A vehicle information acquisition step of acquiring information on whether or not the force is applicable to the vehicle;

Information on the restricted traffic road acquired by the road information acquisition step, information on the road on which the specific vehicle can pass, and information on whether or not the force corresponds to the specific vehicle acquired by the vehicle information acquisition step And a route search process for searching for a route to the destination point based on

A route search method comprising:

[9] A route search program that causes a computer to execute the route search method according to claim 8.

[10] A computer-readable recording medium on which the route search program according to claim 9 is recorded.