Route search device, route search method, and computer program

Abstract

To provide a route searching device that can suppress a guidance of routes including a blind alley or a dead end.SOLUTION: A route searching device comprises: a route information storage unit that stores road network data including information on a node, and information on a link linking between the nodes; and a route searching unit that searches for routes from a departure site to a destination site. The route searching unit is configured to, after excluding, from a search object, a terminal link serving as the link in which only one is connected to other link of the nodes located at either end of the link, search for routes from the road network data and cause the searched routes to output.SELECTED DRAWING: Figure 3

Description

Technical Field

[0001] The present invention relates to a route search device, a route search method, and a computer program.

Background Art

[0002] A navigation device that guides a route from a departure point to a destination is known. Since such a navigation device is often mounted on a vehicle and used for guiding the moving route of the vehicle, there is a desire not to search for a route including a dead end or a cul-de-sac where a U-turn of the vehicle occurs.

[0003] In this regard, for example, Patent Document 1 discloses that in a navigation device, when there is first information indicating a dead end within a predetermined section or beyond it, the predetermined section is excluded from the selection setting of the traveling route, so as not to search for a route that cannot be a traveling route. For example, Patent Document 2 discloses that in a navigation device, when a guiding route that makes a U-turn at the end of a cul-de-sac is set, a U-turn guiding image is displayed. For example, Patent Document 3 discloses that in a car navigation device, when it is determined that a road is a cul-de-sac, guidance regarding the cul-de-sac road is provided.

Prior Art Documents

Patent Documents

[0004]

Patent Document 1

Patent Document 2

Patent Document 3

Summary of the Invention

Problems to be Solved by the Invention

[0005] By the way, in recent years, with the spread of Internet shopping, the demand for logistics services has increased, and the number of people engaged in the business of delivering goods such as products to designated delivery destinations (hereinafter also referred to as "delivery persons") has been increasing. From the perspective of business efficiency, delivery persons have a pre-determined area of responsibility and deliver goods to private residences within the area of responsibility. Here, places with many private residences are characterized by many dead ends and cul-de-sacs where vehicle U-turns occur and many intersections compared to ordinary main roads, and there is also a lot of traffic of people and bicycles. Therefore, in particular, in the route search device (navigation device) used in the delivery business, it is required to suppress the guidance of routes including dead ends and cul-de-sacs.

[0006] In this regard, in the navigation device described in Patent Document 1, since the determination of a dead end is made using the first information, there is a problem that a route including a cul-de-sac or a dead end is guided in a place where the first information is not available. In particular, in residential areas with many private residences, the information infrastructure tends to lag behind that of office areas, etc. In the delivery business, it is even more important to suppress the guidance of such routes (routes including cul-de-sacs and dead ends) in such residential areas from the demand side and the safety side. Also, the navigation devices described in Patent Documents 2 and 3 only present information on U-turns and cul-de-sac roads and do not consider suppressing the guidance of routes including cul-de-sacs and dead ends at all. Note that such problems are common not only to the route search devices used in the delivery business but also to the route search devices for general users as described above.

[0007] Therefore, there has been a demand for a route search device capable of suppressing the guidance of routes including cul-de-sacs and dead ends.

Means for Solving the Problems

[0008] The present invention has been made to solve at least a part of the above-described problems and can be realized in the following forms. A route search device, comprising: a route information storage unit that stores road network data including information on nodes and information on links connecting between nodes; and a route search unit that searches for a route from a starting point to a destination via one or more intermediate points. When the route search unit sets a link in which only one of the nodes located at both ends of the link is connected to another link as an end link, even if the intermediate point is set on the end link, the route search unit searches for the route after excluding the end link from the search target in the road network data, and outputs the searched route. In addition, the present invention can also be realized in the following forms.

[0009] (1) According to one aspect of the present invention, a route search device is provided. This route search device includes a route information storage unit that stores road network data including node information and link information connecting between nodes, and a route search unit that searches for a route from a starting point to a destination. The route search unit searches for the route after excluding from the search target end links, which are links in which only one of the nodes located at both ends of the link is connected to another link, from the road network data, and outputs the searched route.

[0010] "Dead end" means a road where only one of both ends of the road is connected to another road. According to this configuration, the route search unit searches for a route after excluding from the search target end links (that is, links corresponding to dead ends), which are links in which only one of the nodes located at both ends of the link is connected to another link, from the road network data. Therefore, it is possible to provide a route search device capable of suppressing guidance of a route including a dead end. Further, according to this configuration, the determination as to whether it is an end link (a link corresponding to a dead end) is made using the connection relationship of the links in the road network data used for route search. Therefore, compared with the case where special information is separately required, it is possible to suppress guidance of a route including a dead end without being affected by the availability of information preparation.

[0011] (2) In the route search device according to the above aspect, the route search unit may search for the route after excluding from the search target, in addition to the end links, specific links in which one of the nodes located at both ends of the link is connected only to the end link, from the road network data. "Dead-end road" means a group of roads that form a bag shape and cannot be passed through. According to this configuration, the route search unit searches for a route from the road network data, excluding, in addition to the end links, specific links where only one of the nodes located at both ends of the link is connected to the end link (i.e., the link for entering the dead-end road). Therefore, a route search device capable of suppressing the guidance of a route including a dead-end road can be provided. Also, according to this configuration, the determination of whether a link is a specific link (the link for entering the dead-end road) is made using the connection relationship of the links in the road network data used for route search. Therefore, compared with the case where special information is separately required, the guidance of a route including a dead-end road can be suppressed without being affected by the availability of information.

