JP4652848B2 - Apparatus and method for searching for optimum route in station premises - Google Patents

Description

  The present invention relates to an optimum route searching apparatus and method in a station premises, and more specifically, when a moving means in the vertical direction such as an elevator or an escalator is used, and in consideration of the congestion situation of the moving route. The present invention relates to an optimum route searching apparatus and method capable of searching for an optimum route from a station entrance to a boarding vehicle position.

The route search system to the destination by the map information and the route guidance system have been actively used. In addition to this, it has been applied to guidance in the station premises.
For example, as an optimum route search system in a conventional station premises, for example, an optimum route search system has been proposed that presents a route that can shorten the time it takes to get to an entrance close to the destination after getting off at the destination station (for example, Patent Document 1).
JP 2003-185464 A

However, although the technique described in Patent Document 1 is suitable for moving quickly within a station premises, by a person who has a request to quickly reach a train through a route searched by such a method. Since the possibility of being selected is high, there is a problem that the vehicle is crowded.
In addition, there are many cases where the handicapped person or the elderly is not suitable for easy travel.
In addition, when people with disabilities or elderly people move to the position of the boarding vehicle, it is often easier to move by using an elevator or escalator instead of the stairs. No search method has been proposed.
In addition, there is no proposal from the viewpoint of searching for a travel route that is not congested.
Furthermore, there is no proposal from the viewpoint of route search for a boarding position for boarding a vehicle having a priority seat.

  It is an object of the present invention to search for a low-crowded boarding vehicle position so that even a handicapped person or an elderly person can easily move, and easily move to the boarding vehicle position using an elevator or an escalator. It is an object of the present invention to provide a route searching apparatus and method in a station premises that can search for a possible route in consideration of the degree of congestion in the station premises.

In order to achieve the above object, the present invention provides a timetable data storage unit that stores timetable data, a train congestion degree data storage unit that stores congestion degree data of each car in a train or a train, and a station premises. A location information data storage unit for storing location information data based on a three-dimensional location vector of a facility including an elevator means, a premises congestion degree data storage unit for storing congestion degree data in the station premises, and map data in the station premises are stored. Optimal route search apparatus in a station premises, comprising a database including a map data storage unit, an input means for inputting search conditions, and a search processing means for searching for an optimal route to a target position and outputting a search result to a display screen Because
The search processing means
A route search condition including priority regarding a desired boarding time condition, a use condition of the elevating means and a desired congestion degree condition regarding the degree of congestion is received from the input means, and based on the desired boarding time condition and the timetable data A first means for searching for a boarding train, a second means for searching the degree of congestion for each vehicle of the searched boarding train from the train congestion degree data storage unit, and a desired congestion degree condition received from the input means, The degree of congestion for each vehicle, the use conditions of the elevating means, the degree of congestion in the station premises acquired from the premises congestion degree data storage unit, and the location information data of the facilities in the station premises acquired from the location information data storage unit And a third means for searching for an optimum route satisfying the desired congestion degree condition received from the input means and the use conditions of the lifting means among the trains searched by the first means, and Characterized in that it comprises a fourth means for outputting the drawing on the display screen based route on the map data of the station premises stored in the map data storage unit.
Further, the on-site congestion degree data is stored in the on-site congestion degree data storage unit using on-site location information and time as parameters.

In addition, a timetable data storage unit that stores timetable data, a train congestion degree data storage unit that stores congestion degree data of each train or each car in the train, and a three-dimensional position vector of a facility that includes lifting means in the station premises A database including a location information data storage unit that stores location information data based on the above, a campus congestion degree data storage unit that stores congestion degree data within a station, and a map data storage unit that stores map data within the station, An optimum route search processing method in a station premises comprising an input means for inputting search conditions and a search processing means for searching for an optimum route to a target position and outputting a search result to a screen,
The search processing means
A route search condition including priority regarding a desired boarding time condition, a use condition of the elevating means and a desired congestion degree condition regarding the degree of congestion is received from the input means, and based on the desired boarding time condition and the timetable data A first step of searching for a boarding train, a second step of searching from the train congestion level data storage unit for the degree of congestion of each searched boarding train, and a desired congestion level condition received from the input means, The degree of congestion for each vehicle, the use conditions of the elevating means, the degree of congestion in the station premises acquired from the premises congestion degree data storage unit, and the location information data of the facilities in the station premises acquired from the location information data storage unit The third step of searching for the optimum route satisfying the desired congestion degree condition received from the input means and the usage means of the lifting means among the trains searched in the first step. When, characterized in that it comprises a fourth step of outputting to draw on the display screen based on the searched optimum route in the map data of the station premises stored in the map data storage unit.

  According to the present invention, even when the entrance of the station and the platform are not on the same floor, along with the degree of congestion of the vehicle, what kind of lifting means is used as the lifting means that moves between the floors Since the optimum route from the entrance of the station to the position of the boarding vehicle is searched according to the individual's condition, the user can move within the station along the optimum movement route for the user.

