WO2016185696A1 - Système de gestion d'itinéraire, procédé de gestion d'itinéraire et support d'enregistrement lisible par ordinateur - Google Patents

Système de gestion d'itinéraire, procédé de gestion d'itinéraire et support d'enregistrement lisible par ordinateur Download PDF

Info

Publication number
WO2016185696A1
WO2016185696A1 PCT/JP2016/002345 JP2016002345W WO2016185696A1 WO 2016185696 A1 WO2016185696 A1 WO 2016185696A1 JP 2016002345 W JP2016002345 W JP 2016002345W WO 2016185696 A1 WO2016185696 A1 WO 2016185696A1
Authority
WO
WIPO (PCT)
Prior art keywords
route
crowd
main
possibility
main route
Prior art date
Application number
PCT/JP2016/002345
Other languages
English (en)
Japanese (ja)
Inventor
義晴 前野
Original Assignee
日本電気株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 日本電気株式会社 filed Critical 日本電気株式会社
Priority to JP2017518753A priority Critical patent/JP6658748B2/ja
Publication of WO2016185696A1 publication Critical patent/WO2016185696A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G—PHYSICS
    • G08—SIGNALLING
    • G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B25/00—Alarm systems in which the location of the alarm condition is signalled to a central station, e.g. fire or police telegraphic systems
    • G—PHYSICS
    • G08—SIGNALLING
    • G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B27/00—Alarm systems in which the alarm condition is signalled from a central station to a plurality of substations
    • G—PHYSICS
    • G08—SIGNALLING
    • G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B29/00—Checking or monitoring of signalling or alarm systems; Prevention or correction of operating errors, e.g. preventing unauthorised operation
    • G—PHYSICS
    • G08—SIGNALLING
    • G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B31/00—Predictive alarm systems characterised by extrapolation or other computation using updated historic data
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/005—Traffic control systems for road vehicles including pedestrian guidance indicator