[0012] (3) In the route search device of the above form, the route search unit searches for a route from the departure point to the destination via a predetermined waypoint. When a node that is not connected to other links among the nodes located at both ends of the end link is set as the end node, if the link length from the end node to the waypoint is equal to or greater than a predetermined threshold value, the route may be searched without excluding the end link from the search target. In cases where the dead-end road has a long road length even though it is a dead-end, there is a desire to guide a route including the dead-end. In this regard, according to this configuration, when a node that is not connected to other links among the nodes located at both ends of the end link is set as the end node, if the link length from the end node to the waypoint is equal to or greater than a predetermined threshold value, the route search unit does not exclude the end link (the link corresponding to the dead-end) from the search target. Therefore, when the dead-end road has a long road length even though it is a dead-end, the route search unit can guide a route including the dead-end.

[0013] (4) In the route search device of the above form, when the end link is a link facing either the departure point or the destination, the route may be searched without excluding the end link from the search target. If the vehicle is stopped and facing either the departure point or the destination, there is a request to guide a route including the stop. In this regard, according to this configuration, when the end link is a link facing either the departure point or the destination, the route search unit does not exclude the end link (the link corresponding to the stop) from the search target. Therefore, when the vehicle is stopped and facing either the departure point or the destination, the route search unit can guide a route including the stop.

[0014] (5) In the route search device according to the above aspect, when the searched route includes a route in which a certain link makes a U-turn, the route search unit may exclude the link constituting the U-turn route from the search target, re-search the route, and output the re-searched route. In a residential area with many private houses, compared with ordinary main roads, there are many narrow roads where vehicle U-turns occur, and there is also a lot of traffic of people, bicycles, etc. In this regard, according to this configuration, when the searched route includes a route in which a certain link makes a U-turn, the route search unit excludes the link constituting the U-turn route from the search target and re-searches the route and outputs the re-searched route. As a result, according to the route search device of this configuration, furthermore, the guidance of a route including a U-turn route is suppressed, so that the drivability of the guided route can be improved and the safety can be improved.

[0015] (6) In the route search device according to the above aspect, the route search unit may acquire information on one or more delivery destinations where the user of the route search device stops for delivering luggage, and search for a route from the departure point to the destination via the one or more delivery destinations as waypoints. In recent years, with the popularization of Internet shopping, the demand for logistics services has increased, and the number of people (delivery personnel) engaged in the business of delivering goods such as products to designated delivery destinations has been increasing. In this regard, according to this configuration, the route search unit acquires information on one or more delivery destinations where the user (delivery personnel) of the route search device stops by for delivering goods, and searches for a route from the departure point to the destination via one or more delivery destinations as waypoints, thereby providing a route search device specialized for delivery services.

[0016] (7) In the route search device of the above-described embodiment, the route search unit may acquire position information of a parking space that is located near a road and where a vehicle can be parked safely, and that is along the searched route, and in addition to the searched route, cause the acquired position information of the parking space to be output. In the vicinity of a residential area with many private houses, there are fewer parking lots than near ordinary main roads. In this regard, according to this configuration, the route search unit acquires position information of a parking space (a parking space where a vehicle can be parked safely) along the searched route, and causes the position information of the parking space to be output together with the searched route. Therefore, in a residential area with few parking lots, etc., it is possible to prevent the user (delivery personnel) from parking the vehicle on an unsafe road shoulder, thereby improving the convenience and safety of the user.

[0017] Note that the present invention can be realized in various forms, for example, in the forms of a route search device, a navigation device, a navigation system, a computer program for realizing the functions of these devices and systems, a server device for distributing the computer program, a non-transitory storage medium storing the computer program, and the like.

Brief Description of the Drawings

[0018]

Figure 1

Figure 2

Figure 3

Figure 4

Figure 5

Figure 6

Figure 7

Figure 8

Figure 9

Figure 10

Figure 11

Figure 12

Figure 13

Embodiments for Carrying Out the Invention

[0019] A. First Embodiment: FIG. 1 is a diagram showing the schematic configuration of a navigation system 1 as an embodiment of the present invention. The navigation system 1 is a system used by a person engaged in the logistics business, particularly in the business of delivering goods and other parcels to a designated delivery destination (hereinafter also referred to as a "delivery person") as a user. The navigation system 1 exemplified here outputs guidance information including route guidance to the delivery destination of the parcel to be delivered (hereinafter also referred to as "parcel to be delivered") and information about the delivery destination to the user (delivery person), and is used to smooth the delivery operation.

[0020] The navigation system 1 of this embodiment can suppress the guidance of routes including dead ends and cul-de-sacs through the route search process described later. Here, "dead end" means a road where only one of the two ends of the road is connected to another road. Also, "cul-de-sac" means a group of roads that form a bag shape and cannot be passed through.

[0021] The navigation system 1 includes a server 10 and a client 30. The server 10 is connected to the Internet INT by wired communication. The client 30 is connected to the Internet INT by wireless communication via a communication carrier BS. The communication carrier BS includes a transmission / reception antenna, a wireless base station, and an exchange station. That is, the server 10 and the client 30 can communicate with each other via the Internet INT.

[0022] The server 10 uses the delivery plan information 341 (details will be described later) acquired from the client 30 to search for a route (hereinafter also referred to as a "delivery route") in which the delivery destinations of the parcels to be delivered are set as waypoints respectively. The server 10 corresponds to a "route search device". The server 10 includes a CPU 110, a communication unit 120, a ROM / RAM 130, and a storage unit 140, and each unit is connected to each other by a bus (not shown).

