Urban design support device, urban design support method, and urban design support program

Abstract

To easily determine an appropriate position of a traffic base and an appropriate position of a point where a service is provided so as to allow a user to easily use various services at various points.SOLUTION: A storage unit stores a current state graph which represents the current state created in a form of a state graph including a node representing a point, a point function available at the point or a movement method between the points, and edges linking the multiple nodes with a strong relationship in terms of usage. A processing unit acquires a concept graph including a departure point node, a destination point node, and a point function node, supplements the acquired concept graph with a supplemental node, generates an ideal state graph including an additional node representing point functions or movement methods that do not currently exist, and representing such a state that a person existing at the departure point moves to the destination point and can use the point function at the destination point, calculates a difference between the ideal state graph and the current state graph as additional element information and outputs it.SELECTED DRAWING: Figure 1

Description

[Technical field]

[0001] The present invention relates to an urban design support device, an urban design support method, and an urban design support program that calculate information regarding the layout of facilities to be installed in a city. [Background technology]

[0002] In order for city residents to live comfortably, it is desirable for them to be able to easily use various services at various locations. In order for city residents to easily use various services at various locations, transportation hubs such as bus stops and stations where people can get on and off vehicles, and service locations such as supermarkets and government offices need to be appropriately located.

[0003] Therefore, there is a technique for appropriately determining the location of transportation hubs and service locations. For example, the technique described in Patent Document 1 compares the cost of travel using a first transportation facility (such as a train or bus) whose operation schedule is determined in advance with the cost of travel using a second transportation facility (such as a car sharing service or an on-demand shared taxi) that operates according to user requests, and calculates candidate locations for locating boarding and disembarking points for the second transportation facility. By using the technique described in Patent Document 1, it becomes easy to determine locations for locating boarding and disembarking points for the second transportation facility so as to reduce travel costs. [Prior art documents] [Patent documents]

[0004] [Patent Document 1] JP 2019-215798 A Summary of the Invention [Problem to be solved by the invention]

[0005] When locating transportation hubs and service locations so that city residents can easily use various services at various locations, it is necessary to determine appropriate locations for the transportation hubs and service locations. The technology described in Patent Document 1 cannot calculate candidate locations other than the locations where the boarding and disembarking points of the second transportation are located. Therefore, even if the technology described in Patent Document 1 is used, it is not easy to determine appropriate locations for the transportation hubs and service locations so that city residents can easily use various services at various locations.

[0006] Therefore, an object of the present invention is to provide an urban design support device, an urban design support method, and an urban design support program that make it easy to determine appropriate locations for transportation hubs and locations where services are provided, so that city residents can easily use various services at various locations. [Means for solving the problem]

[0007] In order to achieve the above-mentioned object, one aspect of the urban design support device of the present invention is an urban design support device that calculates information regarding the placement of facilities to be installed in a city, comprising a memory unit and a processing unit, wherein the memory unit includes additional nodes that represent currently non-existent location functions or currently non-existent locations, created in the form of a state graph including nodes that represent locations, location functions available at the locations, or methods of travel between the locations, and edges that connect a plurality of the nodes that have a strong relationship in terms of usage, and stores an ideal state graph that represents a state in which a person at the source location can travel to the destination location and use the location functions of the destination location, and a current state graph that represents the current state, and the processing unit calculates the difference between the ideal state graph and the current state graph as additional element information, and outputs the calculated additional element information.

[0008] Moreover, one aspect of the urban design support method in an urban design support device of the present invention is an urban design support method in an urban design support device that includes a storage device and a processor, and the processor calculates information regarding the placement of facilities to be installed in a city, wherein the storage device includes additional nodes that represent currently non-existent location functions or currently non-existent locations, created in the form of a state graph including nodes that represent locations, location functions available at the locations, or methods of travel between the locations, and edges that connect a plurality of the nodes that have a strong relationship in terms of usage, and stores an ideal state graph that represents a state in which a person at the source location can travel to the destination location and use the location functions of the destination location, and a current state graph that represents the current state, and the processor calculates the difference between the ideal state graph and the current state graph as additional element information, and outputs the calculated additional element information.

[0009] Moreover, one aspect of the urban design support program of the present invention is an urban design support program in an urban design support device that includes a storage device and a processor, and the processor calculates information regarding the placement of facilities to be installed in a city, wherein the storage device includes additional nodes that represent currently non-existent location functions or currently non-existent locations, created in the form of a state graph including nodes that represent locations, location functions available at the locations, or methods of travel between the locations, and edges that connect a plurality of the nodes that have a strong relationship in terms of usage, and stores an ideal state graph that represents a state in which a person at the source location can travel to the destination location and use the location functions of the destination location, and a current state graph that represents the current state, and causes the processor to calculate the difference between the ideal state graph and the current state graph as additional element information, and output the calculated additional element information. Effect of the Invention

[0010] Exemplary aspects of the present invention facilitate determining appropriate locations of transportation hubs and service locations so that various services at various locations can be easily utilized.

[0011] Other objects, configurations and advantages than those mentioned above will become apparent from the following description of the embodiments. [Brief description of the drawings]

[0012] [Figure 1] FIG. 1 is a diagram illustrating an example of a functional block diagram of an urban design assistance apparatus according to an embodiment. [Diagram 2] FIG. 2 is a block diagram illustrating an example of a hardware configuration of the urban design assistance apparatus according to the embodiment. [Diagram 3] FIG. 3 is a diagram showing an example of the data configuration of the map information table 234. As shown in FIG. [Figure 4] FIG. 4 is a diagram showing an example of the data configuration of the location relationship information table 235. As shown in FIG. [Diagram 5] FIG. 5 is a diagram showing an example of the data configuration of the node template information table 236. As shown in FIG. [Figure 6] 1 is an explanatory diagram showing an example of a conceptual graph input screen 600 displayed on the user terminal 500 or the output device 25 (monitor) of the urban design support device 1. FIG. [Figure 7] FIG. 7 is a flowchart illustrating an example of an ideal state graph generation process according to the embodiment. [Figure 8] FIG. 8 is an explanatory diagram for explaining a method for selecting, as a supplementary node candidate, a point node within a predetermined range from a starting point node Ni, which is a point node. [Figure 9] FIG. 9 is an explanatory diagram for explaining a method for selecting a point node between two point nodes as a supplementary node candidate. [Figure 10] FIG. 10 is an example of a conceptual graph 1000 displaying potential replenishment nodes. [Figure 11] FIG. 11 is a flowchart illustrating an example of the ideal state graph analysis process according to the embodiment. [Figure 12] FIG. 12 is an explanatory diagram showing an example of an ideal state graph display screen 1200 displayed on the user terminal 500 or the output device 25 (monitor) of the urban design assistance device 1. As shown in FIG. [Figure 13]FIG. 13 is a diagram showing an example of the data configuration of the movement history table 237. As shown in FIG. [Figure 14] FIG. 14 is a diagram showing an example of the data configuration of the second node template information table 236a. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0013] Hereinafter, an embodiment of the present invention will be described with reference to the drawings. However, the present invention is not to be interpreted as being limited to the description of the embodiment shown below. It will be easily understood by those skilled in the art that the specific configuration can be changed without departing from the concept or purpose of the present invention.

[0014] In the configurations of the invention described below, the same or similar configurations or functions are given the same reference numerals, and duplicated explanations are omitted.

[0015] In this specification, the terms "first," "second," "third," and the like are used to identify components and do not necessarily limit the number or order.