Hereinafter, a station premises route search apparatus and method according to an embodiment of the present invention will be specifically described with reference to the drawings.
FIG. 1 is a block diagram showing a configuration example of a station premises route search apparatus according to an embodiment of the present invention.
As shown in FIG. 1, the station premises route search apparatus according to the present embodiment includes an optimum route search device 1 and an input / output device 2.
The optimum route search device 1 includes a search unit 3 that performs an optimum route search and a data unit 4 that includes data used for the optimum route search. The data unit 4 includes, for example, timetable data 4a, train congestion data 4b, on-site location data 4c relating to a facility on the premises represented by, for example, a three-dimensional position vector, on-site congestion data 4d, and map data 4e. And have.
The optimum route search device 1 and the input / output device 2 may have an integrated configuration, but the optimum route search device 1 and the input / output device 2 are configured to be connectable via a network, for example. May be. For example, the input / output device 2 and the optimum route search device 1 having the search unit 3 and the data unit 4 are connected by a communication line like a portable terminal having a route search input function and a search result display function. It may be a configuration.
The input / output device 2 is provided, for example, for each station entrance and exit, and designates a search condition including a departure station to be searched for a route, a departure station entrance, a departure date and time, a boarding route, ascending / descending priority, etc. It is a device to do. Moreover, the result searched by the optimum route searching apparatus 1 can also be output.
Here, the ascending / descending priority order specifies the first to third priorities for the elevator, the escalator, and the stairs when going up and down.
The search unit 3 uses the designated search condition from the input / output device 2 and the data in the data unit 4 to search for an optimal boarding vehicle position where the degree of congestion of the boarding train is low, for example, from the station entrance to the platform boarding vehicle position Search for the optimal route. The route displayed as a result of the search can be displayed in an easy-to-understand manner by displaying a station premises map on the input / output device 2 and highlighting the route on the map. Furthermore, by providing the input / output device 2 with a function of acquiring position information such as GPS, the current position can be displayed on a map.
The input / output device 2 has a device 2a for inputting personal data, and it is also possible to send personal data to the optimum route searching device 1 by using, for example, an IC card without using an input means. . A portable terminal or the like can also be used. It becomes a more convenient tool by changing what is prioritized (priority) according to the personal situation.

FIG. 2 is a flowchart showing the flow of the optimum route search procedure according to this embodiment.
As shown in FIG. 2, when the process is started (Start), first, the search conditions are input from the input / output device 2, for example, departure station, departure station entrance, departure date and time, boarding route, elevation priority, presence / absence of a ticket, When information such as the position of the boarding vehicle is input and a search instruction operation is performed, this is accepted (step 21).
Next, the timetable data 4a in the data section 4 is searched according to the input departure station, departure date and time, and boarding route, and the train number and boarding platform number of the boarding vehicle are acquired (step 22).
Next, according to the boarding route, the train number of the boarding train, the departure station, and the departure date and time, the train congestion degree data 4b of the data section 4 is used to obtain the lowest crowded vehicle number or the designated boarding vehicle number. To do. In addition, a vehicle number having the lowest congestion degree closest to each lifting means is acquired (step 23).
Through the above steps, the station entrance, the platform number of the boarding train, and the boarding position of the boarding vehicle number can be acquired.
The train congestion degree may be data based on statistical values taking into account routes, month / day, day of the week, time, special dates such as event holding, or may be a value measured in real time.

FIG. 3 is a diagram showing an example of the content of train congestion degree data, and is a table holding the congestion degree for each vehicle of the train.
As shown in FIG. 3, the congestion degree data holds, for example, a route name, a train number, the number of trains, a boarding station, a vehicle number, and a congestion degree for each train.
The user can acquire the congestion degree of each vehicle number of the desired boarding train by searching the table shown in FIG. 3 by designating the name of the boarding route, the desired boarding train number, and the boarding station.
For example, if a user dislikes congestion, a vehicle number with a low degree of congestion can be acquired in the desired train by searching for a vehicle number with a low degree of congestion.
Among the contents of the table shown in FIG. 3, the congestion degree data may be, for example, information created by information based on past results, or at the time of departure from the previous station or the previous station. Information on the degree of congestion obtained by actual measurement of passengers obtained for each vehicle may be used. Alternatively, the degree of congestion measured in real time may be used. For example, if the user designates line A (up) as the name of the route to board, M251 train as the desired train number, and Shinagawa station as the boarding station, the data shown in the top three rows of FIG. For example, it can be known that the first car is relatively free at a congestion degree of 50%.

  Returning to FIG. 2, the description will be continued. In the above processing, the route information is searched from the premises position data 4c according to the input departure station entrance, ascending / descending priority order, platform number, vehicle number of the boarding vehicle, and congestion degree in the station premises (step 24).