[0023] The CPU 110 controls each unit of the server 10 by expanding and executing the computer program stored in the ROM 130 in the RAM 130. The CPU 110 also functions as a route search unit 111. The route search unit 111 is a processing unit that searches for a route from the departure point to the destination using the route information DB 142. The route search unit 111 of this embodiment calculates the above-described delivery route. The communication unit 120 controls communication with other devices such as the client 30 via a communication interface (not shown).

[0024] The storage unit 140 is composed of a hard disk, a flash memory, a memory card, etc. In the storage unit 140, a map information database 141, a route information database 142, and a guidance information database 143 are stored in advance. In the following description, the database is also simply referred to as "DB".

[0025] The map information DB 141 is a database that stores data representing a map image. The data representing the map image includes information necessary for map display, such as terrain, buildings, and the shape of roads. The route information DB 142 is a database in which road network data is stored. The road network data includes node information regarding "nodes" representing the positions of intersections and landmarks such as stations, and link information regarding "links" representing the roads connecting the nodes. The node information includes the position information of the node, the type of the node, the name of the node, and other information of the node. The link information includes the link cost for each means of transportation (the average travel time of the road represented by the link), the type of the link, the name of the link, the state of the link, and other information of the link. The route information DB 142 corresponds to the "route information storage unit".

[0026] The guidance information DB 143 is a database that stores information regarding parking spaces. Here, "parking space" means a place located near a road where a vehicle can be parked safely. The parking spaces in this embodiment are not limited to so-called parking lots. The information regarding parking spaces may include, in addition to the position information of the parking spaces, the type of the parking spaces (such as whether it is a parking lot), the size of the parking spaces, and the time zones when the parking spaces can be used. Note that the guidance information DB 143 may be stored in another server different from the server 10. In that case, the server 10 may connect to the other server as necessary in the processes described later and acquire the information regarding parking spaces.

[0027] The client 30 can be configured as any device such as a personal computer, an in-vehicle device, a wearable device, etc., in addition to the illustrated smartphone. The client 30 includes a CPU 310, a communication unit 320, a ROM / RAM 330, a storage unit 340, an input / output unit 350, and a current location acquisition unit 360, and each unit is interconnected by a bus (not shown).

[0028] By expanding and executing the computer program stored in the ROM 330 in the RAM 330, the CPU 310 controls each part of the client 30 and also functions as a guidance unit 311. The guidance unit 311 transmits delivery plan information 341 to the server 10 and acquires delivery route information 342 from the server 10. The guidance unit 311 uses the acquired delivery route information 342 to output a delivery route (path) from the input / output unit 350, thereby guiding the user of the client 30 about the delivery route.

[0029] The communication unit 320 controls communication with other devices such as the server 10 via a communication interface (not shown).

[0030] The storage unit 340 is composed of a hard disk, a flash memory, a memory card, etc. The delivery plan information 341 is stored in the storage unit 340 in advance. Also, the delivery route information 342 acquired from the server 10 is stored in the storage unit 340 through the processes described later.

[0031] FIG. 2 is a diagram showing an example of the delivery plan information 341. The delivery plan information 341 stores information on the packages to be delivered by the user of the client 30 on that day (hereinafter also referred to as "package information"). As shown in the figure, each package information includes, for example, the delivery destination address, the delivery destination latitude and longitude, the presence or absence of a delivery box at the delivery destination, the nameplate information, the remarks information, the specified delivery time of the package, the availability of using the delivery box, and the leave-at-door information. The leave-at-door information may include the availability of leave-at-door, the specified leave-at-door location, the specified conditions for implementing leave-at-door (date and time, weather, etc.). Note that the package information may include other information not shown.

[0032] Returning to FIG. 1, the description will be continued. The input / output unit 350 is various interfaces used for inputting and outputting information between the client 30 and the user. For example, a touch panel as an input unit, a touch panel as a display unit (output unit), a liquid crystal panel, etc. can be adopted as the input / output unit 350. The current position acquisition unit 360 receives radio waves transmitted from artificial satellites constituting the Global Positioning System (GPS) or the Quasi-Zenith Satellite System (QZSS), and acquires current position information (latitude and longitude) indicating the current position of the client 30. Here, since the client 30 is carried by the user, the current position acquired by the current position acquisition unit 360 can be regarded as the current position of the user.

[0033] 3 is a flowchart showing an example of a processing procedure of the route search process. The route search process is a process executed in the server 10 in order to search for a delivery route. The route search process is started in response to a processing request from the client 30. The processing request from the client 30 includes the delivery plan information 341 described in FIG. 2. In step S100, the route search unit 111 acquires the delivery plan information 341 included in the processing request from the client 30.

[0034] In step S102, the route search unit 111 refers to the delivery plan information 341 acquired in step S100 and performs a route search in which each delivery destination address of the package information 1 to n (n is any natural number) is set as a route point. The departure point at this time may be the current position acquired by the current position acquisition unit 360, or may be a predetermined location (for example, the user's home, a delivery business office, etc.). The arrival point can be a predetermined location (for example, the user's home, a delivery business office, etc.). The route search can be performed using the route information DB 142, using the well-known Dijkstra's algorithm or the well-known A-star search algorithm.