[0016] In this specification, as an example of various information, the term "XX table" may be used, but it may also be expressed as a data structure such as an "XX list" or "XX queue." Furthermore, the "XX table" may also be expressed as "XX information." When explaining identification information, the terms "identification information," "identifier," "name," "ID," "number," and the like are used, but these are interchangeable.

[0017] In the embodiments, a process performed by executing a program may be described. Here, a computer executes the program using a processor (e.g., CPU, GPU), and performs the process defined by the program while using a storage resource (e.g., memory) and an interface device (e.g., communication port), etc. Therefore, the subject of the process performed by executing the program may be the processor. Similarly, the subject of the process performed by executing the program may be a controller, device, system, computer, or node having a processor. The subject of the process performed by executing the program may be a calculation unit, and may include a dedicated circuit that performs specific processing. Here, the dedicated circuit is, for example, an FPGA (Field Programmable Gate Array), an ASIC (Application Specific Integrated Circuit), or a CPLD (Complex Programmable Logic Device), etc.

[0018] The program may be installed in the computer from a program source. The program source may be, for example, a program distribution server or a computer-readable storage medium. When the program source is a program distribution server, the program distribution server may include a processor and a storage resource that stores the program to be distributed, and the processor of the program distribution server may distribute the program to be distributed to other computers. In addition, in the embodiment, two or more programs may be realized as one program, and one program may be realized as two or more programs. EXAMPLES

[0019] The urban design support device 1 of the embodiment calculates information regarding the layout of facilities to be installed in a city, as will be described in detail below. More specifically, the urban design support device 1 calculates information regarding the location of a transportation hub and the location of a point where a service is provided, which allows city residents to easily use a service at a certain point, and generates data for evaluating the calculated locations of the transportation hub and the locations of the points where the service is provided. A transportation hub is a location where people can get on and off vehicles, such as a bus stop or a station.

[0020] <<Configuration of urban design support device 1>> Fig. 1 is a diagram showing an example of a functional block diagram of an urban design support device 1 according to an embodiment. As shown in Fig. 1, the urban design support device 1 includes a storage unit 11, a processing unit 12, and a display unit 13 as a functional configuration, and is connected to a network NW. The urban design support device 1 is connected to a user terminal 500 via the network NW.

[0021] The memory unit 11 stores data used for processing performed by the urban design support device 1. The processing unit 12 has a communication unit 121, a conceptual graph unit 122, and an analysis unit 123. The processing unit 12 can handle conceptual graphs, ideal state graphs, and current state graphs created in the form of a "state graph." A graph in the form of a state graph is a graph that includes nodes representing points, nodes representing point functions that can be used at the points, nodes representing methods of travel between the points, and edges that connect multiple nodes that have a strong relationship in terms of usage.

[0022] In the conceptual graph, ideal state graph, and current state graph, the attributes of a node include four types: location, location function, transportation hub, and transportation method. A location function is a service that can be used at a location. The type of location function is indicated by a word that describes the content of the service, such as a convenience store, supermarket, restaurant, sports gym, or government office. A transportation hub is a departure and arrival point for vehicles, such as a bus stop or train station. Transportation methods include vehicles such as trains, buses, and cycling, as well as walking.

[0023] A conceptual graph is a graph in the form of a state graph that roughly represents a state in which a resident of a city at a certain point can easily use services at another point. A conceptual graph is a graph that includes an origin point node that represents the point from which a resident moves (referred to as an "origin point"), a destination point node that represents the point to which the resident moves (referred to as a "destination point"), and a point function node that represents a point function. Here, an origin point node is a node that represents the point from which a resident moves (origin point). A destination point node is a node that represents the point to which a resident moves (destination point). A point function node is a node that represents a point function. A point function node is connected to a point node of a point having a point function via an edge.

[0024] An ideal state graph is a graph in the form of a state graph that details a state in which city residents at one point can easily use services at another point. The ideal state graph includes nodes that represent point functions that do not currently exist and nodes (called "added nodes") that represent travel methods between points that do not currently exist. The ideal state graph represents, for example, a state in which a person at a source point can travel to a destination point and use the point functions at the destination point. The ideal state graph is generated by adding nodes to a conceptual graph. The nodes added to the conceptual graph are called "supplementary nodes."

[0025] A current state graph is a graph that represents the current state in the form of a state graph.

[0026] The user terminal 500 can access the urban design assistance device 1 via the network NW.

[0027] The communication unit 121 can transmit and receive data to and from the user terminal 500. Furthermore, the communication unit 121 acquires a conceptual graph from the user terminal 500, and stores the acquired conceptual graph in the storage unit 11.

[0028] When the conceptual graph unit 122 acquires the conceptual graph, it supplements the acquired conceptual graph with supplementary nodes to generate an ideal state graph.

[0029] The analysis unit 123 calculates the difference between the ideal state graph and the current state graph as additional element information. Furthermore, the analysis unit 123 calculates a gap evaluation value indicating the magnitude of the difference between the ideal state graph and the current state graph based on the additional element information. Based on the gap evaluation value, it is possible to determine to what extent the situation can be improved by bringing the situation into the state represented by the ideal state graph. Furthermore, the analysis unit 123 outputs the ideal state graph, the additional element information, and the gap evaluation value to the display unit 13.

[0030] The display unit 13 displays the ideal state graph, the additional element information, and the gap evaluation value.

[0031] The network NW may be a wired network or a wireless network. The network NW may be a global network such as the Internet or a local area network (LAN). The network NW may include a wired communication path such as a Universal Serial Bus (USB) or a wireless communication path such as Bluetooth.

[0032] Fig. 2 is a block diagram showing an example of a hardware configuration of an urban design support device 1 of an embodiment. As shown in Fig. 2, the urban design support device 1 has, as a hardware configuration, a processor 21, a main memory device 22, a sub-memory device 23, an input device 24, an output device 25, a network I / F 26, and a bus 27 connecting these. The urban design support device 1 can be realized by an information processing device such as a general PC or a server device. The user terminal 500 can be realized by the same hardware resources as the urban design support device 1.

[0033] The processor 21 controls each part of the urban design support device 1, reads data and programs stored in the sub-storage device 23 into the main storage device 22, and executes processing determined by the programs. The processing unit 12 is realized by reading the programs stored in the sub-storage device 23 into the main storage device 22 and executing the read programs. The communication unit 121 is realized by the processor 21 reading the communication program 21a stored in the sub-storage device 23 into the main storage device 22 and executing it. Similarly, the conceptual graph unit 122 and the analysis unit 123 are realized by the processor 21 reading the conceptual graph program 122a and the analysis program 123a stored in the sub-storage device 23 into the main storage device 22 and executing them, respectively. In this specification, when the processing is described in a sentence with the processing unit 12, the communication unit 121, the conceptual graph unit 122, or the analysis unit 123 as the subject, it indicates that the processor 21 of the urban design support device 1 is executing the communication program 121a, the conceptual graph program 122a, and the analysis program 123a that realize the corresponding functional units.

[0034] The communication program 121a, the conceptual graph program 122a, and the analysis program 123a are collectively referred to as an urban design support program.

[0035] The main memory device 22 is a RAM or the like, has a volatile memory element, and stores the programs executed by the processor 21 and data.

[0036] The secondary storage device 23 is a device such as an HDD (Hard Disk Drive) or an SSD (Solid State Drive) that has a non-volatile storage element and stores programs, data, etc. The secondary storage device 23 has a communication program 121a, a conceptual graph program 122a, and an analysis program 123a installed therein. As described above, the communication program 121a, the conceptual graph program 122a, and the analysis program 123a are programs that are executed by the processor 21 to realize the functions of the communication unit 121, the conceptual graph unit 122, and the analysis unit 123, respectively.