FIG. 4 is a diagram illustrating a configuration example of the premises position data.
As shown in FIG. 4, the premises position data table is a table in which facility names are associated with premises map position information of each facility. For example, the entrance of the north exit has (X2, Y2, Z2) as campus map position information, while the elevator 1 for the first line has (X5, Y5, Z1) as campus map position information. ing. Here, Z1 indicates the first floor, for example, and Z2 indicates the second floor.
In the present embodiment, movement in the Z direction, which is difficult for the elderly or the like to move, is particularly taken into account by providing position information in the Z direction (height direction) in particular. Further, even if the movement is in the same Z direction, the conditions (priorities, etc.) may be different between the downlink and the uplink. That is, the route search is performed in consideration of the position data in the Z direction and the data related to the moving direction (vector data related to the three-dimensional movement and the direction).
Regarding search conditions, route unconditional (unrestricted) search, that is, search with the least crowded vehicle or specified vehicle as the boarding position regardless of the travel distance, and home travel distance restriction There is a search, that is, for each of the elevator, the escalator, and the staircase, for example, a search in which the vehicle with the lowest congestion is within the range of one vehicle in the front and rear from the place.

FIG. 5 is a diagram showing on-site congestion degree data, which is a table holding the degree of congestion for each time at each position in the station premises.
The degree of congestion in the station premises may be data based on statistical values taking into account the same line, platform on the up and down, train arrival time, date, day of the week, etc., or may be a value measured in real time.
FIG. 6 is a diagram illustrating a reference example of the degree of congestion on the premises.
The degree of congestion is defined as 1 when 1 person / 1 m ² or less, and hereinafter, the degree of congestion is defined according to the degree of congestion of people. In addition, the moving speed of a healthy person and a disabled person is determined according to the degree of congestion. As a method of measuring the degree of congestion in real time, for example, a wide-angle camera is appropriately installed on the ceiling of a station or the like, and is photographed at regular intervals, and a floor color (for example, a light color such as white is desirable) and calculates an area ratio in approximate density of human is measured with other colors (e.g., human head such as black) (average color area other than the floor per floor 1 m ² occupied per Dividing the floor area).
The route search in the station premises is performed by using the premises location data 4c (FIG. 4) and the premises congestion data 4d (FIG. 5).

FIG. 7 is a chart at the time of search, and shows the final combination of routes searched from the station entrance to the boarding vehicle position.
Hereinafter, the procedure for acquiring the movement route and the movement time will be described with reference to FIG.
The case where it is necessary for a healthy person to purchase a ticket will be described as an example. From the station entrance designated by input, S, each ticket vending machine position, ticket 1 and ticket 2 are searched, the route from S to ticket 1; The path from S1 and S to the ticket 2 and the travel time of S2 are calculated from the distance and the degree of congestion.
Here, what is abbreviated as ticket 1, ticket 2, etc. indicates the following.
S: Start (station entrance), Re1: Elevator 1, Car 1: Designated vehicle, Ticket 1: Ticket vending machine 1, Les 2: Elevator 2, Car 2: Elevator 1 nearest vehicle, Ticket 2: Ticket vending machine 2, Floor 1: Stair 1, Car 3: Closest vehicle of elevator 2, Gate 1: Ticket gate 1, S1: Escalator 1, Vehicle 4: Nearest vehicle of stairs 1, Vehicle 5: Nearest vehicle of escalator 1, Transit 1: S and ticket 1 path, longitude 10: route 1 and car 1 route, longitude 2: S and ticket 2 route, longitude 11: route 1 and car 2 route, longitude 3: S and modified route 1, longitude 12: 2 and car 1 route, longitude 4: ticket 1 and reform 1 route, longitude 13: train 2 and car 3 route, longitude 5: ticket 2 and reform 1 route, longitude 14: floor 1 and car 1 route , Longitude 6: Kai 1 and route 1 longitude 15: floor 1 and car 4 route, longitude 7: Kai 1 and route 2, longitude 16: Su 1 and car 1 route, longitude 8: Kai 1 Floor 1 Routes 17: Su 1 5 route of, through 9: path of reforming 1 and vinegar 1.