[0035] Here, in step S102, the route search unit 111 excludes the terminal link and the specific link from the search targets according to the following rules a1 to a5. Specifically, in the route information DB 142, for the links corresponding to the terminal link and the specific link, processing such as assigning a maximum cost, correcting the link cost so as not to be selected, and assigning a predetermined flag (hereinafter also referred to as "exclusion processing") is performed to exclude the link from the search targets. Here, the "terminal link" is a link corresponding to a dead end (a road where only one of the two ends of the road is connected to another road). The "specific link" is a link for entering a cul-de-sac (a group of roads forming a bag shape and impassable).

[0036] (a1) The route search unit 111 excludes from the search targets a link in which only one of the nodes located at both ends of the link is connected to another link as a "terminal link". (a2) The route search unit 111 excludes from the search targets a link in which one of the nodes located at both ends of the link is connected only to the terminal link of rule a1 as a "specific link". (a3) Even if the link corresponds to the terminal link of rule a1, when the link length from the node (end node) that is not connected to another link among the nodes located at both ends of the terminal link to the waypoint is equal to or greater than a predetermined threshold, the terminal link is not excluded from the search targets. (a4) Even if the link corresponds to the terminal link of rule a1, when the terminal link faces either the departure point or the destination, the terminal link is not excluded from the search targets. (a5) If all the links correspond to the terminal link of rule a1 or the specific link of rule a2, the terminal link and the specific link are not excluded from the search targets.

[0037] FIG. 4 is a diagram for explaining a specific example of rule a1. FIG. 4(A) shows an example of the search route RT before the exclusion process. FIG. 4(B) shows an example of the search route RTa after the exclusion process. In FIG. 4, the nodes marked with diagonal hatching mean the nodes (end nodes) not connected to other links. This also applies to the figures after FIG. 4. As shown in FIG. 4(A), assume a case where the waypoint WP is set on the link EL. Only one of the nodes N2 and N3 (node N2) located at both ends of the link EL is connected to other links. In such a case, in accordance with rule a1, the route search unit 111 performs an exclusion process on the link EL on the assumption that the link EL corresponds to a terminal link, thereby excluding the link EL from the search target. As a result, as shown in FIG. 4(B), a route RTa that does not include the link EL is calculated. The route RTa is a route that does not include a U-turn on the link EL (refer to the route RT before the exclusion process). Note that, as shown in FIG. 4(B), the route search unit 111 may move the symbol display position of the waypoint WP to the position on the route RTa that is closest to the original position of the waypoint WP (waypoint WPa).

[0038] FIG. 5 is a diagram for explaining a specific example of rule a2. FIG. 5(A) shows an example of a search route RT before the exclusion process. FIG. 5(B) shows an example of a search route RTa after the exclusion process. As shown in FIG. 5(A), it is assumed that a waypoint WP is set on a link L1, and the link L1 is connected to a link EL1 and a link EL2 via a node N3. Only one of the nodes N3 and N5 (node N3) located at both ends of the link EL1 is connected to another link. Similarly, only one of the nodes N3 and N6 (node N3) located at both ends of the link EL2 is connected to another link. Therefore, in accordance with rule a1, the route search unit 111 excludes the links EL1 and EL2 from the search target by performing an exclusion process on the links EL1 and EL2, respectively, assuming that the links EL1 and EL2 correspond to end links. Also, only one of the nodes N2 and N3 (node N3) located at both ends of the link L1 is connected only to the end links (EL1, EL2) of rule a1. Therefore, in accordance with rule a2, the route search unit 111 excludes the link L1 from the search target by performing an exclusion process on the link L1, assuming that the link L1 corresponds to a specific link. As a result, as shown in FIG. 5(B), a route RTa that does not include the links L1, EL1, and EL2 is calculated. It is a route that does not include a U-turn on the link L1 (refer to the route RT before the exclusion process). Note that, similar to FIG. 4, the route search unit 111 may move the symbol display position of the waypoint WP (waypoint WPa).

[0039] FIG. 6 is a diagram for explaining a specific example of rule a3. FIG. 6(A) is a diagram showing a specific example of rule a3. The connection relationship and the waypoint of the link in FIG. 6(A) are the same as those in FIG. 5. On the other hand, in FIG. 6(A), the link length of link EL1 is longer than that in the example of FIG. 5. As described in FIG. 5, link EL1 corresponds to a terminal link. Among the nodes N3 and N5 located at both ends of link EL1, the node N5 that is not connected to other links is called the "end node". For link EL1, the link length A1 from the end node N5 to the waypoint WP is equal to or greater than a predetermined threshold value X1. Therefore, in accordance with rule a3, the route search unit 111 does not perform exclusion processing on link EL1 and does not exclude it from the search target (that is, link EL1 is treated as a link that does not conform to rule a1). The threshold value X1 can be arbitrarily set and may be registered or changed by the user of the client 30. Also, since link L1 does not correspond to a link (specific link) in which one of the nodes N2 and N3 located at both ends of link L1 is connected only to the terminal link of rule a1, no exclusion processing is performed and it is not excluded from the search target.

[0040] FIG. 6(B) is a diagram for explaining a rule that may be further executed in addition to rule a3. In addition to the above-described rules a1 to a5, the route search unit 111 may also determine a link to be excluded from the search target in accordance with the following rule a31. (a31) Even for a link that corresponds to the specific link of rule a2, if the link length from a node (entry node) different from the node connected to the terminal link among the nodes located at both ends of the specific link to the waypoint is equal to or greater than a predetermined threshold value, the specific link is not excluded from the search target.

