Data structure and node search method

Abstract

This provides a data structure that allows for the search of the optimal pick-up / drop-off location from among multiple candidate locations where vehicles can be used. [Solution] The data, which includes sidewalk network data 11, roadway network data 12, and node data group 13, is used in a search process that searches for multiple node points N1 and N2 near a first point (destination) P1 on the sidewalk network NW1 and calculates the walking costs C1 and C2 required for walking along routes R1 and R2 connecting the first point P1 and each node point N1 and N2, and also calculates the automobile costs C3 and C4 required for traveling along routes R3 and R4 connecting a second point (starting point) P2 on the roadway network NW2 and each node point N1 and N2, and a selection process that selects the node on the route with the smallest sum of walking costs C1 and C2 and automobile costs C3 and C4 from among the multiple node points N1 and N2 that have been searched as the optimal drop-off point.

Description

Technical Field

[0001] The present invention relates to a data structure and a junction point search method.

Background Art

[0002] In large facilities such as parks, concert halls, and stadiums, there are multiple locations (exits) that can be regarded as junction points where the location and the roadway are in contact. In such facilities, for example, there may be confusion in determining which exit to go to pick up a user. Therefore, Patent Document 1 discloses a technique for setting a meeting place when going to pick up a user of a facility by car. According to this technique, by referring to a database of meeting places (pick-up candidate locations), a plurality of meeting place candidates are presented to a user who is a user, and the user is allowed to select a meeting place.

Prior Art Documents

Patent Documents

[0003]

Patent Document 1

Summary of the Invention

Problems to be Solved by the Invention

[0004] <000!025>However, there is a problem that the meeting place selected by the user is not necessarily a suitable place for the meeting in consideration of the travel route from the departure place to the destination place.

[0005] The present invention has been made under the above circumstances, and an object thereof is to provide a data structure and a junction point search method capable of searching for an optimal boarding and alighting point from a plurality of boarding and alighting point candidates where a vehicle can board and alight.

Means for Solving the Problems

[0006] In order to achieve the above object, the data structure according to the first aspect of the present invention is A data structure for data stored in a computer comprising a control unit and a memory unit, wherein the data is used in the memory unit. This is data of a walkway network that users can walk on, and includes walkway network data having location information and cost information for walking on each individual walkway that constitutes the walkway network, This is data of a road network on which automobiles can travel, and includes road network data having location information and cost information for traveling on individual roads that constitute the road network. This includes a set of node data, which consists of data for multiple nodes where sidewalks and roadways meet and where users can get in and out of vehicles, The control unit performs a search process in which it refers to the sidewalk network data, the roadway network data and the node data group to search for multiple node points on the sidewalk network that are close to the destination, calculates the walking cost required to walk the route connecting the destination and each node point, and calculates the automobile cost required to travel the route connecting the starting point on the roadway network and each node point. The control unit performs a selection process to select the node on the route where the sum of the walking cost and the automobile cost is smallest from among the multiple node points that have been searched, as the optimal disembarking point. It is used for this purpose.

[0007] A data structure relating to a second aspect of the present invention is: A data structure for data stored in a computer comprising a control unit and a memory unit, wherein the data is used in the memory unit. This is data of a walkway network that users can walk on, and includes walkway network data having location information and cost information for walking on each individual walkway that constitutes the walkway network, This is data of a road network on which automobiles can travel, and includes road network data having location information and cost information for traveling on individual roads that constitute the road network. This includes a set of node data, which consists of data for multiple nodes where sidewalks and roadways meet and where users can get in and out of vehicles, The control unit performs a search process in which it refers to the sidewalk network data, the road network data and the node data group to search for multiple node points on the sidewalk network that are close to the starting point, calculates the walking cost required to walk the route connecting the starting point and each node point, calculates the automobile cost required to travel the route connecting the destination on the road network and each node point, and calculates the dispatch cost for multiple routes connecting each node point on the road network to the location of an automobile that can be dispatched to that node point. The control unit performs a selection process to select the node on the route where the sum of the walking cost, the automobile cost, and the dispatch cost is smallest from among the multiple node points that have been searched, as the optimal boarding point. It is used for this purpose.

[0008] A node search method according to a third aspect of the present invention is: A node search method performed by a node search system, A search step that refers to data of a pedestrian walkway network, which includes pedestrian walkway network data having location information and cost information for walking on individual walkways constituting the pedestrian walkway network; roadway network data, which includes data of a roadway network where automobiles can travel, which includes location information and cost information for traveling on individual roadways constituting the roadway network; and a group of node data, which are points where pedestrian walkways and roadways meet, where automobiles can get in and out of vehicles, to search for multiple node points on the pedestrian walkway network that are close to the destination, calculates the walking cost required to walk the route connecting the destination and each node point, and calculates the automobile cost required to travel the route connecting the starting point on the roadway network and each node point, A selection step in which, from among the multiple nodes explored, the node on the route where the sum of the walking cost and the automobile cost is smallest is selected as the optimal drop-off point for the automobile, Includes.

[0009] A node search method according to the fourth aspect of the present invention is: A node search method performed by a node search system, A search step that refers to data of a pedestrian walkway network, which includes pedestrian walkway network data having location information and cost information for walking on individual walkways constituting the pedestrian walkway network; roadway network data, which includes data of a roadway network where automobiles can travel, which includes location information and cost information for traveling on individual roadways constituting the roadway network; and a group of node data, which are points where a pedestrian walkway and a roadway meet, where automobiles can get in and out of automobiles, to search for multiple node points on the pedestrian walkway network that are close to the starting point, calculates the walking cost required to walk the route connecting the starting point and each node point, calculates the automobile cost required to travel the route connecting the destination on the roadway network and each node point, and calculates the dispatch cost for multiple routes connecting each node point on the roadway network to the locations of automobiles that can be dispatched to the node point. A selection step in which, from among the multiple nodes explored, the node on the route where the sum of the walking cost, the automobile cost, and the dispatch cost is smallest is selected as the optimal boarding point, Includes. [Effects of the Invention]

