JP7609566B2 - Computer Systems - Google Patents

Description

One aspect of the present disclosure relates to a computer system, a processing method, a program, and/or a data structure.

Patent document 1 describes a route search device that searches for route information representing links of a route to a destination based on hierarchical network data in which corresponding transfer nodes in multiple networks are connected by links.

JP 2012-58157 A

The aim is to enable flexible searches regarding changes in transportation means.

A computer system according to an aspect of the present disclosure includes a processor. The processor executes a search for a change in a transportation means at a transportation node based on map data showing a plurality of constituent facilities corresponding to each of a plurality of transportation means constituting a transportation node reachable by the plurality of transportation means, and enabling identification of one of the plurality of constituent facilities as a facility representing the transportation node, thereby generating a route including information on the change, information on the constituent facilities among the plurality of constituent facilities corresponding to the transportation means before the change, and information on the constituent facilities among the plurality of constituent facilities corresponding to the transportation means after the change. At the transportation node, a transfer is possible from a first transportation means to a second transportation means different from the first transportation means. The processor searches for a first constituent facility corresponding to the first transportation means, searches for a transportation node corresponding to the searched first constituent facility, and searches for a second constituent facility corresponding to the second transportation means constituting the transportation node.

FIG. 1 is a diagram showing an example of a transportation hub. FIG. 1 is a diagram illustrating an example of a route search system according to an embodiment. FIG. 2 illustrates an example of a hardware configuration of a server. FIG. 2 is a diagram illustrating an example of map data. FIG. 2 is a diagram illustrating an example of map data. FIG. 2 is a diagram illustrating an example of map data. FIG. 2 is a diagram illustrating an example of map data. 4 is a flowchart showing an example of an operation of the route search system according to the embodiment. FIG. 11 is a diagram illustrating an example of a route search. FIG. 11 is a diagram illustrating an example of a route search. FIG. 11 is a diagram illustrating an example of a route search. 13 is a flowchart showing an example of a process related to a change of a means of transportation. FIG. 1 illustrates an example of a transportation node having four layers. FIG. 14 is a diagram showing an example of map data corresponding to FIG. 13;

Embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings. In the description of the drawings, identical or equivalent elements are given the same reference numerals, and duplicate descriptions will be omitted.

[System Overview]
In this embodiment, as an example, a computer system according to the present disclosure is applied to a route search system 1. The route search system 1 according to the embodiment is a computer system that searches for a travel route from a starting point to a destination specified by a user and provides the travel route to the user. The user refers to a person who obtains information using a computer system according to the present disclosure, such as the route search system 1. The starting point refers to a place set as a starting point for searching a travel route, and the destination refers to a place set as an end point for the search. Both the starting point and the destination are reference points for route search. The travel route refers to information regarding travel from one point to another point. In one example, the travel route can indicate not only the route from the starting point to the destination, but also the attributes of the route (hereinafter referred to as "route attributes"). The route attributes are any information that represents the nature, characteristics, or situation of the route. For example, the route attributes may include at least one of a means of transportation such as a means of transport, a time or cost required to travel the route, a condition of the route (e.g., traffic information), features associated with the route (i.e., feature information), businesses associated with the route (i.e., business information), and service information associated with the route (e.g., advertising information, coupon information, etc.).

A feature is any tangible or intangible object that exists on the ground. A feature may be natural or man-made. For example, features may include mountains, farmland, residential areas, vacant lots, rivers, lakes, oceans, tourist sites, roads, railways, buildings, parks, towers, traffic lights, railroad crossings, pedestrian crossings, footbridges, buoys, etc. Examples of intangible features include areas set up for any purpose (e.g. no photography zones, temporary no-entry zones, etc.), areas where events are held, meeting places, photo spots, etc. Naturally, the types of features are not limited to these.

In one example, the route search system 1 searches for one or more suitable travel routes from options including various transportation facilities or means of transportation and provides the travel routes to the user. In this route search, the route search system 1 may perform a search for a change in travel means. A travel means refers to a method for traveling. A travel means is not limited to a mobile body, and is a concept that includes methods that do not use a mobile body. A travel means may be a public transportation facility or a mobile body operated by a user himself. A travel means may be a ground or underground mobile body, an aerial mobile body, or a water or underwater mobile body. Examples of travel means include walking, bicycles, motorcycles, private cars, buses, taxis, conventional lines, high-speed railways, airplanes, and ferries, but of course, travel means are not limited to these. "Change of travel means" refers to changing from one travel means to another. Corresponding to the fact that the travel means is not limited, the change of travel means is also not limited. Transferring from one travel means to another travel means is an example of a change of travel means. Examples of changes in transportation means include transferring from a taxi to a local train, transferring from one route (railroad line, bus line, etc.) to another route (railroad line, bus line, etc.), changing from a private car to walking, and changing from walking to a local train. "Searching for changes in transportation means" refers to the process of finding information related to changes in transportation means. Searching for transfer methods is an example of a search for changes in transportation means.