[0041] The connection relationship and the transit points in FIG. 6(B) are the same as those in FIG. 5. On the other hand, in FIG. 6(B), the link length of link L1 is longer than that in the example of FIG. 5. As described with reference to FIG. 5, link L1 corresponds to a specific link, and links EL1 and EL2 correspond to terminal links. Of the nodes N2 and N3 located at both ends of link L1, a node N2 different from the node N3 connected to the terminal links EL1 and EL2 is called an "entrance node". For link L1, the link length B1 from the entrance node N2 to the transit point WP is equal to or greater than a predetermined threshold value Y1. Therefore, the route search unit 111 does not perform exclusion processing on link L1 in accordance with rule a31 and does not exclude it from the search target (that is, treats link L1 as a link not corresponding to rule a2). The threshold value Y1 can be arbitrarily set and may be registered or changed by the user of the client 30. The threshold value Y1 may be the same value as the threshold value X1 in FIG. 6(A).

[0042] Note that, instead of the above-described rules a3 and a31, the route search unit 111 may determine non-search target links in accordance with the following rules b3 and b31. (b3) Even if a link corresponds to a terminal link of rule a1, if the link length of the terminal link (that is, the link length stored in the route information DB142) is equal to or greater than a predetermined threshold value, the terminal link is not excluded from the search target. (b31) Even if a link corresponds to a specific link of rule a2, if the link length of the specific link (that is, the link length stored in the route information DB142) is equal to or greater than a predetermined threshold value, the specific link is not excluded from the search target.

[0043] Note that, instead of the above-described rules a3 and a31, the route search unit 111 may determine non-search target links in accordance with the following rules c3 and c31. (c3) Even if a link corresponds to a terminal link of rule a1, if the end node of the terminal link is not included in a predetermined area from a predetermined position, the terminal link is not excluded from the search target. (c31) Even if the link corresponds to the specific link of rule a2, if the entry node of the specific link is not included within the predetermined area from the predetermined position, the specific link is not excluded from the search target. The predetermined positions of rules c3 and c31 can be arbitrarily determined. For example, the position of the waypoint WP or the nearest node N3 from the waypoint WP can be used. The predetermined area of rules c3 and c31 means an arbitrary range delimited centering on the predetermined position. For example, a criterion such as within the frame of a virtual circle having a predetermined radius centering on the predetermined position can be used.

[0044] FIG. 7 is a diagram for explaining specific examples of rules a4 and a5. FIG. 7(A) shows a specific example of rule a4. The link connection relationship in FIG. 7(A) is the same as that in FIG. 4. However, in FIG. 7(A), the destination G is set on the link EL. As described in FIG. 4, the link EL corresponds to the terminal link. The link EL is a link facing either the departure point or the destination (the destination G in the illustrated example). Therefore, in accordance with rule a4, the path search unit 111 does not perform exclusion processing on the link EL and does not exclude it from the search target (that is, the link EL1 is treated as a link not corresponding to rule a1). As a result, in the example of FIG. 7(A), a route RT to the destination G on the link EL is calculated.

[0045] FIG. 7(B) shows a specific example of rule a5. The connection relationship and the transit points of the links in FIG. 7(B) are the same as those in FIG. 5. However, in FIG. 7(B), in addition to nodes N5 and N6, nodes N1 and N4 also correspond to the end nodes. Further, in FIG. 7(B), the destination G is set on the link EL3. The link EL3 is a terminal link in which only one of the nodes N1 and N2 (node N2) located at both ends of the link EL3 is connected to another link. Similarly, the link EL4 is a terminal link in which only one of the nodes N2 and N4 (node N2) located at both ends of the link EL4 is connected to another link. Therefore, in accordance with rule a5, the route search unit 111 does not perform exclusion processing on the terminal links EL1, EL2, EL3, EL4, and the specific link L1 and does not exclude them from the search target (that is, the links EL1, EL2, EL3, EL4 are treated as links not corresponding to rule a1, and the link L1 is treated as a link not corresponding to rule a2). As a result, as shown in FIG. 7(B), a route RT including a U-turn on the link L1 is calculated.

[0046] Note that, although the link does not correspond to the above-described terminal link in terms of the connection relationship of the link, the route search unit 111 does not apply rules a1 to a5 to a link that is impassable due to being blocked or restricted.

[0047] In step S104 of FIG. 3, the route search unit 111 determines whether the route obtained in step S102 includes an exclusion target route. Here, the "exclusion target route" can be arbitrarily defined. For example, a U-turn route can be set as the exclusion target route. In this case, the route search unit 111 analyzes the route (link sequence) obtained in step S102, and when the round trip of the same link is included (specifically, when the forward progress of a certain link A and the reverse progress of link A are included), it can be determined that a U-turn route is included. If the exclusion target route is included (step S104: YES), the route search unit 111 transitions the process to step S106. On the other hand, if the exclusion target route is not included (step S104: NO), the route search unit 111 transitions the process to step S108.

[0048] FIG. 8 is a diagram for explaining a specific example of an exclusion target route. Assume that as a result of the route search in step S102, the route RT shown in FIG. 8 is calculated. In this case, the route search unit 111 determines that the route RT includes a U-turn route. Note that in step S104, the route search unit 111 may perform the determination of the exclusion target route in consideration of the link width (road width). For example, when the link width is greater than a predetermined value, the route search unit 111 may determine that it is a large street where a U-turn is possible and determine that the exclusion target route is not included (step S104: NO). This predetermined value serving as a criterion can be arbitrarily determined.

[0049] In step S106, the route search unit 111 performs an exclusion process on the links constituting the exclusion target route, thereby excluding the links constituting the exclusion target route from the search target. Thereafter, the route search unit 111 performs route search again and transitions the process to step S108.