Definitions

  • the present invention relates to a route management system, a route management method, and a computer-readable recording medium.
  • the crowd may evacuate to an evacuation site.
  • a crowd may move to a venue, transportation, or the like.
  • the crowd is guided to move along a predetermined route according to the situation such as the disaster or the event.
  • crowd guidance it is desirable to select an appropriate guidance route.
  • Patent Document 1 describes a route guidance system.
  • the route guidance system described in Patent Document 1 guides the person to be guided from any location within a predetermined area to the destination so as to be intuitively understood. Further, the route guidance system described in Patent Document 1 is configured to automatically calculate a route based on the Dijkstra method, for example, the distance of each route existing between the start point and the end point.
  • Patent Document 2 describes an evacuation guidance system and the like.
  • an evacuation guidance server generates evacuation route information based on disaster information, current position information received from a portable information terminal, and map information around the current position.
  • the portable information terminal detects the current position triggered by the reception of disaster information, transmits it to the evacuation guidance server, and uses the evacuation route information transmitted from the evacuation guidance server. Execute navigation processing.
  • Patent Document 3 describes an evacuation guidance method and the like.
  • the comparison determines the probability that a person can pass through each blocking location in the current state while being healthy, and the route with the highest probability is the refugee as the safest route. Shown in
  • the crowd or part of the crowd can travel via a route different from the defined route There is sex.
  • the crowd moves along a route different from the predetermined route, there is a higher possibility that the time and distance of the movement will be longer or that confusion will occur.
  • the route is not selected in consideration of the influence when the crowd deviates from a predetermined route and travels to a route different from the predetermined route. That is, with the techniques described in Patent Documents 1 to 3, it may be difficult to efficiently guide the crowd.
  • the present invention has been made to solve the above-described problems, and has as its main object to provide a route management system and the like that enable efficient guidance of the crowd.
  • the route management system includes a specifying unit that specifies a candidate for a main route and a candidate for a sub route related to the main route used when the crowd moves, and the crowd proceeds to a route different from the main route.
  • the route management method specifies a candidate of a main route used when a crowd moves and a candidate of a sub route related to the route, and derives a possibility that the crowd proceeds to a route different from the main route. Then, based on the main route, the sub route, and the possibility, the route used by the crowd is selected from the route candidates.
  • a process for identifying a main route candidate and a sub route candidate related to the main route to be used when the crowd moves is performed on the computer.
  • each component of each device represents a functional unit block.
  • Each component of each device can be realized by any combination of an information processing device 500 and software as shown in FIG. 11, for example.
  • the information processing apparatus 500 includes the following configuration as an example.
  • each device can be realized as a dedicated device.
  • Each device can be realized by a combination of a plurality of devices.
  • each of the plurality of devices constituting each device may be connected by a wired or wireless communication network.
  • FIG. 1 is a diagram showing a path management system according to the first embodiment of the present invention.
  • FIG. 2 is a diagram illustrating examples of routes targeted by the route management system according to the first embodiment of the present invention.
  • FIG. 3 is a diagram showing an example of a link management table for managing information on links included in the route shown in FIG.
  • FIG. 4 is a diagram illustrating an example of a decision factor management table indicating factors when a crowd selects a route in the first embodiment of the present invention.
  • FIG. 5 is a diagram illustrating an example of a node environment management table showing factors related to the environment when a crowd selects a route in the first embodiment of the present invention.
  • FIG. 1 is a diagram showing a path management system according to the first embodiment of the present invention.
  • FIG. 2 is a diagram illustrating examples of routes targeted by the route management system according to the first embodiment of the present invention.
  • FIG. 3 is a diagram showing an example of a link management table for managing information on links included in the route shown in
  • FIG. 6 is a flowchart showing the configuration of the path management system according to the first embodiment of the present invention.
  • FIG. 7 is a diagram showing a configuration of a modified example of the route management system in the first exemplary embodiment of the present invention.
  • FIG. 8 is a flowchart showing another example of the operation of the path management system in the first exemplary embodiment of the present invention.
  • FIG. 9 is a diagram showing a configuration of another modification of the route management system in the first exemplary embodiment of the present invention.
  • FIG. 10 is a diagram showing a configuration of still another modified example of the route management system according to the first exemplary embodiment of the present invention.
  • the route management system 100 includes a specifying unit 110, a possibility derivation unit 120, and a selection unit 130.
  • the identifying unit 110 identifies a candidate for a main route and a candidate for a sub route related to the main route used when the crowd moves.
  • the possibility deriving unit 120 obtains a possibility that the crowd will travel on a route different from the main route.
  • the selection unit 130 selects a route used by the crowd among main route candidates based on the main route, the sub route, and the above-described possibility.
  • the route management system 100 may further include a route storage unit 111, a decision factor storage unit 121, and an environment factor storage unit 122, as shown in FIG.
  • the route storage unit 111 holds information on a route related to the main route or the sub route.
  • the decision factor storage unit 121 holds information related to a decision factor management table and the like which will be described later.
  • the environment storage unit 122 holds information related to a node environment management table and the like which will be described later.
  • the identification unit 110 identifies candidates for the main route and the sub route that the crowd uses when moving.
  • the main route is a route that is used when the departure point and the destination are connected and the crowd moves from the departure point to the destination.
  • the departure place is a place where the crowd stays, for example, when the crowd starts moving.
  • the destination is the place where the crowd goes.
  • the crowd moves on the main route or the like on foot.
  • the starting point or the destination is determined in advance by any procedure when the specifying unit 110 specifies candidates for the main route and the sub route.
  • the place where the crowd exists when the disaster occurs is determined as the departure place.
  • shelters and temporary accommodation facilities are defined as destinations.
  • the route that becomes the evacuation route corresponds to the main route. That is, it is assumed that the crowd is guided to move to the destination via the main route.
  • the venue where the event is held the railway station adjacent to the venue, etc. Transportation, etc. is determined as the starting point or destination.
  • One of the roads connecting the venue and the railway station becomes the main route.
  • the sub route is a route that connects an arbitrary point of the main route and the destination and is at least partially different from the main route.
  • the sub route will move from the point where the crowd has advanced to a different route to the destination. It is a route that may pass before it reaches.
  • the route for which the main route or the like is specified by the specifying unit 110 is expressed in a format such as a graph shown in FIG.
  • the graph shown in FIG. 2 includes nodes and links connecting the nodes.
  • a node corresponds to a branch point such as an intersection in a real road network or the like where a crowd can move, a place where a crowd stays, or the like.
  • a link corresponds to each road in an actual road network or the like that can be a route on which a crowd moves.
  • An identifier may be attached to each node or link.
  • the nodes are numbered 1 to 4 as identifiers.
  • the links are given the codes L1 to L6 as identifiers.
  • For each link there is no need to specify the direction in which the crowd moves. However, the direction in which the crowd moves may be specified in accordance with the situation such as an actual road corresponding to each link.
  • the graph related to the route shown in FIG. 2 is expressed in the form of a table as shown in FIG. 3, for example.
  • the table shown in FIG. 3 is called a link management table as necessary.
  • the link management table shown in FIG. 3 shows, for each link included in the graph shown in FIG. 2, information on the two nodes connected by the link at both ends and the distance of the link.
  • the link distance indicates the distance between two nodes connected to the link.
  • the link distance is determined based on the length of the actual road associated with each link.
  • the link management table shown in FIG. 3 may include other information related to links.
  • the identifying unit 110 acquires information about the route included in the link management table shown in FIG. 3 via any input means, a communication network, or the like. For example, when the specifying unit 110 includes the route storage unit 111 illustrated in FIG. 7, the specifying unit 110 may acquire information on the above-described route stored in the route storage unit 111 in advance.
  • the identifying unit 110 acquires information regarding the departure place and the purpose.
  • the specifying unit 110 acquires these pieces of information via an arbitrary input unit, a communication network, or the like, similarly to the information on the route.
  • the starting point is the node 1 and the destination is the node 4 in the examples of FIGS.
  • the identifying unit 110 identifies a candidate for the main route by using information on the route included in the link management table shown in FIG. 3 described above.
  • the identification unit 110 uses the Dijkstra method, for example, to determine a route with the shortest distance among routes that can reach the destination from the departure point, and sets it as a candidate for the main route.
  • the identifying unit 110 selects a route from the node 1 as the departure point to the node 4 as the destination via the link L1, the node 2, and the link L4. As specified.
  • the specifying unit 110 further specifies a plurality of main route candidates.
  • the specifying unit 110 has the smallest distance from the starting point to the destination using the Dijkstra method or the like.
  • the route is obtained and set as a main route candidate.
  • the identifying unit 110 may identify a predetermined number of main route candidates according to the above-described procedure, or may obtain all routes that can be main route candidates.
  • the specifying unit 110 in addition to the above-described main route candidates, for example, from the node 1, which is the departure point, at the destination via the link L3, the node 3, and the link L5.
  • a route toward a certain node 4 is specified as a candidate for the main route.
  • the specifying unit 110 further specifies a sub route with respect to the main route.
  • the specifying unit 110 for example, from the first node (hereinafter referred to as “adjacent node”) to the destination when the crowd travels from a node included in the main route to a route different from the main route.
  • the shortest route is identified as a sub route.
  • the possibility deriving unit 120 which will be described later, derives the possibility that the crowd will travel on a route different from the main route
  • the specifying unit 110 is included in the main route candidates using information on the possibility.
  • a sub route may be specified for some nodes.
  • the route going to link L2 at node 2 is the sub route. Conceivable.
  • the adjacent node reached via the link L2 is the node 1.
  • the specifying unit 110 takes a route from the node 1 to the node 4 via the link L1, the node 2, the link L2, the node 1, the link L1, the node 2, and the link L4. Specify as a route.
  • the route forward from the node 1 to the link L6 at the node 3 is the secondary route candidate to the node 4 via the link L3, the node 3 and the link L5.
  • the specifying unit 110 specifies, as an example, a path that travels from the node 1 to the node 4 via the link L3, the node 3, and the link L6.
  • the specifying unit 110 determines a node that is most likely to travel to a route different from the main route in the possibility deriving unit 120 described later, or a certain percentage of the possibility. Identify sub-paths for nodes that exceed.
  • the specifying unit 110 may specify the sub route with respect to all the nodes included in the main route regardless of the possibility that the crowd travels to a route different from the main route.
  • the specifying unit 110 can appropriately determine a sub route according to an operation related to selection of a main route and a sub route in the selection unit 130 described later.
  • the specifying unit 110 may be configured to acquire information related to a main route or a sub route specified in advance.
  • the possibility deriving unit 120 calculates the possibility that the crowd will travel on a route different from the main route.
  • the possibility deriving unit 120 obtains a possibility that the crowd will travel on a route different from the main route, for example, at a node that is a branch point included in each of the main route candidates.
  • a link different from the link included in the main route for example, a link included in the sub route
  • It means selecting and heading to the destination.
  • the crowd when the crowd moves to a route different from the main route, the crowd corresponds to a link corresponding to a link different from the link included in the main route at an intersection corresponding to a node that is a branch point included in the main route. Equivalent to selecting and heading to the destination. Therefore, when the crowd moves to a route different from the main route, the crowd fails to select the route at the node that is a branch point included in the main route, or the guidance of the crowd by the administrator of the main route fails. You can also think.
  • the possibility deriving unit 120 obtains the possibility that the crowd will travel on a route different from the main route, for example, in the form of the probability that the crowd will travel on a route different from the main route in each of the nodes included in the main route.
  • the probability that the crowd travels on a route different from the main route is also considered to be the probability that the crowd fails to guide to the main route.
  • the probability that the crowd travels on a route different from the main route indicates, for example, the proportion of people who travel on a route different from the main route. That is, in each embodiment of the present invention, when the crowd travels on a route different from the main route, a case where a part of the crowd travels on a route different from the main route is included.
  • the probability that the crowd will travel on a route different from the main route is, for example, the number of times that the crowd travels on a route different from the main route in the plurality of movements assuming that the crowd moves the main route multiple times. It may be a ratio.
  • the possibility deriving unit 120 may obtain the possibility that the crowd will travel on a route different from the main route in a form different from the probability that the crowd will travel on a route different from the main route.
  • the possibility deriving unit 120 may obtain the possibility that the crowd will travel on a route different from the main route in a format such as which of a plurality of stages corresponds.
  • the possibility deriving unit 120 determines a route in which the crowd is different from the main route based on factors that may affect the determination of the direction of travel when the crowd determines a link to be traveled in the node. Ask for the possibility to go to.
  • the crowd decides the direction of travel
  • the crowd for example, the actual intersection or road environment associated with the node or link, the information posted on the intersection, etc. It is assumed that some guidance information may be affected. That is, it is assumed that two main factors relating to the environment and guidance influence the determination of the direction of travel of the crowd.
  • the possibility deriving unit 120 obtains the possibility that the crowd will travel on a route different from the main route based on information on the environment of the main route and information on guidance of the crowd on the main route.
  • the factors related to the environment at the nodes included in the main route are called environmental factors.
  • the factors related to the guidance information for guiding the crowd to the main route are called guidance factors.
  • the possibility deriving unit 120 obtains the possibility that the crowd will travel on a route different from the main route by using the ratio of two factors of the environmental factor and the guidance factor determined for each node.
  • the environmental factor and the inductive factor are each represented by a positive value, and are normalized by the sum so as to be 1 and used in the possibility derivation unit 120.
  • the ratio of environmental factors and inductive factors is determined as follows, for example.
  • a crowd is a main route if the road associated with the link that is the main route among the multiple links connected to the node is wide and bright compared to the road associated with the other links It is assumed that the possibility of selecting a link is high. In this case, the respective ratios are determined so that the ratio of environmental factors increases and the ratio of induction factors decreases.
  • each ratio is determined so that the ratio of the inducing factor is increased and the ratio of the environmental factor is decreased.
  • FIG. 4 shows an example of a table regarding environmental factors and induction factors.
  • the table shown in FIG. 4 is also called a decision factor management table.
  • the decision factor management table shown in FIG. 4 represents environmental factors and guidance factors in each of the nodes included in the route shown in FIG. 2 in a table format.
  • the environmental factor value is 0.6 and the guidance factor value is 0 for each of the nodes 1 to 4 included in the route shown in FIG. .4.
  • This ratio is determined based on, for example, the result of a questionnaire conducted on a pedestrian who has actually walked an intersection associated with the node. In addition, this ratio may be determined based on information acquired by various sensors installed at the intersection or the like. In any case, the above-described ratio may be determined for each time when the crowd is expected to move.
  • the possibility deriving unit 120 obtains and uses information such as the above-described decision factor management table via an input means or a communication network (not shown) as needed when the crowd seeks the possibility of traveling on a route different from the main route. May be.
  • the decision factor storage unit 121 is provided as in the route management system 101 illustrated in FIG. 7, the possibility derivation unit 120 includes the decision factor management table stored in the decision factor storage unit 121 in advance. Such information as described above may be acquired and used.
  • the possibility deriving unit 120 may use other information related to the environment such as an intersection related to each node and a link connected to the node. For example, in a node to which a plurality of links are connected, the crowd depends on factors related to the environment of the node or the link, such as an intersection corresponding to the node and the width and brightness of a road corresponding to the link. It is assumed that the direction of movement is determined.
  • the possibility deriving unit 120 uses the ratio indicating the ratio of each of the plurality of links connected to the node to be selected as the moving direction by the crowd at each node, so that the crowd proceeds on a route different from the main route.
  • a possibility may be sought.
  • Each of the plurality of links in this case is a link that becomes a candidate of a main route or a sub route, for example. This ratio is determined according to factors related to the environment of the node and the link connected to the node.
  • FIG. 5A is a diagram showing the ratio of the path shown in FIG. 5A and 5B, the “previous link number” represents a link used when the crowd reaches the node.
  • the “next link number” represents a link where the crowd proceeds from the node.
  • “Ratio” indicates the ratio of the crowd going from the link specified by “previous link number” to the link specified by “next link number”. That is, in the example shown in FIG. 5A, it is assumed that the crowd that has reached the node 2 via the link L1 proceeds to either the link L2 or L4 at the same rate. That is, in the example shown in FIG.
  • the possibility deriving unit 120 may acquire and use information such as the above-described node environment management table via an input unit or a communication network (not shown) as needed.
  • the possibility deriving unit 120 includes the above-described node environment management table and the like stored in advance in the environmental factor storage unit 122. The acquired information may be acquired and used.
  • the above-mentioned ratio in each node is determined based on the width, brightness, traffic, etc. of roads associated with each link. For example, there are a plurality of link candidates (that is, links designated by “next link number” in the node environment management table of FIG. 5) that the crowd proceeds to, and roads respectively corresponding to the plurality of link candidates. If the widths of the links are the same, the same ratio is assigned to each link. For example, if the crowd has two link candidates to go to next and the road widths related to the two link publications are both 3 meters, this ratio will be 0.5 respectively Assigned to each.
  • the above-described ratio is set according to the brightness. Assigned to the link. As an example, if the crowd has two next link candidates, and the road brightness associated with the two link candidates is one 80 lux and the other 20 lux, this ratio Are assigned to each link as 0.8 and 0.2, respectively.
  • the possibility deriving unit 120 obtains the probability that the crowd will travel on a route different from the main route for each node based on the information described above. Then, the possibility deriving unit 120 sets the calculated probability as the possibility that the crowd will travel on a route different from the main route. For example, the possibility deriving unit 120 calculates the product of the ratio assigned to the link different from the main route among the links in the traveling direction from each node and the guidance factor at the node, at the crowd. Is the probability of traveling on a route different from the main route.
  • the possibility deriving unit 120 determines the probability that the crowd proceeds along the main route, assuming that the crowd proceeds along the main route when the crowd does not travel on a route different from the main route at the node. Can be sought. That is, the possibility deriving unit 120 calculates the difference obtained by subtracting the probability that the crowd proceeds to a route different from the main route at the node from 1 (representing all cases when the crowd proceeds) from the crowd to the main route at the node. Probability of proceeding.
  • the possibility deriving unit 120 obtains the probability that the crowd will travel on a route different from the main route as follows. In the candidate of the main route from the departure node 1 to the node 4 via the link L1, the node 2, and the link L4, for example, the route toward the link L2 is different from the link L4 included in the main route in the node 2. Exists. In this case, the possibility deriving unit 120 obtains 0.2, which is a product of 0.4 that is the guidance factor in the node 2 and 0.5 that is the ratio allocated to the link L2, in the crowd at the node 2. Is the probability of traveling on a route different from the main route. Therefore, the possibility deriving unit 120 sets the probability that the crowd will travel along the main route at the node 2 as 0.8.
  • the link L6 is different from the link L5 included in the main route.
  • the possibility deriving unit 120 obtains 0.08, which is a product of 0.4 that is the guidance factor at the node 3 and 0.2 that is the ratio assigned to the link L6, at the crowd at the node 3. Is the probability of traveling on a route different from the main route. Therefore, the possibility deriving unit 120 sets the probability that the crowd will travel along the main route at the node 3 is 0.92.
  • the possibility deriving unit 120 allows the crowd to go to a route different from the main route for each node. You may ask for sex.
  • the node for which the possibility of deriving the possibility that the crowd will travel on a route different from the main route in the possibility deriving unit 120 is appropriately determined according to the route selection procedure in the selecting unit 130 described later.
  • the possibility deriving unit 120 may obtain the possibility that the crowd will travel on a route different from the route by another method. For example, the possibility deriving unit 120 may obtain the possibility that the crowd will travel on a route different from the main route based on the percentage of people who actually traveled on a route different from the main route. Or possibility derivation part 120 may ask for the possibility that a crowd will go on a course different from a main course based on a result when a person without land intuition about a main course walks a main course.
  • the possibility derivation unit 120 determines that the crowd is the main route based on the result of measuring the ratio of the person who has no intuition regarding the main route, etc., to the route different from the main route at the node having the branch. The probability indicating the possibility of traveling on a different route from that is obtained.
  • the selection unit 130 selects a route used by the crowd among main route candidates.
  • the selection unit 130 selects a route used by the crowd based on the main route, the sub route, and the possibility that the crowd determined by the possibility deriving unit 120 may travel to a route different from the main route. That is, when the route is selected by the selection unit 130, the influence when the crowd travels to a route different from the main route is considered.
  • the influence when the crowd travels to a route different from the main route is determined using, for example, information on candidates for the main route and the sub route and the possibility that the crowd travels to a route different from the main route.
  • the route that becomes the moving route is the shortest distance (or the shortest time required).
  • the route for the route with the shortest distance to the destination is a route that requires a long distance or time to reach the destination as described above, it is considered that the route is not preferable as the main route. .
  • the route that does not vary greatly in distance and time required to the destination is selected as the main route, and the shortest route to the destination is selected as the main route. It may be preferable to being selected.
  • the selection unit 130 selects a route used by the crowd based on the main route, the sub route, and the above-described possibility. That is, the selection unit 130 takes into consideration the effect of the crowd traveling on a route different from the main route, and the distance and time required for movement when the crowd travels on a route different from the main route among the main route candidates. A route with a small increase is selected. As an example, the selection unit 130 selects a route used by the crowd based on an expected value of a distance required when the crowd moves from the departure place to the destination for each of the main route candidates.
  • the expected distance traveled by the crowd is the distance that the crowd moves along the main route, the distance that the crowd moves along the secondary route associated with the main route, and the It is calculated using the probability of passing through each sub route.
  • the probability that the crowd goes through the main route or the sub route is the probability that the crowd travels on a route different from the main route or the probability that the crowd travels along the main route. Then, the selection unit 130 obtains an expected value of the distance required for the movement of the crowd for each of the main route candidates.
  • the selection unit 130 may determine the distance from the starting point to the destination in each case when the crowd moves along a candidate main route or a sub route related to the main route, Each product with the probability of selecting a route is obtained. Then, the selection unit 130 sets the sum of the products obtained as described above as an expected value of the distance required when the crowd moves along the main route.
  • the distance is 2 according to the link management table shown in FIG.
  • the probability that the crowd will head for the main route at node 2 is 0.8 as described above.
  • the crowd travels to a route different from the main route, and the route toward the destination node 4 via the link L2, the node 1, the link L1, the node 2, and the link L4 is the sub route. It is assumed as a route. In this case, the probability that the crowd in node 2 travels to a route different from the main route and heads for the sub route is 0.2 as described above. Further, the distance required from the starting point to the destination via the sub route is 5 according to FIG.
  • the selection unit 130 is the product of the distance 2 when moving along the above-described main route and the probability 0.8 that the main route is selected, and the distance when moving along the sub route. 5 and the probability of selecting the sub route 0.2. Then, the selection unit 130 obtains the expected value of the distance required for the movement of the crowd for the above-described main route by obtaining the sum of these products to 2.6.
  • the route is passed through the main route.
  • the distance in the case is 3 according to FIG.
  • the probability that the crowd will head for the main route at node 3 is 0.92, as described above.
  • the crowd proceeds to a route different from the main route, and a route to the destination node 4 via the link L6 is assumed as the sub route.
  • the probability that the crowd proceeds to a route different from the main route and heads for the sub route is 0.08 as described above.
  • the distance required from the departure point to the destination via the sub route is 4 according to FIG.
  • the selection unit 130 is the product of the distance 3 when moving along the above-described main route and the probability 0.92 that the main route is selected, and the distance when moving along the sub route. 4 and the probability that the sub route is selected is 0.08. Then, the selection unit 130 obtains the expected value of the distance required for the movement of the crowd for the above-described main route by obtaining the sum of these products as 3.08.
  • the selection unit 130 selects, from among the main route candidates, for example, the main route candidate having the smallest expected distance required when the crowd moves from the departure place to the destination as the route used by the crowd.
  • the selection unit 130 selects a candidate for a main route from the node 1 that is the departure point to the node 4 that is the destination via the link L1, the node 2, and the link L4. Since it is smaller than the main route candidate, it is selected as a route used by the crowd.
  • the selection unit 130 selects a route used by the crowd, even when the crowd travels to a route different from the main route, the distance from the crowd to the destination compared to the main route is determined. The path is selected so that the increase is small.
  • the selection unit 130 branches from a node that is most likely to travel to a route different from the main route, for example.
  • the sub route is targeted when calculating the expected value described above. By doing in this way, it becomes possible to reduce calculation required when calculating
  • the selection unit 130 may target information on any sub-route including all sub-routes in the expected value calculation.
  • the target sub-path in the expected value calculation performed by the selection unit 130 is appropriately determined according to the complexity of the calculation required to calculate the expected value, the accuracy of the expected value required, and the like.
  • the selection unit 130 may select a route used by the crowd among candidates for the main route using a procedure different from the procedure described above. For example, the selection unit 130 may select a route used by the crowd based on the expected time and the number of steps required when the crowd moves from the departure place to the destination. Further, the selection unit 130 appropriately weights each distance of the main route or the sub route from the departure point to the destination, obtains an average value of the distance from the departure point to the destination of each route, and calculates the average value. The route used by the crowd may be selected. The selection unit 130 selects the route having the smallest difference between the distance from the departure point to the destination when passing through the main route and the distance from the departure point to the destination when passing through the sub route regarding the main route. It may be selected as a route.
  • the generation unit 110 acquires, for example, information related to a route including a departure place and a destination via an input unit (not shown) (step S101). Next, the generation unit 110 identifies main route candidates from the routes included in the information acquired in step S101 (step S102).
  • the possibility deriving unit 120 derives, for each of the main routes specified in Step S102, the possibility that the crowd will travel on a route different from the main route (Step S103).
  • the generation unit 110 specifies a sub route based on the possibility that the crowd derived in step S103 travels to a route different from the main route (step S104). ).
  • the generation unit 110 creates a link different from the main route from a node derived from the nodes included in the main route that are most likely to travel to a route different from the main route.
  • the route to the destination via the route is specified as a sub route.
  • the selection unit 130 selects a route used by the crowd (step S105). Information on the selected route is output via an output unit or the like (not shown) as appropriate.
  • the route management system 100 selects a route to be used when a crowd moves.
  • the route management system 100 determines the possibility that the crowd will travel on a route different from the main route for each of the main route candidates used when the crowd moves. Then, the route management system 100 according to the present embodiment selects a route used by the crowd based on the possibility that the crowd will travel to a route different from the main route. In this case, the route management system 100 determines the route used by the crowd so that, for example, when the crowd travels to the different route, the distance and time required for the crowd to reach the destination are reduced. select.
  • the route management system 100 selects a route to be used when the crowd moves based on the influence of the crowd traveling on a route different from the main route.
  • the route management system 100 selects a route to be used when the crowd moves based on the influence of the crowd traveling on a route different from the main route.
  • the route management system 100 enables efficient guidance of the crowd.
  • the identifying unit 110 can identify the sub route in various orders or procedures. That is, unlike the example of the flowchart illustrated in FIG. 6, the specifying unit 110 may specify a sub route with respect to a node included in the specified main route together with the specification of the main route.
  • the route management system 100 operates according to the flowchart shown in FIG. 8, for example.
  • the operations in steps S111, S113, and S114 are performed in the same manner as the operations in steps S101, S103, and S105 in the flowchart shown in FIG.
  • the identifying unit 110 derives a sub route with respect to the nodes included in the main route, together with the derivation of the main route performed in step S102 illustrated in FIG.
  • route management system 100 may include other components.
  • FIG. 9 shows a configuration of a route management system 102 which is a modification of the first embodiment of the present invention.
  • the route management system 102 which is a modification of the first embodiment of the present invention, further includes a start point setting unit 140 and an end point setting unit 150 with respect to the route management system 100 in the first embodiment.
  • the start point setting unit 140 sets a starting point.
  • the start point setting unit 140 sets a starting point based on information on the situation of the crowd acquired in the route used by the route crowd.
  • Information on the situation of the crowd is acquired via various sensors installed on a route that may be a candidate for the main route.
  • the sensor is, for example, a camera installed at a plurality of points on the road network.
  • the starting point setting unit 140 sets a starting point based on the result of analyzing the images captured by these cameras. For example, the start point setting unit 140 sets a node related to a point where an image determined to show a crowd as a starting point. In addition, when an image showing a crowd is captured at a plurality of points, the start point setting unit 140 may estimate the number of crowds and set a point with the largest number of crowds as a departure point. .
  • the start point setting unit 140 may acquire information regarding the situation of the crowd via a sensor of a different type from the above-described camera.
  • the start point setting unit 140 may use information such as a human sensor or a temperature sensor installed on a route that may be a candidate for the main route. Even in this case, the start point setting unit 140 sets a departure point as a point where it is determined that the number of crowds is large based on information from these sensors and the like.
  • the end point setting unit 150 may acquire information regarding a starting point via an arbitrary input unit such as a keyboard, a communication network, or the like.
  • the end point setting unit 150 sets a destination point. For example, the end point setting unit 150 acquires information regarding a destination point via any input means such as a keyboard, a communication network, or the like. The end point setting unit 150 may determine the destination according to the position of the departure place set by the start point setting unit 140.
  • the end point setting unit 150 may use an evacuation place located near the departure place as a destination according to the point set as the departure place.
  • the end point setting unit 150 is located near the departure place and is an evacuation place that can accommodate the crowd. May be set as the destination.
  • the end point setting unit 150 may further set, as a destination, an evacuation place that can secure a space or the like that can accommodate a crowd based on sensor information or the like.
  • the generation unit 110 uses the information about the departure point or the destination set by the start point setting unit 140 or the end point setting unit 150 to select main route candidates. Generate.
  • the start point setting unit 140 and the end point setting unit 150 enable setting of a departure point and a destination according to the position of the crowd and the number of people. Therefore, the route management system 102 enables selection of a route according to the position of the crowd and the number of people.
  • the route management system 102 may include only one of the start point setting unit 140 and the end point setting unit 150.
  • route management system 100 may further include other components.
  • FIG. 10 shows a configuration of a route management system 103 which is a modified example of the first embodiment of the present invention.
  • the route management system 103 which is a modification of the first embodiment of the present invention, further includes a distribution unit 160 with respect to the route management system 100 in the first embodiment.
  • the distribution unit 160 distributes information regarding the main route determined by the selection unit 130.
  • the target to which the distribution unit 160 distributes information is determined according to the selected route.
  • the distribution unit 160 distributes such information via any wired or wireless communication network.
  • the distribution unit 160 determines a display device, digital signage, and the like arranged on the route determined as the main route as a target for distributing information, and distributes information on the main route to the target.
  • the information regarding the main route includes information regarding the direction in which the crowd should travel and information regarding nodes included from the departure point to the destination.
  • the distribution unit 160 may distribute these pieces of information to an application or the like executed on a mobile terminal or the like owned by the crowd.

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Emergency Management (AREA)
  • Economics (AREA)
  • Primary Health Care (AREA)
  • Health & Medical Sciences (AREA)
  • Automation & Control Theory (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Computer Security & Cryptography (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Computing Systems (AREA)
  • Navigation (AREA)
  • Alarm Systems (AREA)
  • Traffic Control Systems (AREA)

Abstract

L'invention concerne un système de gestion d'itinéraire, etc., permettant un guidage efficace d'une foule. Le système de gestion d'itinéraire est pourvu : d'une unité de spécification pour spécifier des candidats pour un itinéraire principal utilisé lorsqu'une foule est en mouvement, et des candidats pour un itinéraire auxiliaire afférent à l'itinéraire principal ; d'une unité de calcul de possibilité pour calculer la possibilité que la foule poursuive sa route sur un itinéraire différent d'un itinéraire principal ; et d'une unité de sélection pour sélectionner un itinéraire utilisé par la foule parmi les candidats pour un itinéraire principal, sur la base des itinéraires principaux, des itinéraires auxiliaires et de la possibilité.
PCT/JP2016/002345 2015-05-21 2016-05-13 Système de gestion d'itinéraire, procédé de gestion d'itinéraire et support d'enregistrement lisible par ordinateur WO2016185696A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2017518753A JP6658748B2 (ja) 2015-05-21 2016-05-13 経路管理システム、経路管理方法及びコンピュータ読み取り可能記録媒体

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2015103593 2015-05-21
JP2015-103593 2015-05-21

Publications (1)

Publication Number Publication Date
WO2016185696A1 true WO2016185696A1 (fr) 2016-11-24

Family

ID=57319827

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2016/002345 WO2016185696A1 (fr) 2015-05-21 2016-05-13 Système de gestion d'itinéraire, procédé de gestion d'itinéraire et support d'enregistrement lisible par ordinateur

Country Status (2)

Country Link
JP (1) JP6658748B2 (fr)
WO (1) WO2016185696A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3783313A1 (fr) * 2019-08-23 2021-02-24 Atos Integration Dispositif de création et de gestion d'itinéraires

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04326499A (ja) * 1991-04-26 1992-11-16 Toshiba Corp 避難誘導支援システム
JP2012252683A (ja) * 2012-01-03 2012-12-20 Ism Corp 津波避難ナビゲーションシステム、その方法及びプログラム
JP2013024764A (ja) * 2011-07-22 2013-02-04 Navitime Japan Co Ltd 経路探索装置、端末装置、経路探索システム、経路探索方法および経路探索プログラム
JP2013089224A (ja) * 2012-03-26 2013-05-13 Ism Corp 津波避難支援システム、津波避難支援方法、津波避難支援装置およびその制御方法と制御プログラム
JP2014081795A (ja) * 2012-10-17 2014-05-08 Houwasangyo Kk 避難誘導装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04326499A (ja) * 1991-04-26 1992-11-16 Toshiba Corp 避難誘導支援システム
JP2013024764A (ja) * 2011-07-22 2013-02-04 Navitime Japan Co Ltd 経路探索装置、端末装置、経路探索システム、経路探索方法および経路探索プログラム
JP2012252683A (ja) * 2012-01-03 2012-12-20 Ism Corp 津波避難ナビゲーションシステム、その方法及びプログラム
JP2013089224A (ja) * 2012-03-26 2013-05-13 Ism Corp 津波避難支援システム、津波避難支援方法、津波避難支援装置およびその制御方法と制御プログラム
JP2014081795A (ja) * 2012-10-17 2014-05-08 Houwasangyo Kk 避難誘導装置

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3783313A1 (fr) * 2019-08-23 2021-02-24 Atos Integration Dispositif de création et de gestion d'itinéraires
FR3100060A1 (fr) * 2019-08-23 2021-02-26 Atos Integration Dispositif de creation et de gestion d'itineraires

Also Published As

Publication number Publication date
JP6658748B2 (ja) 2020-03-04
JPWO2016185696A1 (ja) 2018-03-15

Similar Documents

Publication Publication Date Title
JP5902607B2 (ja) 旅行時間情報提供装置、旅行時間情報提供方法
US9659492B2 (en) Real-time vehicle spacing control
CN107561490B (zh) 推荐建筑物中的位置的装置及其使用方法
US20130253812A1 (en) Traffic Congestion Prediction Method And Traffic Congestion Prediction Device
US9273970B2 (en) Systems and methods for generating a plurality of trip patterns
EP2489983A2 (fr) Système de navigation
JP4368404B2 (ja) ナビゲーションシステム、経路探索サーバおよび経路探索方法
KR20190093318A (ko) 최단시간 경유경로 정보 제공 시스템, 및 방법
US20190128682A1 (en) Route guidance system and recording medium recording route guidance program
JP6488136B2 (ja) サーバ装置
US20190210805A1 (en) Movement route determination method and program
JP6669167B2 (ja) 誘導支援システム、誘導支援方法及びコンピュータ読み取り可能記録媒体
JP6999519B2 (ja) 輸送力調整装置、輸送力調整システムおよび輸送力調整方法
WO2016185696A1 (fr) Système de gestion d'itinéraire, procédé de gestion d'itinéraire et support d'enregistrement lisible par ordinateur
US20130046464A1 (en) Method and system for generating fixed transit routes
JP2019215798A (ja) 情報処理方法および情報処理装置
JP6417272B2 (ja) 情報処理装置、および、コンピュータプログラム
JP5053135B2 (ja) 交通情報表示システム、交通情報表示サーバ、交通情報表示方法、および、コンピュータプログラム
JP2016211900A (ja) 情報処理装置、経路探索方法、交通情報データ、およびコンピュータプログラム
WO2015125462A1 (fr) Dispositif et procédé de recherche d'itinéraire, programme informatique et structure de données
JP2018066570A (ja) 経路管理装置、経路管理方法及びプログラム
JP2011164070A (ja) 訪問地予測装置、及び、訪問地予測方法
JP7272449B2 (ja) 通行可否判断方法、通行可否判断装置、及び移動経路生成システム
JP6687021B2 (ja) 誘導支援システム、誘導支援方法及びコンピュータ読み取り可能記録媒体
JP7359293B2 (ja) 座席案内装置、システム、方法及びプログラム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16796092

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2017518753

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16796092

Country of ref document: EP

Kind code of ref document: A1