[0010] According to the present invention, it is possible to search for the optimal boarding / alighting point from among a plurality of candidate boarding / alighting points where it is possible to get in and out of a vehicle. [Brief explanation of the drawing]

[0011] [Figure 1] This is a block diagram showing the configuration of a node search system according to an embodiment of the present invention. [Figure 2] Figure 1 is a schematic diagram showing a first example of the data structure in the node search system. [Figure 3] (A) is a schematic diagram showing a route from the starting point by car, getting out of the car and heading to the destination. (B) is a schematic diagram showing a route from the starting point on foot, getting into a car and heading to the destination. [Figure 4] This diagram shows an example of a pedestrian walkway network and a roadway network. [Figure 5]It is a block diagram showing the hardware configuration of the node search system in FIG. 1. [Figure 6] It is a flowchart of the node search process. [Figure 7] It is a diagram showing an example of a route of moving from a starting point by car, getting off the car, and heading to a destination. [Figure 8] It is a diagram showing an example of a route of moving from a starting point on foot, getting on a car, and heading to a destination. [Figure 9] (A) is a diagram showing a second example of the data structure. (B) is a schematic diagram showing a state of searching for a node. [Figure 10] (A) is a diagram showing a third example of the data structure. (B) is a schematic diagram showing a state of searching for a node. [Figure 11] (A) is a diagram showing another example of node data. (B) is a schematic diagram showing a state of searching for a node. [Figure 12] It is a schematic diagram showing a state of searching for a node and a vehicle to be dispatched on the condition of not making a U-turn.

Mode for Carrying Out the Invention

[0012] Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings. In each drawing, the same or equivalent parts are denoted by the same reference numerals. In the following embodiments, expressions such as "having", "including", or "containing" also include the meaning of "consisting of" or "composed of".

[0013] The node search system 1 (see FIG. 1) according to the present embodiment is a system that targets an automobile pick-up and drop-off service, optimizes the movement route during automobile pick-up and drop-off, and searches for an optimal boarding or alighting point (boarding point or alighting point) of an automobile. In the present embodiment, for example, as shown in FIG. 2 and the like, mainly, the movement route between the first point P1 and the second point P2 will be described.

[0014] Regarding the movement route during automobile pick-up and drop-off, the following movement routes (1) and (2) can be considered. (1) A route from the starting point by car, getting out of the car and heading to the destination. In this travel route, the user travels by car to near the destination, gets out of the car, and then walks to the destination. In this case, as shown in Figures 2 and 3(A), for example, the second point P2 is the starting point and the first point P1 is the destination. The node search system 1 searches for, for example, the car routes R3 and R4 from the second point P2 to the disembarking points N1 and N2, and the subsequent walking routes R1 and R2 for the user from the nodes N1 and N2 to the first point P1, and selects the optimal disembarking point for the car from among the nodes N1 and N2.

[0015] (2) A route that involves walking from the starting point and then traveling to the destination by car. In this travel route, the user walks along the sidewalk from the starting point to the car boarding location, and then travels along the road to the destination after boarding the car. In this case, as shown in Figures 2 and 3(B), for example, the first point P1 is the starting point, the second point P2 is the destination, and the third point P3 is the location of the available cars 1 and 2. The node search system 1 searches for walking routes R1 and R2 from the first point P1 to the boarding locations at nodes N1 and N2, then car routes R3 and R4 from nodes N1 and N2 to the second point P2, route R5 from car 1 to node N1, route R6 from car 1 to node N2, route R7 from car 2 to node N1, and route R8 from car 2 to node N2. Furthermore, the node search system 1 selects the optimal boarding location for the car from among nodes N1 and N2, and selects the car 1 and 2 to be dispatched to that boarding location. If only one vehicle is available for dispatch, there will be only one location P3, and no vehicle selection will be performed.

[0016] As shown in Figure 1, the node search system 1 according to this embodiment 1 comprises a server device 2, a communication terminal 3, and a dispatch system 4. The server device 2 is a server computer that can connect to a communication network. The communication terminal 3 is a terminal that can connect to a communication network. The communication terminal 3 may be a mobile terminal such as a smartphone, or another terminal device such as a car navigation system. The dispatch system 4 is a computer system that dispatches taxis and the like. The server device 2, the communication terminal 3, and the dispatch system 4 can send and receive data from each other via the communication network.

[0017] The communication terminal 3 is configured to determine whether the travel route to be searched is (1) or (2) as described above. Furthermore, the communication terminal 3 is configured to set the type of travel route to be searched, the departure point and destination, and the current location information of the communication terminal 3 is detected. The communication terminal 3 transmits the setting information of the travel route type, departure point and destination, and the detected current location information to the server device 2. Based on the received travel route type, departure point and destination and current location information, the server device 2 searches for a travel route of (1) or (2) and finds the optimal boarding and alighting point for the vehicle.

[0018] In the case of the travel route described in (2), the dispatch system 4 provides the server device 2 with the current location information of the vehicles that can be dispatched. The location of the vehicles that can be dispatched (current location information) becomes the third point P3 shown in Figure 3(B). The number of vehicles for which current location information is provided can be multiple. For example, as shown in Figure 3(B), the location of car 1 and the location of car 2 each become the third point P3. Based on the received current location information of the vehicles (third point P3), the server device 2 searches for the travel route described in (2) and finds the optimal pick-up point for the vehicles.