In FIG. 7, when the distance of longitude 1 is 10 m and the degree of congestion between them is 3, the travel time of longitude 1 is 10 s, and when the distance of longitude 2 is 24 meters and the degree of congestion is 2, the travel time of longitude 2 is 20 s.
Next, each ticket gate position and break 1 are searched from each ticket vending machine, and the travel time of each route from the ticket 1, the ticket 2 to the break 1, the path 4, the path 5 is calculated from the distance and the degree of congestion.
Here, when the distance of longitude 4 is 16 m and the congestion degree between them is 4, the travel time of longitude 4 is 20 s, and when the distance of longitude 5 is 20 m and the congestion between them is 3, the travel time of longitude 5 is 20 s. It becomes.
Next, the elevator means position is searched for each elevator means from the ticket gate. Here, a case where an elevator is used as the lifting means will be described as an example.
Each route from the ticket gate to Les 1 and Les 2 and the travel time of longitude 6 and longitude 7 are calculated from the distance and the degree of congestion. Here, when the distance of longitude 6 is 13 m and the congestion degree therebetween is 1, the travel time of longitude 6 is 10 s, and when the distance of longitude 7 is 26 m and the congestion degree therebetween is 1, the travel time of longitude 7 is 20 s. It becomes.
Next, each vehicle position, car 1, car 2, and car 3 are searched from each lifting means position, and each route from the car 1 to car 1 and car 2, the car 10, the car 11, the car 2 and the car 1, car 3 The travel time of each route, and the lengths 12 and 13 are calculated from the distance and the degree of congestion.
Here, when the distance of longitude 10 is 13 m and the degree of congestion is 1, the movement time of longitude 10 is 10 s, the distance of longitude 11 is 6.5 m, and the degree of congestion is 1 during that time, the movement time of longitude 11 Is 5 s, the distance of 12 points is 13 m, and the degree of congestion is 1; the travel time of 12 points is 10 s; the distance of 13 points is 6.5 m and the degree of congestion is 1; Is 5 s.
Next, the travel time of the combination of the search routes is calculated, and the shortest result is searched for the route with respect to each lifting means and the boarding vehicle position.
Here, a case where an elevator is used as the lifting means will be described as an example. When the elevator is used as the lifting means and the vehicle position is specified, the total route 1 of the longitude 1+ longitude 4+ longitude 6+ longitude 10, the total route 2 of longitude 1+ longitude 4+ longitude 7+ longitude 12 and longitude 2+ longitude 5+ A total path 3 of longitude 6 + longitude 10 and a total path 4 of longitude 2 + longitude 5 + longitude 7 + longitude 12 are obtained. Each travel time is 50 s for the total route 1, 60 s for the total route 2, 60 s for the total route 3, and 70 s for the total route 4, and the total route 1 is selected as a search result.
Further, when the position of the boarding vehicle is not specified, the total route 5 of longitude 1 + longitude 4 + longitude 6 + longitude 11, the total length 6 of longitude 1 + longitude 4 + longitude 7 + longitude 13, and vertical length 2 + longitude 5 + longitude 6 + longitude 11 The total route 7 is the total route 8 of the longitude 2+ longitude 5+ longitude 7+ longitude 13. Each travel time is 45 s for the total route 5, 55 s for the total route 6, 55 s for the total route 7, and 65 s for the total route 8, and the total route 5 is selected as a search result. Further, the total travel time is a value obtained by totaling the travel times of the used elevators.
In addition, about the movement time in each raising / lowering means, the data based on the statistical value of the moving average time of each raising / lowering means may be used, and the value measured in real time may be sufficient.
In addition, the search of each movement target position may search all the movement target positions, and you may make it search the movement target position in a specific distance from the present location.
In the above procedure, the route with the shortest travel time is displayed as a search result. However, by giving priority to the congestion degree over the travel time, it is possible to search for the route with the lowest congestion degree of the travel route. .
Next, the route from the station entrance to the boarding vehicle position is displayed on the input / output device based on the contents of the premises position data and the map data 4e (step 25).