In relation to the change of the means of transportation, the route search system 1 executes processing related to the transport node. A transport node is a place where the change of the means of transportation is implemented (in other words, a place where the means of transportation changes). More specifically, a transport node is a place where multiple homogeneous or heterogeneous transport means are connected. A transport node is associated with at least two constituent facilities. A constituent facility is a facility used by a user to change the means of transportation. The constituent facilities are processed by the route search system 1 as elements that constitute a transport node. Examples of constituent facilities include train stations, bus stops, taxi stands, ports, airports, parking lots, and bicycle parking lots, but are not limited to these. One constituent facility may belong to multiple transport nodes. Therefore, the transport nodes and the constituent facilities are in a many-to-many relationship (in other words, an M:N relationship).

Figure 1 is a diagram showing an example of a transportation node. In this example, a map 200 is shown that includes a subway 210, a conventional line 220, a road network 230, and a road network 240. In map 200, open circles represent constituent facilities, and dashed lines represent transportation nodes. Note that while four transportation nodes are illustrated in Figure 1, there may be additional transportation nodes in map 200.

In this example, the traffic node 251 is composed of subway station A, conventional line station A, and parking lot Pa. At the traffic node 251, people can change their transportation means in various ways, such as transferring between the subway and conventional line, leaving their car in the parking lot and getting on the subway or conventional line, or getting off the subway and walking. The traffic node 252 is composed of conventional line station B and parking lot Pb. At the traffic node 252, people can change their transportation means in various ways, such as getting off the conventional line and getting on their car from the parking lot, or walking to the station and getting on the conventional line. The traffic node 253 is composed of conventional line station C. At the traffic node 253, people can get off the conventional line and walk, or get a car to the station and get on the conventional line. The traffic node 254 is composed of parking lots Pc, Pd, and Pe. People can drive to transportation hub 254, park their car in one of the parking lots, and then walk from the parking lot.

[System Configuration]
2 is a diagram showing an example of the route search system 1. The route search system 1 includes a server 10, which is a computer that provides a travel route to a user. In one example, the server 10 is connected to a map database 20 and one or more user terminals 30 via a communication network.

The server 10 is a computer that executes the main functions of the route search system 1. The server 10 executes a route search based on a request from the user terminal 30, and provides the searched travel route to the user terminal 30. In this route search, the server 10 executes a search regarding changes in the means of transportation.

Figure 2 also shows an example of the functional configuration of the server 10. The server 10 has a communication unit 11 and a search unit 12 as functional modules. The communication unit 11 is a functional module that transmits and receives data to the user terminal 30. Specifically, the communication unit 11 receives a route search request from the user terminal 30, and transmits the searched travel route to the user terminal 30 as a search result. The search unit 12 is a functional module that searches for a travel route.

The computer that functions as the server 10 is not limited. In one example, the server 10 is configured by a large computer such as a business server. FIG. 3 shows an example of the hardware configuration of the server 10. For example, the server 10 has a control circuit 100. In one example, the control circuit 100 has one or more processors 101, a memory 102, a storage 103, a communication port 104, and an input/output port 105. The processor 101 executes an operating system and an application program. The storage 103 is configured by a storage medium such as a hard disk, a non-volatile semiconductor memory, or a removable medium (e.g., a magnetic disk, an optical disk, etc.), and stores the operating system and the application program. The memory 102 temporarily stores a program loaded from the storage 103 or a calculation result by the processor 101. In one example, the processor 101 functions as each functional module of the server 10 by executing a program in cooperation with the memory 102. The communication port 104 performs data communication with other devices via the communication network NW according to an instruction from the processor 101. The input/output port 105 performs input/output of electrical signals between input/output devices (user interfaces) such as a keyboard, mouse, and monitor according to instructions from the processor 101.

The storage 103 stores a program 120 for causing the computer to function as the server 10. The program 120 includes program code for causing the computer to function as the communication unit 11 and the search unit 12. The program 120 may be provided in a state in which it is permanently recorded on a non-transitory recording medium such as a CD-ROM, a DVD-ROM, or a semiconductor memory. Alternatively, the program 120 may be provided via a communication network as a data signal superimposed on a carrier wave.

The server 10 may be composed of one or more computers. When multiple computers are used, a single server 10 is logically configured by connecting these computers to each other via a communication network.

The map database 20 is a non-transient storage medium or storage device that permanently stores the map data 21 required for route search. The map database 20 may be constructed as part of the route search system 1, or may be provided in a computer system separate from the route search system 1.

Map data 21 indicates map elements that constitute a map. The type and expression method of map elements are not limited, and may be designed according to any policy. Examples of map elements include nodes and links. A node refers to a position that characterizes a route, and more specifically, refers to a position where the movement method (e.g., direction, speed, etc.) of a moving object can be changed, or a position where the movement method changes (e.g., a transfer point such as a station, bus stop, or parking lot, an intersection, etc.). A constituent facility belonging to a transportation hub may be a type of node. A link refers to a virtual line that is set to indicate a route, and connects adjacent nodes. The shape of the link may be straight or curved, or may be a combination of straight and curved lines. On the ground, the shape of the link may depend on the shape of the road. The positions at which the nodes and links are set are not limited, and for example, the nodes and links may be set on the ground, underground, in the air, on water, or underwater.

The user terminal 30 is a computer (client terminal) operated by a user. The user terminal 30 may be a fixed terminal or a mobile terminal. Examples of the user terminal 30 include a mobile phone, a smartphone, a tablet terminal, a wearable terminal, or a personal computer, but the type of terminal is not limited to these. Although only one user terminal 30 is shown in FIG. 2, the number of user terminals 30 accessing the route search system 1 is not limited.