[0019] <Server equipment> As shown in Figure 1, the server device 2 is composed of a computer comprising a storage unit 10 and a control unit 20. The storage unit 10 stores data used to search for the travel route of the server device 2 in (1) or (2). The control unit 20 searches for the travel route by referring to the data stored in the storage unit 10. Based on the type, departure point, destination and current location information received from the communication terminal 3 and the current location information of the available vehicles provided by the dispatch system 4, the control unit 20 searches for the travel route in (1) or (2) and searches for the optimal pick-up and drop-off points for the vehicles. In the case shown in Figure 2, either node N1 or node N2 is searched for as the optimal pick-up and drop-off point for vehicles 1 and 2.

[0020] As shown in Figure 1, the storage unit 10 includes sidewalk network data 11, roadway network data 12, and node data group 13. The data structure of the data stored in the storage unit 10, which is used in a server device 2 comprising a control unit 20 and a storage unit 10, will be described below.

[0021] <Pedestrian Network Data> The pedestrian walkway network data 11 is data for the pedestrian walkway network NW1 (see Figure 4) that users can walk on. For example, the pedestrian walkway network NW1, shown by the dotted line in Figure 4, is composed of individual walkways that pedestrians can walk on, connected to one another. The data for each walkway is compiled as walkway data 11a (see Figure 2).

[0022] As shown in Figure 2, the sidewalk data 11a consists of sidewalk ID (IDentification), location coordinates, first connecting sidewalk ID, second connecting sidewalk ID, and cost data. The sidewalk ID is unique identification information assigned to the corresponding sidewalk. The location coordinates are the location coordinates of the corresponding sidewalk. The first connecting sidewalk ID is the ID of one sidewalk connected to the corresponding sidewalk. The second connecting sidewalk ID is the ID of the other sidewalk connected to the corresponding sidewalk. The cost is cost information required to travel along that sidewalk. The cost is basically set to increase as the length of the sidewalk in the direction of travel increases. However, it is not limited to this. The cost may be set to increase not only in terms of the length of the sidewalk, but also in terms of how difficult it is to travel along that sidewalk. The difficulty of traveling along a sidewalk can be determined, for example, by whether the sidewalk includes stairs, has a steep slope, or is very narrow. The cost may be determined by the average time required to travel along this difficult sidewalk. The cost of a sidewalk is determined not by simple distance, but based on the attributes of the sidewalk.

[0023] As described above, the sidewalk network data 11 includes the position coordinates of each sidewalk constituting the sidewalk network NW1, the ID of the connected sidewalk, and information on the cost required for walking.

[0024] <Roadway network data> Roadway network data 12 is data for the roadway network NW2 (see Figure 4) on which automobiles can travel. The roadway network NW2 is composed of individual roadways connected to one another, as shown by the thick solid lines in Figure 4. The data for each individual roadway is compiled as roadway data 12a (see Figure 2).

[0025] As shown in Figure 2, the roadway data 12a consists of roadway ID (IDentification), position coordinates, entry roadway ID, exit roadway ID, and cost data. The roadway ID is unique identification information assigned to the corresponding roadway. The position coordinates are the position coordinates of the corresponding roadway. The entry roadway ID is the ID of the roadway that a vehicle travels on in order to enter the corresponding roadway. The exit roadway ID is the ID of the roadway that a vehicle travels on after exiting the corresponding roadway. The cost is cost information required to travel on that roadway. The cost is set to increase as the length of the roadway in the direction of travel increases. However, it is not limited to this. The cost may be set to increase not only as a length of roadway, etc., but also as the time required to travel on that roadway at a typical speed increases. The cost of a roadway is determined not by simple distance, but based on the attributes of the roadway.

[0026] As described above, the road network data 12 includes the position coordinates of each roadway constituting the road network NW2, the ID of the connected roadway, and information on the cost required for vehicle travel.

[0027] <Node Dataset> The node data group 13 consists of data on points where sidewalks constituting the sidewalk network NW1 and roadways constituting the roadway network NW2 meet, and is data on multiple nodes where users can get in and out of vehicles. When there is a roadway and a sidewalk adjacent to that roadway, the roadway and the sidewalk become a node. Here, "adjacent" means that a roadway and a sidewalk are in a relationship where it is possible for vehicles on the roadway to get in and out of the sidewalk; if it is not possible to get in and out of vehicles, it is not said to "adjacent". For example, in the map shown in Figure 4, node points N1 and N2 are node points close to point SG. As shown in Figure 2, each node is assigned a node ID as identification information. The node data 13a is composed of this node ID, sidewalk ID, and roadway ID.

[0028] <Department Head> As shown in Figure 1, the control unit 20 comprises a search unit 21 and a selection unit 22. As shown in Figures 1 and 2, the search unit 21 refers to the sidewalk network data 11, roadway network data 12, and node data group 13 stored in the storage unit 10 to search for a travel route via a node (for example, node N1, N2 in Figure 4) between a first point P1 in the sidewalk network NW1 and a second point P2 in the roadway network NW2.

[0029] As shown in Figure 3(A), when searching for the travel route described in (1) above, the search unit 21 sets the destination to which the user will go after getting out of the car as the first point P1, and the starting point, which is the location of the car the user will be riding in, as the second point P2. Also, as shown in Figure 3(B), when searching for the travel route described in (2) above, the search unit 21 sets the starting point, which is the user's current location, as the first point P1, sets the destination to which the car will go as the second point P2, and sets the locations of the cars (cars 1 and 2) that can be dispatched to the nodes N1 and N2 as the third point P3. In this way, if there are multiple cars that can be dispatched, the locations of each of the multiple cars that can be dispatched are set as the third point P3.