[0050] In step S108, the route search unit 111 generates delivery route information and outputs it by transmitting it to the client 30. Specifically, the route search unit 111 searches the guidance information DB 143 and acquires information on parking spaces (parking space location information, parking space type, parking space size, time zone when the parking space can be used, etc.) along the route (delivery route) searched in step S102 or step S104. Then, the route search unit 111 transmits the route searched in step S102 or step S104 and the acquired parking space information to the client 30 as "delivery route information". Note that the description "step S102 or step S104" means that when the re-search of step S104 is performed, the search result of step S104 is used, and when the re-search of step S104 is not performed, the search result of step S102 is used.

[0051] FIG. 9 is a diagram showing an example of a guidance screen W1 displayed on the client 30. After acquiring the delivery route information from the server 10, the guidance unit 311 of the client 30 outputs a screen W1 for guiding the delivery route to the input / output unit 350. As shown in FIG. 9, the screen W1 includes a map view V1, a delivery destination list view V2, and a guidance view V3.

[0052] In the map view V1, a map is displayed. On the map, a current position symbol PL, a delivery route RT, a delivery destination symbol S1 plotted at the first delivery destination position, a delivery destination symbol S2 plotted at the second delivery destination position, and symbols PS1 to PS3 representing the positions of parking spaces along the delivery route RT are displayed. Here, as shown in the map view V1 of FIG. 9, the first delivery destination S1 is set on the end link. However, as a result of suppressing the calculation of a route including a dead end or a cul-de-sac by the route search process described in FIG. 3, the delivery route RT is a route that does not include the end link facing the delivery destination S1. Here, when the user taps any one of the parking spaces PS1 to PS3, the guidance unit 311 may display the detailed information of the tapped parking space (for example, the type of the parking space, the size of the parking space, the time zone when the parking space can be used, etc.) in a balloon or in any manner such as a separate window. Note that the parking space PS3 exists at a position slightly away from the delivery route RT. In this way, in addition to the information of the parking spaces along the delivery route RT, the route search unit 111 may add the information of the parking spaces around the delivery route RT to the delivery route information (FIG. 3: step S108).

[0053] In the delivery destination list view V2, luggage information regarding the luggage to be delivered (delivery destination address, delivery destination latitude and longitude, presence or absence of a home delivery box at the delivery destination, nameplate information, remarks information, delivery time specification of the luggage, availability of using the home delivery box, leaving package information, etc.) is displayed in a list format. In the guidance view V3, the arrival scheduled time at the first transit point, in other words, the first delivery destination S1, and the distance from the current position PL to the first delivery destination S1 are displayed. Note that the screen W1 shown in FIG. 9 is merely an example, and various changes can be made. For example, the delivery destination list view V2 and the guidance view V3 may be omitted. In this case, for example, when the user taps on the delivery destinations S1, S2, the luggage information regarding the luggage to be delivered to the tapped delivery destination may be displayed in any manner such as a balloon or a separate window. For example, the arrival scheduled time at the first delivery destination S1 and the distance from the current position PL to the first delivery destination S1 may be output by voice, either together with the screen display or instead of the screen display.

[0054] As described above, according to the navigation system 1 of the first embodiment, the route search unit 111 of the server 10 searches for a route after excluding from the search target the end link (that is, the link corresponding to a dead end) in which only one of the nodes located at both ends of the link is connected to another link among the road network data stored in the route information DB142 (step S102: rule a1). Therefore, it is possible to provide a route search device (server 10) capable of suppressing the guidance of a route including a dead end. Further, according to the navigation system 1 of the first embodiment, the determination as to whether or not it is an end link (the link corresponding to a dead end) is made using the connection relationship of the links in the route information DB142 used for route search (rule a1). Therefore, compared with the case where special information is separately required, it is possible to suppress the guidance of a route including a dead end without being affected by the availability of information preparation (FIG. 4).

[0055] Also, according to the navigation system 1 of the first embodiment, the route search unit 111 of the server 10 searches for a route from the road network data stored in the route information DB 142, excluding a specific link (i.e., a link for entering a dead end) in which only one of the nodes located at both ends of the link is connected only to the dead end link, in addition to the dead end link (step S102: rule a2). Therefore, it is possible to provide a route search device (server 10) that can suppress the guidance of a route including a dead end. Also, according to the navigation system 1 of the first embodiment, the determination as to whether a link is a specific link (a link for entering a dead end) is made using the connection relationship of the links in the route information DB 142 used for route search (rule a2). Therefore, compared with the case where special information is separately required, the guidance of a route including a dead end can be suppressed without being affected by the availability of information preparation (Fig. 5).

[0056] In the case where the road length is long even at a dead end, there is a demand to guide a route including the dead end. In this regard, according to the navigation system 1 of the first embodiment, when the route search unit 111 of the server 10 sets a node not connected to other links among the nodes located at both ends of the dead end link as the end node, if the link length from the end node to the waypoint is equal to or greater than a predetermined threshold value, the dead end link (the link corresponding to the dead end) is not excluded from the search target (step S102: rule a3). Therefore, the route search unit 111 can guide a route including the dead end when the road length is long even at the dead end (Fig. 6(A)).

[0057] If the vehicle is stopped and facing either the departure point or the destination, there is a request to guide a route including the stop. In this regard, according to the navigation system 1 of the first embodiment, when the end link is a link facing either the departure point or the destination, the route search unit 111 of the server 10 does not exclude the end link (the link corresponding to the stop) from the search target (step S102: rule a4). Therefore, when the vehicle is stopped and facing either the departure point or the destination, the route search unit 111 can guide a route including the stop (Fig. 7(A)).