[Map data]
The map data 21 is used for route search, and in one example, is used for searching for a route including a change in the means of transportation. The map data 21 expresses the association between a transportation node and at least one constituent facility that constitutes the transportation node. A specific data structure for defining the relationship between the transportation node and the constituent facility is not limited, and may be implemented in any manner. Various examples of the data structure of the map data 21 will be described with reference to Figs. 4 to 7. Figs. 4 to 7 are all diagrams showing an example of the data structure of the map data 21, and more specifically, show data structures related to the transportation node and the constituent facility. Although these examples all show information about one transportation node, it should be noted that there are naturally multiple transportation nodes, and therefore the map data 21 shows information about multiple transportation nodes.

The map data 21A shown in FIG. 4 includes a transport node table 23, a constituent facility table 24, and a transfer table 25. The transport node table 23 is a data table that stores transport node data indicating information about transport nodes. In one example, each record of the transport node data includes a transport node ID that uniquely identifies each transport node, and the name of the transport node (transport node name). The constituent facility table 24 is a data table that stores constituent facility data indicating information about the constituent facility. In one example, each record of the constituent facility data includes a constituent facility ID that uniquely identifies each constituent facility, a transport node ID corresponding to the constituent facility, the name of the constituent facility (facility name), and a representative flag. The representative flag is information indicating whether the constituent facility represents two or more constituent facilities in one transport node, and is indicated by a binary value. In one example, the representative flag is either "1" indicating that the constituent facility is the representative, or "0" indicating that the constituent facility is not the representative. The transfer table 25 is a data table that stores transfer data indicating information about transfers at transportation nodes. In one example, each record of the transfer data includes a transfer ID that uniquely identifies an individual transfer method, and the IDs of two constituent facilities used in the transfer (a first constituent facility ID and a second constituent facility ID).

The constituent facility table 24 is associated with the transport node table 23 by the transport node ID, and this relationship makes it possible to identify the constituent facilities that belong to the transport node. The transfer table 25 is associated with the constituent facility table 24 by two constituent facility IDs, and this relationship makes it possible to identify the transfer methods available at the transport node.

The example in Figure 4 shows that the transportation node "hub Ha" is composed of two constituent facilities, "station Sa" and "parking lot Px", and that it is possible to change the means of transportation between station Sa and parking lot Px. In this example, the constituent facility table 24 includes an information set 24a when station Sa is the representative, and an information set 24b when parking lot Px is the representative. In this way, information on the constituent facilities may include information when a certain constituent facility is the representative and information when another constituent facility is the representative. The number of information sets as shown in Figure 4 is not limited to two, and may be one, three or more. When there are multiple information sets, which information set is used in the route search may be designed arbitrarily.

The map data may be configured as follows. A certain transportation node is composed of four constituent facilities, namely, "Station S1", "Bus stop B1", "Parking lot P1", and "Parking lot P2", with Station S1 being the representative. Another transportation node is composed of four constituent facilities, namely, "Station S1", "Bus stop B1", "Parking lot P2", and "Parking lot P3", with Bus stop B1 being the representative. Parking lot P1 is close to Station S1 but relatively far from Bus stop B1. Parking lot P2 is close to both Station S1 and Bus stop B1. Parking lot P3 is relatively far from Station S1 but close to Bus stop B1. By using the map data in which such distances between the constituent facilities are taken into consideration, the search unit 12 can search for a route that passes through Station S1 and Bus stop B1 as a route for transferring between a train and a bus. The search unit 12 can also search for a route that passes through Parking lot P1 and Station S1 as a route for transferring between a car and a train. Furthermore, the search unit 12 can search for a route that passes through parking lot P3 and bus stop B1 as a route for transferring between a car and a bus.

Map data 21B shown in FIG. 5 includes a transportation node table 23, a destination table 26, and a constituent facility table 24. The destination table 26 is a data table that stores destination data indicating information about destinations at a transportation node. A destination at a transportation node refers to a destination for which a person is heading to the transportation node. In one example, the destination data includes a destination ID that uniquely identifies a combination of a transportation node and a destination, a transportation node ID, and a destination name (destination name). There are no limitations on the way the destination name is expressed, and for example, the destination name may be expressed as a phrase having any meaning, such as a reason for moving or a destination. In map data 21B, each record of the constituent facility data further includes a destination ID.

The destination table 26 is associated with the transport node table 23 by the transport node ID, and this relationship makes it possible to identify the destination at the transport node. The constituent facility table 24 is associated with the destination table 26 by a combination of the destination ID and the transport node ID, and this relationship makes it possible to identify the constituent facility that corresponds to the destination at the transport node.

The example in FIG. 5 shows that the transportation node "Area Hb" is composed of four constituent facilities: "Parking Lot Pf", "Parking Lot Pg", "Parking Lot Ph", and "Parking Lot Pi". Three objectives are set for this area Hb: "Campsite", "Park", and "Nature Observation Center". Parking Lots Pf and Pg correspond to the objective "Campsite", Parking Lot Ph corresponds to the objective "Park", and Parking Lot Pi corresponds to the objective "Nature Observation Center". This correspondence between the objectives and the constituent facilities indicates, for example, that parking lots Pf and Pg are close to the campsite, parking lot Ph is close to the park, and parking lot Pi is close to the nature observation center. Therefore, the correspondence makes it possible to identify convenient constituent facilities according to the objectives.