[0030] As shown in Figure 2, the search unit 21 performs search processing by referring to the sidewalk network data 11, the roadway network data 12, and the node data group 13. When searching for the travel route in (1), in the search processing, the search unit 21 searches for multiple node points N1 and N2 near the first point (destination) P1 in the sidewalk network NW1, for example as shown in Figure 3(A), and calculates the walking costs C1 and C2 required for walking along routes R1 and R2 connecting the first point P1 and the individual node points N1 and N2. Furthermore, as shown in Figure 3(A), the search unit 21 calculates the automobile costs C3 and C4 required for traveling along routes R3 and R4 connecting the second point (starting point) P2 in the roadway network NW2 and the individual node points N1 and N2.

[0031] Even when searching for the travel route described in (2), in the search process, the search unit 21 searches for multiple nodes N1 and N2 near the first point P1 in the pedestrian network NW1, as shown in Figure 3(B), and calculates the walking costs C1 and C2 required for walking along routes R1 and R2 connecting the first point (starting point) P1 and the individual nodes N1 and N2. The search unit 21 also calculates the automobile costs C3 and C4 required for traveling along routes R3 and R4 connecting the second point (destination) P2 in the road network NW2 and the individual nodes N1 and N2, as shown in Figure 3(B). Furthermore, the search unit 21 calculates the dispatch costs C5 to C8 corresponding to multiple routes R5 to R8 connecting the individual nodes N1 and N2 in the road network NW2 and the third point (location of a vehicle that can be dispatched) P3, as shown in Figure 3(B). Thus, when there are multiple vehicles (vehicle 1, vehicle 2) that can be dispatched, the search unit 21 calculates the dispatch costs C5 to C8 corresponding to the multiple routes R5 to R8 connecting individual nodes N1 and N2 in the road network NW2 and individual third points P3.

[0032] For example, as shown in Figures 2 and 3(A), in the case of travel path (1), the selection unit 22 performs a selection process to select the optimal boarding and alighting point for the vehicle from among the multiple node points N1 and N2 that have been searched, based on walking costs C1 and C2 and vehicle costs C3 and C4. In the case of travel path (1), the search unit 21 searches for a path R1+R3 that passes through node point N1 and a path R2+R4 that passes through node point N2. If the sum of the walking costs C1 and vehicle costs C3 of the path R1+R3 that passes through node point N1 is less than the sum of the walking costs C2 and vehicle costs C4 of the path R2+R4 that passes through node point N2, the selection unit 22 selects node point N1 as the optimal alighting point for the vehicle. In other words, the selection unit 22 selects the node of the path with the smallest overall cost as the optimal alighting point.

[0033] Furthermore, as shown in Figures 2 and 3(B), in the case of the travel path in (2), the selection unit 22 performs a selection process to select the optimal boarding point for the vehicle from among the multiple node points N1 and N2 that have been searched, based on walking costs C1 and C2, vehicle costs C3 and C4, and vehicle dispatch costs C5 to C8. In the case of the travel path in (2), the search unit 21 searches for a path R1+R3 that passes through node point N1 and a path R2+R4 that passes through node point N2. Furthermore, the path R5 of vehicle 1 and the path R7 of vehicle 2 are added to the path R1+R3 that passes through node point N1, respectively, to generate the overall paths R1+R3+R5 and R1+R3+R7. Furthermore, the path R6 of vehicle 1 and the path R8 of vehicle 2 are added to the path R2+R4 that passes through node point N2, respectively, to generate the overall paths R2+R4+R6 and R2+R4+R8.

[0034] The selection unit 22 calculates the sums of walking costs, automobile costs, and dispatch costs C1+C3+C5, C1+C3+C7, C2+C4+C6, and C2+C4+C8 for each of the overall routes R1+R3+R5, R1+R3+R7, R2+R4+R6, and R2+R4+R8, respectively. From the nodes N1 and N2, the selection unit 22 selects the node corresponding to the route with the smallest sum of these costs in the overall route. Furthermore, the selection unit 22 determines which of the two cars, 1 and 2, corresponds to the car with the smallest cost among the sums of walking costs, automobile costs, and dispatch costs C1+C3+C5, C1+C3+C7, C2+C4+C6, and C2+C4+C8, and selects the car to be dispatched.

[0035] Thus, if there are multiple vehicles that can be dispatched to a node, the selection unit 22 selects the node on the route with the lowest overall cost from among the multiple searched nodes as the optimal boarding point for the vehicle, and also selects a vehicle from among the multiple vehicles that corresponds to the optimal boarding point. The selection unit 22 selects the node on the route with the lowest sum of walking cost, vehicle cost, and dispatch cost from among the multiple searched nodes as the optimal boarding point. Even if there is only one vehicle that can be dispatched to a node, the dispatch cost from the third point P3 to each node is calculated, and the node is selected taking the dispatch cost into account.

[0036] <Hardware Configuration> The node search system 1 shown in Figure 1 is realized, for example, by a server device 2 and a communication terminal 3 having the hardware configuration shown in Figure 5 executing a software program. Specifically, the server device 2 includes a CPU (Central Processing Unit) 31, which is a processor that controls the entire device; main memory 32 such as RAM (Random Access Memory); external memory 33 consisting of non-volatile memory such as flash memory and hard disk; a communication interface 36 for data communication with the communication terminal 3, etc.; and an internal bus 38 that connects these.