[0037] Furthermore, the secondary storage device 23 stores a current state graph store 231 , an ideal state graph store 232 , a relationship model store 233 , a map information table 234 , a point relationship information table 235 , and a node template information table 236 .

[0038] The current state graph store 231 stores a current state graph, and the ideal state graph store 232 stores an ideal state graph.

[0039] The relationship model store 233 stores a relationship model. As described later, the relationship model is an AI (Artificial Intelligence) model that is trained using the nodes and edges of the current state graph and represents the strength of relationships between multiple nodes of the current state graph.

[0040] The map information table 234, the details of which will be described later with reference to FIG. 3, is a table that stores information on the current location.

[0041] The location relationship information table 235, details of which will be described later with reference to Figure 4, is a table that stores information on the feature vectors of nodes, which represent the strength of the relationships between multiple nodes in the current state graph, calculated using the relationship model stored in the relationship model store 233.

[0042] The node template information table 236, which will be described in detail later with reference to Fig. 5, is a table that associates and stores the attributes of multiple nodes connected by edges with the types of supplementary nodes to be added between the multiple nodes connected by edges. The node template information table 236 is node template information.

[0043] The input device 24 is a device such as a keyboard or a mouse that accepts user operations and acquires information input by the user's operations. The output device 25 is a device such as a display or a touch panel that displays information and presents information to the user by displaying it on a screen.

[0044] The network I / F 26 is connected to the network NW. The network I / F 26 is an interface (transmitting / receiving device) capable of transmitting and receiving data to and from devices such as the user terminal 500 via the network NW. The urban design support device 1 can use the network I / F 26 to transmit and receive data to and from devices such as the user terminal 500 via the network NW.

[0045] As shown in Fig. 1, the urban design support device 1 includes a memory unit 11, a processing unit 12, and a display unit 13. The memory unit 11 is a secondary storage device 23. The processing unit 12 is realized by the processor 21 as described above. The communication unit 121 is the processor 21 that executes the network I / F 26 and a communication program 121a. The conceptual graph unit 122 is the processor 21 that executes a conceptual graph program 122a. The analysis unit 123 is the processor 21 that executes an analysis program 123a. The display unit 13 is an output device 25.

[0046] <<Data structure of urban design support device 1>> Next, the data configuration of various data used in the urban design assistance device 1 will be described with reference to FIG. 3 to FIG.

[0047] 3 is a diagram showing an example of the data configuration of the map information table 234. The map information table 234 stores information about points. The map information table 234 has the following fields: point ID 301, attribute 302, type 303, addability 304, coordinates 305, and area name 306.

[0048] Locations have defined attributes. Attributes are divided into location attributes and function attributes. Location attributes include "transportation hubs", which are locations where you can get on and off vehicles, and "locations", which are locations other than transportation hubs. Function attributes include "travel methods" that can be used at transportation hubs, and "location functions", which are functions other than travel methods.

[0049] There are also types related to attributes. For example, the types are train station, bus stop, and cycle port for the attribute "transportation base." For example, the types are convenience store, supermarket, park, and school for the attribute "location function."

[0050] The point ID 301 is an ID that identifies a point. The attribute 302 is an attribute of the point. The value of the attribute 302 is a point function or a transportation hub. The type 303 is the type of point related to the attribute 302. For example, if the attribute 302 is a "point function", the value of the type 303 is a train station, a bus stop, or a cycle port. Also, if the attribute 302 is a "point function", the value of the type 303 is a convenience store, a supermarket, a park, or a school.

[0051] Addition Possibility 304 indicates whether or not it is possible to install new equipment at a location. If it is possible to install new equipment at a location, the value of Addition Possibility 304 is "O." On the other hand, if it is not possible to install new equipment at a location, the value of Addition Possibility 304 is "X."

[0052] Coordinates 305 are the coordinates of the location on the map. Area name 306 is the name of the city, town, or village in which the location is included.

[0053] 4 is a diagram showing an example of the data configuration of the point relationship information table 235. The point relationship information table 235 stores information on the feature vector of a node, which indicates the calculated strength of the relationship between a plurality of nodes in the current state graph. The point relationship information table 235 has fields of a node ID 401, a node type 402, and a feature vector 403. The node ID 401 is an ID for identifying a node. The node type 402 is the type of node. The value of the node type 402 is any one of a point, a point function, a transportation hub, and a travel method.

[0054] The feature vector 403 is a feature vector of a node that represents the strength of the relationship between multiple nodes of the current state graph, calculated using a relationship model stored in the relationship model store 233. The relationship model is an AI (Artificial Intelligence) model that represents the strength of the relationship between multiple nodes of the current state graph, learned using the nodes and edges of the current state graph. In other words, the feature vector 403 is a feature vector of each node that constitutes a graph calculated by applying a graph embedding method, which is one of machine learning methods, to the current state graph. As a method for calculating a feature vector from the current state graph, for example, the method disclosed in Grover and Leskovec, “node2vec: Scalable Feature Learning for Networks”, Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, 2016. can be used.

[0055] 5 is a diagram showing an example of the data configuration of the node template information table 236. The node template information table 236 has fields including a template ID 501, a connection pattern 502, a measure implementation necessity 503, a measure 504, and a replacement connection pattern 05.

[0056] The template ID 501 is an ID for identifying a node template. The connection pattern 502 is an attribute of a node that is connected at both ends by an edge.

[0057] Measure implementation necessity 503 is a value indicating whether or not a measure of adding a refill node is necessary for the edge of connection pattern 502. If a measure of adding a refill node is necessary for the edge of connection pattern 502, the value of measure implementation necessity 503 is "necessary." On the other hand, if a measure of adding a refill node is not necessary for the edge of connection pattern 502, the value of measure implementation necessity 503 is "no."

[0058] The measure 504 is the name of a measure to be added to the edge of the connection pattern 502. The value of the measure 504 may be "-", which indicates a null value and corresponds to the value "no" of the measure implementation necessity 503.

[0059] The replacement connection pattern 505 is an attribute of a plurality of nodes that replaces the nodes of the connection pattern 502. The value of the replacement connection pattern 505 may be an empty value "-" that indicates that the nodes of the connection pattern 502 are not replaced. The value of the replacement connection pattern 505 may also be an attribute of three nodes that adds the attribute "location" or "transportation base" to the attributes of the two nodes of the connection pattern 502.

[0060] For example, in a record with a template ID of 1, connection pattern 502 is (point, point). The nodes at both ends of the edge are points. Measure 504 is "introduction of transportation service (travel method)" to travel between the points at both ends of the edge. Replacement connection pattern 505 is (point, travel method, point). In a record with a template ID of 2, the connection pattern is (point, point function). The nodes at both ends of the edge are a point and a point function. This indicates that the point of the node at one end of the edge has the point function of the node at the other end of the edge, and since there is no need to add equipment, the value of measure implementation necessity 503 of the record is "no."

[0061] <<Processing procedure of urban design support device 1, Figs. 23 to 28>> Next, a processing procedure of the urban design support device 1 will be described. When a user operates the user terminal 500 to cause the user terminal 500 to access the urban design support device 1, the urban design support device 1 executes the communication program 121a. The urban design support device 1 executes the communication program 121a to realize the communication unit 121. The communication unit 121 transmits to the user terminal 500 conceptual graph input screen information, which is information on a conceptual graph input screen used to create a conceptual graph. The conceptual graph input screen information includes information on the configuration of the conceptual graph input screen and information to the effect that the conceptual graph input screen is to be displayed on the user terminal 500. As will be described below, the conceptual graph input screen is configured so that components of a conceptual graph can be input.