Map data 21A has a data structure that directly associates transportation nodes with constituent facilities, so the relationship between transportation nodes and constituent facilities is expressed in a two-layer structure in map data 21A. On the other hand, map data 21B has a data structure that associates transportation nodes with objectives, and then associates constituent facilities with those objectives, so the relationship between transportation nodes and constituent facilities is expressed in a three-layer structure in map data 21B. The correspondence between transportation nodes and constituent facilities can be expressed in various data structures, and may be expressed in a structure of four or more layers, for example.

The map data 21C shown in FIG. 6 includes a transportation node table 23, a constituent facility table 24, a transfer table 25, and a period table 27. The period table 27 is a data table that stores period data indicating the effective period of the constituent facility. The effective period of the constituent facility refers to the period during which a person can use the constituent facility. In this disclosure, a constituent facility with a set effective period is also referred to as a "time-limited facility." In one example, each record of the period data includes a period ID that uniquely identifies the record, a constituent facility ID, a start date and time that is the start of the effective period, and an end date and time that is the end of the effective period. The constituent facility data associated with the period data becomes effective at the start date and time and becomes invalid at the end date and time. Such activation may be achieved by adding a record to the constituent facility table, and invalidation may be achieved by deleting a record from the constituent facility table 24. Such record operations may be performed automatically or in accordance with an operator's operation. In addition, the record operations may be performed in the route search system 1 or by another computer system.

The relationship between the transportation node table 23, the constituent facility table 24, and the transfer table 25 is the same as that in the map data 21A. The period table 27 is associated with the constituent facility table 24 by the constituent facility ID, and this relationship makes it possible to identify the validity period of the constituent facility.

The example in FIG. 6 shows that the transportation hub "Hc" is composed of three constituent facilities, "Station Sb," "Bus Stop Ba," and "Temporary Bus Stop Bb," and that it is possible to change the means of transportation between Station Sb, Bus Stop Ba, and Temporary Bus Stop Bb. However, Temporary Bus Stop Bb is a time-limited facility that is valid only from 10:00 on March 1, 2020 to 18:00 on March 15, 2020. This means that data for Temporary Bus Stop Bb can be extracted by the server 10 only during its validity period.

In the example of FIG. 6, the effective period is specified by both the start date and time and the end date and time, but the effective period may be specified by only one of the start date and time and the end date and time. For example, the effective period of a newly established permanent component facility may be specified by only the start date and time, and the effective period of a component facility to be abolished may be specified by only the end date and time.

The map data 21D shown in FIG. 7 includes a transportation node table 23, a constituent facility table 24, a transfer table 25, and a usage attribute table 28. The usage attribute table is a data table that stores usage attribute data indicating the usage attributes of the constituent facilities. The usage attribute of a constituent facility refers to the characteristics or properties related to the usage of the constituent facility. In this disclosure, a constituent facility for which a usage attribute is set is also referred to as an "attribute-limited facility". In one example, each record of the usage attribute data includes a usage attribute ID that uniquely identifies the record, a constituent facility ID, a usage attribute type, a target facility, a user attribute, and a user list. The usage attribute type refers to one or more types of usage attributes that can be referenced in the record. The target facility, user attribute, and user list are all set with values indicating conditions for extracting a constituent facility as a candidate in a route search. At least one value of "target facility", "user attribute", and "user list" is set as the type. When "target facility" is set as the type, the name of the facility that can be specified as a search condition is set as the data item "target facility". When "User Attribute" is set as the type, the data item "User Attribute" is set to a user attribute that can be specified as a search condition. A user attribute is any information that represents the nature, characteristics, or situation of a user. When "User List" is set as the type, the data item "User List" is set to one or more user IDs that can be specified as search conditions. A user ID is an identifier that uniquely identifies an individual user.

The relationship between the transportation node table 23, the constituent facility table 24, and the transfer table 25 is the same as that of the map data 21A. The usage attribute table 28 is associated with the constituent facility table 24 by the constituent facility ID, and this relationship makes it possible to identify the usage attributes of the constituent facilities.

The example in Figure 7 shows that the transportation hub "Hd" is made up of three constituent facilities, "Station Sc," "Bus Stop Bc," and "Bus Stop Bd," and that it is possible to change the means of transportation between Station Sc, Bus Stop Bc, and Bus Stop Bd. However, Bus Stop Bd is an attribute-limited facility that is valid only when the user attributes included in the search conditions correspond to the user attributes of the usage attribute data. This means that data for Bus Stop Bd can be extracted only when the search conditions correspond to the user list for Bus Stop Bd.

As described above, the data structure of the map data 21 is not limited to the examples in FIGS. 4 to 7. For example, both period data and usage attribute data may be associated with a certain component facility. The period table 27 and the usage attribute table 28 may be applied to the map data 21 having the destination table 26. At least one of the period data and the usage attribute data may be associated with the transportation node data. That is, there may be a transportation node that can appear in the search results of a route search only during a specific period, and in this disclosure, such a transportation node is also referred to as a "time-limited transportation node." There may be a transportation node that can appear in the search results of a route search only when it corresponds to a specific usage attribute, and in this disclosure, such a transportation node is also referred to as an "attribute-limited transportation node." The structure of each data table is not limited, and the data structure may be designed according to any policy. For example, at least one of the various data tables described above may be normalized or denormalized according to any policy and stored in one or more data tables.