[0037] Program 39 is loaded from external memory 33 into main memory 32 and executed by CPU 31. This enables the functionality of server device 2. During the execution of program 39, CPU 31 communicates data with an external computer via communication interface 36 as needed.

[0038] The functions of server device 2 can be implemented in a computer system consisting of one or more computers, each containing one or more processors and one or more storage devices, including non-temporary storage media. Multiple computers communicate with each other via an interconnected communication network to implement the functions of server device 2. For example, some of the functions of server device 2 may be implemented on one computer, while other functions may be implemented on other computers. The functions of server device 2 may also be implemented on a cloud computer.

[0039] Similarly, the communication terminal 3 shown in Figure 1 is realized by a computer having the hardware configuration shown in Figure 5 executing a software program. Specifically, the communication terminal 3 comprises a CPU (Central Processing Unit) 41, the main memory 42 of the CPU 41, an external memory 43 for storing the program 49, an operating unit 44 which is a device such as a keyboard and mouse, a display 45 which is composed of a display device such as a CRT (Cathode Ray Tube) and an LCD monitor, a communication interface 46 for data communication with other computers, a position sensor 47 for detecting the location information of the communication terminal 3, and an internal bus 48 that connects these.

[0040] Program 49 is loaded from external memory 43 into main memory 42 and executed by the CPU 41. The execution of program 49 is controlled by the operation input of the operation unit 44, and data communication with an external computer is performed via the communication interface 46 as needed, and an image is displayed on the display 45. This realizes the functions of the communication terminal 3. The hardware configuration of the dispatch system 4 is the same as the hardware configuration of the server device 2 and the communication terminal 3 shown in Figure 5.

[0041] Next, we will explain the operation of the server device 2 in the node search system 1, that is, the node search method.

[0042] As shown in Figure 6, in the node search process, first, the search unit 21 acquires the first point P1 and the second point P2 (step S1). Here, the search unit 21 receives the type, departure point, destination and current location information received from the communication terminal 3, and the current location information of the available vehicles provided by the dispatch system 4, and acquires the first point P1 and the second point P2 based on the received data. For example, if the system is set to search for the travel route of (1), as shown in Figure 7, the search unit 21 acquires the location information of the destination G as the first point P1 and the departure point S as the second point P2. Also, for example, if the system is set to search for the travel route of (2), as shown in Figure 8, the search unit 21 acquires the location information of the departure point S as the first point P1, the destination G as the second point P2, and the location of the available vehicles as the third point P3.

[0043] Next, as shown in Figure 2, the search unit 21 refers to the sidewalk network data 11, the roadway network data 12, and the node data group 13 to search for multiple node points (e.g., node points N1, N2) near the first point P1 in the sidewalk network NW1, and calculates the walking costs (e.g., walking costs C1, C2) required to walk along the paths (e.g., paths R1, R2) connecting the first point P1 to each node point (step S2: search step).

[0044] Next, as shown in Figure 3, the search unit 21 calculates the automobile cost required to travel along the routes connecting the second point P2 and each node in the road network NW2 (Step S3: Search Step).

[0045] Next, the search unit 21 determines whether or not it is the travel route of (2) (step S4). If it is the travel route of (2) (step S4; Yes), the search unit 21 obtains the location of a vehicle that can be dispatched to the node as the third point P3 (step S5; search step), and calculates the dispatch costs (e.g., dispatch costs C5 to C8) for each of the multiple routes (e.g., routes R5 to R8) connecting the individual node in the road network NW2 to the third point P3 (step S6).

[0046] After step S6 is executed, or if the travel route is not (step S4; No), the selection unit 22 selects, based on walking cost and automobile cost, and if the travel route is (2), based on walking cost, automobile cost and vehicle dispatch cost, the node on the route with the smallest overall cost from among the multiple nodes that have been searched, as the optimal boarding / alighting point (drop-off point or boarding point) for the automobile (step S7: selection step). At this time, if the travel route is (2) and there are multiple automobiles that can be dispatched, the optimal automobile is also selected.

[0047] Next, the selection unit 22 transmits information about the travel route between the first point P1 and the second point P2, including the selected boarding / alighting point (or the selected vehicle if there are multiple vehicles that can be delivered along the travel route in (2)), to the communication terminal 3 (step S8). The communication terminal 3 displays the received travel route information. After step S8 is completed, the server device 2 terminates the node search process.

[0048] <In the case of travel path (1)> For example, if the system is set to search for the travel route described in (1), and a starting point S and a destination G are set as shown in Figures 3(A) and 7, the search unit 21 acquires location information for the destination G as the first point P1 and the starting point S as the second point P2 (step S1). Furthermore, the search unit 21 searches for junction points N1 and N2 near the destination G in the pedestrian network NW1 and calculates the walking costs C1 and C2 for each, as well as the automobile costs C3 and C4 for the route in the road network NW2 from the starting point S to junction points N1 and N2 (steps S2, S3). Then, the selection unit 22 selects the junction point N1 of the travel route with the smallest total cost (C1+C3, C2+C4) from the starting point S to the destination G as the optimal automobile drop-off point (step S7).