FIG. 8 shows an example of the map data 4e.
As shown in FIG. 8, a station premises 31 includes, for example, a south exit 33 which is one of the station entrances, an input terminal 37 provided near the south exit 33, a ticket vending machine 35, a ticket vending machine 36, a ticket gate 41, , Facilities 43 such as shops and toilets, passage information 47, and elevator means such as an elevator 45, an elevator 46, an escalator 48, and a staircase 49 are arranged, and facilities necessary for users to move around the station premises The facility that serves as a landmark is displayed.
In particular, as described above, when the searched station entrance position, ticket vending machine position, and platform position are not on the same floor, elevator means including elevators, escalators, and stairs are provided based on the input elevator priority. Search by including it in the search conditions. At this time, the search is possible by having the position coordinates in the Z direction as the on-premise map information. By connecting the position information of the searched ticket machines, ticket gates, elevators, etc. with lines on the passage, the route from the station entrance to the platform position can be determined and presented to the user. The route to be presented may be a plurality of candidates, and it is preferable to let the user select from among them.
Next, the route is output to the input / output device 2, and the process is terminated.
The above search results are displayed in the order of no limit (elevator), no limit (escalator), no limit (stairs), limit (elevator), limit (escalator), limit (step).
However, if the search result with no restriction and the search result with restriction are the same, only one is displayed. For example, if the vehicle closest to the location of the elevator is the first vehicle and the first vehicle has a minimum congestion level of 50, the restriction (elevator) and the restriction (elevator) are the same result, so only five patterns are displayed. To do.
Further, the route can be selected according to each user's preference by selecting the list display without limiting the lifting means. For example, when an elevator or an escalator (other than stairs) is to be used, it is possible to select whether to prioritize the required time or congestion by comparing two routes and viewing a list.

Example 1
Hereinafter, more specific examples including operations actually performed by the user will be described.
In the first embodiment, the input terminal 37 shown in FIG. 8 is provided with the input / output device (for example, touch panel) 2, and the description will be made on the assumption that the user performs necessary operations using the touch panel of the input terminal 37.
FIG. 9 is a diagram illustrating a first display example of the boarding route selection screen according to the first embodiment.
In the first display example 51-1 according to the first embodiment, along with a message “Please select the route to board”, A-line (up) 53-1, A-line (down) 53-2, The route on which the user gets is selected from the B line (up) 53-3 and the B line (down) 53-4 using the touch panel.

FIG. 10 is a diagram illustrating a second display example of the boarding route selection screen according to the first embodiment.
In the second display example 51-2 according to the first embodiment, the train list of “Line A (up)” selected on the first display screen is displayed together with a message “Please select a train to board”. Is displayed. Here, for example, five candidates, such as the current train time + travel time calculation value, such as the second train 55-1 for the ordinary train 12:00 departure XX, are displayed as selection candidates 55-1 to 5-5, and the user's boarding Select the train you want to touch using the touch panel.
In addition, a touch panel for selecting 57 for returning to the previous screen and 58 for returning to the top screen is also provided.

FIG. 11 is a diagram illustrating a third display screen according to the first embodiment.
In the third display example 51-3 according to the first embodiment, together with the message “Please select the vehicle to board”, the “Express 12:05 departure XX bound first line selected on the second display screen” "Is displayed as selection candidates 56-1 to 56-1, and the vehicle on which the user gets is selected from the touch panel.
In addition, a touch panel for selecting 57 for returning to the previous screen, 58 for returning to the top screen, and 59 for not selecting a vehicle is also provided. In the 59 process in which no vehicle is selected, it is assumed that the vehicle with the lowest congestion is selected. However, if the displayed vehicle includes a special vehicle that requires a separate fee, such as a green car, the vehicle is displayed in a different color and automatically even if the congestion level is the lowest. May not be selected. For example, in FIG. 11, the congestion degree of the eighth car and the ninth car is low, but if the eighth car and the ninth car are special vehicles, when the touch panel 59 that does not select the vehicle is pressed, The second car having the lowest congestion is automatically selected.

FIG. 12 is a diagram illustrating a fourth display screen according to the first embodiment.
In the fourth display example 51-4 according to the first embodiment, “Line A (up)” selected on the second display screen together with a message “Please select your route from 1 to 6”. The table 61 including the lifting means of “limited express 12:05 departure XX first line” is displayed.
Six types of selection items SR1 to SR6 are provided, and elevators, escalators, and stairs are listed as lifting means. The boarding vehicle, the seat availability, the strap availability, and the required time are displayed.
The user selects a route based on the type of lifting means, the boarding vehicle, the seat, the availability of the strap, and the required time.
There are two patterns for the elevator, escalator, and staircase for the uncongested route search result to the vehicle with the lowest congestion level or the vehicle specified on the third display screen and the search result with home travel limit. If there are the same search results, only one pattern is displayed), and a total of 6 patterns are displayed. At this time, the required time displays the travel time calculated in the route search procedure using FIG. In addition, according to the degree of congestion of the train, the availability of seats and straps is displayed as ◯, Δ, and X.