[0062] Fig. 6 is an explanatory diagram showing an example of a conceptual graph input screen 600 displayed on the user terminal 500 or the output device 25 (monitor) of the urban design support device 1. The conceptual graph input screen 600 shown in Fig. 6 has a region name input field 601, a region setting button 602, a point selection checkbox 611, a transportation base selection checkbox 612, a point function selection button 613, a travel method selection button 614, a node ID setting field 615, a position input checkbox 616, a coordinate input field 617, an add node button 618, a delete node button 619, an edge start node ID input field 621, an edge end node ID input field 622, an add edge button 623, a delete edge button 624, a point function weight input field 631, a travel method weight input field 632, a conceptual graph 640, and a conceptual graph creation completion button 650.

[0063] The area name input field 601 is a field for inputting the application area of ​​the urban concept represented by the conceptual graph. The area setting button 602 is a button for setting the application area input in the area name input field 601 as the application area for the ideal graph. When the area setting button 602 is pressed, the user terminal 500 transmits application area map request information including the application area input in the area name input field 601 and application area request information to the urban design support device 1. When the communication unit 121 of the urban design support device 1 receives the application area map request information, it transmits application area information including a record of the map information table 234 in which the area name 306 is associated with the application area to the user terminal 500. When the user terminal 500 receives the application area information, it creates a map of the application area input in the area name input field 601 based on the record of the map information table 234 included in the received application area information, and displays the created map in the conceptual graph 640.

[0064] The point selection checkbox 611 is a checkbox for inputting that a node of a point type is to be created when the node type of the node to be created in the conceptual graph is a point. Checking the point selection checkbox 611 inputs that a node of a point type is to be created.

[0065] The transportation base selection checkbox 612 is a checkbox for inputting that a node of the node type of a transportation base is to be created when the node type of the node to be created in the conceptual graph is a transportation base. Checking the transportation base selection checkbox 612 inputs that a node of the node type of a transportation base is to be created.

[0066] The point function selection button 613 is a button for selecting a point function to be represented by a node when the node type of the node to be created in the conceptual graph is a point function. When the point function selection button 613 is pressed, a list of types of point functions is displayed, allowing the type of point function of the node to be created to be selected.

[0067] The movement method selection button 614 is a button for selecting the movement method to be represented by the node when the node type of the node to be created in the conceptual graph is a movement method. When the movement method selection button 614 is pressed, a list of movement method types is displayed, allowing the type of movement method for the node to be created to be selected.

[0068] The node ID setting field 615 is a field for inputting the node ID of the node to be created. If no ID is entered in the node ID setting field 615, an appropriately calculated numeric node ID is automatically assigned to the node to be created.

[0069] The position input checkbox 616 is a checkbox for inputting a check as to whether or not the position of a cursor 641 in a conceptual graph, which will be described later, is to be set in the position information of a node. When the position input checkbox 616 is checked, the position (numeric coordinates) of the cursor 641 in a conceptual graph 640, which will be described later, is set in the position information of a location node (a point node and a transportation hub node). On the other hand, when the position input checkbox 616 is not checked, the position (numeric coordinates) of the cursor 641 in a conceptual graph 640, which will be described later, is not set in the position information of a location node.

[0070] The coordinate input field 617 is a field for inputting the coordinates of the node on the map as the position information of the node. When coordinate values ​​are input in the coordinate input field 617, the coordinate values ​​input in the coordinate input field 617 are set as the position information of the location node (point node and transportation hub node). When the position input checkbox 616 is not checked and coordinate values ​​are not input in the coordinate input field 617, a node that does not include position information is created in the conceptual graph 640.

[0071] The add node button 618 is a button for inputting a command to add a new node to the conceptual graph 640. When the add node button 618 is pressed, the user terminal 500 adds a new node including the information input in the location selection checkbox 611 to the coordinate input field 617 to the conceptual graph 640. That is, a node of a node type corresponding to the input button among the location selection checkbox 611, the transportation base selection checkbox 612, the location function selection button 613, and the travel method selection button 614 is created. Then, the created node is added with the position information specified in the node ID setting field 615, the position input checkbox 616, and the coordinate input field 617. Then, the new node to be added to the conceptual graph 640 is displayed. The new nodes are added sequentially from the start point side to the end point side of the conceptual graph.

[0072] Furthermore, as described above, when a node is added to the conceptual graph 640, a new edge is created connecting the added node with the most recently created node. Here, an edge ID with an appropriately calculated value is automatically assigned to the new edge.

[0073] The delete node button 619 is a button for inputting a command to delete a node created in the conceptual graph 640. When the delete node button 619 is pressed, a node that can be specified by the information entered in the fields from the node ID setting field 615 to the coordinate input field 617 is deleted from the conceptual graph 640. When a node is deleted, the node ID value and edge ID value are updated so that they become larger from the start point side to the end point side of the conceptual graph.

[0074] The edge start node ID input field 621 and edge end node ID input field 622 are fields for inputting the node IDs of the nodes at both ends of an edge in order to specify the edge. The edge start node ID input field 621 is a field for inputting the node ID of the node connected to the start point side of the edge to be specified. The edge end node ID input field 622 is a field for inputting the node ID of the node connected to the end point side of the edge to be specified.

[0075] The add edge button 623 is a button for adding an edge. When the add edge button 623 is pressed, the conceptual graph unit 122 adds to the conceptual graph an edge whose start point is connected to the node whose node ID is input in the edge start node ID input field 621 and whose end point is connected to the node whose node ID is input in the edge end node ID input field 622. Here, an appropriately calculated numeric node ID is automatically assigned to the edge to be added.

[0076] The delete edge button 624 is a button for deleting an edge in the conceptual graph 640. When the delete edge button 624 is pressed, an edge whose starting point is connected to the node whose node ID is input in the edge starting node ID input field 621 and whose ending point is connected to the node whose node ID is input in the edge ending node ID input field 622 is deleted from the conceptual graph.

[0077] The point function weight input field 631 is a field for inputting a point function weight Wf used by the analysis unit 123 to calculate a relationship strength value representing the strength of the relationship between the point node connected to the edge and the node of the point function, as described below.

[0078] The travel method weight input field 632 is a field for inputting a travel method weight Wt used by the analysis unit 123 to calculate a relationship strength value representing the strength of the relationship between the transportation hub node connected to the edge and the travel method node, as described below.

[0079] The conceptual graph 640 is a field that displays a map of the area entered in the area name input field 601 (a map of the applicable area of ​​the urban plan represented by the conceptual graph) and a conceptual graph. The conceptual graph 640 has a cursor 641 that can specify a position (numerical coordinates) within the conceptual graph 640 by clicking or the like.

[0080] The conceptual graph 640 shown in FIG. 6 includes nodes N1 to N5 and edges E1-2 to E4-5. The conceptual graph 640 indicates that a person at point N1 can travel to cycle port N4 by bus N2 and bicycle N3 to reach point N5. Although not shown, there is a forest park at point N5. Node N1 is the node of the origin point (origin point node). Point N1 of node N1 is the origin point. Node N5 is the node of the destination point (destination point node). Point N5 of node N5 is the destination point.