[0049] <In the case of travel path (2)> For example, if the system is set to search for the travel route described in (2), and a starting point S and a destination G are set as shown in Figures 3(B) and 8, the search unit 21 will set the starting point S as the first point P1 and the destination as the second point P2, and acquire their location information (step S1). Furthermore, the search unit 21 will search for nodes N1 and N2 near the starting point S in the pedestrian network NW1, and determine their respective walking costs C1 and C2, as well as the automobile costs C3 and C4 for the route from the second point P2, i.e., the destination, to the nodes N1 and N2 in the road network NW2 (steps S2, S3). Furthermore, the search unit 21 acquires the locations of vehicles (vehicles 1 and 2) that can be dispatched to nodes N1 and N2 as third point P3 (step S5), and calculates the dispatch costs C5 to C8 corresponding to multiple routes R5 to R8 connecting individual nodes N1 and N2 in the road network NW2 to third point P3 (step S6). Then, the selection unit 22 selects node N2 of the travel route with the smallest total cost from departure point S to destination G as the optimal vehicle boarding point (step S4). Here, if multiple vehicles can be dispatched along the travel route in (2), the selection unit 22 selects a vehicle from among the multiple vehicles that corresponds to the optimal boarding point. Specifically, in the example shown in Figure 3(B), the selection unit 22 selects the node from among nodes N1 and N2 that corresponds to the route with the smallest total cost along the entire route. Furthermore, the selection unit 22 determines which of the cars 1 and 2 corresponds to the car with the lowest total cost among the sums of walking cost, automobile cost, and dispatch cost C1+C3+C5, C1+C3+C7, C2+C4+C6, and C2+C4+C8, and will be dispatched.

[0050] In this embodiment, the node search system 1 stores a node data group 13 in the storage unit 10 and searches for nodes N1 and N2 based on the node data group 13. However, it is not limited to this. As shown in Figure 9(A), node IDs may be added to the sidewalk data 11a of the sidewalk network data 11 and to the roadway data 12a of the roadway network data 12. In this case, the same node ID is assigned to the roadway and the sidewalk adjacent to that roadway. Even with such a data configuration, it is possible to search for nodes. In this data structure, the node IDs added to the sidewalk data 11a and roadway data 12a constitute the node data group 13.

[0051] The search unit 21 searches for a node starting from the first point P1. Specifically, as shown in Figure 9(B), the search unit 21 searches for a node in the sidewalk data 11a by following the sidewalk data 11a until the node ID attached to the sidewalk data 11a becomes a number other than None. The search unit 21 can then search the roadway network NW2 using the road with node ID (1010) as a node.

[0052] Furthermore, as shown in Figure 10(A), network-level data assigned to roads may be used as node data 13a instead of node ID. Network-level data is numerical data that indicates the type of roadway, such as 0 for expressways, 1 for national roads, and 2 for general roads.

[0053] The search unit 21 searches for a node starting from the first point P1. Specifically, as shown in Figure 10(B), the search unit 21 searches for a node in the sidewalk data 11a by following the sidewalk data 11a until the network level data attached to the sidewalk data 11a becomes a number other than None. The search unit 21 can then search the roadway network NW2 using roads with network level data of (2) as nodes.

[0054] <Enlargement of the nodal point> In Figure 2, the node data 13a is composed of one sidewalk ID and one roadway ID. However, a common area ID, which is unique common identification information, may be assigned to multiple node points corresponding to multiple adjacent sidewalks and roadways, and the node data 13a may be composed of the common area ID and each node point ID. In the node data 13a shown in Figure 11(A), the node ID_A of sidewalk A and roadway A, and the node ID_B of roadway B, which is the opposite lane of roadway A, and sidewalk B are grouped together as node data 13a with the same common area ID. Also, as shown in Figure 11(B), node N1 is composed of sidewalk A and roadway A, and node N3 is composed of sidewalk B and roadway B.

[0055] In such cases, the search unit 21 searches for all nodes that have the same common area ID as the previously searched node. For example, as shown in Figure 11(B), when searching for nodes from the starting point S (first point P1), node N1 is found first, but the search unit 21 also searches for node N3 on sidewalk B and roadway B, which have the same common area ID as node N1, by referring to node data 13a. As a result, not only node N1 but also node N3 becomes a candidate for the boarding point. In this case, if the sum of walking cost, car cost, and dispatch cost corresponding to the boarding route is smallest for node N3 than for node N1 in terms of the positional relationship between the location of the available car (third point) P3 and the destination (second point P2), node N3 is selected as the boarding point.

[0056] Furthermore, the assignment of a common area ID is not limited to the intersection points of multiple sidewalks and roadways that form opposing lanes. For example, a common area ID may be assigned to intersection points at the front and rear of the roadway in the direction of travel, or to intersection points corresponding to roadways connected across an intersection. In other words, a common area ID can be assigned to intersection points corresponding to multiple roadways and sidewalks within a predetermined area, and as a search process, the intersection point data 13a can be referenced to search for all intersection points that have the same common area ID as the first intersection point searched.

[0057] As such, since the nearest node from the first point P1 is not necessarily the optimal boarding and alighting point, nodes may be searched within a range where the walking cost does not exceed a threshold. In this case, the communication terminal 3 can set the conditions for the range in which nodes are searched, and information indicating the conditions is transmitted from the communication terminal 3 to the server device 2. The search unit 21 searches for nodes within a range where the walking cost does not exceed a threshold value corresponding to the conditions. Note that the search unit 21 may also calculate the total of the multiplication results as the walking cost by multiplying the cost required for each individual sidewalk by a coefficient corresponding to the conditions without changing the threshold value. In this case, if the search range of the nodes is to be narrowed, the value of the coefficient will be greater than 1.0.

[0058] <U-turn countermeasure> Also, in the case of the travel route in (2), it is also possible to ensure that the dispatched vehicle can drop off the user without making a U-turn as much as possible after the user gets on the vehicle. For example, as shown in FIG. 12, among the two vehicles 1 and 2, vehicle 1 makes a U-turn to the destination G after picking up the user at node N2, while vehicle 2 can go straight to the destination G after picking up the user at node N1. In this case, it is desirable to select node N1 and vehicle 2.

