EP3425606A1 - Système d'estimation de situation de trafic et procédé d'estimation de situation de trafic - Google Patents

Système d'estimation de situation de trafic et procédé d'estimation de situation de trafic Download PDF

Info

Publication number
EP3425606A1
EP3425606A1 EP16889665.2A EP16889665A EP3425606A1 EP 3425606 A1 EP3425606 A1 EP 3425606A1 EP 16889665 A EP16889665 A EP 16889665A EP 3425606 A1 EP3425606 A1 EP 3425606A1
Authority
EP
European Patent Office
Prior art keywords
time
connection
data
transportation means
terminals
Prior art date
Legal status (The legal status 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 status listed.)
Granted
Application number
EP16889665.2A
Other languages
German (de)
English (en)
Other versions
EP3425606A4 (fr
EP3425606B1 (fr
Inventor
Rieko OOTSUKA
Takumi INOKUCHI
Kei Suzuki
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hitachi Ltd
Original Assignee
Hitachi Ltd
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 Hitachi Ltd filed Critical Hitachi Ltd
Publication of EP3425606A1 publication Critical patent/EP3425606A1/fr
Publication of EP3425606A4 publication Critical patent/EP3425606A4/fr
Application granted granted Critical
Publication of EP3425606B1 publication Critical patent/EP3425606B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B61—RAILWAYS
    • B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
    • B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
    • B61L27/10—Operations, e.g. scheduling or time tables
    • B61L27/14—Following schedules
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B61—RAILWAYS
    • B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
    • B61L25/00—Recording or indicating positions or identities of vehicles or trains or setting of track apparatus
    • B61L25/02—Indicating or recording positions or identities of vehicles or trains
    • 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
    • G06Q50/40—Business processes related to the transportation industry
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B61—RAILWAYS
    • B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
    • B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
    • B61L27/50—Trackside diagnosis or maintenance, e.g. software upgrades
    • B61L27/57—Trackside diagnosis or maintenance, e.g. software upgrades for vehicles or trains, e.g. trackside supervision of train conditions

Definitions

  • the present invention relates to a system for estimating traffic conditions.
  • wireless base stations such as public wireless LAN access points
  • public transportation systems including in airports, stations, and trains, as well as in commercial establishments, particularly by railway companies and communications companies.
  • real-world testing is being conducted to measure with a high degree of accuracy the movements of people both indoors and outdoors using public wireless LANs and the like.
  • JP 2007-120953 A is an example of prior art of the present technical field.
  • JP 2007-120953 A discloses a technique in which acceleration sensors provided in mobile terminals are used to determine whether a train has arrived at or departed from a station on the basis of detection results from an acceleration detection means and determination results of a communication area determination means.
  • a method for transmitting to passengers information acquired by a train operation management system requires a system in which sensors are installed in trains and measured data is gathered through wireless communication, which results in high installation and development costs. Also, it was difficult for many railway companies to deploy and operate such systems in a short time frame.
  • the positions of passengers having mobile terminals in the station can be tracked, and thus, it can be determined whether a passenger has boarded a train, and the arrival/ departure time of the train can be measured in real time.
  • at least one passenger needs to be detected per train.
  • the time at which the train has arrived at the station can be detected using acceleration data measured by mobile terminals possessed by individuals, but in order to detect the arrival/departure times of all trains and at all stations, there is a need to gather and analyze acceleration data measured by mobile terminals of many passengers. Therefore, in detecting the arrival/departure times of all trains using the method disclosed in JP 2007-120953 A , data must be gathered with those who possess mobile terminals having specialized applications and sensors being present in all trains.
  • An object of the present invention takes into consideration the above issues, and estimates the arrival/departure times of trains using information of connections to wireless base stations (such as public wireless LAN access points) disposed in the station, without needing to gather data from mobile terminals of passengers.
  • wireless base stations such as public wireless LAN access points
  • a traffic condition estimation system comprising: a processor that executes a program; and a storage device that stores the program.
  • a plurality of base stations of a wireless communication system are installed in a boarding/ deboarding facility for use of a transportation means.
  • the storage device stores connection information including connection start locations and connection termination locations between terminals possessed by users of the transportation means and any of the plurality of base stations.
  • the processor is configured to: extract, from the connection information, terminals for which the connection start locations and the connection termination locations differ from each other; and multiply a number of said extracted terminals by a predetermined first coefficient to estimate a number of people waiting in the boarding/deboarding facility for use of the transportation means.
  • the number of passengers in a transportation means can be estimated. Problems, configurations, and effects other than those described above are made clear from the following description of an embodiment of this invention.
  • the present invention will be described with reference to FIGs. 1 to 22 .
  • the times at which trains arrive at or depart from stations and the number of passengers are estimated, but the present invention can be applied to any transportation means used by many people (such as buses and ferries).
  • the present invention can be applied to taxi stands to estimate the degree of congestion of the taxi stand (that is, the number of people waiting to catch a taxi).
  • FIG. 1 is a diagram illustrating an outline of a public wireless LAN in a system according to an embodiment of the present invention.
  • a public wireless LAN is a service in which internet connection is provided through wireless LAN, and a user 101 connects to the internet through an access point 102 from a mobile terminal 103 such as a laptop computer, a smartphone, or a tablet computer.
  • the signal range of one access point is typically in the range of tens of meters, and thus, in large spaces such as large-scale commercial establishments and stations, a plurality of access points are often installed.
  • the wireless LAN access points 102 and the mobile terminals communicate using a common SSID to prevent interference and unnecessary communications, and the connection start time and connection termination time for each mobile terminal can be acquired by the access points 102.
  • public wireless LAN services in which the user would register a MAC address or the like, which is an identifier of the mobile terminal, in advance.
  • the movement history of each mobile terminal can be analyzed from the wireless LAN connection data.
  • Such settings and registration would typically require action by the owner of the mobile terminal who wishes to use the public wireless LAN.
  • FIG. 2 is a diagram illustrating a relationship between a public wireless LAN in a system and movement within the station according to the embodiment of the present invention.
  • the public wireless LAN access points 102 in the station are installed near ticket gates and at platforms, and the general location of the mobile terminal can be estimated by the signal strength between each access point 102 and the mobile terminal. If the user 101 having a mobile phone connected to a public wireless LAN exits a train, for example, first the mobile terminal connects to an access point 102A installed at the platform level. When the user 101 moves towards a ticket gate 104 in order to leave the station, the mobile terminal switches connection to an access point 102B installed near the ticket gate. By tracking in this manner the access points 102 to which each mobile terminal is connected in time series order, it is possible to estimate movements of passengers in the station.
  • a plurality of access points may be installed in the same area (such as three access points at the track 1 platform).
  • FIG. 3 is a diagram illustrating a structure of a record in which public wireless LAN connection information 122 is stored according to the embodiment of the present invention.
  • the public wireless LAN connection information 122 includes information such as access point IDs 211, connection times 212, and connecting device IDs 213 representing the IDs of connected mobile devices, and is data of the devices connected at the time.
  • the connection time 212 may store records at one second increments or several second increments. By retaining the connection time at narrow increments, it is possible to increase the estimation accuracy for the train arrival/departure times.
  • the connecting device ID 213 can be uniquely identified in one day, and thus, anonymization may be performed by changing the ID assignment rules for each day.
  • the public wireless LAN connection information 122 stores data included in a predetermined time window such as by stream data processing, and as time passes, new data is added and old time data is deleted.
  • FIG. 4A is a diagram illustrating the configuration according to the entire system of the embodiment of the present invention
  • FIG. 4B is a diagram illustrating the configuration of a data server 111
  • FIG. 4C is a diagram illustrating the configuration of a calculation server 112.
  • automatic ticket gates 104 are installed in many railway stations, and users 101 of the railway system are allowed to enter and exit the station as a result of the automatic ticket gates 104 reading a contactless IC card (or mobile terminal having a function of contactless IC card) or a magnetic ticket.
  • the information read by the automatic ticket gate 104 is transmitted through a network 107 to a group of data management servers 108 managed by a railway operator, and is accumulated as ticket gate passage data.
  • connected device information is transmitted in real time to the group of data management servers 108 through the public wireless LAN access points 102 installed near the ticket gate or at the platforms.
  • surveillance cameras 105 are installed near the ticket gates or at the platforms. The image data acquired by the surveillance cameras 105 can be viewed in real time through the network 107 at a command center or the like that manages railway operations.
  • a traffic condition estimation system 110 is constituted of the data server 111, the calculation server 112, and an information distribution server 113, and gathers, accumulates, and analyzes connection device information of the public wireless LAN access points 102 and ticket gate passage data.
  • the image data acquired by the surveillance cameras 105 and the ticket gate passage data is transmitted to the data server 111 through the network 107 whenever new data is acquired or at a predetermined time interval (such as once per hour or once per day).
  • the traffic condition estimation system 110 which is constituted of a group of servers including the data server 111, the calculation server 112, and the information distribution server 113, can communicate with a computer 117 used by a railway operator 116 or a terminal 118 used by a passengers 115 through networks 107 and 114.
  • the data server 111, the calculation server 112, and the information distribution server 113 constitute the group of servers, but the functions of this group of servers may be realized by one server or a plurality of servers.
  • the data server 111 is a computer primarily having a network interface, a processor, a memory, and a storage unit.
  • the processor executes programs stored in the memory.
  • the memory includes ROM, which is a non-volatile memory element, and RAM; which is a volatile memory element.
  • the ROM includes fixed programs (such as the BIOS).
  • the RAM is a high speed and volatile memory element such as DRAM (dynamic random access memory), and temporarily stores programs to be executed by the processor and data used during execution of the programs.
  • the storage unit is constituted of a large capacity non-volatile storage device such as a magnetic storage device (HDD), a CD-ROM drive, or flash memory (SSD), for example, and stores programs to be executed by the processor and data to be used while executing the programs.
  • the programs are read from the storage unit, loaded into the memory, and executed by the processor.
  • the data server 111 receives public wireless LAN connection information 122 and ticket gate passage headcount data 126 through the network 107 at a predetermined timing (predetermined update time interval) and stores the information in a data storage unit 121 (DB). Specifically, the storage unit has a data storage unit 121 (DB).
  • the data storage unit 121 stores the public wireless LAN connection information 122, master data 123 indicating the configuration of the station, in-station movement data 124, train time data 125, ticket gate passage headcount data 126, train headcount data 127, in-station waiting headcount data 128, and the like.
  • the master data 123 is inputted from an external source (such as the computer 117 used by the railway operator 116) every time there is a change and then updated.
  • the in-station movement data 124, the train time data 125, the train headcount data 127, and the in-station waiting headcount data 128 are result data generated by the calculation server 112.
  • the calculation server 112 executes a process of estimating the arrival/departure times of trains using a data group accumulated in the data server 111.
  • the calculation server 112 is a computer primarily having a network interface 130 (I/F(A)), a processor 131 (CPU), a memory 132, and a storage unit 133.
  • the network interface 130 is an interface for connecting to the networks 107 and 114.
  • the processor 131 executes programs stored in the memory 132.
  • the memory 132 includes ROM, which is a non-volatile memory element, and RAM, which is a volatile memory element.
  • the ROM includes fixed programs (such as the BIOS).
  • the RAM is a high speed and volatile memory element such as DRAM (dynamic random access memory), and temporarily stores programs to be executed by the processor 131 and data used during execution of the programs.
  • the storage unit 133 is constituted of a large capacity non-volatile storage device such as a magnetic storage device (HDD), a CD-ROM drive, or flash memory (SSD), for example, and stores programs to be executed by the processor 131 and data to be used while executing the programs. In other words, the programs are read from the storage unit 133, loaded into the memory 132, and executed by the processor 131.
  • a magnetic storage device HDD
  • CD-ROM drive compact flash memory
  • SSD flash memory
  • the storage unit 133 includes a data storage unit 152 (DB) that stores programs such as an in-station movement data generating program 134, a train time estimating program 135, a train delay calculating program 136, a rebate coefficient calculating program 137, a train passenger headcount aggregating program 138, and a in-station waiting headcount totaling program 139, as well as data such as a rebate coefficient table 153, and also stores intermediate data generated during the calculation process.
  • the data server 111 instead of the calculation server 112 may store the rebate coefficient table 153.
  • a plurality of recording devices may be provided, with programs and data being split among the plurality of recording devices.
  • data to be analyzed is acquired from the data server 111 and temporarily stored in the memory 132, and by reading from the memory 132 and executing the programs 134, 135, 136, 137, 138, and 139, the processor 131 realizes the respective functions thereof.
  • These programs may be automatically executed at a predetermined time interval (such as every few seconds or every few minutes).
  • the information distribution server 113 is a computer primarily having a network interface 145 (I/F(B)), a processor 146 (CPU), a memory 147, and a storage unit 148.
  • the network interface 145 is an interface for connecting to the networks 107 and 114.
  • the processor 146 executes programs stored in the memory 147.
  • the memory 147 includes ROM, which is a non-volatile memory element, and RAM, which is a volatile memory element.
  • the ROM includes fixed programs (such as the BIOS).
  • the RAM is a high speed and volatile memory element such as DRAM (dynamic random access memory), and temporarily stores programs to be executed by the processor 146 and data used during execution of the programs.
  • the storage unit 148 is constituted of a large capacity non-volatile storage device such as a magnetic storage device (HDD), a CD-ROM drive, or flash memory (SSD), for example, and stores programs to be executed by the processor 131 and data to be used while executing the programs. In other words, the programs are read from the storage unit 148, loaded into the memory 147, and executed by the processor 146. Specifically, the storage unit 148 stores programs such as a condition acquiring program 141 and an information distribution program 142, and intermediate data generated during the process of calculation.
  • programs such as a condition acquiring program 141 and an information distribution program 142, and intermediate data generated during the process of calculation.
  • the information distribution server 113 is accessed through networks 114 and 151 by a terminal 120 used by a system operator 119, the computer 117 used by the railway operator 116, and the terminal 118 used by the passenger 115, and provides information.
  • Information provided by the information distribution server 113 includes information for setting conditions pertaining to user verification and image display, results of estimating the number of people waiting at the station, and the like, for example, and is essentially provided whenever a computer or terminal accesses the information distribution server 113.
  • the system operator 119 who operates the traffic condition estimation system 110 uses the terminal 120 in order to confirm, through the network 151, the structure and state of data accumulated in the traffic condition estimation system 110, the state and calculation results of the calculation server 112, the search request state from users, and the like.
  • the servers 111, 112, and 113 may have an input interface and an output interface.
  • the input interface is connected to a keyboard, a mouse, or the like and receives input from an operator.
  • the output interface is connected to a display device, a printer, or the like and outputs execution results of the program in a format readable by an operator.
  • Programs executed by the processors 131 and 146 of the servers are provided to the servers 112 and 113 through removable media (such as CD-ROMs and flash memory) or through a network, and are stored in the non-volatile storage devices 133 and 148, which are non-transitory storage media.
  • the servers 112 and 113 would have an interface for reading in data from removable media.
  • Each server 111, 112, and 113 is a computer system constituted of one physical computer or a plurality of logical or physical computers, and may be operated in individual threads on the same computer, or in virtual computers created in a plurality of physical computer resources.
  • FIG. 5 is a diagram illustrating a data structure of the master data 123 stored in the data server 111 according to the embodiment of the present invention.
  • the master data 123 includes information such as installation location information 170 indicating the installation locations of the access points 102, definition information 180 for movement patterns in the station, and a planned train timetable 190.
  • the installation location information 170 for the access points 102 is data indicating the locations at which the public wireless LAN access points 102 are installed, and includes access point IDs 171, installation station names 172, and details 173 of installation locations. In a case where the location of the access point 102 is changed, the system operator or railway operator updates the data by input from outside of the system.
  • In-station movement definition information 180 includes information such as station names 181, connection start locations 182, connection termination locations 183, and types 184, and is data classifying movements in the station by action type for every combination of connection start location and connection termination location to the public wireless LAN in the station.
  • the type 184 can be classified into one of three types: boarding, exiting, and on-board.
  • the location on the platform of each mobile terminal can be estimated, and thus, information indicating the location on the platform of the mobile terminal may be included in addition to information of the type 184 indicating boarding or exiting from the train. In this manner, it is possible to perform detailed analysis such as which door on the train each mobile terminal entered or exited.
  • the planned train timetable 190 includes information such as station names 191, train IDs 192, train stopping locations 193, dates 194, arrival times 195, and departure times 196, and is data indicating the order in which trains arrive at or depart from each platform of each station.
  • the railway operator determines operating schedules in advance in order to operate the trains, make arrangements for crews, and the like, and manages planned schedule information indicating the timing at which the trains operate.
  • the planned train timetable 190 may record the planned schedule information as is or may extract only the necessary information and record that. Also, the planned train timetable 190 may be sequentially updated whenever the planned schedule is determined or updated, or by a batch process executed at predetermined times.
  • the operating schedules sometimes are modified according to the day of week or season, and thus, the date 194 is used to determine which day operating schedule is to be used.
  • FIG. 6 is a diagram illustrating a data structure of the in-station movement data 124 stored in the data server 111 according to the embodiment of the present invention.
  • the in-station movement data 124 is generated from the public wireless LAN connection information 122.
  • the in-station movement data 124 includes information such as connecting device IDs 231, station names 232, dates 233, connection start times 234, connection start locations 235, connection termination times 236, and connection termination locations 237, and is data indicating the time and place at which the mobile terminal started its connection to the access point in the station, and the time and place at which the connection was terminated.
  • the action type of each mobile terminal in the station can be determined.
  • FIG. 7 is a flowchart of a process in which the in-station movement data generating program 134 generates the in-station movement data 124 according to the embodiment of the present invention.
  • step 301 all records included in the public wireless LAN connection information 122 in the data server 111 are reordered according to the connection time 212 and the connecting device ID 213 (step 301). The following process is repeated for all connecting device IDs using the reordered data (step 302).
  • connection time 212 When repeating in the step 302, first the value of the connection time 212 is referred to, and the data is split at portions with a gap of t minutes or longer (step 303). This is in order to split the communication record into the plurality of times during the day that a person used the public wireless LAN such as morning and night, and process the communication record correctly.
  • the threshold of t minutes may be the time interval at which passengers generally use the station with this threshold being defined as being tens of minutes to a few hours, or public wireless LAN information may be used to determine an accurate time interval.
  • one group including the connection start time and the connection termination time generated in step 302 is divided into a plurality of pairs of connection start times and connection termination times in step 302.
  • This splitting may be performed by combining the connection start time with a connection termination time of another pair, and the connection termination time may be combined with a connection start time of another pair. Also, a determination may be made that the connection has lasted for a predetermined time from the connection start time and that the connection has lasted for a predetermined time before the connection termination time. In the latter case, even if connection data is lost, the connection time can be determined accurately.
  • step 304 The following process is repeated using the split data (step 304).
  • the value of the connection time 212 is acquired from the first record, and stored as the connection start time (step 305). Furthermore, the value of the access point ID 211 is acquired from the first record, the installation location information 220 included in the master data 123 is referenced, and the station name and installation location are searched (step 306).
  • the value of the connection time 212 is acquired from the last record, and stored as the connection termination time (step 307).
  • the value of the access point ID 211 is acquired from the last record, the installation location information 220 included in the master data 123 is referenced, and the station name and installation location are searched (step 308).
  • the installation locations of the plurality of access points are treated as the same in the process above.
  • information including the connecting device ID, the acquired station name, the connection start time, the connection start location, the connection termination time, and the connection termination location are stored in the in-station movement data 124 (step 309).
  • the date of the current time is stored in the date information.
  • FIG. 8 is a diagram illustrating a method of estimating the arrival/departure times of the train and the number of passengers in the train from the in-station movement data 124 according to the embodiment of the present invention.
  • Mobile terminals possessed by passengers on the train start connecting to an access point 102 installed in the station as the train arrives at the station.
  • A. Detect train arrival time the arrival time of the train as indicated by "A. Detect train arrival time”.
  • B. Detect train departure time the departure time of the train as indicated by "B. Detect train departure time”.
  • the mobile terminal possessed by the passenger on-board the train is connected to the public wireless LAN access point of the station while the train is stopped at the station.
  • devices where the connection start location and connection termination location of the in-station movement data 124 are at the same platform are possessed by passengers who are currently on-board the train.
  • the histogram sometimes includes noise.
  • the threshold used for filtering may be a fixed value or a value that changes dynamically (such as the average value during a predetermined period prior to the current time).
  • noise may be filtered out by eliminating data in which the time period in which the data appears in the histogram is shorter than a predetermined time.
  • FIG. 9 is a diagram illustrating a data structure of the train time data 125 stored in the data server 111 according to the embodiment of the present invention.
  • the train time data 125 includes information such as station names 241, train IDs 242, in-station locations 243, dates 244, arrival times 245, and departure times 246, and is data indicating the arrival/departure times of each train.
  • the train time data 125 stores results of estimating the arrival/departure information of the trains using the in-station movement data 124.
  • FIG. 10 is a flowchart of a process in which the train time estimating program 135 estimates the arrival/departure times of the train from the in-station movement data 124 according to the embodiment of the present invention.
  • the train time estimating program 135 is executed at each station.
  • the station name 181 of the in-station movement definition information 180 included in the master data 123 is referenced, and all records including the station are extracted (step 401). Then, the following process is repeated for all extracted records (definition pattern) (step 402).
  • connection start location 235 and the connection termination location 237 of the in-station movement data 124 are referenced, and all records corresponding to the definition pattern are extracted (step 403).
  • the connection start time 234 and the connection termination time 236 of the extracted record are used to create a histogram of the number of records according to a predetermined time interval (step 404).
  • a histogram is created using the connection start time 234, focusing on passengers who got off the train and onto the platform.
  • connection termination time 236 focusing on passengers who have boarded the train and are moving away from the station.
  • the time interval for creating the histogram is set in advance to a value from a few seconds to a few tens of seconds according to the station and the time period.
  • the arrival/departure times of the trains are detected with higher accuracy if a short time interval is used (every second, for example), but in stations or time periods with a small number of connected devices, aggregation may be performed with a longer time period (every few tens of seconds, for example).
  • step 405 data is detected from the histogram and a train ID is assigned in the order of detection (step 405), and stored in the train time data 125 (step 406).
  • the detection of data from the histogram may detect peaks, rises, or falls in the histogram. In a case where a peak is detected, for example, the arrival time of the train can be accurately estimated. In a case where a rise is detected, the departure time of the train can be accurately estimated.
  • the planned train timetable 190 can be used as the master data 123, the following may be performed: the original planned arrival/departure times 195 and planned departure time 196 are compared with the estimated time, and the train ID 192 closest to the arrival/departure times is detected and stored as the train ID 242 of the train time data 125. In a case where the gap between the train operation state and the plan is small on a given day, it is more useful to apply the planned train ID in order to analyze delays for each train.
  • FIG. 11 is a flowchart of a process in which the train delay calculating program 136 calculates the delay of trains calculates the delay of trains according to the embodiment of the present invention.
  • the train delay calculating program 136 uses the train time data 125 in order to calculate the delay of all trains operating on a given day. First, all records of a designated day are extracted from the train time data 125 (step 501), the records are rearranged with the station name 241, the train ID 242, and the in-station location 243 as keys (step 502), and the following process is repeated for all records (step 503).
  • the delay is calculated by simply comparing with the planned arrival time and departure time. Specifically, records including the corresponding train ID are extracted from the planned train timetable 190 (step 504), and the value ATplan for the train arrival time and the value DTplan for the train departure time are acquired (step 505). Also, the value AT for the train arrival time and the value DT for the train departure time are acquired from the train time data 125 (step 506). Lastly, ATplan is subtracted from AT to calculate the delay in the train arrival time and DTplan is subtracted from DT to calculate the delay in the train departure time (step 507).
  • a process may be performed in which records during a predetermined period in the past in which the combination of station name 241, train ID 242, and in-station location 243 are the same are extracted from the train time data 125, the average train arrival time is calculated and designated as ATplan and the average train departure time is calculated and designated as DTplan, and these values are compared with the train arrival time AT and the train departure time DT. By using the average value, it is possible to determine the delay in the train arrival time and the train departure time without the planned train timetable 190.
  • FIG. 12 is a diagram illustrating a data structure of the ticket gate passage headcount data 126 stored in the data server 111 according to the embodiment of the present invention.
  • the ticket gate passage headcount data 126 includes information such as station names 251, dates 252, time periods 253, types 254, and passage headcounts 255, and is data representing the number of passengers who have passed through the ticket gate of the station.
  • the ticket gate passage headcount data 126 can be created by aggregating passage records and/or IC ticket data of the automatic ticket gate 104. Alternatively, people can be detected in the image captured by the surveillance camera 105 installed near the ticket gate using image analysis techniques or signal analysis techniques to aggregate the ticket gate passage headcount.
  • the process of calculating the ticket gate passage headcount by image analysis or signal analysis may be executed in the data server 111 or processed outside of the system.
  • a statistical value determined from already stored ticket gate passage headcount data 126 may be used.
  • the passage headcount may be recorded separately according to whether they are entering or exiting, or the total number of people entering and exiting may be recorded without separation.
  • the interval for the time period 253 is set in advance to anywhere from a few minutes to a few hours.
  • the ticket gate passage headcount data 126 is needed in order to estimate the total number of passengers using the station. The reason is that some passengers do not use the public wireless LAN, or in some cases, one person has a plurality of mobile terminals, and thus, the number of connected devices attained from the public wireless LAN connection information 122 is not equal to the total number of passengers. In stations close to business districts and during commute times, the proportion of those having mobile terminals is thought to be higher, and thus, it is thought that there is some change depending on the station and time period in the ratio of the number of devices connected to the public wireless LAN and the total number of passengers.
  • FIG. 13 is a diagram illustrating a data structure of the rebate coefficient table 153 stored in the calculation server 112 according to the embodiment of the present invention.
  • the rebate coefficient table 153 includes information such as station names 261, time periods 262, and coefficients 263, and is data indicating the ratio of the number of devices connected to the public wireless LAN and the total number of passengers. The granularity of the time period 262 should match that of the time period 253 of the ticket gate passage headcount data 126.
  • the rebate coefficient table 153 may record differing coefficients depending on day attributes such as whether the day is a weekday or weekend/holiday.
  • the rebate coefficient table 153 may record differing coefficients depending on action types such as boarding, exiting, being on-board a train, or waiting at the station.
  • the rebate coefficient table 153 may record differing coefficients depending on the location in the station. By subdividing the rebate coefficient table 153, it is possible to estimate the number of people more accurately.
  • FIG. 14 is a flowchart of a process in which the rebate coefficient calculating program 137 generates the rebate coefficient table 153 according to the embodiment of the present invention.
  • the rebate coefficient calculating program 137 need not be executed everyday, and may be executed at a predetermined timing (every few days or every few weeks).
  • records of the corresponding period are extracted from the ticket gate passage headcount data 126 and the in-station movement data 124 (step 601).
  • the corresponding period may be set as a given day or a plurality of days. However, it is preferable that data containing both ticket gate passage headcount data 126 and the in-station movement data 124 be used.
  • the ticket gate passage headcount data 126 and the in-station movement data 124 of the same day could be used, but a statistical value (such as an average) of the ticket gate passage headcount data 126 and the in-station movement data 124 in which the attributes are of the same day may be used.
  • the following process is repeated for all stations (step 602).
  • the in-station movement data 124 is aggregated according to the granularity of the time period 253 of the ticket gate passage headcount data 126, and the number of connected devices N for each time period is determined (step 603).
  • the time information used when aggregating may be the connection start time 234 or the connection termination time 236.
  • step 604 a record of the station and the time period is extracted from the ticket gate passage headcount data 126 and the passage headcount T is acquired (step 605).
  • the total is calculated.
  • T/N is calculated and the calculated coefficient is stored in the rebate coefficient table 153 (step 606).
  • FIG. 15 is a diagram illustrating a data structure of the train headcount data 127 stored in the data server 111 according to the embodiment of the present invention.
  • the train headcount data 127 includes information such as station names 271, train IDs 272, in-station locations 273, dates 274, types 275, and headcounts 276, and is data indicating the number of passengers in each train, the number of people who have exited the train, the number of people currently riding the train, and the like.
  • the type 275 is recorded as one of three types: boarding, exiting, and on-board.
  • FIG. 16 is a flowchart of a process in which the train passenger headcount aggregating program 138 generates the train headcount data 127 according to the embodiment of the present invention.
  • the train passenger headcount aggregating program 138 is executed at each day and each station determined on the basis of information inputted from outside, and generates the train headcount data 127 using the in-station movement data 124.
  • the in-station movement definition information 180 is referenced with a combination of the station name 232 of the in-station movement data 124, the connection start location 235, and the connection termination location 237 as a key, and corresponding types 184 are extracted (step 703).
  • the train time data 125 is referenced and the train believed to have been ridden by a passenger having the connecting device is identified (step 704).
  • the departure time 246 of the train time data 125 is referenced with focus on the connection termination location 237 and the connection termination time 236, and the ID of the train with the smallest difference between the connection termination time 236 and the departure time 246 (or with a difference less than or equal to a threshold) is acquired.
  • the arrival time 245 of the train time data 125 is referenced with focus on the connection start location 235 and the connection start time 234, and the ID of the train with the smallest difference between the connection start time 234 and the arrival time 245 (or with a difference less than or equal to a threshold) is acquired.
  • connection start time 234 is compared with the arrival time 245 of the train time data 125, and the train ID is acquired by a method such as determining whether the difference is within a predetermined threshold.
  • connection termination time 236 may be compared with the departure time 246 of the train time data 125.
  • the arrival time 245 or departure time 246 of the train ID acquired in step 704 is used to reference the rebate coefficient table 153, thereby acquiring the rebate coefficient (step 705).
  • the rebate coefficient table 153 stores rebate coefficients separately according to whether the day is a weekday or weekend/holiday, the rebate coefficient is acquired in consideration of what day of the week the date is.
  • a search is performed to determine whether a record of the corresponding station name, train ID, date, and type is included in the record of the train headcount data 127.
  • a value equal to "rebate coefficient ⁇ 1" is added to the passenger number data.
  • a new record is created and a value equal to "rebate coefficient ⁇ 1" is recorded as the number of passengers.
  • FIG. 17 is a diagram illustrating a data structure of the in-station waiting headcount data 128 stored in the data server 111 according to the embodiment of the present invention.
  • the in-station waiting headcount data 128 includes information such as station names 281, in-station locations 282, dates 283, time periods 284, and waiting headcounts 285, and is data indicating the station and the number of people waiting in the station.
  • the interval for the time period 284 may be defined in advance as anywhere from a few minutes to a few hours. In a case where the in-station waiting headcount data 128 is generated at a narrow granularity such as a few seconds or a few minutes, it is possible to accumulate in greater detail short term changes in congestion in the station resulting from the arrival and departure of trains.
  • FIG. 18 is a flowchart of a process in which the in-station waiting headcount totaling program 139 generates the in-station waiting headcount data 128 according to the embodiment of the present invention.
  • the in-station waiting headcount totaling program 139 is executed at each day and each station determined on the basis of information inputted from outside, and generates the in-station waiting headcount data 128 using the in-station movement data 124.
  • connection start location 235 and the connection termination location 237 of the in-station movement data 124 are acquired, and it is determined whether the connection start location 235 is the same as the connection termination location 237 (step 803).
  • the records are considered to belong to a passenger currently on-board a train, and thus, the process is skipped in order not to count the passenger as someone waiting at the station (step 808).
  • connection start location 235 and the connection termination location 237 differ from each other, the number of people waiting is added for both the connection start location and the connection termination location.
  • the connection start time 234 is acquired and matched to the granularity of the time period of the in-station waiting headcount data 128, and the corresponding time period is determined (step 804).
  • a search is performed in the in-station waiting headcount data 128 to determine whether a record containing the station name, the connection start location, the date, and the time period is present.
  • the rebate coefficient table 153 is referenced and the value of the rebate coefficient is added.
  • no corresponding record is present, a new record is added to the in-station waiting headcount data 128 (step 805).
  • connection termination time 236 is acquired and matched to the granularity of the time period of the in-station waiting headcount data 128, and the corresponding time period is determined (step 806).
  • a search is performed in the in-station waiting headcount data 128 to determine whether a record containing the station name, the connection termination location, the date, and the time period is present.
  • the rebate coefficient table 153 is referenced and the value of the rebate coefficient is added.
  • a new record is added to the in-station waiting headcount data 128 (step 807).
  • FIG. 19 is a diagram illustrating an example of a screen 1010 distributed by the information distribution server 113 according to the embodiment of the present invention.
  • the screen 1010 is distributed to the terminal 120 of the system operator 119 or the computer 117 of the railway operator 116, and displays information such as current train delays, train congestion, and station congestion, for example.
  • the screen 1010 includes a map display region 1011, a ranking display region 1012, and a graph display region 1013.
  • the map display region 1011 displays on a map the number of people waiting at a station corresponding to the degree of congestion at the station, and the number of passengers in the train corresponding to the degree of congestion in the train.
  • the ranking display region 1012 displays in ascending or descending order the number of people waiting at the station or the number of people on-board the train.
  • the graph display region 1013 displays on a time series graph the number of people waiting in the station or the number of people riding the train from the first train of the day to the current time.
  • a warning 1014 indicating an anomaly may be displayed to the user.
  • the data and time of the data displayed may be displayed on the screen. Information on the number of people waiting at the station and the number of people on the train can be conveyed in an easy to understand manner to the user by modifying display aspects (such as the size and color of the image) for stations and trains on the basis of a level differentiation definition set in advance.
  • Information on the number of people waiting at the station and the number of people on the train may be displayed as text. Furthermore, stations may be sorted in order of degree of congestion and displayed in tabular format during a certain time period or throughout the day.
  • a screen that allows for a general overview, it is possible to attain information for improving service such as revisiting operation plans and drafting measures to alleviate congestion in the station.
  • These screens can be operated using an input interface such as a mouse or keyboard, and one may zoom into/out of the map screen using a scroll wheel or the like, or select the station or train by clicking thereon and display detailed information such as the train ID and operation records.
  • FIG. 20 is a diagram illustrating an example of a screen 1020 distributed to the terminal 118 by the information distribution server 113 according to the embodiment of the present invention.
  • the screen 1020 is distributed to the terminal 118 of the passenger 115.
  • a small screen indicated in a display of the mobile terminal 118 of the passenger 115 needs to be designed with consideration for small and low resolution.
  • the screen 1020 includes an interface 1021 for selecting the line, the direction, and the station, and an information display region 1022 having a scroll function. Thus, the user can easily select the station or train for which to view information.
  • the screen 1020 displays delays of trains scheduled to arrive at the station where the user is waiting as well as the degree of congestion at the station. In this manner, the user can determine whether to ride the next train or the train after the next.
  • FIG. 21 is a diagram illustrating an example of a screen 1110 for setting conditions for information to be distributed by the information distribution server 113 according to the embodiment of the present invention.
  • the condition-setting screen 1110 is to be displayed in the computer 117 of the railway operator 116, the terminal 118 of the passenger 115, or the terminal 120 of the system operator 119.
  • the station to be searched 1111, the date to be searched 1112, and the like are entered by direct input, by selecting an item on a drop down menu, or the like, and the execution button 1113 is pressed, thereby sending a request to the information distribution server 113.
  • These display conditions can be set by the user through an input interface such as a mouse, a keyboard, or a touch panel.
  • one train line, one station, and one date to be searched can be selected, but an interface may be adopted in which a plurality of options can be simultaneously selected.
  • an interface that operates in stages may be adopted such as by selecting the station after selecting the train line.
  • FIG. 22 is a flowchart of an information distribution process according to the embodiment of the present invention.
  • the information distribution server 113 executes an information distribution process.
  • the conditions inputted in the search condition-setting screen 1100 are acquired from the received request (step 1200).
  • a record corresponding to the aggregated station and date is extracted from the train time data 125, the train headcount data 127, and the in-station waiting headcount data 128 according to the inputted search conditions (step 1201).
  • the extracted record is processed so as to fit the format of the time series graph or map screen, and distributed to the device that sent the request (step 1202).
  • the information distribution server 113 may create the screen to be distributed by combining a plurality of programs according to the characteristics of the device to which the information is being distributed or the content of the information being distributed. It is possible to use web server technology when distributing the screen, and the distributed information can be viewed by a web browser running on the device to which the information is being distributed, for example. A specialized application to be run on the device to which the information is being distributed may create the screen to be displayed using the data transmitted from the information distribution server 113.
  • the embodiment of the present invention it is possible to estimate the time at which the train (transportation means) arrived at the station (boarding/deboarding means), and the time at which the train departed from the station. Also, it is possible to estimate the number of people boarding the train, the number of people exiting the train, and the number of people currently on-board the train. Furthermore, by accumulating the estimation values for the arrival/departure times of the train, the number of people on the train, and the number of people waiting at the station and calculating the average, it is possible to know whether train delays or congestion are worse than normal.
  • the number of people waiting at the boarding/deboarding facility (a station, a terminal, or the like) to ride a transportation means is estimated by extracting from the public wireless LAN connection information 122 the terminals where the connection start location and the connection termination location differ and multiplying the number of extracted terminals by the rebate coefficient, and thus, it is possible to know the degree of congestion at the station or the like without high equipment costs.
  • the passenger can select stations that are not as congested.
  • Transportation operators can ensure safety by deploying personnel according to the degree of congestion at the station or the like or putting in place restrictions.
  • by sending a large number of transportation means (buses, taxis, etc.) to congested stations congestion can be eased in a short period of time.
  • the number of people currently riding a transportation means is estimated by extracting from the public wireless LAN connection information 122 the terminals where the connection start location and the connection termination location are the same boarding/deboarding location and multiplying the number of extracted terminals by the rebate coefficient, and thus, it is possible to know the degree of congestion in the train or the like without high equipment costs. Passengers can select and ride less congested trains. Transportation operators can use this information as a basis for proposing measures to ease congestion (such as modifying the schedule).
  • the time from the connection start time to the connection termination time of the same terminal acquired from the public wireless LAN connection information 122 is greater than or equal to a predetermined time t, the time from the connection start time to the connection termination time is subdivided, and thus, it is possible to appropriately subdivide data on users who used one station a plurality of times, allowing for accurate estimation of the number of people.
  • connection data between the base station installed at the deboarding area and the terminal is acquired from the public wireless LAN connection information 122, and by performing a statistical process on the data, the time at which the number of terminals that have started connections is determined, and the determined time is considered to be the arrival time of the transportation means, and thus, it is possible to know the operation state (delays) of the train without high equipment costs. Passengers can know whether a train is delayed prior to going to the station. Transportation operators can use the daily arrival time data as a basis to improve the schedule.
  • connection data between the base station installed at the boarding area and the terminal is acquired from the public wireless LAN connection information 122, and by performing a statistical process on the data, the time at which the number of terminals that have stopped connections is determined, and the determined time is considered to be the departure time of the transportation means, and thus, it is possible to know the operation state (delays) of the train without high equipment costs. Passengers can know whether a train is delayed prior to going to the station. Transportation operators can use the daily arrival time data as a basis to improve the schedule.
  • connection data when performing a statistical process on the connection data, at least one of the following is eliminated: data where the number of devices is less than a predetermined number per unit time, and data where the time period at which the data appears is shorter than a predetermined time.
  • the average over a predetermined period of the estimated arrival time or departure time is calculated, and delays in the transportation means are estimated by the difference between the calculated average and the estimated arrival time and departure time, and thus, it is possible to know whether there is a delay even without a timetable.
  • the information of programs, tables, and files to implement the functions may be stored in a storage device such as a memory, a hard disk drive, or an SSD (a Solid State Drive), or a storage medium such as an IC card, or an SD card.
  • a storage device such as a memory, a hard disk drive, or an SSD (a Solid State Drive), or a storage medium such as an IC card, or an SD card.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Mechanical Engineering (AREA)
  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Marketing (AREA)
  • Primary Health Care (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Train Traffic Observation, Control, And Security (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Traffic Control Systems (AREA)
EP16889665.2A 2016-03-02 2016-03-02 Système d'estimation de situation de trafic et procédé d'estimation de situation de trafic Active EP3425606B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2016/056461 WO2017149703A1 (fr) 2016-03-02 2016-03-02 Système d'estimation de situation de trafic et procédé d'estimation de situation de trafic

Publications (3)

Publication Number Publication Date
EP3425606A1 true EP3425606A1 (fr) 2019-01-09
EP3425606A4 EP3425606A4 (fr) 2019-10-23
EP3425606B1 EP3425606B1 (fr) 2021-08-18

Family

ID=59742617

Family Applications (1)

Application Number Title Priority Date Filing Date
EP16889665.2A Active EP3425606B1 (fr) 2016-03-02 2016-03-02 Système d'estimation de situation de trafic et procédé d'estimation de situation de trafic

Country Status (3)

Country Link
EP (1) EP3425606B1 (fr)
JP (1) JP6326177B2 (fr)
WO (1) WO2017149703A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6923731B1 (ja) * 2020-09-08 2021-08-25 Kddi株式会社 情報提供装置、情報端末、プログラム及び情報提供システム

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6736619B2 (ja) * 2018-08-20 2020-08-05 ヤフー株式会社 決定装置、決定方法、決定プログラム
JP7060537B2 (ja) * 2019-03-18 2022-04-26 ソフトバンク株式会社 情報処理システム、移動局数推計方法、人口推計方法及びプログラム

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4399283B2 (ja) * 2004-01-30 2010-01-13 三菱電機株式会社 駅混雑度推定システム
CN101243478A (zh) * 2005-06-23 2008-08-13 艾尔塞奇公司 利用蜂窝数据用于运输规划和工程的方法和系统
JP4028879B2 (ja) 2005-10-25 2007-12-26 株式会社ナビタイムジャパン ナビゲーションシステム、携帯端末装置および出発、到着判別方法
JP2010277190A (ja) * 2009-05-26 2010-12-09 Nippon Telegr & Teleph Corp <Ntt> 滞在地コンテキスト抽出装置、滞在地コンテキスト抽出方法およびプログラム
GB2497928B (en) * 2011-12-21 2014-11-19 Vodafone Ip Licensing Ltd Transport system monitoring using mobile network data
JP5872381B2 (ja) * 2012-05-23 2016-03-01 株式会社日立製作所 代替経路情報表示装置
IL229671A0 (en) * 2013-11-28 2014-03-31 Google Inc Determining transport status using network connections

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6923731B1 (ja) * 2020-09-08 2021-08-25 Kddi株式会社 情報提供装置、情報端末、プログラム及び情報提供システム
JP2022045243A (ja) * 2020-09-08 2022-03-18 Kddi株式会社 情報提供装置、情報端末、プログラム及び情報提供システム

Also Published As

Publication number Publication date
JP6326177B2 (ja) 2018-05-16
WO2017149703A1 (fr) 2017-09-08
EP3425606A4 (fr) 2019-10-23
EP3425606B1 (fr) 2021-08-18
JPWO2017149703A1 (ja) 2018-03-08

Similar Documents

Publication Publication Date Title
CN109789885B (zh) 交通系统、调度表建议系统以及车辆运行系统
Zhu et al. A probabilistic passenger-to-train assignment model based on automated data
US10430736B2 (en) System and method for estimating a dynamic origin-destination matrix
JP6675860B2 (ja) データ処理方法およびデータ処理システム
Sánchez-Martínez Inference of public transportation trip destinations by using fare transaction and vehicle location data: Dynamic programming approach
JP5986641B2 (ja) 交通分析システム
US20160371973A1 (en) Traffic Prediction and Real Time Analysis System
US11176812B2 (en) Real-time service level monitor
US10621529B2 (en) Goal-based travel reconstruction
JP2019177760A (ja) 輸送機関混雑予測システム及び混雑予測方法
JP5520203B2 (ja) 混雑度推定装置
Fernandez et al. Effect of passenger–bus–traffic interactions on bus stop operations
CN110545558A (zh) 基于Wi-Fi数据的高速服务区人群密度估计系统
EP3425606B1 (fr) Système d&#39;estimation de situation de trafic et procédé d&#39;estimation de situation de trafic
Liu et al. Smart card data-centric replication of the multi-modal public transport system in Singapore
Zhao et al. Isolating high-priority metro and feeder bus transfers using smart card data
CN110874668A (zh) 一种轨道交通od客流预测方法、系统及电子设备
JP2016222114A (ja) データ処理システム、及び、データ処理方法
CN110046535B (zh) 基于机器学习的智能出行时间预测系统、方法及存储介质
JP7555813B2 (ja) データ処理方法、データ処理システム
CN108230670B (zh) 预测在给定时间段给定地点出现的移动体数的方法和装置
US11252379B2 (en) Information processing system, information processing method, and non-transitory storage medium
JP2020035004A (ja) 需要予測システムおよび需要予測方法
KR102700257B1 (ko) 시내버스의 디지털영상저장장치(dvr) 영상을 활용한 혼잡도 분석 방법
CN115495651A (zh) 一种乘客个性化出行需求挖掘系统、方法及存储介质

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20180326

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20190919

RIC1 Information provided on ipc code assigned before grant

Ipc: G06Q 50/30 20120101ALI20190914BHEP

Ipc: G08G 1/01 20060101AFI20190914BHEP

Ipc: B61L 27/00 20060101ALI20190914BHEP

Ipc: B61L 25/02 20060101ALI20190914BHEP

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20200625

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20210302

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602016062555

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

Ref country code: AT

Ref legal event code: REF

Ref document number: 1422337

Country of ref document: AT

Kind code of ref document: T

Effective date: 20210915

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20210818

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1422337

Country of ref document: AT

Kind code of ref document: T

Effective date: 20210818

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211118

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211220

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211118

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211119

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602016062555

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20220519

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602016062555

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20220331

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220302

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220331

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220302

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220331

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20221001

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220331

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220331

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20160302

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20240201

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: IT

Payment date: 20240212

Year of fee payment: 9

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210818