FIG. 13 is a diagram illustrating a reference example of the degree of congestion.
The degree of congestion is from 0 to 49. When both the seat and the strap are vacant, the availability of the seat and the strap and the degree of congestion are related to the degree of congestion below.

FIG. 14 is a diagram illustrating route search processing according to the first embodiment.
FIG. 14 shows a first floor (1F) with a ticket gate, a second floor (2F) with a platform, and a train 81 parked on the platform. On the first and second floors, elevators 73, stairs 75, and escalators 77 are provided at corresponding positions. The first and second floors are provided using these lifting means (73, 75, 77). You can go back and forth between.
Each line (solid line, broken line, dotted line, etc.) described on the map shown in FIG. 14 indicates routes SR1 to SR6 selected on the route selection screen shown in FIG.
The selected route SR1 is not limited (elevator), and based on the conditions described in SR1 in FIG. 12, using the elevator 73 from the ticket gate 71 on the first floor along the solid line indicated by SR1 in FIG. Ascend from the first floor to the second floor. After that, it is a route that travels on the platform to the eighth car of the train 81 and gets into the eighth car. The selection route SR2 is not limited (escalator), and based on the conditions described in SR2 in FIG. 12, using the escalator 77 from the ticket gate 71 on the first floor along the broken line indicated by SR2 in FIG. Ascend from the first floor to the second floor. After that, it is a route that travels on the platform to the eighth car of the train 81 and gets into the eighth car. The selected route SR3 is not limited (steps), and ascends from the first floor to the second floor using the first floor stairs 75 along the dotted line indicated by SR3 in FIG. After that, it is a route that travels on the platform to the eighth car of the train 81 and gets into the eighth car. Since No. 8 car is the minimum congestion level or designated vehicle, priority is given to getting into No. 8 car which is this minimum congestion level from SR1 to SR3, and there is no restriction on lifting means.

On the other hand, SR4 uses an elevator as an elevating means, SR5 uses an escalator as an elevating means, and SR6 has priority with respect to using a stairs as an elevating means. That is, the selected route SR4 is limited (elevator), and ascends from the first floor to the second floor using the first floor elevator 73 along the broken line indicated by SR4 in FIG. The ascending place is the immediate vicinity of the second car of the train 81 and is a route for getting into the second car as it is. At this time, since there is a restriction that an elevator is used, the second car having the lowest congestion degree is selected from the first to third cars.
The selected route SR5 is limited (escalator), and rises from the first floor to the second floor using the first floor escalator 77 along the dotted line indicated by SR5 in FIG. The ascending place is the immediate vicinity of the 12th car of the train 81, and is a route for getting into the 12th car as it is. At this time, there is a restriction that the escalator is used, and the boarding position is the 10th and 12th cars, and the 12th car with the lowest congestion is selected. The selected route SR6 is limited (steps), and ascends from the first floor to the second floor using the first floor staircase 75 along the alternate long and short dash line indicated by SR6 in FIG. The ascending place is near the fourth car of the train 81, and is a route for getting into the fourth car as it is. At this time, there is a restriction that the stairs are used, and the boarding position is the 4th to 6th cars, and the 4th car with the lowest congestion is selected.

FIG. 15 is a diagram corresponding to FIG. 14 and is a diagram illustrating an example of a display screen displayed when the user selects the route of SR3.
As shown in FIG. 15, only the route related to the SR3 selected by the user is displayed to the user, and the display is easy for the user to understand. Based on this display, the user can follow a route according to his / her wishes. In addition, it is possible to directly deliver a printed matter based on the display to the user as a service, and it is also possible to send display data to a portable terminal or the like possessed by the user.
In the first embodiment, the description is made on the assumption that the fixed input terminal 37 installed in the station premises is used, but instead of the fixed input terminal or together with the fixed input terminal, You may use portable terminals, such as PDA and a mobile telephone. At this time, all input / output related to the above-described processing may be performed by a mobile terminal possessed by the user, or only part of the processing may be performed by the mobile terminal. Alternatively, the search process is performed using a fixed input terminal, and then the recommended route shown in FIG. 15, for example, is displayed on the mobile terminal when the user proceeds toward the target in the station premises. The user may be navigated with reference to this. At this time, if a GPS function is added to the portable terminal, the current position can be displayed based on the GPS, and the user can easily move toward the target without hesitation, which is particularly convenient.
Furthermore, by storing the route once used in the memory of the mobile phone, when the same action is repeated, the optimum route can be quickly taken out from the memory of the mobile terminal by omitting the search process and the like. Is possible.
If the station entrance and the boarding vehicle position are not on the same floor, the station entrance floor route and the boarding vehicle position floor route can be divided and displayed, or the screen It is also possible to display them separately by switching.
Further, when the degree of congestion is low in any vehicle, the elevating means has the highest priority, and the condition regarding the vehicle position has a low priority.
Further, in the present embodiment, an example in which the optimum route is searched in consideration of the conditions regarding the departure station is shown, but the conditions regarding the arrival station including the transfer station are considered together with the departure station information or instead of the departure station information. The optimum route may be searched for.