Each data item of each piece of data may be set statically or dynamically. "Statically set" means that the value is set in advance and will not change without human intervention. On the other hand, "dynamically set" means that the value can be changed without human intervention in response to any event. Dynamic setting is achieved by running a program that controls a given data item on a specific computer. Dynamic setting may be performed by the route search system 1 or by another computer system.

[System procedure]
The operation of the route search system 1 and the route search method according to the present embodiment will be described with reference to Fig. 8. Fig. 8 is a flowchart showing an example of the operation of the route search system 1, and more specifically, the overall flow of the route search is shown as a process flow S1.

In step S11, the communication unit 11 receives a search request from the user terminal 30. The search request is a data signal indicating search conditions for a travel route. The user operates the user terminal 30 to input information necessary for route search and instructs transmission of the information. In response to the operation, the user terminal 30 generates search conditions and transmits a search request indicating the search conditions to the server 10. The communication unit 11 receives the search request. The search conditions indicate at least the departure point and destination specified by the user. The search conditions may further include other data items such as at least one of the departure date and time and the arrival date and time, and at least one intermediate point. The search conditions may further include a data item related to the purpose. The method of expressing the purpose is not limited, and for example, the purpose may indicate any meaning such as the reason for travel or the destination. The search conditions may include a data item related to the user, for example, a user ID, or may further include at least one data item related to a user attribute.

In step S12, the search unit 12 obtains data necessary for route search from the map database 20. In one example, the search unit 12 calculates a geographical range in which one or more travel routes corresponding to the search criteria exist, extracts transportation nodes and constituent facilities located within that geographical range, and obtains data related to the extracted transportation nodes and constituent facilities from the map database 20. There are no limitations on the method of calculating the geographical range, and the search unit 12 may perform the calculation using any algorithm. The transportation nodes and constituent facilities extracted in this process are transportation nodes and constituent facilities that may form a travel route that matches the search criteria.

When a purpose is set for a certain constituent facility, the search unit 12 extracts the constituent facility if the purpose corresponds to the search criteria. For example, when the purpose name indicated in the purpose data corresponds to the purpose of the search criteria, the search unit 12 extracts the constituent facility corresponding to the purpose name. When the purpose name does not correspond to the purpose of the search criteria, the search unit 12 does not extract the constituent facility corresponding to the purpose name.

When a time-limited facility is set, the search unit 12 extracts a time-limited facility that is valid at the search date and time specified from the search conditions. The type of search date and time is not limited, but for example, the search date and time may be any date and time between the departure date and time and the arrival date and time. Hereinafter, the any date and time is also referred to as the "travel date and time". In one example, the search unit 12 specifies the travel date and time from at least one of the departure date and time and the arrival date and time, and the search unit 12 extracts the time-limited facility when the travel date and time is included between the start date and time and the end date and time of the period data of the time-limited facility (i.e., when the travel date and time is within the valid period). If the travel date and time is outside the valid period, the search unit 12 does not extract the time-limited facility. When a time-limited transportation node is set, the search unit 12 extracts a time-limited transportation node that is valid at the travel date and time specified from the search conditions. A specific method for extracting a time-limited transportation node is similar to the method for extracting a time-limited facility.

When an attribute-limited facility is set, the search unit 12 extracts an attribute-limited facility whose usage attribute corresponds to the search criteria. For example, the search unit 12 extracts the attribute-limited facility when the target facility indicated by the usage attribute data of the attribute-limited facility corresponds to the departure point, destination, or intermediate point of the search criteria. When the target facility does not correspond to any of the departure point, destination, and intermediate point, the search unit 12 does not extract the attribute-limited facility. As another example, the search unit 12 extracts the attribute-constituting facility when the user attribute indicated by the usage attribute data of the attribute-limited facility corresponds to the user attribute of the search criteria. When the user attribute of the usage attribute data does not correspond to the user attribute of the search criteria, the search unit 12 does not extract the attribute-limited facility. As yet another example, the search unit 12 extracts the attribute-limited facility when the user list indicated by the usage attribute data of the attribute-limited facility includes the user ID of the search criteria. When the user list of the usage attribute data does not include the user ID of the search criteria, the search unit 12 does not extract the attribute-constituting facility. When an attribute-limited transport node is set, the search unit 12 extracts the transport node if its usage attribute corresponds to the search criteria. The specific method for extracting attribute-limited transport nodes is the same as the method for extracting attribute-limited facilities.

For a given constituent facility, any two of the following elements may be set: purpose, validity period, and usage attribute (at least one of the target facility, user attribute, and user list). In this case, the search unit 12 extracts the constituent facility only if all of these two or more elements match the search conditions. Similarly, for a given transportation node, both the validity period and usage attribute (at least one of the target facility, user attribute, and user list) may be set. In this case, the search unit 12 extracts the transportation node only if both of these elements match the search conditions.

In this way, the search unit 12 can extract transportation nodes and their constituent facilities using various methods. In any case, the search unit 12 obtains data on the extracted transportation nodes and their constituent facilities from the map database 20.