[0081] Node N1 is a node of node type "location" that includes coordinates (36.18, 141.11) as location information (i.e., a node that represents the location at coordinates (36.18, 141.11)). Node N2 is a node of node type "transportation method" that represents the transportation method by bus. Node N3 is a node of type "transportation method" that represents the transportation method by cycling. Node N4 is a cycle port node of node type "transportation hub" that includes coordinates (36.15, 141.10) as location information (i.e., a node that represents a cycle port at coordinates (36.15, 141.10)). Node N5 is a node of node type "location" that includes coordinates (35.18, 141.11) as location information (i.e., a node that represents the location at coordinates (35.18, 141.11)).

[0082] Edge E1-2 is an edge that connects node N1 and node N2. Edge E2-3 is an edge that connects node N2 and node N3. Edge E3-4 is an edge that connects node N3 and node N5. Edge E4-5 is an edge that connects node N4 and node N5.

[0083] When the conceptual graph creation completion button 650 is pressed, the user terminal 500 transmits the conceptual graph 640 to the urban design support device 1. That is, the user terminal 500 generates conceptual graph information including information on all edges and nodes included in the conceptual graph 640, and transmits the generated conceptual graph information (conceptual graph 640) to the urban design support device 1. Upon acquiring the conceptual graph information transmitted by the user terminal 500, the urban design support device 1 executes the conceptual graph program 122a and realizes the conceptual graph unit 122. The conceptual graph unit 122 executes an ideal state graph generation process using the conceptual graph information transmitted by the user terminal 500 as an input.

[0084] When the user of the urban design support device 1 inputs a conceptual graph using the input device 24 of the urban design support device 1, the communication unit 121 causes the output device 25 to display the conceptual graph input screen 600, and the conceptual graph information is input. Furthermore, when the user of the urban design support device 1 clicks a conceptual graph creation completion button 650 on the conceptual graph input screen 600, the communication unit 121 generates conceptual graph information and executes the conceptual graph program 122a to realize the conceptual graph unit 122. The conceptual graph unit 122 executes an ideal state graph generation process using the conceptual graph information as an input.

[0085] FIG. 7 is a flowchart illustrating an example of an ideal state graph generation process according to the embodiment. The conceptual graph unit 122 stores connection pattern information that associates, for each edge included in the conceptual graph of the conceptual graph information, an edge ID, the node IDs of the nodes connected to both ends of the edge, and the attributes (connection pattern) of the nodes connected to both ends of the edge (step S101).

[0086] Next, the conceptual graph unit 122 starts a loop process of replenishing replenishing nodes according to the edge connection pattern (step S102). The process shown from step S102 of the loop start to step S107 of the loop end is repeated for each edge ID of the connection pattern information saved in step S101. In step S102, the conceptual graph unit 122 selects one edge ID from among the unprocessed edge IDs of the connection pattern information saved in step S101.

[0087] Next, the conceptual graph unit 122 refers to the node template information table 236, and acquires and saves a replacement connection pattern associated with the connection pattern (attributes of the nodes at both ends of the edge of the edge ID) of the connection pattern information including the edge ID selected in step S102 in the node template information table 236 (step S103). In the node template information table 236, a replacement connection pattern does not exist for a connection pattern associated with the value of "No" in the measure implementation necessity 503. In this case, the value of the replacement connection pattern is "-" (empty). On the other hand, a replacement connection pattern exists for a connection pattern associated with the value of "Needed" in the measure implementation necessity 503 in the node template information table 236.

[0088] Next, the conceptual graph unit 122 determines whether the replacement connection pattern acquired in step S103 is empty (step S104). If the conceptual graph unit 122 determines that the replacement connection pattern acquired in step S103 is empty (step S104: Yes), the conceptual graph unit 122 executes the process of step S107. On the other hand, if the conceptual graph unit 122 determines that the replacement connection pattern acquired in step S103 is not empty (step S104: No), the conceptual graph unit 122 executes the process of step S105.

[0089] Next, the conceptual graph unit 122 calculates at least one replenishment node candidate, which is a candidate for the replenishment node, based on the replacement connection pattern acquired in step S103, presents the calculated replenishment node candidate in the conceptual graph, and further waits for the input of the replenishment node candidate selected by the user (step S105). Step S105 is a process executed when the replacement connection pattern is not empty (step S104: No). In the replacement connection pattern, a node of an attribute added from the connection pattern is added to the conceptual graph as a replenishment node. As described below, the conceptual graph unit 122 calculates replenishment node candidates that are candidates for the replenishment node for the replacement connection pattern. Furthermore, the conceptual graph unit 122 displays the calculated replenishment node candidates in the conceptual graph, and accepts and waits for the input of the selected replenishment node candidate. In addition, the points of the following replenishment node candidates are selected from the points in the map information table 234 where the value of the addable / unaddable 304 is "0".

[0090] Since the replacement connection pattern for template ID 501 of 2, 4, 9 is empty, template ID 501 is not 2, 4, 9 when the process of step S105 is executed.

[0091] In a replacement connection pattern (location, travel method, location) with template ID 501 of 1, transportation hub facilities are provided at each of the location nodes connected by edges at both ends so that travel can be made between the location nodes connected by edges at both ends by the travel method. Therefore, no facilities are provided at new locations other than the location nodes connected by edges at both ends. Therefore, the conceptual graph unit 122 executes the process of step S107 without calculating candidate supplementary nodes for the location. Also, in the conceptual graph, a node for the travel method is added between the location nodes connected by edges at both ends.

[0092] In the replacement connection pattern (point, transportation base, travel method) with template ID 501 of 3, a transportation base is provided at a point around the point node connected at the other end of the edge so that the travel method of the node connected at one end of the edge can be used. As shown in Fig. 8, the point node connected at the other end of the edge is set as the starting point node, and the point nodes within a specified range from the starting point node are selected as candidate supplementary nodes for the transportation base node.

[0093] 8 is an explanatory diagram for explaining a method for selecting point nodes within a predetermined range from a starting point node Ni, which is a point node, as supplementary node candidates. The conceptual graph unit 122 targets point nodes Nx that exist around the starting point node Ni at positions on the map. Nodes Nx are a general term for point nodes.

[0094] As shown in formula (1), the Nx of a point node within the movable range where the norm of the difference vector between the vector of the origin node Ni (coordinates on the map or feature vector in FIG. 4) and the vector of the Nx of the point node (coordinates on the map or feature vector in FIG. 4) is equal to or less than the movable distance dmax is set as a supplementary node candidate Nx. The conceptual graph unit 122 calculates at least one supplementary node candidate. Also, in FIG. 8, Nx1 and Nx2 are shown as supplementary node candidates, but node Nx is a general term for point nodes. There is no limit to the number of supplementary node candidates calculated by the conceptual graph unit 122.

[0095] In the replacement connection pattern (point function, point, point function) with template ID 501 of 5, a facility that can use the point function of the node of the point function connected at both ends of the edge is provided at the point of the supplementary node of the point. The supplementary node candidates are calculated as shown in FIG.

[0096] 9 is an explanatory diagram explaining a method for selecting a point node between two point nodes as a supplementary node candidate. In a conceptual graph, the closest point node on the edge's origin point side is set as the starting point node Ni, and the closest point node on the edge's destination point side is set as the starting point node Ni+1. The conceptual graph unit 122 targets point nodes Nx that exist between the starting point node Ni and the starting point node Ni+1 in terms of positions on the map. Node Nx is a general term for point nodes.