(Example 2)
In the second embodiment, the description will be made on the assumption that the user uses and operates the mobile terminal. In addition, the explanation is made on the assumption that the user searches at a place different from the boarding station and performs a search again after arrival at the boarding station.
FIG. 16 is a diagram illustrating a first display example according to the present embodiment.
In the first display example 91-1 according to the second embodiment, together with the message "Please enter the station and departure time to board", the entry field 93-1 of the boarding station and the input field 93- of the departure time. 2. Search 93-3 is displayed.
The user inputs the boarding station and departure time and selects search.

FIG. 17 is a diagram illustrating a second display example according to the present embodiment.
In the second display example 91-2 according to the second embodiment, along with a message “Please select a route to board”, A line (up) 95-1, A line (down) 95-2, The route on which the user gets on is selected from the B line (up) 95-3 and the B line (down) 95-4.

FIG. 18 is a diagram illustrating a third display example of the boarding route selection screen according to the second embodiment.
In the third display example 91-3 according to the second embodiment, the train list of “Line A (up)” selected on the second display screen is displayed together with a message “Please select a train to board”. Is displayed. Here, for example, five candidates that are close to the departure time, such as the second train 97-1 for the ordinary train 12:00 departure XX, are displayed as selection candidates 97-1 to 97-5, and the train on which the user gets is selected. It is also possible to select 97-6 for returning to the previous screen and 97-7 for returning to the top screen.

FIG. 19 is a diagram illustrating a fourth display screen according to the second embodiment.
In the fourth display example 91-4 according to the second embodiment, along with the message “Please select the vehicle to board”, the “Express 12:05 departure XX bound first line selected on the third display screen” Is displayed as selection candidates 98-1 to 98-12, and the user selects a vehicle on which the user gets on.
It is also possible to select 98-13 for returning to the previous screen, 98-14 for returning to the top screen, or 98-15 processing without selecting a vehicle. In the 98-15 process in which no vehicle is selected, it is assumed that the vehicle with the lowest congestion is selected.

FIG. 20 is a diagram illustrating a fifth display screen according to the second embodiment.
In the fifth display example 91-5 according to the second embodiment, the message “The search condition has been recorded. Please arrive at the boarding station at HH MM and re-search.” Search 99-1 is displayed. In addition, the time which subtracted the maximum movement time calculated in the procedure of the route search using the above-mentioned FIG. 7 from the departure time of the selected train is displayed for HH hour MM minutes.
When the user performs a search again after arriving at the boarding station, the route is searched based on the current time and the conditions set earlier, and the route selection screen shown in FIG. 12 is displayed. For example, the user selects the route of SR3. When selected, the route shown in FIG. 15 is displayed on the portable terminal.
In the above embodiment, the search condition may be recorded on the mobile terminal side or may be recorded on the search device side.

(Example 3)
In the third embodiment, the description is given on the assumption that the user confirms the degree of train congestion.
FIG. 21 is a diagram illustrating a first display example according to the third embodiment.
In the first display example 101-1 according to the third embodiment, along with the message “Please enter the menu to be used.”, The route search 103-1, the train congestion status check 103-2, and the station premises congestion status A confirmation 103-3 is displayed.
The user selects the displayed menu.

FIG. 22 is a diagram illustrating a second display example according to the third embodiment.
In the second display example 101-2 according to the third embodiment, the input field 105-1 of the boarding station and the input field of the route are displayed together with a message “Please enter the station, route and departure time to be boarded”. 105-2, a departure time input field 105-3, and a search 105-4 are displayed. The user inputs the boarding station, route, departure time, and selects search.

FIG. 23 is a diagram illustrating a third display example according to the third embodiment.
In the third display example 101-3 according to the third embodiment, for example, five trains that are close to the departure time and the train congestion state 107-1 are displayed along with the message "The congestion state of the train on line A (upbound)." It is displayed as ˜5 and the congestion degree of the train can be confirmed. As the congestion level displayed at this time, a value obtained by averaging the vehicle congestion levels of the train congestion level data is displayed. It is also possible to select 107-6 for returning to the previous screen and 107-7 for returning to the top screen.