In step S13, the search unit 12 refers to the extracted data and searches for one or more travel routes that satisfy the search conditions. The search unit 12 may search for multiple travel routes, for example, multiple travel routes with different routes, multiple travel routes with the same route but different means of transportation or travel dates and times, or both of these travel routes. The specific search method for each travel route is not limited, and the search unit 12 may search for a travel route using any algorithm. In this search process, the search unit 12 may perform a search for a change in means of transportation. For example, the search unit 12 performs a search for a transfer method. An example of the process for changing the transfer method will be described later as processing flow S2 with reference to FIG. 12.

The order in which steps S12 and S13 are performed is not limited. For example, the search unit 12 may appropriately obtain necessary data from the map database 20 during the search for a travel route. In other words, the search unit 12 may perform step S12 during step S13.

In step S14, the communication unit 11 transmits the search result to the user terminal 30. The search result is a data signal indicating one or more travel routes that have been searched for. In one example, the user terminal 30 receives and displays the search result, so that the user can confirm the search result. The user terminal 30 may output the search result by voice. If the travel route includes a change in the means of transportation, the user can know where to make the change (e.g., where to transfer).

A specific example of a route search based on process flow S1 will be described with reference to Figures 9 to 11. Figures 9 to 11 each show an example of a route search.

The example shown in FIG. 9 corresponds to map data 21B. In this example, it is assumed that the user performs a search to go by car to a park in area Hb. In this case, in step S12, the search unit 12 acquires data in which the traffic node is "area Hb" and the destination name is "park". In one example, the acquired data is traffic node data including a traffic node ID "H00020", destination data including a destination ID "V10002", and constituent facility data including a constituent facility ID "F10023". The search unit 12 performs a route search that includes reference to these data to acquire a travel route that includes a route 301 to drive to parking lot Ph and a route 302 to walk from there to the park. In this route search, the search unit 12 executes a search for changing from car to walking.

By using map data 21B, server 10 can accurately extract constituent facilities that match the purpose indicated in the search conditions. For example, even if a user is not familiar with the area around the destination, the user can input search conditions that include the purpose and obtain parking lots that match the purpose as search results. Based on the example in FIG. 9, a user who wants to go to a park can set the park as a purpose in the search conditions and learn a travel route that leads to a parking lot Ph close to the park as the destination.

The example shown in FIG. 10 corresponds to map data 21C. In this example, it is assumed that the user has specified a search condition for going to stadium X via station Sb. It is also assumed that there is a regular bus from bus stop Ba to stadium X, and a special bus from special bus stop Bb to stadium X depending on the time of year. Example (a) of FIG. 10 shows a case where special bus stop Bb is not available, that is, the travel date and time is outside the validity period of special bus stop Bb. In this case, since special bus stop Bb is invalid in map data 21C, in step S12, the search unit 12 extracts data for bus stop Ba but does not extract data for special bus stop Bb. Therefore, the search unit 12 searches only for travel routes including bus travel 311 from bus stop Ba to stadium X. On the other hand, example (b) of FIG. 10 shows a case where special bus stop Bb is available, that is, the travel date and time is within the validity period of special bus stop Bb. In this case, since temporary bus stop Bb is valid in map data 21C, the search unit 12 extracts data for both bus stop Ba and temporary bus stop Bb in step S12. Therefore, in addition to a travel route that includes bus travel 311, the search unit 12 can also search for another travel route that includes bus travel 312 from temporary bus stop Bb to stadium X.

In the real world, there are constituent facilities such as temporary bus stop Bb that are only installed for a specific period of time. By using map data 21C, server 10 can perform flexible searches that are suited to such real-world situations. Based on the example of FIG. 10, a user can obtain a travel route that passes through temporary bus stop Bb even if the user is not aware that temporary bus stop Bb has been opened.

The example shown in FIG. 11 corresponds to map data 21D. In this example, assume that the user specifies a search condition for going to driving school C via station Sc. If the user is a student of driving school C, the search unit 12 acquires data of bus stop Bd as well as data of bus stop Bc in step S12. Thus, the search unit 12 can search for a travel route including a bus trip 321 from bus stop Bd to driving school C. If the user is not a student of driving school C, the search unit 12 acquires data of bus stop Bc but not data of bus stop Bd in step S12. Thus, the search unit 12 searches for a travel route including, for example, a bus trip 322 from bus stop Bc to bus stop Bx close to driving school C and a walking route 323 from bus stop Bx to driving school C. If the target facility "Driving School C" is set in correspondence with the usage attribute ID "A00010" in the usage attribute data of the map data 21D, the search unit 12 can search for a travel route that includes the bus trip 321, regardless of who the user is.

In the real world, there are places such as driving school C that are mainly used by only certain people. By using map data 21D, server 10 can execute flexible searches that are suited to such real-world situations. Based on the example in FIG. 11, students at driving school C can know the direct route to that place. When the target facility "driving school C" is set in correspondence with the usage attribute ID "A00010", people who are planning to enroll in driving school C can also know the direct route to that place. Depending on the method of setting the usage attribute, it is also possible to provide routes that include transportation for certain people (for example, women-only taxis, women-only night buses, etc.).

The process for changing the mode of transportation will be described with reference to FIG. 12. FIG. 12 is a flowchart showing an example of the process, and more specifically, an example of a search for changing from a first mode of transportation to a second mode of transportation at a certain transportation node is shown as process flow S2. Process flow S2 can be executed at least once in step S13.

