WO2022027748A1 - Passenger recognition method, passenger recognition apparatus, electronic device and readable storage medium - Google Patents
Passenger recognition method, passenger recognition apparatus, electronic device and readable storage medium Download PDFInfo
- Publication number
- WO2022027748A1 WO2022027748A1 PCT/CN2020/111433 CN2020111433W WO2022027748A1 WO 2022027748 A1 WO2022027748 A1 WO 2022027748A1 CN 2020111433 W CN2020111433 W CN 2020111433W WO 2022027748 A1 WO2022027748 A1 WO 2022027748A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- logical
- trip
- duration
- travel
- trajectory
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 67
- 238000012545 processing Methods 0.000 claims abstract description 34
- 230000008569 process Effects 0.000 claims description 35
- 238000004364 calculation method Methods 0.000 claims description 20
- 230000002238 attenuated effect Effects 0.000 description 23
- 101100463660 Sus scrofa NPG2 gene Proteins 0.000 description 14
- 101150038768 NPG1 gene Proteins 0.000 description 11
- 238000010586 diagram Methods 0.000 description 10
- 230000037361 pathway Effects 0.000 description 9
- 238000001514 detection method Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000003203 everyday effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/22—Matching criteria, e.g. proximity measures
-
- 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/10—Services
- G06Q50/26—Government or public services
Definitions
- the invention belongs to the technical field of spatiotemporal data processing and public transportation, and in particular, relates to a method for identifying public transportation passengers, an identification device for public transportation passengers, electronic equipment and a machine-readable storage medium.
- AFC automatic toll collection system
- AP location data, etc.
- the acquisition of these data provides us with new analysis ideas for analyzing the travel of passengers, especially individual passengers.
- the AFC data records the passenger's entry and exit data
- the AP data records part of the passenger's position data during the trip.
- the two kinds of data are associated, and the complete travel information of passengers can be obtained.
- the data sources for obtaining different data are isolated from each other, and the identification information of the same passenger in different data sources is also different. Therefore, how to associate the same passenger in different data sources is to construct a passenger Prerequisites for detailed travel information.
- FIG. 1 is a schematic diagram of a comparison method of spatiotemporal trajectory similarity in the prior art.
- Passenger A's travel includes: regular travel (stations s 2 to s 5 , station s 1 ) . ⁇ s 3 ) and random trips (stops s 5 ⁇ s 6 ); the trips of passenger B include: regular trips (stops s 2 ⁇ s 5 , s 1 ⁇ s 3 , and s 2 ⁇ s 4 ).
- the matching method based on the existing spatio-temporal trajectories, that is, matching between sites, will obtain an incorrect match, that is, the matching results obtained are (a) the spatio-temporal trajectories in the graph and (d) the spatio-temporal trajectories in the graph.
- the trajectories are matched, resulting in passenger A and passenger B matching due to overlapping spatiotemporal trajectories between different passengers (meaning that the stations also overlap).
- the present invention provides a public transport passenger identification method and a public transport passenger identification device which can improve the identification and matching accuracy of the same passenger under different data sources.
- a method for identifying public transport passengers includes: acquiring a first travel trajectory including a plurality of first logical trips based on a first passenger travel data source, and based on a second passenger travel data source Acquire a second travel trajectory including a plurality of second logical trips, the first logical trip and the second logical trip respectively include travel time periods constituting one logical trip; Matching the logical trips to classify the first logical trips matched with the second logical trips into a matching logical trip set; obtaining the trip time period and the corresponding logical trips of the first logical trips in the matching logical trip set matching the travel time period of the second logical travel overlapping the travel time period, to obtain the overlapping time period corresponding to the overlapping travel time period; performing attenuation processing on the overlapping time period to obtain the overlapping time period after attenuation processing; according to The track similarity of the first travel track and the second travel track is calculated from the overlapping duration after the attenuation
- the performing attenuation processing on the overlapping durations to obtain the overlapping durations after attenuation processing specifically includes: performing an attenuation process on the overlapping durations that meet the preset conditions in the matching logical line set.
- the overlapping duration corresponding to the first logical trip is attenuated to obtain the attenuation overlapping duration; the attenuation overlapping duration and the matching logical trip set corresponding to the first logical trip that does not meet the preset condition are combined.
- the overlapping duration is determined as the overlapping duration after the attenuation process; wherein, the preset condition includes: in a travel time period in the matching logical travel set, all the first logic corresponding to the travel time period The sum of the travel duration of the trip is greater than the preset duration.
- the overlapping duration corresponding to the first logical trip that meets the preset condition in the matching logical trip set is attenuated to obtain the attenuation overlapping duration, specifically: Including: calculating the decay overlap duration based on the following formula,
- i represents the i-th travel time period that meets the preset condition in the matching logical travel set
- c i represents the total number of the first logical trips in the i-th travel time period
- j represents the jth first logical trip in the ith trip time period
- ⁇ represents the decay contribution rate
- ⁇ represents the decay contribution rate
- both the first logical trip and the second logical trip further include the shortest trip duration that constitutes a logical trip; wherein, the overlap processed according to the attenuation
- the trajectory similarity between the first travel trajectory and the second travel trajectory is calculated by the duration, which specifically includes: according to the overlapping duration after the attenuation process, the shortest travel duration of the plurality of first logical trips, and the The shortest travel duration of the second logical trip that does not match the multiple first logical trips, and the similarity between the first trip trajectory and the second trip trajectory is calculated.
- both the first logical trip and the second logical trip further include the shortest trip duration that constitutes a logical trip; wherein, the overlap processed according to the attenuation
- the trajectory similarity between the first travel trajectory and the second travel trajectory is calculated by the duration, which specifically includes: the shortest travel duration of the first logical trip in the matching logical trip set, and the travel duration of the first logical trip in the matching logical trip set.
- the shortest trip duration of the first logical trip that does not match the logical trips and the shortest trip duration of the second logical trips that do not match the multiple first logical trips are given different weighting coefficients respectively; according to the The overlapping duration after attenuation processing and the shortest trip duration of the first logical trip in the matching logical trip set assigned different weight coefficients, and the first logical trip that does not match the plurality of second logical trips.
- the shortest trip duration of the trip and the shortest trip duration of the second logical trip that do not match the multiple first logical trips, and the similarity between the first trip trajectory and the second trip trajectory is calculated.
- both the first logical trip and the second logical trip further include an inbound site, an outbound site, an inbound time, and an outbound time that constitute a logical trip;
- the matching of the first logical trip and the second logical trip to classify the first logical trip matching the second logical trip into a matching logical trip set specifically includes: using The inbound time of the first logical trip is subtracted from the inbound time of the second logical trip to obtain the inbound duration, and the outbound time of the first logical trip is subtracted from the outbound time of the second logical trip.
- the first logical trip is classified into a set of matching logical trips.
- a public transportation passenger identification device comprising: a travel trajectory acquisition module configured to acquire a first travel trajectory including a plurality of first logical travels based on a first passenger travel data source , and obtain a second travel trajectory including a plurality of second logical travels based on the second passenger travel data source; wherein, the first logical travel and the second logical travel respectively include travel time periods that constitute a logical travel; the logic a trip matching module configured to match the first logical trip and the second logical trip to classify the first logical trip matching the second logical trip into a set of matching logical trips; overlapping A duration acquisition module configured to acquire the travel time period in which the travel time period of the first logical trip in the matching logical trip set and the travel time period of the matching second logical trip overlap, so as to obtain the overlapping trip the overlapping duration corresponding to the time segment; the overlapping duration attenuation module is configured to perform attenuation processing on the overlapping duration to obtain the overlapping
- the overlapping duration attenuation module includes: a duration attenuation unit configured to The overlapping duration is attenuated to obtain an attenuated overlapping duration; a duration determining unit is configured to compare the attenuated overlapping duration and the first logical trip in the matching logical trip set corresponding to the first logical trip that does not meet the preset condition.
- the overlapping duration is determined as the overlapping duration after the attenuation process; wherein, the preset condition includes: in a travel time period in the matching logical travel set, all the first logic corresponding to the travel time period The sum of the travel duration of the trip is greater than the preset duration.
- the duration attenuation unit is further configured to obtain the attenuation overlap duration by calculating the following formula:
- i represents the i-th travel time period that meets the preset condition in the matching logical travel set
- c i represents the total number of the first logical trips in the i-th travel time period
- j represents the jth first logical trip in the ith trip time period
- ⁇ represents the decay contribution rate
- ⁇ represents the decay contribution rate
- both the first logical trip and the second logical trip further include the shortest trip duration that constitutes a logical trip;
- the trajectory similarity calculation module is further configured to: : Calculated according to the overlapping duration after the attenuation process, the shortest travel duration of the multiple first logical trips, and the shortest trip duration of the second logical trip that does not match the multiple first logical trips The similarity between the first travel trajectory and the second travel trajectory.
- both the first logical trip and the second logical trip further include the shortest trip duration that constitutes a logical trip;
- the trajectory similarity calculation module includes: A weighting coefficient assigning unit configured to assign the shortest travel duration of the first logical trip in the matching logical trip set and the shortest trip duration of the first logical trip that does not match the plurality of second logical trips , and the shortest travel durations of the second logical trips that do not match the multiple first logical trips are respectively assigned different weight coefficients;
- the similarity calculation unit is configured to The shortest travel duration of the first logical trip in the matching logical trip set with different weight coefficients, the shortest trip duration of the first logical trip that does not match the plurality of second logical trips, and the The shortest travel duration of the second logical trip that does not match the multiple first logical trips is calculated, and the trajectory similarity between the first trip trajectory and the second trip trajectory is calculated.
- both the first logical trip and the second logical trip further include an inbound station, an outbound station, an inbound time, and an outbound time that constitute a logical trip.
- the logical trip matching module includes: an inbound and outbound duration determination unit configured to use the inbound time of the first logical trip to subtract the inbound time of the second logical trip to obtain the inbound duration, and use all the The outbound time of the second logical trip is subtracted from the outbound time of the first logical trip to obtain the outbound duration;
- the shortest inbound and outbound duration determination unit is configured to obtain the distance from the inbound station of the first logical trip to the shortest inbound duration between inbound stations of the second logical trip, and obtaining the shortest outbound duration from the outbound station of the second logical trip to the outbound station of the first logical trip;
- the matching determination unit is configured to, if the absolute value of the sum of the inbound duration and the shortest inbound duration is less than a preset duration threshold,
- an electronic device comprising: at least one processor, and a memory coupled with the at least one processor, the memory storing instructions, when the instructions are executed by the at least one processor When executed by the processor, the at least one processor is caused to execute the method for identifying a public transportation passenger as described above.
- Still another aspect of an embodiment of the present invention provides a machine-readable storage medium storing executable instructions that, when executed, cause the machine to perform the above-described method for identifying a public transportation passenger.
- Fig. 1 is the schematic diagram of the comparison method of the spatiotemporal trajectory similarity of the prior art
- FIG. 2 is a flowchart of a method for identifying a public transportation passenger according to an embodiment of the present invention
- 3A is a block diagram of an apparatus for identifying public transportation passengers according to an embodiment of the present invention.
- Figure 3B is a block diagram of an example of a logical row matching module of the identification device in Figure 3A;
- 3C is a block diagram of an example of an overlap duration decay module of the identification device in FIG. 3A;
- 3D is a block diagram of an example of a trajectory similarity calculation module of the identification device in FIG. 3A;
- FIG. 4 is a block diagram illustrating an electronic device implementing a method for identifying a public transportation passenger according to an embodiment of the present invention.
- the term "including” and variations thereof represent open-ended terms meaning “including but not limited to”.
- the terms “based on”, “depending on” and the like mean “based at least in part on”, “based at least in part on”.
- the terms “one embodiment” and “an embodiment” mean “at least one embodiment.”
- the term “another embodiment” means “at least one other embodiment.”
- the terms “first”, “second”, etc. may refer to different or the same objects. Other definitions, whether explicit or implicit, may be included below. The definition of a term is consistent throughout the specification unless the context clearly dictates otherwise.
- the identification method includes: acquiring a first travel trajectory including a plurality of first logical trips based on a first passenger travel data source, and acquiring a second travel trajectory including a plurality of second logical trips based on a second passenger travel data source, the first The logical trip and the second logical trip respectively include a trip time period that constitutes a logical trip; the first logical trip and the second logical trip are matched to classify the first logical trip matching the second logical trip into the matching logical trip set; obtain the travel time period overlapping the travel time period of the first logical trip in the matching logical travel set and the travel time period of the matching second logical trip, so as to obtain the overlapping time period corresponding to the overlapping travel time period; Perform attenuation processing to obtain the overlapping duration after attenuation processing; calculate the trajectory similarity of the first travel trajectory and the second travel trajectory according to the overlapping duration after atten
- the overlapping duration of the matching first logical trip and the second logical trip is obtained, and the obtained overlapping duration is attenuated, so as to reduce the weight of the overlapping duration in the process of calculating the similarity of the trajectory, thereby increasing the difference between the two.
- the identification matching accuracy rate of the same passenger under the data source is obtained, and the obtained overlapping duration is attenuated, so as to reduce the weight of the overlapping duration in the process of calculating the similarity of the trajectory, thereby increasing the difference between the two.
- Travel data source It can acquire and store passenger travel data such as passenger identification, station data, time data, etc. of passengers when they travel.
- Logical travel refers to a logical ride process of passengers, that is, the whole process of a passenger entering the station from the inbound station and leaving the station from the outbound station.
- a logical trip may include: inbound station, inbound time, outbound station, outbound time, and the like.
- the inbound time and the outbound time constitute the travel time period, therefore, a logical trip can also include: travel time period.
- the time period corresponding to the travel time period is set as the travel time period.
- Shortest travel duration Given any two physical sites, the duration of the shortest path (also called the effective path) from one physical site to the other.
- the shortest path also called the effective path
- there are two paths generally known by public transportation routes), one of which is from station a, via Station a1, station a2 to station b, and another route is from station a, through station b1 to station b
- the shortest travel time from station a to station b is from station a, through station b1 to station b
- the duration used used, of course, the premise here is that the route distance between any two physical stations is basically equal, which is also in line with the actual public transportation settings.
- a logical trip may also include a minimum trip duration.
- Travel trajectory refers to the spatio-temporal point sequence composed of multiple spatio-temporal points (or detection points) arranged in chronological order and collected by the passengers in a period of time by sensing equipment (such as AFC system, AP system).
- sensing equipment such as AFC system, AP system.
- each spatiotemporal point includes the site where the sensing device is installed and the corresponding time (ie, the time of sensing detection).
- FIG. 2 is a flowchart of a method for identifying a public transportation passenger according to an embodiment of the present invention.
- a first travel trajectory including a plurality of first logical travels is obtained based on a first passenger travel data source
- a second travel including a plurality of second logical travels is obtained based on the second passenger travel data source trajectory.
- the travel data source of the first passenger can acquire and store all the inbound sites, inbound time, outbound sites, outbound time, passenger identification ( identification), etc.
- the first passenger travel data source may be, for example, an AFC data source (ie, an AFC system).
- the first travel trajectory includes a plurality of inbound sites obtained from the first passenger travel data source, an inbound time corresponding to each inbound site, a plurality of outbound sites, and an outbound time corresponding to each outbound site. Therefore, each first logical trip includes a corresponding one inbound station, one inbound time, one outbound station, and one outbound time.
- the travel time period and its corresponding travel duration can be obtained according to the inbound time and the outbound time, so each first logical trip may also include a corresponding travel time period and a corresponding travel duration.
- the shortest travel duration can be obtained according to the inbound station and the outbound station, so each first logical trip may further include a corresponding shortest travel duration.
- the travel data source of the second passenger can acquire and store all the route stations of the second passenger when the second passenger travels, the route time corresponding to each route station, and the passenger identification (i.e., identity identification) and the like.
- the second passenger travel data source may be, for example, an AP data source.
- the route station is a public transportation station passed by the second passenger when he travels, and certainly may be a station acquired by the second passenger through sensing and detection when entering or exiting the station.
- the second travel track includes a plurality of route stations obtained from the second passenger travel data source and the route time corresponding to each route station.
- the plurality of pathway sites are arranged in chronological order of pathways, if the current pathway site p i and the previous pathway site p i-1 satisfy the division condition Then, the previous route site p i-1 (and its corresponding route time) and all route sites before this route site p i-1 (and their corresponding route times) are included in a second logical trip, wherein , p i.t represents the pathway time corresponding to the pathway site p i , p i - 1.t represents the pathway time corresponding to the pathway site p i-1 , represents the shortest travel time from the route station pi to the previous route station pi -1 , and ⁇ is the additional additional time that can be tolerated.
- the route station before the previous route station p i-1 refers to the route station before the previous route station p i-1 that does not meet the above-mentioned division conditions and is not included in other second logical trips. .
- the current route station and the previous route station satisfy the division condition, and also satisfy the division condition with the latter route station, the current route station is deleted. That is to say, the isolated pathway sites after being divided according to the dividing conditions are deleted.
- each second logical trip includes at least two waypoints.
- the first route stop (the corresponding route time is the earliest) of the at least two route stops in chronological order in each second logical trip is set as belonging to the route in the second logical trip. station, and set the last route station (with the latest route time) as the outbound station belonging to the second logical trip.
- the route time corresponding to the first route station is the inbound time
- the route time corresponding to the last route station is the outbound time.
- the travel time period and its corresponding travel duration can be obtained according to the inbound time and the outbound time
- each second logical trip may also include a corresponding travel time period and a corresponding travel duration.
- the shortest travel duration can be obtained according to the inbound station and the outbound station, so each second logical trip may further include a corresponding shortest travel duration.
- the ith first logical trip and the jth second logical trip satisfy the following conditions, the ith first logical trip and the jth second logical trip are deemed to match each other.
- the conditions that need to be met can be specified.
- the conditions to be satisfied may include the following conditions:
- the pit stop duration and the shortest pit stop duration The absolute value of the sum is less than a preset duration threshold ⁇ ', and the outbound duration and the shortest outbound duration The absolute value of the sum is less than the preset duration threshold ⁇ ', then it is considered that the i-th first logical trip and the j-th second logical trip match each other, and the i-th logical trip that matches the j-th second logical trip The first logical trip is classified into the matching logical trip set PG.
- Equation 1 the condition that needs to be satisfied can be expressed by Equation 1 below.
- the conditions to be satisfied may also include the following conditions: the inbound station of the i-th first logical trip and outbound sites The valid path between passes through the inbound stop of the jth second logical trip and outbound sites
- the first logical trip that does not match each second logical trip of the second trip trajectory is classified into The first unmatched logical trip set NPG1, and the second logical trips that do not match each of the first logical trips of the first trip trajectory are classified into the second unmatched logical trip set NPG2.
- non-matching means that the above-mentioned conditions are not satisfied. In one example, if Equation 1 above is not satisfied, the i-th first logical run and the j-th second logical run do not match.
- the i-th first logical row and the j-th second logical row are matched with each other as an example.
- the i-th first logical trip includes from 8:00 a.m. to 9:30 a.m. from inbound station S1 through station S2, station S3, and station S4 to outbound station S5, and the jth second logical trip Including from 8:00 am to 9:00 am from the inbound station S2 through the station S3 to the outbound station S4.
- the overlapping travel time period of the i-th first logical trip (8:00 a.m. to 9:30 a.m.) and the j-th second logical trip’s travel time period (8:00 a.m. to 9:00 a.m.) is From 8:00 am to 9:00 am, the corresponding overlapping time is one hour.
- Attenuation processing is performed on each overlapping duration to obtain each overlapping duration after attenuation processing.
- the "attenuation processing” may include attenuation processing that attenuates the overlapping duration, or may include attenuation processing that does not attenuate the overlapping duration.
- the overlapping duration corresponding to each first logical trip that meets the preset condition in the matching logical trip set PG is attenuated, so as to obtain the attenuation overlap corresponding to each first logical trip that meets the preset condition. duration.
- the overlapping duration corresponding to each first logical trip that does not meet the preset condition in the matching logical trip set PG is not attenuated.
- the setting of the preset condition can cause the overlapping durations corresponding to all the first logical trips in the matching logical trip set PG to be attenuated.
- the setting of the preset condition can make the overlapping duration corresponding to some first logical trips in the matching logical trip set PG attenuated, while the overlapping duration corresponding to the remaining part of the first logical trips is not. is attenuated.
- the preset condition may include: in a travel time period in the matching logical travel set PG, the sum of the travel durations of all the first travel trajectories corresponding to the travel time period is greater than the preset time period.
- all the first logical trips corresponding to this travel time period (that is, The travel duration of 30 first logical trips) is 30 hours; if the first passenger travels from the inbound station D1 to the outbound station D2 every day from 8:00 am to 9:00 am on the 20th of the 30 days, Then, the travel duration of all the first logical trips (ie, 20 first logical trips) corresponding to the travel time period is 20 hours.
- a preset duration (such as 20 hours, etc.) is set to obtain all the first logical trips in a certain trip time period in the corresponding matching logical trip set PG, if the sum of the trip durations of these first logical trips is greater than For the preset duration, the first logical trips corresponding to the trip time period meet the preset condition, so that the overlapping durations corresponding to the first logical trips are all attenuated.
- the matching logical travel set PG may include multiple different travel time periods (or travel modes), which are caused by the different regular travel time periods of passengers.
- the preset condition may also be set according to the number of days. For example, if the first passenger travels from the inbound station D1 to the outbound station D2 from 8:00 am to 9:00 am, if the number of days the first passenger travels from 8:00 am to 9:00 am reaches a preset number of days (for example, 20 days) ), then it is considered that the first logical trip corresponding to 8:00 am to 9:00 am meets the preset condition.
- a preset number of days for example, 20 days
- the following formula 2 can be used to attenuate the overlapping duration corresponding to each first logical trip that meets the preset condition in the matching logical trip set PG.
- a represents the a-th travel time period in the matching logical travel set PG that meets the preset condition
- c a represents the total number of first logical trips in the a-th travel time period
- b represents the a-th travel time period
- ⁇ represents the decay contribution rate
- Indicates the decay overlap duration corresponding to the bth first logical row In this case, by attenuating the overlapping durations that meet the preset conditions in the matching logical trip set PG, the weight of the overlapping durations that meet the preset conditions in the trajectory similarity calculation process is reduced, that is, the overlap is reduced.
- the weight of the travel time period (relatively increases the proportion of non-overlapping travel time periods), thereby improving the identification and matching accuracy of the same passenger under different data sources.
- the obtained attenuation overlap duration corresponding to each first logical trip and the overlapping duration corresponding to each first logical trip that does not meet the preset condition in the matching logical trip set PG are determined as the respective attenuations The duration of the overlap after processing. That is to say, all the overlapping durations after the attenuation process include the respective attenuated overlapping durations after the overlapping durations are attenuated and the respective overlapping durations that are not attenuated.
- the track similarity between the first travel track and the second travel track is calculated according to the overlapping duration after the attenuation process.
- the shortest trip duration of all the first logical trips of the first trip trajectory, and the first trip trajectory that does not match all the first logical trips of the first trip trajectory is calculated.
- the trajectory similarity of the first travel trajectory and the second travel trajectory may be calculated based on the following formula 3.
- TS afc indicates the first travel trajectory
- TS ap indicates the second travel trajectory
- Sim(TS afc ,TS ap ) indicates the trajectory similarity between the first travel trajectory and the second travel trajectory
- M indicates the matching logic travel set PG in the pre-defined travel trajectory.
- ⁇ p represents the overlapping duration corresponding to the p-th first logical trip in the matching logical trip set PG that does not meet the preset conditions
- P represents the non-matching logical trip set PG in the matching logical trip set PG.
- the total number of first logical trips that meet the preset conditions represents the nth first logical trip in the first trip trajectory, represents the shortest trip duration of the nth first logical trip
- N represents the total number of first logical trips in the first trip trajectory
- NPG2 represents the qth second logical trip in the second unmatched logical trip set NPG2
- Q represents the total number of second logical trips in the second unmatched logical trip set NPG2.
- the first travel trajectory includes N first logical trips, while M and P are both smaller than N, and Q is also smaller than the total number of second logical trips in the second travel trajectory.
- the first unmatched logical travel set NPG1 can correspond to three types of travel situations.
- the first type of trip corresponding to the matching logical trip set PG refers to that the passenger is detected by the AFC device when entering or leaving the station, and the mobile terminal carried by the passenger is detected by the AP device during the trip;
- the first The second type of travel corresponding to the unmatched logical travel set NPG1 refers to that the passenger is detected by the AFC device when entering or leaving the station, but the mobile terminal carried by the passenger is not detected by the AP device during the travel process;
- the third type of travel corresponding to the matching logical travel set NPG2 refers to that the passenger does not use the sensed object (such as a bus card, etc.) that can be sensed by the AFC device when entering or leaving the station, or the passenger is only active near the public transportation station, Or it can also be detected by the AP device when passing a public transportation station.
- the shortest travel duration of the first logical trip in the matching logical trip set PG and the trip duration of the first logical trip in the first unmatched logical trip set NPG1 are respectively directed to
- the shortest trip duration and the shortest trip duration of the second logical trip in the second unmatched logical trip set NPG2 are given different penalty coefficients.
- the shortest trip duration of a logical trip, the shortest trip duration of the second logical trip in the second unmatched logical trip set NPG2, and the similarity between the first trip trajectory and the second trip trajectory is calculated.
- the similarity between the first travel trajectory and the second travel trajectory can be calculated based on the following formula 4.
- TS afc represents the first travel trajectory
- TS ap represents the second travel trajectory
- Sim(TS afc , TS ap ) represents the trajectory similarity between the first travel trajectory and the second travel trajectory
- M represents the matching logical travel set PG.
- ⁇ p represents the overlapping duration corresponding to the p-th first logical trip that does not meet the preset conditions in the matching logical trip set PG
- P represents the matching logical trip set PG.
- the total number of first logical trips that do not meet the preset conditions represents the sth first logical trip in the matching logical trip set PG, represents the shortest travel duration of the s-th first logical trip
- S represents the total number of first logical trips in the matching logical trip set PG
- rth first logical trip in the first unmatched logical trip set NPG1 represents the shortest trip duration of the rth first logical trip
- R represents the total number of first logical trips in the first unmatched logical trip set NPG1
- Q represents the total number of second logical trips in the second unmatched logical trip set NPG2
- ⁇ 1 , ⁇ 2 and ⁇ 3 respectively represent different penalty coefficients.
- the first travel trajectory includes S+R (the sum of the two is equal to N in Equation 3) first logical travels, while M and P are both smaller than S+R, and Q is also smaller than the second travel trajectory.
- the first passenger and the second passenger are identified according to the trajectory similarity.
- the identification here refers to identifying whether the first passenger and the second passenger are the same passenger.
- a trajectory similarity threshold may be set, and the trajectory similarity threshold may be specified. In this case, when the calculated trajectory similarity is greater than or equal to the trajectory similarity threshold, the first passenger and the second passenger are identified as the same passenger; and when the calculated trajectory similarity is less than the trajectory similarity threshold , it is recognized that the first passenger and the second passenger are not the same passenger.
- FIG. 3A is a flowchart of an apparatus for identifying a public transportation passenger according to an embodiment of the present invention.
- an apparatus 300 for identifying public transportation passengers includes: a travel trajectory acquisition module 310 , a logical travel matching module 320 , an overlapping duration acquisition module 330 , an overlapping duration attenuation module 340 , and a trajectory similarity calculation module 350 And the passenger identification module 360 .
- the travel trajectory obtaining module 310 is configured to obtain a first travel trajectory including a plurality of first logical trips based on the first passenger travel data source, and obtain a second travel trajectory including a plurality of second logical trips based on the second passenger travel data source .
- each first logical trip includes a corresponding inbound station, an inbound time, an outbound station, an outbound time, a travel time period, a travel duration, and a minimum travel duration.
- Each second logical trip includes a corresponding inbound station (the first route station in chronological order), an inbound time (the route time corresponding to the first route station), and an outbound station (by time The last route station in the sequence), a departure time (the route time corresponding to the last route station), a travel time period, a travel time, and a shortest travel time.
- the logical trip matching module 320 is configured to match each of the first logical trips and each of the second logical trips to classify the first logical trips matching the second logical trips into a set of matching logical trips.
- the logical travel matching module 320 may include: an inbound and outbound duration determination unit 321 , a shortest inbound and outbound duration determination unit 322 , and a matching determination unit 323 .
- the inbound and outbound duration determination unit 321 is configured to use the inbound time of the i-th first logical trip Subtract the pit stop time of the jth second logical trip to get the inbound duration and the outbound time of the trip using the jth second logic Subtract the outbound time of the ith first logical trip to get the outbound time.
- the shortest inbound and outbound duration determination unit 322 is configured to obtain the inbound site from the i-th first logical trip to the pit stop of the jth second logical trip Minimum pit stop time between and get the outbound stop from the jth second logical trip To the outbound stop of the i-th first logical trip Minimum outbound time between
- the matching determination unit 323 is configured to determine if the pit stop duration and the shortest pit stop duration The absolute value of the sum is less than a preset duration threshold ⁇ ', and the outbound duration and the shortest outbound duration The absolute value of the sum is less than the preset duration threshold ⁇ ', then it is considered that the i-th first logical trip and the j-th second logical trip match each other, and the i-th logical trip that matches the j-th second logical trip The first logical trip is classified into the matching logical trip set PG. Therefore, in this example, the matching determination unit 323 may determine that the i-th first logical row and the j-th second
- the matching determination unit 323 may also be based on the condition "the pit stop of the i-th first logical trip and outbound sites The valid path between passes through the inbound stop of the jth second logical trip and outbound sites ” to determine that the i-th first logical line and the j-th second logical line match each other.
- the first logical trip that does not match each second logical trip of the second trip trajectory is classified as the first unmatched
- the logical travel set NPG1 is set, and the second logical travel that does not match each of the first logical travels of the first travel trajectory is classified into the second unmatched logical travel set NPG2.
- mismatch means that the above-mentioned conditions are not satisfied. In one example, if Equation 1 above is not satisfied, the i-th first logical run and the j-th second logical run do not match.
- the overlapping duration obtaining module 330 is configured to obtain the travel time period overlapping the travel time period of each first logical trip in the matching logical travel set and the travel time period of the respective matching second logical trip, so as to obtain the total length of each overlapping travel time period.
- the corresponding overlap duration is configured to obtain the travel time period overlapping the travel time period of each first logical trip in the matching logical travel set and the travel time period of the respective matching second logical trip, so as to obtain the total length of each overlapping travel time period. The corresponding overlap duration.
- the overlapping duration attenuation module 340 is configured to perform attenuation processing on each overlapping duration to obtain each attenuated overlapping duration.
- Attenuation processing it may include attenuation processing that attenuates the overlapping duration, or may include attenuation processing that does not attenuate the overlapping duration.
- the overlapping duration attenuation module 340 includes a duration attenuation unit 341 and a duration determination unit 342 .
- the duration attenuation unit 341 is configured to attenuate the overlapping durations corresponding to the first logical trips that meet the preset conditions in the matching logical trip set PG, so as to obtain the corresponding values of the first logical trips that meet the preset conditions. Decay overlap duration. In other words, the overlapping duration corresponding to each first logical trip that does not meet the preset condition in the matching logical trip set PG is not attenuated.
- the duration determining unit 342 is configured to determine the obtained attenuation overlap duration corresponding to each first logical trip and the overlapping duration corresponding to each first logical trip that does not meet the preset condition in the matching logical trip set PG as: The duration of the overlap after each decay process. That is to say, all the overlapping durations after the attenuation process include the respective attenuated overlapping durations after the overlapping durations are attenuated and the respective overlapping durations that are not attenuated.
- the duration attenuation unit 341 may use the above formula 2 to attenuate the overlapping durations corresponding to each first logical trip that meets the preset condition in the matching logical trip set PG.
- the trajectory similarity calculation module 350 is configured to calculate the trajectory similarity of the first travel trajectory and the second travel trajectory according to the overlapping duration after attenuation processing.
- the trajectory similarity calculation module 350 is further configured to, according to the respective attenuated overlapping durations, the shortest trip durations of all first logical trips of the first trip trajectory, and all first logical trips related to the first trip trajectory According to the shortest travel duration of the second logical trips that do not match (ie, all the second logical trips in the second unmatched logical trip set NPG2), the trajectory similarity between the first trip trajectory and the second trip trajectory is calculated.
- the trajectory similarity calculation module 350 may calculate the trajectory similarity of the first travel trajectory and the second travel trajectory based on the above formula 3.
- the trajectory similarity calculation module 350 may include a weight coefficient assignment unit 351 and a similarity calculation unit 352 .
- the weight coefficient assigning unit 351 is configured to assign the shortest travel duration of the first logical trip in the matching logical trip set PG, the shortest trip duration of the first logical trip in the first unmatched logical trip set NPG1, and the shortest trip duration of the second logical trip in the first unmatched logical trip set NPG1.
- the shortest travel duration of the second logical trip in the matching logical trip set NPG2 is given different penalty coefficients.
- the similarity calculation unit 352 is based on the overlapping durations after each attenuation process, and according to the shortest trip duration of the first logical trip and the first unmatched logical trip in the matching logical trip set PG that have been assigned different penalty coefficients respectively.
- the shortest trip duration of the first logical trip in the set NPG1 and the shortest trip duration of the second logical trip in the second unmatched logical trip set NPG2 are used to calculate the similarity between the first trip trajectory and the second trip trajectory.
- the similarity calculation unit 352 may calculate the similarity between the first travel trajectory and the second travel trajectory based on the above formula 4.
- the passenger identification module 360 is configured to identify the first passenger and the second passenger according to the trajectory similarity. Of course, the identification here refers to identifying whether the first passenger and the second passenger are the same passenger.
- FIG. 4 is a block diagram illustrating an electronic device implementing a method for identifying a public transportation passenger according to an embodiment of the present invention.
- an electronic device 400 may include at least one processor 410 , memory (eg, non-volatile memory) 420 , memory 430 , and communication interface 440 , and at least one processor 410 , memory 420 , memory 430 , and communication interface 440 Connected together via bus 450 .
- At least one processor 410 executes at least one machine-readable instruction stored or encoded in memory (ie, the above-described elements implemented in software).
- computer-executable instructions are stored in memory that, when executed, cause at least one processor 410 to perform a process of: obtaining a first travel trajectory including a plurality of first logical trips based on the first passenger travel data source, and A second travel trajectory including multiple second logical trips is obtained based on the second passenger travel data source, and the first logical trip and the second logical trip respectively include travel time periods that constitute one logical trip; Matching trips to classify the first logical trip that matches the second logical trip into the matching logical trip set; obtain the trip time period of the first logical trip in the matching logical trip set and the trip time of the matching second logical trip
- the overlapping travel time segments are used to obtain the overlapping duration corresponding to the overlapping travel time segments; the overlapping duration is attenuated to obtain the attenuated overlapping duration; the first travel trajectory and The track similarity of the second travel track; the first passenger and the second passenger are identified according to the track similarity.
- the identification here refers to identifying whether the first passenger and the second travel track
- a program product eg, a machine-readable medium
- a machine-readable medium may have instructions (ie, the above-described elements implemented in software) that, when executed by a machine, cause the machine to perform the various operations and functions described in connection with FIG. 2 above in embodiments of the present invention.
- a system or an apparatus equipped with a readable storage medium may be provided, on which software program codes for realizing the functions of any of the above-described embodiments are stored, and a computer or a computer of the system or apparatus may be provided.
- the processor reads and executes the instructions stored in the readable storage medium.
- the program code itself read from the readable medium can implement the functions of any one of the above-described embodiments, and thus the machine-readable code and the readable storage medium storing the machine-readable code constitute the present invention part of the example.
- Examples of readable storage media include floppy disks, hard disks, magneto-optical disks, optical disks (eg, CD-ROM, CD-R, CD-RW, DVD-ROM, DVD-RAM, DVD-RW, DVD-RW), magnetic tape, non- Volatile memory cards and ROMs.
- the program code may be downloaded from a server computer or the cloud over a communications network.
- the device structure described in the above embodiments may be a physical structure or a logical structure, that is, some units may be implemented by the same physical entity, or some units may be implemented by multiple physical entities, or may be implemented by multiple physical entities. Some components in separate devices are implemented together.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Evolutionary Computation (AREA)
- Tourism & Hospitality (AREA)
- Artificial Intelligence (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Biology (AREA)
- Life Sciences & Earth Sciences (AREA)
- Databases & Information Systems (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Remote Sensing (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Train Traffic Observation, Control, And Security (AREA)
Abstract
Description
Claims (18)
- 一种公共交通乘客的识别方法,其中,所述识别方法包括:A method for identifying public transport passengers, wherein the identifying method comprises:基于第一乘客出行数据源获取包括多个第一逻辑出行的第一出行轨迹,以及基于第二乘客出行数据源获取包括多个第二逻辑出行的第二出行轨迹,所述第一逻辑出行和所述第二逻辑出行分别包括构成一次逻辑出行的出行时间段;A first travel trajectory including a plurality of first logical trips is obtained based on a first passenger travel data source, and a second travel trajectory including a plurality of second logical trips is obtained based on a second passenger travel data source, the first logical travel and The second logical trips respectively include travel time periods constituting one logical trip;对所述第一逻辑出行和所述第二逻辑出行进行匹配,以将与所述第二逻辑出行匹配的所述第一逻辑出行归类于匹配逻辑出行集;matching the first logical trip and the second logical trip to classify the first logical trip matching the second logical trip into a set of matching logical trips;获取所述匹配逻辑出行集中的所述第一逻辑出行的出行时间段和其匹配的所述第二逻辑出行的出行时间段重叠的出行时间段,以得到所述重叠的出行时间段所对应的重叠时长;Obtain the travel time period in which the travel time period of the first logical trip and the travel time period of the matching second logical trip in the matching logical travel set overlap, so as to obtain the corresponding travel time period of the overlapping travel time period. overlapping duration;对所述重叠时长进行衰减处理,以得到衰减处理后的重叠时长;Perform attenuation processing on the overlapping duration to obtain the overlapping duration after attenuation processing;根据所述衰减处理后的重叠时长计算出所述第一出行轨迹和所述第二出行轨迹的轨迹相似度;Calculate the trajectory similarity of the first travel trajectory and the second travel trajectory according to the overlapping duration after the attenuation process;根据所述轨迹相似度来来对第一乘客和第二乘客进行识别。The first passenger and the second passenger are identified according to the trajectory similarity.
- 根据权利要求1所述的识别方法,其中,所述对所述重叠时长进行衰减处理,以得到衰减处理后的重叠时长,具体包括:The identification method according to claim 1, wherein the performing attenuation processing on the overlapping durations to obtain the overlapping durations after attenuation processing, specifically comprising:对所述匹配逻辑出行集中符合预设条件的所述第一逻辑出行所对应的所述重叠时长进行衰减,以得到衰减重叠时长;attenuating the overlapping duration corresponding to the first logical trip that meets the preset condition in the matching logical trip set to obtain the attenuation overlapping duration;将所述衰减重叠时长和所述匹配逻辑出行集中不符合所述预设条件的所述第一逻辑出行所对应的所述重叠时长确定为所述衰减处理后的重叠时长;Determining the attenuation overlap duration and the overlap duration corresponding to the first logical trip that does not meet the preset condition in the matching logical trip set as the attenuation-processed overlap duration;其中,所述预设条件包括:在所述匹配逻辑出行集中的一个出行时间段中,对应该出行时间段的所有所述第一逻辑出行的出行时长之和大于预设时长。Wherein, the preset condition includes: in a travel time period in the matching logical travel set, the sum of travel time lengths of all the first logical travels corresponding to the travel time period is greater than a preset time period.
- 根据权利要求2所述的识别方法,其中,所述对所述匹配逻辑出行集 中符合预设条件的所述第一逻辑出行所对应的所述重叠时长进行衰减,以得到衰减重叠时长,具体包括:基于下面的式子1计算得到所述衰减重叠时长,The identification method according to claim 2, wherein the attenuating the overlapping duration corresponding to the first logical trip that meets the preset condition in the matching logical trip set to obtain the attenuation overlapping duration, specifically comprises: : Calculate the decay overlap duration based on the following formula 1,其中,a表示所述匹配逻辑出行集中的符合所述预设条件的第a个出行时间段,c a表示所述第a个出行时间段中的所述第一逻辑出行的总数量,b表示第a个出行时间段中的第b个第一逻辑出行,γ表示衰减贡献率, 表示所述第b个第一逻辑出行所对应的重叠时长, 表示所述第b个第一逻辑出行所对应的衰减重叠时长。 Among them, a represents the a-th travel time period that meets the preset condition in the matching logical travel set, c a represents the total number of the first logical trips in the a-th travel time period, and b represents The bth first logical trip in the ath trip time period, γ represents the decay contribution rate, represents the overlapping duration corresponding to the bth first logical trip, Indicates the decay overlap duration corresponding to the bth first logical row.
- 根据权利要求1至3任一项所述的识别方法,其中,所述第一逻辑出行和所述第二逻辑出行均还包括构成一次逻辑出行的出行最短时长;The identification method according to any one of claims 1 to 3, wherein both the first logical trip and the second logical trip further include a shortest trip duration that constitutes a logical trip;其中,所述根据所述衰减处理后的重叠时长计算出所述第一出行轨迹和所述第二出行轨迹的轨迹相似度,具体包括:Wherein, calculating the trajectory similarity between the first travel trajectory and the second travel trajectory according to the overlapping duration after the attenuation process specifically includes:根据所述衰减处理后的重叠时长、所述多个第一逻辑出行的出行最短时长以及与所述多个第一逻辑出行都不匹配的所述第二逻辑出行的出行最短时长,计算出所述第一出行轨迹和所述第二出行轨迹的轨迹相似度。According to the overlapping duration after the attenuation process, the shortest travel duration of the multiple first logical trips, and the shortest trip duration of the second logical trip that does not match the multiple first logical trips, calculate the track similarity between the first travel track and the second travel track.
- 根据权利要求4所述的识别方法,其中,所述根据所述衰减处理后的重叠时长、所述多个第一逻辑出行的出行最短时长以及与所述多个第一逻辑出行都不匹配的所述第二逻辑出行的出行最短时长,计算出所述第一出行轨迹和所述第二出行轨迹的轨迹相似度,具体包括:基于下面的式子2计算得到所述轨迹相似度,The identification method according to claim 4, wherein the overlapping duration processed according to the attenuation, the shortest duration of the trip of the plurality of first logical trips, and the trip duration that does not match the plurality of first logical trips The shortest travel duration of the second logical trip, and calculating the trajectory similarity of the first travel trajectory and the second travel trajectory, specifically including: calculating and obtaining the trajectory similarity based on the following formula 2,其中,TS afc表示所述第一出行轨迹,TS ap表示所述第二出行轨迹,Sim(TS afc,TS ap)表示所述第一出行轨迹和所述第二出行轨迹的轨迹相似度,M表 示所述匹配逻辑出行集中的符合预设条件的不同出行时间段的数量,α p表示所述匹配逻辑出行集中的未符合预设条件的第p个所述第一逻辑出行对应的重叠时长,P表示所述匹配逻辑出行集中的不符合预设条件的第一逻辑出行的总数量, 表示所述第一出行轨迹中的第n个第一逻辑出行, 表示所述第n个第一逻辑出行的出行最短时长,N表示所述第一出行轨迹中的所述第一逻辑出行的总数量, 表示与所述第一出行轨迹的各个第一逻辑出行都不匹配的第二逻辑出行中的第q个第二逻辑出行, 表示所述第q个第二逻辑出行的出行最短时长,Q表示与所述第一出行轨迹的各个第一逻辑出行都不匹配的第二逻辑出行的总数量。 Wherein, TS afc represents the first travel trajectory, TS ap represents the second travel trajectory, Sim(TS afc , TS ap ) represents the trajectory similarity between the first travel trajectory and the second travel trajectory, M represents the number of different travel time periods that meet the preset conditions in the matching logical trip set, α p represents the overlapping duration corresponding to the pth first logical trip that does not meet the preset conditions in the matching logical trip set, P represents the total number of first logical trips that do not meet the preset conditions in the matching logical trip set, represents the nth first logical trip in the first trip trajectory, represents the shortest trip duration of the nth first logical trip, N represents the total number of the first logical trips in the first trip trajectory, represents the qth second logical trip in the second logical trip that does not match each of the first logical trips of the first trip trajectory, represents the shortest trip duration of the qth second logical trip, and Q represents the total number of second logical trips that do not match each first logical trip of the first trip trajectory.
- 根据权利要求1至3任一项所述的识别方法,其中,所述第一逻辑出行和所述第二逻辑出行均还包括构成一次逻辑出行的出行最短时长;The identification method according to any one of claims 1 to 3, wherein both the first logical trip and the second logical trip further include a shortest trip duration that constitutes a logical trip;其中,所述根据所述衰减处理后的重叠时长计算出所述第一出行轨迹和所述第二出行轨迹的轨迹相似度,具体包括:Wherein, calculating the trajectory similarity between the first travel trajectory and the second travel trajectory according to the overlapping duration after the attenuation process specifically includes:向所述匹配逻辑出行集中的所述第一逻辑出行的出行最短时长、与所述多个第二逻辑出行都不匹配的所述第一逻辑出行的出行最短时长、与所述多个第一逻辑出行都不匹配的所述第二逻辑出行的出行最短时长分别赋予不同的权重系数;To the shortest travel duration of the first logical trip in the matching logical trip set, the shortest trip duration of the first logical trip that does not match the plurality of second logical trips, and the shortest trip duration of the first logical trip that does not match the plurality of first logical trips. The shortest trip durations of the second logical trips that do not match the logical trips are respectively assigned different weighting coefficients;根据所述衰减处理后的重叠时长以及被分别赋予不同权重系数的所述匹配逻辑出行集中的所述第一逻辑出行的出行最短时长、与所述多个第二逻辑出行都不匹配的所述第一逻辑出行的出行最短时长、与所述多个第一逻辑出行都不匹配的所述第二逻辑出行的出行最短时长,计算出所述第一出行轨迹和所述第二出行轨迹的轨迹相似度。According to the overlapping duration after the attenuation process and the shortest trip duration of the first logical trip in the matching logical trip set assigned different weighting coefficients, the trip duration that does not match the plurality of second logical trips The shortest trip duration of the first logical trip, the shortest trip duration of the second logical trip that does not match the multiple first logical trips, and the traces of the first trip trajectory and the second trip trajectory are calculated similarity.
- 根据权利要求6所述的识别方法,其中,所述根据所述衰减处理后的重叠时长以及被分别赋予不同权重系数的所述匹配逻辑出行集中的所述第一逻辑出行的出行最短时长、与所述多个第二逻辑出行都不匹配的所述第一逻辑出行的出行最短时长、与所述多个第一逻辑出行都不匹配的所述第二逻辑出行的出行最短时长,计算出所述第一出行轨迹和所述第二出行轨迹的轨迹相似度,具体包括:基于下面的式子3计算得到所述轨迹相似度,The identification method according to claim 6, wherein the overlapping duration after the attenuation process and the shortest travel duration of the first logical trip in the matching logical trip set assigned different weight coefficients respectively, and The shortest trip duration of the first logical trip that does not match the multiple second logical trips, and the shortest trip duration of the second logical trip that does not match the multiple first logical trips, calculate the The trajectory similarity of the first travel trajectory and the second travel trajectory specifically includes: calculating the trajectory similarity based on the following formula 3,其中,TS afc表示所述第一出行轨迹,TS ap表示所述第二出行轨迹,Sim(TS afc,TS ap)表示所述第一出行轨迹和所述第二出行轨迹的轨迹相似度,M表示所述匹配逻辑出行集中的符合预设条件的不同出行时间段的总数量,α p表示所述匹配逻辑出行集中的未符合预设条件的第p个第一逻辑出行对应的重叠时长,P表示所述匹配逻辑出行集中的未符合预设条件的第一逻辑出行的总数量, 表示所述匹配逻辑出行集中的第s个第一逻辑出行, 表示所述第s个第一逻辑出行的出行最短时长,S表示所述匹配逻辑出行集中的第一逻辑出行的总数量, 表示与第二出行轨迹的各个第二逻辑出行都不匹配的第一逻辑出行中的第r个第一逻辑出行, 表示所述第r个第一逻辑出行的出行最短时长,R表示与第二出行轨迹的各个第二逻辑出行都不匹配的第一逻辑出行中的第一逻辑出行的总数量, 表示与所述第一出行轨迹的各个第一逻辑出行都不匹配的第二逻辑出行中的第q个第二逻辑出行, 表示所述第q个第二逻辑出行的出行最短时长,Q表示与所述第一出行轨迹的各个第一逻辑出行都不匹配的第二逻辑出行中的第二逻辑出行的总数量,θ 1、θ 2和θ 3分别表示不同的惩罚系数。 Wherein, TS afc represents the first travel trajectory, TS ap represents the second travel trajectory, Sim(TS afc , TS ap ) represents the trajectory similarity between the first travel trajectory and the second travel trajectory, M represents the total number of different travel time periods that meet the preset conditions in the matching logical trip set, α p represents the overlapping duration corresponding to the pth first logical trip that does not meet the preset conditions in the matching logical trip set, P represents the total number of first logical trips that do not meet the preset conditions in the matching logical trip set, represents the sth first logical trip in the matching logical trip set, represents the shortest trip duration of the sth first logical trip, S represents the total number of first logical trips in the matching logical trip set, represents the rth first logical trip among the first logical trips that do not match each of the second logical trips of the second trip trajectory, represents the shortest trip duration of the rth first logical trip, R represents the total number of first logical trips in the first logical trips that do not match each second logical trip of the second trip trajectory, represents the qth second logical trip in the second logical trip that does not match each of the first logical trips of the first trip trajectory, represents the shortest trip duration of the qth second logical trip, Q represents the total number of second logical trips in the second logical trips that do not match the first logical trips of the first trip trajectory, θ 1 , θ 2 and θ 3 represent different penalty coefficients, respectively.
- 根据权利要求1所述的识别方法,其中,所述第一逻辑出行和所述第二逻辑出行均还包括构成一次逻辑出行的进站站点、出站站点、进站时间和出站时间;The identification method according to claim 1, wherein each of the first logical trip and the second logical trip further comprises an inbound station, an outbound station, an inbound time and an outbound time that constitute a logical trip;其中,所述对所述第一逻辑出行和所述第二逻辑出行进行匹配,以将与所述第二逻辑出行匹配的所述第一逻辑出行归类于匹配逻辑出行集,具体包括:The matching of the first logical trip and the second logical trip to classify the first logical trip matching the second logical trip into a matching logical trip set specifically includes:利用所述第一逻辑出行的进站时间减去所述第二逻辑出行的进站时间以得到进站时长,以及利用所述第二逻辑出行的出站时间减去所述第一逻辑出行的出站时间以得到出站时长;Subtracting the inbound time of the second logical trip from the inbound time of the first logical trip to obtain the inbound duration, and subtracting the inbound time of the first logical trip from the outbound time of the second logical trip Outbound time to get outbound time;获取从所述第一逻辑出行的进站站点到所述第二逻辑出行的进站站点之 间的最短进站时长,以及获取从所述第二逻辑出行的出站站点到所述第一逻辑出行的出站站点之间的最短出站时长;Obtaining the shortest inbound duration from the inbound site of the first logical trip to the inbound site of the second logical trip, and acquiring from the outbound site of the second logical trip to the first logical trip The minimum outbound duration between outbound stops of the trip;若所述进站时长和所述最短进站时长之和的绝对值小于一预设时长阈值,且所述出站时长和所述最短出站时长之和的绝对值小于所述预设时长阈值,则确定所述第一逻辑出行和所述第二逻辑出行匹配,并将与所述第二逻辑出行匹配的所述第一逻辑出行归类于匹配逻辑出行集。If the absolute value of the sum of the inbound duration and the shortest inbound duration is less than a preset duration threshold, and the absolute value of the sum of the outbound duration and the shortest outbound duration is less than the preset duration threshold , then it is determined that the first logical trip matches the second logical trip, and the first logical trip matching the second logical trip is classified into a matching logical trip set.
- 一种公共交通乘客的识别装置,其中,所述识别装置包括:An identification device for public transport passengers, wherein the identification device comprises:出行轨迹获取模块,被配置为基于第一乘客出行数据源获取包括多个第一逻辑出行的第一出行轨迹,且基于第二乘客出行数据源获取包括多个第二逻辑出行的第二出行轨迹;其中,所述第一逻辑出行和所述第二逻辑出行分别包括构成一次逻辑出行的出行时间段;a travel trajectory obtaining module configured to obtain a first travel trajectory including a plurality of first logical trips based on the first passenger travel data source, and obtain a second travel trajectory including a plurality of second logical travels based on the second passenger travel data source ; wherein, the first logical trip and the second logical trip respectively include a trip time period that constitutes a logical trip;逻辑出行匹配模块,被配置为对所述第一逻辑出行和所述第二逻辑出行进行匹配,以将与所述第二逻辑出行匹配的所述第一逻辑出行归类于匹配逻辑出行集;a logical trip matching module configured to match the first logical trip and the second logical trip to classify the first logical trip matching the second logical trip into a set of matching logical trips;重叠时长获取模块,被配置为获取所述匹配逻辑出行集中的所述第一逻辑出行的出行时间段和其匹配的所述第二逻辑出行的出行时间段重叠的出行时间段,以得到重叠的出行时间段所对应的重叠时长;The overlapping duration acquisition module is configured to acquire the travel time period in which the travel time period of the first logical trip in the matching logical trip set and the travel time period of the matching second logical trip overlap, so as to obtain the overlapping travel time period. The overlapping duration corresponding to the travel time period;重叠时长衰减模块,被配置为对所述重叠时长进行衰减处理,以得到衰减处理后的重叠时长;an overlapping duration attenuation module, configured to perform attenuation processing on the overlapping duration to obtain an overlapping duration after attenuation processing;轨迹相似度计算模块,被配置为根据所述衰减处理后的重叠时长计算出所述第一出行轨迹和所述第二出行轨迹的轨迹相似度;a trajectory similarity calculation module, configured to calculate the trajectory similarity of the first travel trajectory and the second travel trajectory according to the overlapping duration after the attenuation process;乘客识别模块,被配置为根据所述轨迹相似度来对第一乘客和第二乘客进行识别。The passenger identification module is configured to identify the first passenger and the second passenger according to the track similarity.
- 根据权利要求9所述的识别装置,其中,所述重叠时长衰减模块包括:The identification device according to claim 9, wherein the overlapping duration decay module comprises:时长衰减单元,被配置为对所述匹配逻辑出行集中符合预设条件的所述第一逻辑出行所对应的所述重叠时长进行衰减,以得到衰减重叠时长;a duration attenuation unit, configured to attenuate the overlapping duration corresponding to the first logical trip that meets the preset condition in the matching logical trip set, so as to obtain the attenuation overlapping duration;时长确定单元,被配置为将所述衰减重叠时长和所述匹配逻辑出行集中不符合所述预设条件的所述第一逻辑出行所对应的所述重叠时长确定为所述衰减处理后的重叠时长;A duration determination unit configured to determine the attenuation overlap duration and the overlap duration corresponding to the first logical trip that does not meet the preset condition in the matching logical trip set as the attenuation processed overlap duration;其中,所述预设条件包括:在所述匹配逻辑出行集中的一个出行时间段中,对应该出行时间段的所有所述第一逻辑出行的出行时长之和大于预设时长。Wherein, the preset condition includes: in a travel time period in the matching logical travel set, the sum of travel time lengths of all the first logical travels corresponding to the travel time period is greater than a preset time period.
- 根据权利要求10所述的识别装置,其中,所述时长衰减单元进一步被配置为利用下面的式子1计算得到所述衰减重叠时长,The identification device according to claim 10, wherein the duration attenuation unit is further configured to obtain the attenuation overlap duration by calculating the following formula 1,其中,a表示所述匹配逻辑出行集中的符合所述预设条件的第a个出行时间段,c a表示所述第a个出行时间段中的所述第一逻辑出行的总数量,b表示第a个出行时间段中的第b个第一逻辑出行,γ表示衰减贡献率, 表示所述第b个第一逻辑出行所对应的重叠时长, 表示所述第b个第一逻辑出行所对应的衰减重叠时长。 Among them, a represents the a-th travel time period that meets the preset condition in the matching logical travel set, c a represents the total number of the first logical trips in the a-th travel time period, and b represents The bth first logical trip in the ath trip time period, γ represents the decay contribution rate, represents the overlapping duration corresponding to the bth first logical trip, Indicates the decay overlap duration corresponding to the bth first logical row.
- 根据权利要求9至11任一项所述的识别装置,其中,所述第一逻辑出行和所述第二逻辑出行均还包括构成一次逻辑出行的出行最短时长;The identification device according to any one of claims 9 to 11, wherein each of the first logical trip and the second logical trip further includes a shortest trip duration constituting one logical trip;所述轨迹相似度计算模块进一步被配置为:根据所述衰减处理后的重叠时长、所述多个第一逻辑出行的出行最短时长以及与所述多个第一逻辑出行都不匹配的所述第二逻辑出行的出行最短时长,计算出所述第一出行轨迹和所述第二出行轨迹的相似度。The trajectory similarity calculation module is further configured to: according to the overlapping duration after the attenuation process, the shortest travel duration of the plurality of first logical trips, and the said plurality of first logical trips that do not match. The shortest trip duration of the second logical trip is calculated, and the similarity between the first trip trajectory and the second trip trajectory is calculated.
- 根据权利要求12所述的识别装置,其中,所述轨迹相似度计算模块进一步被配置为利用下面的式子2计算得到所述轨迹相似度,The identification device according to claim 12, wherein the trajectory similarity calculation module is further configured to calculate the trajectory similarity using the following formula 2,其中,TS afc表示所述第一出行轨迹,TS ap表示所述第二出行轨迹, Sim(TS afc,TS ap)表示所述第一出行轨迹和所述第二出行轨迹的轨迹相似度,M表示所述匹配逻辑出行集中的符合预设条件的不同出行时间段的数量,α p表示所述匹配逻辑出行集中的未符合预设条件的第p个所述第一逻辑出行对应的重叠时长,P表示所述匹配逻辑出行集中的不符合预设条件的第一逻辑出行的总数量, 表示所述第一出行轨迹中的第n个第一逻辑出行, 表示所述第n个第一逻辑出行的出行最短时长,N表示所述第一出行轨迹中的所述第一逻辑出行的总数量, 表示与所述第一出行轨迹的各个第一逻辑出行都不匹配的第二逻辑出行中的第q个第二逻辑出行, 表示所述第q个第二逻辑出行的出行最短时长,Q表示与所述第一出行轨迹的各个第一逻辑出行都不匹配的第二逻辑出行的总数量。 Wherein, TS afc represents the first travel trajectory, TS ap represents the second travel trajectory, Sim(TS afc , TS ap ) represents the trajectory similarity between the first travel trajectory and the second travel trajectory, M represents the number of different travel time periods that meet the preset conditions in the matching logical trip set, α p represents the overlapping duration corresponding to the pth first logical trip that does not meet the preset conditions in the matching logical trip set, P represents the total number of first logical trips that do not meet the preset conditions in the matching logical trip set, represents the nth first logical trip in the first trip trajectory, represents the shortest trip duration of the nth first logical trip, N represents the total number of the first logical trips in the first trip trajectory, represents the qth second logical trip in the second logical trip that does not match each of the first logical trips of the first trip trajectory, represents the shortest trip duration of the qth second logical trip, and Q represents the total number of second logical trips that do not match each first logical trip of the first trip trajectory.
- 根据权利要求9至11任一项所述的识别装置,其中,所述第一逻辑出行和所述第二逻辑出行均还包括构成一次逻辑出行的出行最短时长;The identification device according to any one of claims 9 to 11, wherein each of the first logical trip and the second logical trip further includes a shortest trip duration constituting one logical trip;其中,所述轨迹相似度计算模块包括:Wherein, the trajectory similarity calculation module includes:权重系数赋予单元,被配置为向所述匹配逻辑出行集中的所述第一逻辑出行的出行最短时长、与所述多个第二逻辑出行都不匹配的所述第一逻辑出行的出行最短时长、与所述多个第一逻辑出行都不匹配的所述第二逻辑出行的出行最短时长分别赋予不同的权重系数;A weighting coefficient assigning unit configured to assign the shortest travel duration of the first logical trip in the matching logical trip set and the shortest trip duration of the first logical trip that does not match the plurality of second logical trips , assigning different weight coefficients to the shortest travel durations of the second logical trips that do not match the multiple first logical trips;相似度计算单元,被配置为根据所述衰减处理后的重叠时长以及被分别赋予不同权重系数的所述匹配逻辑出行集中的所述第一逻辑出行的出行最短时长、与所述多个第二逻辑出行都不匹配的所述第一逻辑出行的出行最短时长、与所述多个第一逻辑出行都不匹配的所述第二逻辑出行的出行最短时长,计算出所述第一出行轨迹和所述第二出行轨迹的轨迹相似度。The similarity calculation unit is configured to, according to the overlapping duration after the attenuation process and the shortest trip duration of the first logical trip in the matching logical trip set assigned different weight coefficients, and the plurality of second logical trips respectively. The shortest trip duration of the first logical trip that does not match the logical trips, and the shortest trip duration of the second logical trips that do not match the multiple first logical trips, calculate the first trip trajectory and The track similarity of the second travel track.
- 根据权利要求14所述的识别装置,其中,所述相似度计算单元进一步被配置为利用下面的式子3计算得到所述轨迹相似度,The identification device according to claim 14, wherein the similarity calculation unit is further configured to calculate the trajectory similarity using the following formula 3,其中,TS afc表示所述第一出行轨迹,TS ap表示所述第二出行轨迹,Sim(TS afc,TS ap)表示所述第一出行轨迹和所述第二出行轨迹的轨迹相似度,M表示所述匹配逻辑出行集中的符合预设条件的不同出行时间段的总数量,α p表示所述匹配逻辑出行集中的未符合预设条件的第p个第一逻辑出行对应的重叠时长,P表示所述匹配逻辑出行集中的未符合预设条件的第一逻辑出行的总数量, 表示所述匹配逻辑出行集中的第s个第一逻辑出行, 表示所述第s个第一逻辑出行的出行最短时长,S表示所述匹配逻辑出行集中的第一逻辑出行的总数量, 表示与第二出行轨迹的各个第二逻辑出行都不匹配的第一逻辑出行中的第r个第一逻辑出行, 表示所述第r个第一逻辑出行的出行最短时长,R表示与第二出行轨迹的各个第二逻辑出行都不匹配的第一逻辑出行中的第一逻辑出行的总数量, 表示与所述第一出行轨迹的各个第一逻辑出行都不匹配的第二逻辑出行中的第q个第二逻辑出行, 表示所述第q个第二逻辑出行的出行最短时长,Q表示与所述第一出行轨迹的各个第一逻辑出行都不匹配的第二逻辑出行中的第二逻辑出行的总数量,θ 1、θ 2和θ 3分别表示不同的惩罚系数。 Wherein, TS afc represents the first travel trajectory, TS ap represents the second travel trajectory, Sim(TS afc , TS ap ) represents the trajectory similarity between the first travel trajectory and the second travel trajectory, M represents the total number of different travel time periods that meet the preset conditions in the matching logical trip set, α p represents the overlapping duration corresponding to the pth first logical trip that does not meet the preset conditions in the matching logical trip set, P represents the total number of first logical trips that do not meet the preset conditions in the matching logical trip set, represents the sth first logical trip in the matching logical trip set, represents the shortest trip duration of the sth first logical trip, S represents the total number of first logical trips in the matching logical trip set, represents the rth first logical trip among the first logical trips that do not match each of the second logical trips of the second trip trajectory, represents the shortest trip duration of the rth first logical trip, R represents the total number of first logical trips in the first logical trips that do not match each second logical trip of the second trip trajectory, represents the qth second logical trip in the second logical trip that does not match each of the first logical trips of the first trip trajectory, represents the shortest trip duration of the qth second logical trip, Q represents the total number of second logical trips in the second logical trips that do not match the first logical trips of the first trip trajectory, θ 1 , θ 2 and θ 3 represent different penalty coefficients, respectively.
- 根据权利要求9所述的识别装置,其中,所述第一逻辑出行和所述第二逻辑出行均还包括构成一次逻辑出行的进站站点、出站站点、进站时间和出站时间;The identification device according to claim 9, wherein each of the first logical trip and the second logical trip further comprises an inbound station, an outbound station, an inbound time and an outbound time that constitute a logical trip;所述逻辑出行匹配模块包括:The logical trip matching module includes:进出站时长确定单元,被配置为利用所述第一逻辑出行的进站时间减去所述第二逻辑出行的进站时间以得到进站时长,以及利用所述第二逻辑出行的出站时间减去所述第一逻辑出行的出站时间以得到出站时长;an inbound and outbound duration determination unit configured to subtract the inbound time of the second logical trip from the inbound time of the first logical trip to obtain the inbound duration, and the outbound time of the second logical trip Subtract the outbound time of the first logical trip to obtain the outbound duration;最短进出站时长确定单元,被配置为获取从所述第一逻辑出行的进站站点到所述第二逻辑出行的进站站点之间的最短进站时长,以及获取从所述第二逻辑出行的出站站点到所述第一逻辑出行的出站站点之间的最短出站时长;The shortest inbound and outbound duration determination unit is configured to obtain the shortest inbound duration from the inbound station of the first logical trip to the inbound station of the second logical trip, and to acquire the distance from the second logical trip to the inbound station of the second logical trip The shortest outbound duration between the outbound site of the first logical trip and the outbound site of the first logical trip;匹配确定单元,被配置为若所述进站时长和所述最短进站时长之和的绝对值小于一预设时长阈值,且所述出站时长和所述最短出站时长之和的绝对值小 于所述预设时长阈值,则确定所述第一逻辑出行和所述第二逻辑出行匹配,并将与所述第二逻辑出行匹配的所述第一逻辑出行归类于匹配逻辑出行集。The matching determination unit is configured to, if the absolute value of the sum of the inbound duration and the shortest inbound duration is less than a preset duration threshold, and the absolute value of the sum of the outbound duration and the shortest outbound duration If it is less than the preset duration threshold, it is determined that the first logical trip matches the second logical trip, and the first logical trip matching the second logical trip is classified into a matching logical trip set.
- 一种电子设备,其中,包括:An electronic device comprising:至少一个处理器,以及at least one processor, and与所述至少一个处理器耦合的存储器,所述存储器存储指令,当所述指令被所述至少一个处理器执行时,使得所述至少一个处理器执行如权利要求1至8中任一所述的公共交通乘客的识别方法。a memory coupled to the at least one processor, the memory storing instructions that, when executed by the at least one processor, cause the at least one processor to perform the performance of any one of claims 1 to 8 method for identification of public transport passengers.
- 一种机器可读存储介质,其存储有可执行指令,其中,所述指令当被执行时使得所述机器执行如权利要求1到8中任一所述的公共交通乘客的识别方法。A machine-readable storage medium having executable instructions stored thereon, wherein the instructions, when executed, cause the machine to perform the method of identifying a public transportation passenger as claimed in any one of claims 1 to 8.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010772726.2A CN114090704B (en) | 2020-08-04 | 2020-08-04 | Passenger identification method and device, electronic device and readable storage medium |
CN202010772726.2 | 2020-08-04 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2022027748A1 true WO2022027748A1 (en) | 2022-02-10 |
Family
ID=80118623
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2020/111433 WO2022027748A1 (en) | 2020-08-04 | 2020-08-26 | Passenger recognition method, passenger recognition apparatus, electronic device and readable storage medium |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN114090704B (en) |
WO (1) | WO2022027748A1 (en) |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106445948A (en) * | 2015-08-06 | 2017-02-22 | 中兴通讯股份有限公司 | Analysis method and device of potential relationship of people |
CN106874432A (en) * | 2017-01-24 | 2017-06-20 | 华南理工大学 | A kind of public transport passenger trip space-time track extraction method |
CN106875679A (en) * | 2017-03-14 | 2017-06-20 | 东软集团股份有限公司 | Recognize the method and device of escort vehicle |
CN110134865A (en) * | 2019-04-26 | 2019-08-16 | 重庆大学 | A kind of commuting passenger's social recommendation method and platform based on urban public transport trip big data |
WO2019194760A1 (en) * | 2018-04-02 | 2019-10-10 | Dirik Hunkar | Matching routes method - shuttle with many customers |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10049572B2 (en) * | 2016-11-11 | 2018-08-14 | Microsoft Technology Licensing, Llc | Mass transit-based people traffic sensing and control |
CN106951549A (en) * | 2017-03-27 | 2017-07-14 | 重庆邮电大学 | A kind of passenger's traffic path recognition methods based on track IC-card and mobile phone signaling data |
CN107358319A (en) * | 2017-06-29 | 2017-11-17 | 深圳北斗应用技术研究院有限公司 | Flow Prediction in Urban Mass Transit method, apparatus, storage medium and computer equipment |
CN110162520B (en) * | 2019-04-23 | 2021-07-20 | 中国科学院深圳先进技术研究院 | Friend recommendation method and system for subway passengers |
CN110942198B (en) * | 2019-11-27 | 2024-02-27 | 重庆市交通规划研究院 | Passenger path identification method and system for rail transit operation |
CN111079875A (en) * | 2019-12-17 | 2020-04-28 | 广州交通信息化建设投资营运有限公司 | Public transport passenger flow monitoring method and device based on multi-source data and storage medium |
-
2020
- 2020-08-04 CN CN202010772726.2A patent/CN114090704B/en active Active
- 2020-08-26 WO PCT/CN2020/111433 patent/WO2022027748A1/en active Application Filing
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106445948A (en) * | 2015-08-06 | 2017-02-22 | 中兴通讯股份有限公司 | Analysis method and device of potential relationship of people |
CN106874432A (en) * | 2017-01-24 | 2017-06-20 | 华南理工大学 | A kind of public transport passenger trip space-time track extraction method |
CN106875679A (en) * | 2017-03-14 | 2017-06-20 | 东软集团股份有限公司 | Recognize the method and device of escort vehicle |
WO2019194760A1 (en) * | 2018-04-02 | 2019-10-10 | Dirik Hunkar | Matching routes method - shuttle with many customers |
CN110134865A (en) * | 2019-04-26 | 2019-08-16 | 重庆大学 | A kind of commuting passenger's social recommendation method and platform based on urban public transport trip big data |
Also Published As
Publication number | Publication date |
---|---|
CN114090704A (en) | 2022-02-25 |
CN114090704B (en) | 2024-06-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20230401914A1 (en) | Information processing apparatus, information processing system, and information processing method | |
CN110751828B (en) | Road congestion measuring method and device, computer equipment and storage medium | |
US20220012512A1 (en) | Intelligent gallery management for biometrics | |
US20150371403A1 (en) | Target object identifying device, target object identifying method and target object identifying program | |
CN106529711B (en) | User behavior prediction method and device | |
JP2010055594A (en) | Traffic line management system and program | |
CN110348614B (en) | Method for obtaining passenger OD and method for predicting bus passenger flow | |
CN110874668B (en) | Rail transit OD passenger flow prediction method, system and electronic equipment | |
CN107833328B (en) | Access control verification method and device based on face recognition and computing equipment | |
CN109446881B (en) | Heterogeneous data-based highway section traffic state detection method | |
Tavassoli et al. | Modelling passenger waiting time using large-scale automatic fare collection data: An Australian case study | |
CN112347864A (en) | Method, device, equipment and system for sensing and inducing rail transit passenger flow | |
US20180276696A1 (en) | Association method, and non-transitory computer-readable storage medium | |
CN109359689B (en) | Data identification method and device | |
WO2022027748A1 (en) | Passenger recognition method, passenger recognition apparatus, electronic device and readable storage medium | |
Salah | Design, simulation, and performance-evaluation-based validation of a novel RFID-based automatic parking system | |
CN112927547A (en) | Method and device for supplementing getting-off time | |
JP2018103924A (en) | Device to predict congestion | |
CN114387816B (en) | Mall traffic guiding system and method based on consumer behavior prediction analysis | |
CN114758521B (en) | Parking lot departure guiding method and device, electronic equipment and storage medium | |
CN112528818B (en) | Data statistics method, device, electronic equipment and machine-readable storage medium | |
US10636262B2 (en) | Method and device for monitoring individuals in a place equipped with distributed detection means | |
KR102374359B1 (en) | Method and system for congestion estimation of train based on data of transportaion card | |
Syarif et al. | Big data analytics: Estimation of destination for users of bus rapid transit (BRT) public transportation in Jakarta | |
CN113743212A (en) | Detection method and device for jam or left object at entrance and exit of escalator and storage medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 20948525 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20948525 Country of ref document: EP Kind code of ref document: A1 |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20948525 Country of ref document: EP Kind code of ref document: A1 |
|
32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 090823) |