[0059] In this case, the selection unit 22 may select the optimal boarding and alighting point and the dispatched vehicle so that the number of right and left turns of the vehicle on the route from the third point P3 to the second point P2 is reduced. For example, when calculating the vehicle allocation cost in the search unit 21, for lanes where the direction of the route from the third point P3 to the node is different from the direction of the route from the node to the second point P2, multiply by a coefficient of 1.0 or more that increases as the angle increases, and accumulate the multiplication results to calculate the vehicle allocation cost. For example, for lanes that are in the opposite direction to the direction of the route from the node to the second point P2, the coefficient is maximized. By doing so, routes and vehicles including U-turns are less likely to be selected.

[0060] <Summary> As described in detail above, the node search system 1 according to this embodiment has data on the nodes between sidewalks and roadways, so it can connect walking routes and automobile routes at the nodes, calculate the cost of the entire route, and select the route with the lowest cost. Therefore, it can search for the optimal pick-up / drop-off point from among multiple candidate pick-up / drop-off points where automobiles can be used. The optimal pick-up / drop-off point is selected based on the cost of traveling through the sidewalks that make up the sidewalk network data 11, the cost of traveling through the roadways that make up the roadway network data 12, or the cost obtained by multiplying those costs by a coefficient, so that the total cost of the entire route is minimized. The coefficient can be determined depending on the user and the circumstances at the time. In this way, it is possible to construct a mechanism in which walking costs, automobile costs, and dispatch costs are increased or decreased according to the user or the circumstances at the time, and these increases or decreases affect the selection of nodes, etc. For example, a different coefficient may be assigned to each available automobile (for example, a coefficient that decreases as the priority of the automobile increases), and the dispatch cost may be calculated by multiplying the roadway cost by that coefficient.

[0061] In this embodiment, walking costs, automobile costs, and dispatch costs are calculated by multiplying a predetermined cost by a coefficient. However, walking costs, automobile costs, and dispatch costs may also be calculated by adding costs corresponding to the user and the circumstances at the time to the predetermined cost.

[0062] According to the node search system 1 of this embodiment, the searchable travel route may be a travel route (1) in which the person travels by car from the starting point, gets out of the car, and goes to the destination, or a travel route (2) in which the person travels on foot from the starting point, gets into a car, and goes to the destination. Furthermore, according to the node search system 1 of this embodiment, even if the travel route is a combination of (1) and (2), the travel route can be searched by combining the search for the travel route of (1) and the search for the travel route of (2).

[0063] Furthermore, according to the node search system 1 of this embodiment, it is possible to select the optimal vehicle not only from the vehicle's pick-up and drop-off points, but also from among multiple vehicles that can be dispatched.

[0064] According to the node search system 1 of this embodiment, it is possible to expand the range for searching for nodes to, for example, a predetermined area, and select the optimal boarding and alighting point. The extent to which the range for searching for nodes is expanded can be set for each user. For example, for users who do not want to walk much, it is possible to set a smaller range for searching for nodes.

[0065] According to the node search system 1 of this embodiment, the route from the location of the dispatched vehicle (third point) P3 to the node (second point) P2 can be set to minimize the number of right and left turns the vehicle makes. In this way, efficient and safe vehicle dispatching without waste becomes possible.

[0066] The hardware and software configurations of the server device 2, communication terminal 3, and dispatch system 4 are examples only and can be changed and modified as needed.

[0067] The core processing portion of the server device 2 and communication terminal 3, which consist of CPUs 31 and 41, main memory 32 and 42, external memory 33 and 43, operation unit 44, display 45, communication interface 36 and 46, position sensor 47, and internal buses 38 and 48, can be implemented using a normal computer system, not a dedicated system. For example, a computer program for performing the above operations may be stored on a computer-readable recording medium (flexible disk, CD-ROM, DVD-ROM, etc.) and distributed, and the server device 2 and communication terminal 3 that perform the above processing may be configured by installing the computer program on a computer. Alternatively, the computer program may be stored on a storage device of a server device on a communication network such as the Internet, and the server device 2, communication terminal 3, and dispatch system 4 may be configured by downloading it from a normal computer system.

[0068] When the functions of the server device 2, communication terminal 3, and dispatch system 4 are realized through a division of labor between the OS (operating system) and application programs, or through cooperation between the OS and application programs, only the application program portion may be stored on a recording medium or storage device.

[0069] It is also possible to superimpose a computer program onto a carrier wave and distribute it via a communication network. For example, a computer program could be posted on a bulletin board system (BBS) on a communication network and distributed via the network. This computer program could then be launched and executed under the control of the OS, similar to other application programs, thereby enabling the aforementioned processing.

[0070] This invention allows for various embodiments and modifications without departing from the broad spirit and scope of the invention. Furthermore, the embodiments described above are for illustrative purposes only and do not limit the scope of the invention. In other words, the scope of this invention is indicated not by the embodiments, but by the claims. Various modifications made within the scope of the claims and the equivalent scope of the meaning of the invention are considered to be within the scope of this invention. [Industrial applicability]

[0071] This invention can be applied to selecting the optimal boarding and alighting points for vehicles along a travel route. [Explanation of Symbols]

[0072] 1 Node search system, 2 Server device, 3 Communication terminal, 4 Vehicle dispatch system, 10 Memory unit, 20 Control unit, 11 Sidewalk network data, 11a Sidewalk data, 12 Roadway network data, 12a Roadway data, 13 Node data group, 13a Node data, 20 Control unit, 21 Search unit, 22 Selection unit, 31 CPU, 32 Main memory, 33 External memory, 36 Communication interface (I / F), 38 Internal bus, 39 Program, 41 CPU, 42 Main memory, 43 External memory, 44 Operation unit, 45 Display, 46 Communication interface (I / F), 47 Position sensor, 48 Internal bus, 49 Program, NW1 Sidewalk network, NW2 Roadway network, N1, N2, N3 Node, P1 First point (destination, departure point), P2 Second point (destination, departure point), P3 Third point (location of available vehicles): R1, R2, R3, R4, R5, R6, R7, R8 Route: C1, C2 Walking cost: C3, C4 Vehicle cost: C5, C6, C7, C8 Vehicle dispatch cost