FIG. 24 is a diagram illustrating a fourth display example according to the third embodiment.
In the fourth display example 101-3 according to the third embodiment, together with the message “express 12:05 departure ×× line congestion”, the congestion state 109 of each vehicle on the express 12:05 departure ×× line. −1 to 12 are displayed, and the degree of congestion of the vehicle can be confirmed.
Note that it is also possible to select 109-13 for returning to the previous screen and 109-14 for returning to the top screen.

As described above, according to the station premises route search apparatus described in the present embodiment and examples, various conditions, for example, the position of a boarding vehicle with a low degree of congestion, and automatic lifting means such as an elevator and an escalator are provided. The optimal route suitable for the user from the entrance of the station to the boarding vehicle position can be searched, and movement can be performed by a desired movement method according to the individual's physical strength or the current state. .
A program for causing a computer to execute each step in the method described in the embodiment of the present invention also falls within the scope of the present invention.
Although the present invention is suitable for route search within a station, it can also be applied to various facility moving methods when it is necessary to move to a different floor.

It is a block diagram which shows the structural example of the station premise route search apparatus by one embodiment of this invention. It is a flowchart showing the outline | summary of the flow of the optimal route search process in FIG. It is a figure which shows the structural example of the train congestion degree data shown in FIG. FIG. 2 is a diagram showing a configuration example using the three-dimensional data as the location information, which is the location data in FIG. 1. It is a figure which shows the structural example of the local congestion degree data shown in FIG. It is a figure which shows the example of a definition of a local congestion degree. It is a chart figure at the time of a route search. It is a figure which shows the example of a display of the map data shown in FIG. It is a figure which shows the example of a display of a boarding route selection screen. It is a figure which shows the example of a display of a boarding train selection screen. It is a figure which shows the example of a display of a boarding vehicle selection screen. It is a figure which shows the example of a display of a route selection screen. It is a figure which shows the example of a reference | standard of a train congestion degree. It is a figure which shows the content of the route search process by one Example of this invention. It is a figure which shows the example of a display displayed as a route search process result of FIG. It is a figure which shows the example of a display at the time of setting boarding time. It is a figure which shows the example of a display of a boarding route selection screen. It is a figure which shows the example of a display of a boarding train selection screen. It is a figure which shows the example of a display of a boarding vehicle selection screen. It is a figure which shows the example of a display at the time of search condition recording. It is a figure which shows the example of a display of a menu. It is a figure which shows the example of a display at the time of train congestion degree search. It is a figure which shows the example of a display of a train congestion degree screen. It is a figure which shows the example of a display of a vehicle congestion degree screen.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Optimal route search apparatus 2 Input / output device 3 Search part 4 Data part 4a Timetable data 4b Train congestion degree data 4c Premise location data 4d Station premise congestion degree data 4e Map data

Claims (1)

Based on a timetable data storage unit for storing timetable data, a train congestion degree data storage unit for storing congestion degree data for each train or each car in the train, and a three-dimensional position vector of a facility including an elevator in the station A database that includes a location information data storage unit that stores location information data, a local congestion data storage unit that stores congestion data within the station, and a map data storage unit that stores map data within the station, and search conditions An optimum route search device in a station premises, comprising: an input means for inputting a search route; and a search processing means for searching for an optimum route to a target position and outputting a search result to a display screen,
The search processing means
A search condition for a route including priority regarding a desired boarding time condition, a use condition of the elevating means, and a desired congestion degree condition regarding the degree of congestion is received from the input means, and based on the desired boarding time condition and the timetable data A first means for searching for a boarding train;
A second means for retrieving the degree of congestion for each of the retrieved boarding trains from the train congestion degree data storage unit;
The desired congestion degree condition received from the input means, the congestion degree for each vehicle, the use condition of the advance lift means, the congestion degree in the station premises acquired from the premises congestion degree data storage unit, and the position information data Based on the location information data of the facilities in the station acquired from the storage unit, the optimum route satisfying the desired congestion degree condition received from the input means and the usage means of the lifting means is searched among the trains searched by the first means. A third means to:
Based on the congestion degree for each vehicle, the congestion degree in the station premises acquired from the premises congestion degree data storage unit, and the location information data of the facilities in the station premises acquired from the location information data storage unit, the first A fourth means for calculating the travel time to the platform where the train searched by means arrives ;
A fifth means for drawing and outputting the searched optimum route on the display screen based on the map data in the station premises stored in the map data storage unit;
A sixth means for outputting on the display screen a time obtained by subtracting the travel time from the departure time of the previous transfer train;
An optimal route search device in a station premises, comprising:

Images