[0097] As shown in formula (2), the sum of the norm of the difference vector between the vector of the origin node Ni (coordinates on the map or feature vector in FIG. 4) and the vector of the Nx of the node at the point (coordinates on the map or feature vector in FIG. 4) and the norm of the difference vector between the vector of the origin node Ni+1 and the vector of the Nx of the node at the point, minus the norm of the difference vector between the vector of the origin node Ni and the vector of the origin node Ni+1, is less than or equal to the movable distance dmax, and the Nx of the node at the point within the movable range is set as the supplementary node candidate Nx. The conceptual graph unit 122 calculates at least one supplementary node candidate. Also, in FIG. 9, Nx1 and Nx2 are shown as examples of supplementary node candidates, but there is no limit to the number of supplementary node candidates.

[0098] In the replacement connection pattern (point function, point, travel method) with template ID 501 of 6, a supplementary node for a point is provided that has the point function of the point function node connected at one end of the edge and the function of a travel base that can utilize the travel method of the travel method node connected at the other end of the edge. Therefore, the conceptual graph unit 122 calculates supplementary node candidates for the point, as explained using FIG.

[0099] In a replacement connection pattern (point function, point, transportation hub) with template ID 501 of 7, a facility having the point function of the point function node connected at one end of the edge is provided at a point (called a "development point") around the transportation hub of the transportation hub node connected at one end of the edge. The development point node is set as a supplementary node. The transportation hub node connected at one end of the edge is set as the starting node, and the point (development point) node that is a candidate for a supplementary node is calculated as explained using FIG. 8.

[0100] In the replacement connection pattern (travel method, transportation base, travel method) with template ID 501 of 8, a new transportation base node is provided at the location of the supplementary node of the location, and the facility can use the travel method of the node of the travel method connected at each end of the edge. In this case, the conceptual graph unit 122 calculates supplementary node candidates as described with reference to FIG.

[0101] In the replacement connection pattern (transportation base, travel method, transportation base) with template ID 501 of 10, similar to the replacement connection pattern with template ID 501 of 1, facilities for a travel method that allows travel between the nodes of the mobile bases connected by edges at both ends are provided at each mobile base of the nodes of the mobile bases connected by edges at both ends. Therefore, no facilities are provided at new points other than the nodes of the mobile bases connected by edges at both ends. Therefore, the conceptual graph unit 122 executes the process of step S107 without calculating candidates for supplementary nodes at the points. Also, a node for the travel method is added between the nodes of the mobile bases connected by edges at both ends.

[0102] FIG. 10 is an example of a conceptual graph 1000 displaying replenishment node candidates. In the example of the conceptual graph shown in FIG. 10, a node N1x1 of a transportation base whose type is a bus stop and a node N1x2 of a transportation base whose type is a bus stop are shown as replenishment node candidates. The conceptual graph 1000 also has a replenishment node selection button 1001 and a replenishment node input button 1002. When the replenishment node selection button 1001 is pressed, a list of IDs of replenishment node candidates (N1x1 and N1x2 in the example of FIG. 10) is displayed, and the user can select the replenishment node candidate having the ID of the selected replenishment node candidate as a replenishment node. When the replenishment node input button 1002 is pressed, the replenishment node candidate selected using the replenishment node selection button 1001 is input to the conceptual graph unit 122 as a replenishment node.

[0103] Next, the conceptual graph unit 122 stores the inputted supplementary nodes, and further supplements the inputted supplementary nodes to the conceptual graph, and illustrates the supplemented conceptual graph (step S106).

[0104] Next, the conceptual graph unit 122 determines whether or not the processing has been completed for all edge IDs of the connection pattern information stored in step S101 (step S107). If the conceptual graph unit 122 determines in step S107 that the processing has not been completed for all edge IDs of the connection pattern information stored in step S101, the conceptual graph unit 122 returns to step S102 and continues the processing. On the other hand, if the conceptual graph unit 122 determines that the processing has been completed for all edge IDs of the connection pattern information stored in step S101, the conceptual graph unit 122 executes the processing of step S108.

[0105] Next, the conceptual graph unit 122 generates ideal state graph information including information on all edges and nodes included in the conceptual graph, stores the generated ideal state graph information in the ideal state graph store 232, and further outputs it to the analysis unit 123, thereby completing the processing (step S108).

[0106] When the analysis unit 123 acquires the ideal state graph information, the analysis unit 123 executes an ideal state graph analysis process using the acquired ideal state graph information as an input.

[0107] FIG. 11 is a flowchart illustrating an example of the ideal state graph analysis process according to the embodiment. The analysis unit 123 calculates the difference between the ideal state graph and the current state graph as added element information (step S201). The analysis unit 123 reads out the current state graph of the applicable area of ​​the ideal state graph from the current state graph store 231. The analysis unit 123 calculates and stores information on nodes and edges that exist in the ideal state graph but do not exist in the current state as added element information. Nodes that exist in the ideal state graph but do not exist in the current state are treated as added nodes. In addition, point nodes (point nodes and transportation hub nodes) that exist in the ideal state graph but do not exist in the current state are treated as added point nodes.

[0108] Next, the analysis unit 123 refers to the location relationship information table 235 for each added location node, calculates a gap evaluation value representing the strength of the relationship between the added location node and the node at the closest location on the source location side of the added location node (referred to as the "source node"), and a gap evaluation value representing the strength of the relationship between the added location node and the node at the closest location on the destination location side of the added location node (referred to as the "destination node"), and saves the calculated gap evaluation values ​​(step S202).

[0109] The ideal state graph is a graph in the form of a state graph that represents the state in which city residents at one point can easily access services at another point. Additional point nodes that do not currently exist in the state graph but do exist in the ideal state graph are added with point functions or transportation hub functions that do not currently exist in order to reach the state represented in the ideal state graph.

[0110] In the state represented by the ideal state graph, the addition of a location function or a transportation hub function to the additional point node increases the relationship between the additional point node and the source node, and increases the relationship between the additional point node and the destination node. The lower the relationship between the additional point node and the source node and the relationship between the additional point node and the destination node in the current state graph, the more the relationship between the additional point node and the source node and the relationship between the additional point node and the destination node will be improved when the state represented by the ideal state graph is reached. In other words, the lower the relationship in the current state graph is, the more the relationship between the additional point node and the source node and the relationship between the additional point node and the destination node will be improved by reaching the state represented by the ideal state graph.

[0111] Therefore, the strength of the relationship between the added point node and the source node in the current state graph and the strength of the relationship between the added point node and the destination node are calculated using a relationship model that is learned using the nodes and edges of the current state graph and indicates the strength of the relationship between multiple nodes in the current state graph. The strength of the relationship between the nodes in the current state graph calculated using the relationship model is calculated as the inner product of the feature vectors of the nodes stored in the location relationship information table 235 shown in FIG. 4. The analysis unit 123 acquires the feature vector of the added point node and the feature vector of the source node from the location relationship information table 235, and calculates the inner product of the feature vector of the added point node and the feature vector of the source node as a gap evaluation value that indicates the strength of the relationship between the added point node and the source node. Then, the analysis unit 123 stores information that associates the calculated gap evaluation value with information on the edge (referred to as an "additional edge") that connects the added point node and the source node as gap evaluation value information.

[0112] The gap evaluation value indicates the magnitude of the difference between the ideal state graph and the current state graph. The smaller the gap evaluation value, the more the relationship (convenience) between the location of the added point node and the location of the source node will improve from the current state when the current state is changed to the state represented by the ideal state graph.