In step S21, the search unit 12 identifies the constituent facility that is the end point of the first means of transportation as the first constituent facility. As described above, the method of searching for a travel route is not limited, so the search unit 12 may identify the first constituent facility using any algorithm.

In step S22, the search unit 12 identifies the transport node corresponding to the first component facility, that is, the transport node to which the first component facility belongs. In one example, the search unit 12 first identifies the transport node ID by referring to the component facility data of the first component facility. When the component facility table 24 stores a plurality of information sets, the search unit 12 may identify the transport node ID by referring to the information set in which the first component facility is set as a representative and referring to the component facility data of the first component facility present in the information set. As described above, one component facility may belong to a plurality of transport nodes. In this case, the search unit 12 determines the next second means of transportation by an arbitrary algorithm, and identifies the transport node ID by referring to the component facility data of the first component facility corresponding to the second means of transportation. Next, the search unit 12 refers to the transport node data having the transport node ID. Thus, in one example, the search unit 12 identifies the transport node by referring to the transport node data corresponding to the component facility data of the first component facility.

In step S23, the search unit 12 identifies a constituent facility that corresponds to both the identified transportation node and the second transportation means as a second constituent facility. In one example, the search unit 12 refers to constituent facility data indicating a constituent facility that has the identified transportation node ID and corresponds to the second transportation means, thereby identifying the second constituent facility. This second constituent facility is the starting point of the second transportation means.

In step S24, the search unit 12 searches for a route by the second means of transportation. As described above, the search unit 12 may use any algorithm to search for the route.

As a specific example of the process flow S2, a search for changing from rail to car, assuming map data 21A, will be described. In step S21, the search unit 12 identifies station Sa, which is the end point of the first transportation means, as the first constituent facility. In step S22, the search unit 12 identifies the transportation node ID "H00001" by referring to the constituent facility data of station Sa present in information set 24a, in which station Sa is set as the representative. Then, the search unit 12 refers to the transportation node data having that transportation node ID, that is, the transportation node data of hub Ha. In step S23, the search unit 12 identifies parking lot Px as the second constituent facility by referring to the constituent facility data of parking lot Px, which has transportation node ID "H00001" and corresponds to the second transportation means. In step S24, the search unit 12 searches for a route from parking lot Px to the destination or intermediate point (a transfer point from the second transportation means to another transportation means) by the second transportation means.

In each of map data 21B to 21D, the correspondence between transport nodes and constituent facilities is defined in the same way as in map data 21A. Naturally, therefore, server 10 can execute process flow S2 based on any of map data 21B to 21D. Because map data 21 indicates the relationship between transport nodes and constituent facilities, server 10 can flexibly search for changes in transportation means at those transport nodes.

[effect]
As described above, a computer system according to an aspect of the present disclosure includes a processor that executes a search for a change in transportation means at a transportation node based on map data that shows a plurality of constituent facilities that constitute the transportation node and that identifies one of the plurality of constituent facilities as a facility that represents the transportation node.

The data structure according to one aspect of the present disclosure is a data structure of map data that shows a plurality of constituent facilities that make up a transportation node, and that makes it possible to identify one of the plurality of constituent facilities as a facility that represents the transportation node.

In this respect, map data shows the relationship between transport nodes and their constituent facilities, as well as representative facilities, making it possible to flexibly search for changes in transportation means at those transport nodes.

In a computer system according to another aspect, the map data may include destination data indicating a destination at the transportation node, and constituent facility data indicating a correspondence between the destination and the constituent facility. In a search, the processor may extract constituent facilities that constitute the transportation node and correspond to the destination indicated in the search criteria. Generally, a user heads to a specific location with some purpose in mind. By indicating the purpose of the constituent facilities in the map data, constituent facilities that match the purpose indicated in the search criteria can be accurately extracted.

In a computer system according to another aspect, the map data may include period data indicating the validity period of a time-limited facility among the plurality of constituent facilities. The processor may extract the time-limited facility in the search if the search date and time specified from the search conditions is within the validity period, and may not extract the time-limited facility in the search if the search date and time is outside the validity period. In the real world, some facilities that constitute a transportation hub actually have a limited period of use. By managing such time-limited constituent facilities on the map data, it becomes possible to perform flexible searches that are suited to real-world situations.

In a computer system according to another aspect, the map data may include usage attribute data indicating usage attributes of attribute-limited facilities among a plurality of constituent facilities. The processor may extract the attribute-limited facility in the search if the usage attribute corresponds to the search conditions, and may not extract the attribute-limited facility in the search if the usage attribute does not correspond to the search conditions. In the real world, there are places that are primarily used by only certain people. By managing constituent facilities related to such places on the map data, it becomes possible to perform flexible searches that are suited to real-world situations.

In a computer system according to another aspect, the usage attribute may be represented by at least one of a facility name, a user attribute, and a user list including one or more user IDs. In this case, flexible searches can be performed according to a specific location, a specific user attribute, or a specific user.

[Modification]
The present disclosure has been described in detail above based on the embodiments. However, the present disclosure is not limited to the above embodiments. The present disclosure can be modified in various ways without departing from the spirit and scope of the present disclosure.