[0058] In a residential area with many private houses, compared with ordinary main roads, there are many narrow roads where U-turns of vehicles occur, and there is also a lot of traffic of people and bicycles. In this regard, according to the navigation system 1 of the first embodiment, when the searched route includes a route for making a U-turn at a certain link, the route search unit 111 of the server 10 excludes the links constituting the U-turn route from the search target and then re-searches the route and outputs the re-searched route (steps S104, S106, Fig. 8). As a result, according to the route search device (server 10), further, the guidance of the route including the U-turn route is suppressed, so that the drivability of the guided route can be improved and the safety can be improved.

[0059] In recent years, with the popularization of Internet shopping, the demand for logistics services has increased, and the number of people (delivery persons) engaged in the business of delivering goods such as commodities to designated delivery destinations has been increasing. In this regard, according to the navigation system 1 of the first embodiment, the route search unit 111 of the server 10 acquires information on one or more delivery destinations where the user of the route search device (server 10) stops for delivering goods (step S100), and searches for a route from the departure point to the destination via one or more delivery destinations as waypoints (step S102). Therefore, a route search device specialized for delivery services can be provided.

[0060] In addition, in the vicinity of a residential area where there are many private houses, there are fewer parking lots than in the vicinity of ordinary main roads. In this regard, according to the navigation system 1 of the first embodiment, the route search unit 111 of the server 10 acquires the position information of the parking spaces (parking spaces where vehicles can be parked safely) along the searched route (step S108), and outputs the position information of the parking spaces together with the searched route (Fig. 9). Therefore, in a residential area with few parking lots, etc., it is possible to prevent users from parking their vehicles on the unsafe road shoulders, so that the convenience and safety of the users can be improved.

[0061] B. Second Embodiment: Fig. 10 is a diagram showing the schematic configuration of the navigation system 1A of the second embodiment. The navigation system 1A of the second embodiment includes a server 10A instead of the server 10 in the configuration described in the first embodiment. In the second embodiment, the content of the route search process executed in the server 10A is different from that of the first embodiment.

[0062] Fig. 11 is a flowchart showing an example of the processing procedure of the route search process of the second embodiment. The CPU 110A of the server 10A has a route search unit 111A instead of the route search unit 111. The route search unit 111A executes the route search process shown in Fig. 11. The route search process in Fig. 11 is the same as the route search process in Fig. 3, except that steps S104 and S106 (re-search when the route to be excluded is included) are not executed.

[0063] As described above, the configuration of the navigation system 1A can be variously changed, and the re-search when the route to be excluded is included may be omitted. Also, with the navigation system 1A of the second embodiment as described above, the same effects as those of the first embodiment described above can be achieved. Further, according to the navigation system 1A of the second embodiment, the processing load on the server 10A can be reduced, and the time from when a processing request is made from the client 30 until a response is made by the server 10 (step S108 in Fig. 11: transmission of the delivery route) can be shortened.

[0064] C. Third Embodiment: FIG. 12 is a diagram showing a schematic configuration of the navigation system 1B according to the third embodiment. The navigation system 1B according to the third embodiment includes a server 10B instead of the server 10 in the configuration described in the first embodiment, and does not include the client 30. The server 10B according to the third embodiment executes processing without cooperating with the client 30.

[0065] In addition to the map information DB 141, the route information DB 142, and the guidance information DB 143, the storage unit 140B of the server 10B further stores delivery plan information 144 in advance. The content of the delivery plan information 144 is the same as that of the delivery plan information 341 described in FIG. 2. Further, as a result of the route search process (FIG. 3), the delivery route information 145 is stored in the storage unit 140B. The CPU 110B of the server 10B has a route search unit 111B instead of the route search unit 111. The route search unit 111B acquires the delivery plan information 144 from the storage unit 140B in step S100 of the route search process (FIG. 3). Further, in step S108 of the route search process (FIG. 3), the route search unit 111B stores the generated delivery route information in the delivery route information 145.

[0066] Thus, the configuration of the navigation system 1B can be variously changed, and the server 10B may output the generated delivery route information to the storage unit 140B of the server 10B. Further, the server 10B may acquire the delivery plan information 144 from other devices or servers connected via a network. Similarly, the server 10B may output the delivery route information generated by the route search process (FIG. 3) to other devices or servers connected via a network. The navigation system 1B according to the third embodiment can also achieve the same effects as those of the first embodiment described above.

[0067] D. Fourth Embodiment: FIG. 13 is a diagram showing a schematic configuration of the navigation system 1C according to the fourth embodiment. The navigation system 1C according to the fourth embodiment includes a client 30C instead of the client 30 in the configuration described in the first embodiment, and does not include the server 10. The client 30C according to the fourth embodiment executes processing without cooperating with the server 10. In this embodiment, the client 30C corresponds to the "route search device".

[0068] In addition to the delivery plan information 341 and the delivery route information 342, the storage unit 340C of the client 30C further stores a map information DB 343, a route information DB 344, and a guidance information DB 345 in advance. The map information DB 343 is the same as the map information DB 141 described in FIG. 1. The route information DB 344 is the same as the route information DB 142 described in FIG. 1. The guidance information DB 345 is the same as the guidance information DB 143 described in FIG. 1. The CPU 310C of the client 30C further includes a route search unit 312 in addition to the guidance unit 311. The route search unit 312 is a functional unit that performs the same processing as the route search unit 111 described in FIGS. 1 and 3.