[0113] The gap evaluation value between the point of the added point node and the point of the origin node and the calculation method of the gap evaluation value have been described above. As described above, the analysis unit 123 calculates the inner product of the feature vector of the added point node and the feature vector of the destination node stored in the point relationship information table 235, and sets the calculated value as the gap evaluation value between the point of the added point node and the point of the destination node. The analysis unit 123 also stores, as gap evaluation value information, information that associates the calculated gap evaluation value with information on the edge (called an "additional edge") that connects the added point node and the destination node. The analysis unit 123 executes the process described above for each added point node.

[0114] Next, the analysis unit 123 generates ideal state graph information including the gap evaluation value information and information on all edges and nodes included in the ideal state graph, stores the generated ideal state graph information in the ideal state graph store 232, and further transmits ideal state graph screen information including the ideal state graph information, information on the configuration of the ideal state graph screen, and an instruction to display the ideal state graph screen to the user terminal 500, and ends the process (step S203). When the user terminal 500 acquires the ideal state graph screen information, it displays an ideal state graph display screen including the ideal state graph and the gap evaluation value. In the above, the ideal state graph display screen is displayed on the user terminal 500, but the ideal state graph display screen may be displayed on the output device 25 of the urban design support device 1.

[0115] FIG. 12 is an explanatory diagram showing an example of an ideal state graph display screen 1200 displayed on the user terminal 500 or the output device 25 (monitor) of the urban design support device 1. The ideal state graph display screen 1200 shown in FIG. 12 has an ideal state graph 1210. The ideal state graph 1210 has nodes N1 to N5 and edges E1-1x to E4-5. Nodes N1x, N2, N2x, and N3 whose contours are indicated by two-dot chain lines are added nodes that do not exist in the actual state graph. Nodes N1x and N2x are added point nodes. Edge E1-1x connecting node N1 and node N1x is an added edge, and its gap evaluation value is 20. Similarly, edge E1x-2x connecting node N1x and node N2x is an added edge, and its gap evaluation value is 50. Furthermore, edge E2x-4 connecting node N2x and node N4 is an additional edge, and its gap evaluation value is 10. From the above, it can be evaluated that providing a bus stop and cycling port at node N2x would be more convenient for residents than providing a bus stop and cycling port at node N1x or node N2x.

[0116] <Effects of the Invention> The urban design support device 1 generates an ideal state graph from the conceptual graph. Then, the urban design support device 1 outputs the difference between the ideal state graph and the current state graph as additional element information. The additional element information includes information on facilities with point functions and facilities for transportation methods that need to be newly installed in order to realize the arrangement of point functions and transportation methods between points in the city shown in the ideal state graph.

[0117] Therefore, if only the conceptual graph is prepared, the urban design support device 1 generates an ideal graph and calculates the additional element information. Then, based on the additional element information, the user can consider the facilities with the location functions that need to be newly installed and the facilities of the transportation method, and judge whether or not they should be in the state shown by the ideal state graph. In this way, the urban design support device 1 can easily determine the appropriate locations of transportation hubs and service locations so that city residents can easily use various services at various locations.

[0118] Furthermore, the urban design support device 1 acquires a conceptual graph from the user terminal 500, and generates an ideal state graph from the acquired conceptual graph. A user of the user terminal 500 connected to the network NW can use the user terminal 500 to transmit the conceptual graph to the urban design support device 1. Therefore, not only a user of the urban design support device 1, but also a user of the user terminal 500 can cause the urban design support device 1 to calculate the difference between the ideal state graph and the current state graph. Therefore, the urban design support device 1 can make it even easier to determine appropriate locations for transportation hubs and points where services are provided, so that city residents can easily use various services at various points.

[0119] Furthermore, the conceptual graph unit 122 presents at least one location node within the movable range, the distance from which the edge is connected to the node being equal to or less than the movable distance, as a supplementary node candidate, and sets the supplementary node candidate selected by the user as the supplementary node. As a result, the supplementary node at an appropriate position is supplemented to the conceptual graph, and an ideal state graph is generated. Thus, a more appropriate ideal state graph is generated.

[0120] Furthermore, the analysis unit 123 calculates a gap evaluation value indicating the magnitude of the difference between the ideal state graph and the current state graph based on the additional element information, and outputs the calculated gap evaluation value. This makes it easy for a user of the urban design support device 1 to grasp the degree of improvement from the current state when the state represented by the ideal state graph is achieved.

[0121] Furthermore, the analysis unit 123 calculates a gap evaluation value indicating the magnitude of the difference between the ideal state graph and the current state graph based on the added element information and the relationship model, thereby enabling the analysis unit to calculate an appropriate gap evaluation value.

[0122] Furthermore, the analysis unit 123 outputs the ideal state graph and the gap evaluation value to an output device. This allows the user of the urban design support device 1 to easily recognize the ideal state graph and the difference between the state indicated by the ideal state graph and the current state.

[0123] <Variation 1> In this modification, the secondary storage device 23 (storage unit 11) stores a movement history table 237. The relationship model is trained using the movement history in the movement history table 237, as well as the nodes and edges of the current state graph.

[0124] FIG. 13 is a diagram showing an example of the data configuration of the movement history table 237. The movement history table 237 has the following fields: history ID 1301, movement history 1302, and area name 1303. History ID 1301 is an ID that identifies the movement history. Movement history 1302 is a movement history from a start point to an end point. The data structure of the movement history 1302 is a structure in which location IDs and movement methods between locations are arranged alternately. This indicates that movement is made between location IDs by a movement method between the location IDs. Area name 1303 is the name of an area that a person has passed through in the movement history. The value of area name 1303 is at least one area name.

[0125] 4 is a feature vector of a node that indicates the strength of the relationship between multiple nodes in the current state graph, calculated using a relationship model stored in the relationship model store 233. The relationship model is an AI (Artificial Intelligence) model that is trained using the nodes and edges of the current state graph and indicates the strength of the relationship between multiple nodes in the current state graph.

[0126] In this modification, a relationship model is trained using not only the nodes and edges of the current state graph but also the movement history in the movement history table 237. That is, in this modification, a relationship model is trained so that the strength of the relationship between nodes at adjacent points passed through on the movement history route in the movement history table 237 becomes stronger. This makes the gap evaluation value calculated by the analysis unit 123 a more appropriate value.

[0127] <Variation 2> This modification differs from the urban design assistance device 1 of the above-described embodiment in the following points. 1. The secondary storage device 23 (storage unit 11) stores a second node template information table 236a (see FIG. 14) instead of the node template information table 236 shown in FIG. 5. In this modification, the conceptual graph unit 122 uses the second node template information table 236a (see FIG. 14) instead of the node template information table 236. 2. On the conceptual graph input screen shown in FIG. 6, the point nodes (point nodes and transportation hub nodes) created in the conceptual graph always include information on their positions (coordinates on the map). 3. First, create a source location node and a destination location node in the conceptual graph on the conceptual graph input screen shown in Fig. 6. Once the source location node and the destination location node are created, a route map of transportation (trains, buses, etc.) between the source location node and the destination location node is displayed in the conceptual graph on the conceptual graph input screen. 4. The correspondence between points with location functions and transportation hubs where a travel method can be used is expressed using "=" as follows: "Point node = Point function node", "Transportation hub node = Travel method node". 5. Before performing the ideal state graph generation process (see FIG. 7), the conceptual graph unit 122 creates a node group that summarizes the point functions of points in the vicinity of the point node, replaces multiple nodes (point node, point function node, transportation hub node) included in the node group with a node group, and treats the node group in the same way as the point node. For example, the point node group is treated as a node including the point function nodes and transportation hub nodes of points within a predetermined distance (e.g., 200 m) from the central point node. The ideal state graph used as input for the analysis process of the analysis unit 123 does not use a node group, but uses multiple nodes instead of the node group. 6. In the ideal state graph generation process (see FIG. 7), the conceptual graph unit 122 performs the loop process from step S102 to step S107 on the edge IDs in the order of the movement route, from the edge ID of the edge on the origin point side to the edge ID of the edge on the destination point side. As a result, the added point nodes are determined sequentially from the origin point side to the destination point side, together with their positions (map-like coordinates).