As mentioned above, the data structure of the map data is not limited. FIG. 13 is a diagram showing an example of a transportation node having four layers. FIG. 14 is a diagram showing an example of map data corresponding to FIG. 13 as map data 21E. FIG. 13 shows the layer structure of a transportation node corresponding to airport H. The first layer is airport H, and the international terminal and domestic terminal are located on the second layer. For the domestic terminal, the first terminal and the second terminal are located on the third layer. For the first terminal, the first parking lot and the second parking lot are located on the fourth layer, and for the second terminal, the third parking lot and the fourth parking lot are located on the fourth layer.

Each of these facilities can be a representative facility (representative facility) of the transportation node. Data table 211 of map data 21E shows the configuration of the transportation node when each constituent facility is a representative facility. Each record of data table 211 shows the representative facility and its transportation node ID, and the remaining constituent facilities. Each record of data table 212 shows the transportation node ID and transportation node name. Data table 213 shows the parent-child relationships between facilities. Each record of data table 213 includes a parent-child relationship ID that uniquely identifies the parent-child relationship of the facilities, a child ID that is the transportation node ID of the facility located in the lower layer, and a parent ID that is the transportation node ID of the facility located in the higher layer. The four-layer structure shown in FIG. 13 is expressed by map data 21E that includes these data tables 211 to 213.

In the above embodiment, the computer system according to the present disclosure is applied to a client-server system, but the computer system according to the present disclosure may also be applied to a standalone computer.

The computer system, method, and program disclosed herein may be applied to applications other than route search, for example, to technology that provides users with transfer methods at transfer locations.

In this disclosure, the expression "at least one processor executes a first process, executes a second process, ... executes an nth process" or a corresponding expression indicates a concept including cases where the entity executing the n processes from the first process to the nth process (i.e., the processor) changes midway. In other words, this expression indicates a concept including both cases where all n processes are executed by the same processor and cases where the processor changes among the n processes according to an arbitrary policy.

When comparing the magnitude of two numbers within a computer system, either of the two criteria "greater than or equal to" and "greater than" may be used, or either of the two criteria "less than or equal to" and "less than". The choice of criteria does not change the technical significance of the process of comparing the magnitude of two numbers.

The processing procedure of the method executed by at least one processor is not limited to the example in the above embodiment. For example, some of the steps (processing) described above may be omitted, or each step may be executed in a different order. In addition, any two or more of the steps described above may be combined, or some of the steps may be modified or deleted. Alternatively, other steps may be executed in addition to each of the steps described above.

The aspects described in all or part of the above embodiments solve any one of the following problems: appropriate change of transportation means, appropriate route search, improvement of processing speed, improvement of processing accuracy, improvement of usability, improvement of functions using data or provision of appropriate functions, other improvement of functions or provision of appropriate functions, reduction of data and/or program capacity, miniaturization of devices and/or systems, etc., provision of appropriate data, programs, recording media, devices and/or systems, and optimization of the production and manufacturing of data, programs, recording media, devices and/or systems, such as reduction of production and manufacturing costs of data, programs, devices or systems, simplification of production and manufacturing, and shortening of production and manufacturing time.

1...route search system, 10...server, 11...communication unit, 12...search unit, 20...map database, 30...user terminal, 21, 21A, 21B, 21C, 21D, 21E...map data, 23...transportation node table, 24...component facility table, 25...transfer table, 26...destination table, 27...period table, 28...usage attribute table, 120...program.

Claims (5)

A processor is provided.
The processor executes a search for a change in transportation means at the transportation node based on map data that indicates a plurality of constituent facilities corresponding to each of a plurality of transportation means constituting a transportation node that can be reached by the plurality of transportation means and that makes it possible to identify that one of the plurality of constituent facilities is a facility that represents the transportation node, thereby creating a route that includes information regarding the change, information regarding a constituent facility among the plurality of constituent facilities that corresponds to the transportation means before the change, and information regarding a constituent facility among the plurality of constituent facilities that corresponds to the transportation means after the change ,
At the transportation hub, a user can transfer from a first transportation means to a second transportation means different from the first transportation means;
The processor searches for a first constituent facility corresponding to the first transportation means, searches for a transportation node corresponding to the searched first constituent facility, and searches for a second constituent facility corresponding to the second transportation means that constitutes the transportation node . the map data includes destination data indicating a purpose for which a person is heading to the transportation node, and constituent facility data indicating a correspondence between the destination and the constituent facility,
The processor extracts, in the search, constituent facilities that constitute the transportation node and correspond to a purpose specified as a search condition.
2. The computer system of claim 1. the map data includes period data indicating a validity period of a time-limited facility among the plurality of constituent facilities,
The processor,
If the search date and time specified by the search conditions is within the validity period, the time-limited facility is extracted in the search;
If the search date and time is outside the validity period, the time-limited facility is not extracted in the search.
3. A computer system according to claim 1 or 2. the map data includes usage attribute data indicating usage attributes of attribute-limited facilities among the plurality of constituent facilities,
The processor,
extracting the attribute-limited facility in the search if the use attribute corresponds to the search criteria;
If the use attribute does not correspond to the search condition, the attribute-limited facility is not extracted in the search.
A computer system according to any one of claims 1 to 3. The usage attribute is represented by at least one of a facility name, a user attribute, and a user list including one or more user IDs.
5. The computer system of claim 4.

Images