Claims

1. A data structure for data stored in a computer comprising a control unit and a memory unit, wherein the data is used in the memory unit. This is data of a walkway network that users can walk on, and includes walkway network data having location information and cost information for walking on each individual walkway that constitutes the walkway network, This is data of a road network on which automobiles can travel, and includes road network data having location information and cost information for traveling on individual roads that constitute the road network. This includes a set of node data, which consists of data for multiple nodes where sidewalks and roadways meet and where users can get in and out of vehicles, The control unit performs a search process in which it refers to the sidewalk network data, the roadway network data and the node data group to search for multiple node points on the sidewalk network that are close to the destination, calculates the walking cost required to walk the route connecting the destination and each node point, and calculates the automobile cost required to travel the route connecting the starting point on the roadway network and each node point. The control unit performs a selection process to select the node on the route where the sum of the walking cost and the automobile cost is smallest from among the multiple node points that have been searched, as the optimal disembarking point. The data structure used for the data.

2. A data structure for data stored in a computer comprising a control unit and a memory unit, wherein the data is used in the memory unit. This is data of a walkway network that users can walk on, and includes walkway network data having location information and cost information for walking on each individual walkway that constitutes the walkway network, This is data of a road network on which automobiles can travel, and includes road network data having location information and cost information for traveling on individual roads that constitute the road network. This includes a set of node data, which consists of data for multiple nodes where sidewalks and roadways meet and where users can get in and out of vehicles, The control unit performs a search process in which it refers to the sidewalk network data, the road network data and the node data group to search for multiple node points on the sidewalk network that are close to the starting point, calculates the walking cost required to walk the route connecting the starting point and each node point, calculates the automobile cost required to travel the route connecting the destination on the road network and each node point, and calculates the dispatch cost for multiple routes connecting each node point on the road network to the location of an automobile that can be dispatched to that node point. The control unit performs a selection process to select the node on the route where the sum of the walking cost, the automobile cost, and the dispatch cost is smallest from among the multiple node points that have been searched, as the optimal boarding point. The data structure used for the data.

3. The aforementioned search process includes a process of calculating the dispatch cost for each of the multiple routes connecting the individual nodes in the road network with the locations of multiple vehicles that can be dispatched to the nodes, The selection process involves selecting, from among the searched number of available vehicles, the vehicle whose sum of the walking cost, vehicle cost, and dispatch cost is smallest as the vehicle to be dispatched. Used in The data structure according to claim 2.

4. The aforementioned selection process is used to select the optimal node and the dispatched vehicle so as to minimize the number of right and left turns the vehicle makes along the route from the location of the vehicle that can be dispatched to the node to the destination. The data structure according to claim 3.

5. In the aforementioned node data, a common identification information unique to each node within a predetermined region is assigned. The aforementioned search process involves referring to the node data and searching for all nodes whose searched node and the common identification information are the same. The data structure according to any one of claims 2 to 4.

6. A node search method performed by a node search system, A search step that refers to data of a pedestrian walkway network, which includes pedestrian walkway network data having location information and cost information for walking on individual walkways constituting the pedestrian walkway network; roadway network data, which includes data of a roadway network where automobiles can travel, which includes location information and cost information for traveling on individual roadways constituting the roadway network; and a group of node data, which are points where pedestrian walkways and roadways meet, where automobiles can get in and out of vehicles, to search for multiple node points on the pedestrian walkway network that are close to the destination, calculates the walking cost required to walk the route connecting the destination and each node point, and calculates the automobile cost required to travel the route connecting the starting point on the roadway network and each node point, A selection step in which, from among the multiple nodes explored, the node on the path where the sum of the walking cost and the automobile cost is smallest is selected as the optimal drop-off point for the automobile. A node search method that includes [specific details].

7. A node search method performed by a node search system, A search step that refers to data of a pedestrian walkway network, which includes pedestrian walkway network data having location information and cost information for walking on individual walkways constituting the pedestrian walkway network; roadway network data, which includes data of a roadway network where automobiles can travel, which includes location information and cost information for traveling on individual roadways constituting the roadway network; and a group of node data, which are points where a pedestrian walkway and a roadway meet, where automobiles can get in and out of automobiles, to search for multiple node points on the pedestrian walkway network that are close to the starting point, calculates the walking cost required to walk the route connecting the starting point and each node point, calculates the automobile cost required to travel the route connecting the destination on the roadway network and each node point, and calculates the dispatch cost for multiple routes connecting each node point on the roadway network to the locations of automobiles that can be dispatched to the node point. A selection step in which, from among the multiple nodes explored, the node on the route where the sum of the walking cost, the automobile cost, and the dispatch cost is smallest is selected as the optimal boarding point, A node search method that includes [specific details].

8. In the aforementioned search step, the dispatch cost for each of the multiple routes connecting the individual nodes in the road network to the locations of multiple vehicles that can be dispatched to the nodes is calculated. In the selection step, from among the multiple vehicles that have been searched for and are available for dispatch, the vehicle that has the smallest sum of the walking cost, the vehicle cost, and the dispatch cost is selected as the vehicle to be dispatched. The node search method according to claim 7.

Images