[0128] By the above steps 1 to 6, the urban design assistance device 1 can generate a more appropriate ideal state graph.

[0129] 14 is a diagram showing an example of the data configuration of the second node template information table 236a. The second node template information table 236a has a template ID 1401, a connection pattern 1402, a measure 1403, and a replacement connection pattern 1404 as fields.

[0130] Template ID 1401 and measure 1403 are the same as template ID 501 and measure 504 in node template information table 236 shown in Fig. 5. Connection pattern 1402 and replacement connection pattern 1404, as in 4 above, express the relationship between points (points and transportation hubs) and functions (point functions and travel methods) with "=".

[0131] The replacement connection pattern 1404 "point + transportation base" with template ID 1401 of 6 represents a node group that groups together a point node and a transportation base node. In this way, in the replacement connection pattern 1404, nodes adjacent to the "+" are grouped into a node group. Also, some replacement connection patterns 1404 have a larger number of added nodes than the replacement connection pattern 505 in the node template information table 236 shown in FIG. 5 (for example, replacement connection patterns 1404 with template IDs 1 and 6). [Explanation of symbols]

[0132] 1;Urban design support equipment 11;Memory part 12; Processing section 121; Communications Department 121a;Correspondence Program 122; Conceptual Graph Section 122a;Conceptual graph program 123;Analysis Department 123a;Analysis program 13;Display section 21; Processor 22; Main memory 23; Secondary storage device 231;Current state graph store 232;Ideal state graph store 233;Relationship model store 234;Map information table 235; Location relationship information table 236; Node template information table 236a; Second node template information table 237; Movement history table 24; Input device 24 25; Output device 25 26;Network I / F 27; Bus 27 500; User terminal NW; Network

Claims

1. An urban design support device that calculates information regarding the layout of facilities to be installed in a city, A storage unit and a processing unit are included, The storage unit is storing a current state graph representing a current state, the current state graph being created in the form of a state graph including nodes representing points, point functions available at the points, or methods of moving between the points, and edges connecting a plurality of the nodes having a strong relationship in terms of usage; The processing unit includes: When a conceptual graph is obtained that includes a source point node that represents the source point, a destination point node that represents the destination point, and a point function node that represents the point function, the conceptual graph is created in the form of the state graph. Generate an ideal state graph in the form of the state graph by supplementing the acquired conceptual graph with supplementary nodes to include additional nodes representing location functions that do not currently exist or methods of moving between the locations that do not currently exist, and which represents a state in which a person present at the source location can move to the destination location and use the location functions at the destination location; Calculating a difference between the ideal state graph and the current state graph as additional element information; Output the calculated additional element information; Urban design support device.

2. The urban design support device according to claim 1, The urban design assistance apparatus is connected to a network that is connected to a user terminal, Further, a communication unit for transmitting and receiving data to and from a user terminal is provided, When the communication unit acquires the conceptual graph from the user terminal, The communication unit stores the acquired conceptual graph in the storage unit, the processing unit acquires the conceptual graph acquired by the communication unit. Urban design support device.

3. The urban design support device according to claim 1, The storage unit further stores node template information that associates and stores attributes of the plurality of nodes connected by the edge with a type of a supplementary node to be supplemented between the edge and the plurality of nodes connected by the edge; The processing unit includes a conceptual graph unit, The conceptual graph unit For each of the edges included in the conceptual graph, obtain, in the node template information, attributes associated with attributes of the plurality of nodes connected by the edge; According to the acquired attribute, a supplementary node of the acquired attribute is supplemented between the plurality of nodes connected by the edge, and the supplementary node is connected to the plurality of nodes connected by the edge by a new edge, generating the ideal state graph; Urban design support device.

4. The urban design support device according to claim 3, The conceptual graph unit For each of the edges included in the conceptual graph, obtain, in the node template information, attributes associated with attributes of the plurality of nodes connected by the edge; presenting at least one point node within a movable range whose distance from at least one of the plurality of nodes connected by the edge is equal to or less than the movable distance as a supplementary node candidate; Accepting an input of a replenishment node candidate selected from the presented replenishment node candidates; Once the selected candidate replenishment nodes are obtained, The obtained replenishment node candidate is set as the replenishment node. Urban design support device.

5. The urban design support device according to claim 1, The processing unit includes an analysis unit, the analysis unit calculates a gap evaluation value indicating a magnitude of a difference between the ideal state graph and the current state graph based on the additional element information, and outputs the calculated gap evaluation value. Urban design support device.

6. The urban design support device according to claim 5, The storage unit further stores a relationship model that is trained using the nodes and the edges of the current state graph and indicates strengths of relationships between the plurality of nodes of the current state graph; the analysis unit calculates a gap evaluation value indicating a magnitude of a difference between the ideal state graph and the current state graph based on the additional element information and the relationship model, and outputs the calculated gap evaluation value. Urban design support device.

7. The urban design support device according to claim 5, The urban design assistance device further includes an output device for displaying information, The analysis unit outputs the ideal state graph and the gap evaluation value to the output device. Urban design support device.

8. 1. An urban design support method in an urban design support device, comprising a storage device and a processor, the processor calculating information regarding the placement of facilities to be installed in a city, The storage device includes: storing a current state graph representing a current state, the current state graph being created in the form of a state graph including nodes representing points, point functions available at the points, or methods of moving between the points, and edges connecting a plurality of the nodes having a strong relationship in terms of usage; The processor, When a conceptual graph is obtained that includes a source point node that represents the source point, a destination point node that represents the destination point, and a point function node that represents the point function, the conceptual graph is created in the form of the state graph. Generate an ideal state graph in the form of the state graph by supplementing the acquired conceptual graph with supplementary nodes to include additional nodes representing location functions that do not currently exist or methods of moving between the locations that do not currently exist, and which represents a state in which a person present at the source location can move to the destination location and use the location functions at the destination location; Calculating a difference between the ideal state graph and the current state graph as additional element information; Output the calculated additional element information; Urban design support method.

9. 1. An urban design support program for an urban design support device, comprising: a storage device and a processor, the processor calculating information regarding the layout of facilities to be provided in a city, The storage device includes: storing a current state graph representing a current state, the current state graph being created in the form of a state graph including nodes representing points, point functions available at the points, or methods of moving between the points, and edges connecting a plurality of the nodes having a strong relationship in terms of usage; When the processor obtains a conceptual graph in the form of the state graph, the conceptual graph including a source point node representing the source point, a destination point node representing the destination point, and a point function node representing the point function, The processor, supplementing the acquired conceptual graph with supplementary nodes to generate an ideal state graph in the form of the state graph, which includes additional nodes representing location functions that do not currently exist or methods of moving between the locations that do not currently exist, and represents a state in which a person at a source location can move to a destination location and use the location functions at the destination location; A difference between the ideal state graph and the current state graph is calculated as additional element information; Output the calculated additional element information, Urban design support program.

Images