[0069] As described above, the configuration of the navigation system 1C can be variously changed, and the client 30C may be configured as a route search device. Note that the map information DB 343, the route information DB 344, and the guidance information DB 345 may be stored in an external data server, and the route search unit 312 may connect to the data server each time in the process of FIG. 3 to acquire necessary data. Further, in the client 30C whose processing ability is inferior to that of the server 10 (FIG. 1), in order to execute the route search process (particularly, step S102 in FIG. 3), restrictions may be imposed on the search speed and the search distance range in the route search process. Also, the navigation system 1C according to the fourth embodiment can achieve the same effects as those of the first embodiment described above.

[0070] E. Modification example: In the above embodiment, part of the configuration that was implemented by hardware may be replaced with software, and conversely, part of the configuration that was implemented by software may be replaced with hardware. Other modifications are possible as follows.

[0071] · Modification Example 1: In the above embodiment, an example of the configuration of the navigation system, server, and client was shown. However, the configuration of each device can adopt any aspect arbitrarily. For example, at least a part of each DB possessed by the server and the client may be stored in another device other than itself (including an external server connected via the Internet).

[0072] In the above embodiment, the navigation system was assumed to be a system that guides a delivery route, in other words, a system used in the delivery business. However, the navigation system can be constructed as a system for general users who perform normal route guidance, not limited to the delivery business.

[0073] · Modification Example 2: In the above embodiment, for the route search process (Figs. 3 and 11), an example of the processing procedure was given and explained. However, these processing procedures can be variously changed, and the processing content in each step can be added, omitted, or changed, and the execution order of each step can also be changed.

[0074] For example, in step S102, rules a1 to a5 for excluding the terminal link and the specific link from the search targets were exemplified. However, one or more of these rules a1 to a5 may be adopted in any combination. For example, only rule a1 may be executed, or rule a1 and rule a3 may be executed in combination.

[0075] For example, in step S108, it is assumed that the delivery route information includes the route searched in step S102 or step S104 and the information on the parking space. However, the information on the parking space may be omitted. Further, the delivery route information may include other information.

[0076] ·Modification Example 3: The present invention is not limited to the above-described embodiments, examples, and modification examples, and can be realized in various configurations without departing from the spirit thereof. For example, the technical features in the embodiments, examples, and modification examples corresponding to the technical features in each form described in the summary of the invention can be appropriately replaced or combined in order to solve some or all of the above-described problems or to achieve some or all of the above-described effects. Further, if the technical feature is not described as essential in this specification, it can be appropriately deleted.

Explanation of Reference Numerals

[0077] 1, 1A~1C… Navigation system 10, 10A, 10B… Server 30, 30C… Client 110, 110A, 110B… CPU 111, 111A, 111B… Route search unit 120… Communication unit 130… ROM / RAM 140, 140B… Storage unit 141… Map information DB 142… Route information DB 143… Guidance information DB 144… Delivery plan information 145… Delivery route information 310, 310C… CPU 311… Guidance unit 312… Route search unit 320… Communication unit 330… ROM / RAM 340, 340C… Storage unit 341… Delivery plan information 342… Delivery route information 343… Map information DB 344… Route information DB 345… Guidance information DB 350… Input / output unit 360… Current position acquisition unit

Claims

1. A route search device, comprising: a route information storage unit that stores road network data including node information and link information connecting between nodes; a route search unit that searches for a route from a starting point to a destination via one or more waypoints; and is provided with: wherein the route search unit: when a link in which only one of the nodes located at both ends of the link is connected to another link is defined as an end link, even if the waypoint is set on the end link, searches for the route from the road network data with the end link excluded from the search target, and outputs the searched route. A route search device.

2. The route search device according to claim 1, wherein the route search unit searches for the route from the road network data with a specific link in which one of the nodes located at both ends of the link is connected only to the end link excluded from the search target in addition to the end link. A route search device.

3. The route search device according to claim 1 or claim 2, wherein the route search unit searches for the route without excluding the end link from the search target when the end link is a link facing either the starting point or the destination. A route search device.

4. The route search device according to any one of claims 1 to 3, wherein the route search unit, when the waypoint is set on the end link, moves the symbol display position of the waypoint displayed on the guidance screen of the searched route to the position on the searched route that is closest to the position of the waypoint. A route search device.

5. The route search device according to any one of claims 1 to 4, wherein the route search unit: acquires information on one or more delivery destinations where the user of the route search device stops for luggage delivery, and searches for the route from the starting point to the destination via the one or more delivery destinations as the waypoints. A route search device.

6. The route search device according to claim 5, wherein the route search unit: acquires position information of a parking space that is located near a road and where it is possible to safely park a vehicle, and the position information of the parking space along the searched route, and outputs the acquired position information of the parking space in addition to the searched route. A route search device.

7. A route search method, wherein an information processing apparatus executes a step of searching for a route from a starting point to a destination via one or more waypoints using road network data including information on nodes and information on links connecting the nodes, in the step of searching, when a link in which only one of the nodes located at both ends of the link is connected to another link is defined as an end link, even if the waypoint is set on the end link, the route is searched from the road network data with the end link excluded from the search targets, and the searched route is output.

8. A computer program for causing an information processing apparatus to execute a step of searching for a route from a starting point to a destination via one or more waypoints using road network data including information on nodes and information on links connecting the nodes, in the step of searching, when a link in which only one of the nodes located at both ends of the link is connected to another link is defined as an end link, even if the waypoint is set on the end link, the route is searched from the road network data with the end link excluded from the search targets, and the searched route is output.

Images