[go: up one dir, main page]

WO2012041732A1 - Procédé et moyen d'acquisition d'informations d'itinéraire sur la base d'informations de transfert d'un terminal mobile - Google Patents

Procédé et moyen d'acquisition d'informations d'itinéraire sur la base d'informations de transfert d'un terminal mobile Download PDF

Info

Publication number
WO2012041732A1
WO2012041732A1 PCT/EP2011/066198 EP2011066198W WO2012041732A1 WO 2012041732 A1 WO2012041732 A1 WO 2012041732A1 EP 2011066198 W EP2011066198 W EP 2011066198W WO 2012041732 A1 WO2012041732 A1 WO 2012041732A1
Authority
WO
WIPO (PCT)
Prior art keywords
handover
credibility
handovers
nodes
road section
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.)
Ceased
Application number
PCT/EP2011/066198
Other languages
English (en)
Inventor
Wei Qiu
Lei Ming Xu
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.)
Siemens AG
Siemens Corp
Original Assignee
Siemens AG
Siemens Corp
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 Siemens AG, Siemens Corp filed Critical Siemens AG
Publication of WO2012041732A1 publication Critical patent/WO2012041732A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • 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
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0108—Measuring and analyzing of parameters relative to traffic conditions based on the source of data
    • G08G1/012—Measuring and analyzing of parameters relative to traffic conditions based on the source of data from other sources than vehicle or roadside beacons, e.g. mobile networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/0005—Control or signalling for completing the hand-off
    • H04W36/0083—Determination of parameters used for hand-off, e.g. generation or modification of neighbour cell lists
    • H04W36/00837—Determination of triggering parameters for hand-off
    • H04W36/008375—Determination of triggering parameters for hand-off based on historical data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
    • H04W64/006—Locating users or terminals or network equipment for network management purposes, e.g. mobility management with additional information processing, e.g. for direction or speed determination

Definitions

  • the present invention relates to the field of information technology, and in particular to the technology based on mobile terminal handover information for acquiring path information .
  • the mobile FCD technology includes: creating a handover pattern, extracting data from mobile networks, which data is usually a handover sequence, and matching this handover sequence with the handover pattern, so as to obtain a possible path, and the map matching or other traffic applications can be finished finally according to this path.
  • the above handover pattern is usually obtained by several preliminary actual road measurements, i.e. by
  • the monitoring of traffic flow can be achieved by the FCD technology without the aid of GPS (global positioning system) data, without the modification of the infrastructures of the currently available mobile networks, without laying infrastructures afresh, and without changing the mobile terminals.
  • GPS global positioning system
  • the continuous handover information extracted from the mobile networks includes, for example, the ID of a source cell and the ID of a target cell
  • handover 1 is the handover from cell 1 to cell 2, which may occur in road sections 1, 2 and 3
  • handover 2 is the handover from cell 2 to cell 4, which may occur in road sections 1 and 4
  • handover 3 is the handover from cell 3 to cell 6, which may occur in road sections 5, 6 and 7.
  • the resultant handover pattern is as shown in Fig. 1.
  • the object of the present invention is to provide a method base on mobile terminal handover information for acquiring path information, so as to learn more accurate mobile paths of mobile terminals.
  • the embodiments of the present invention further provide means based on mobile terminal handover information for acquiring path information.
  • the embodiments of the present invention provide the following technical solution for solving the above technical problems .
  • the embodiments of the present invention provide a method based on mobile terminal handover information for acquiring path information, said method comprising:
  • acquiring the handover information of a mobile terminal which includes at least one handover sequence of said mobile terminal, wherein said handover sequence includes at least two handovers of said mobile terminal; determining, according to said handover sequence, a handover pattern which includes the handovers in said
  • the credibility of the nodes in the handover pattern is determined by one of the following or a
  • the embodiments of the present invention provide means based on mobile terminal handover information for acquiring path information, said means comprising:
  • an acquiring module for acquiring the handover
  • a pattern module for determining, according to the handover sequence, a handover pattern, with said handover pattern including the handovers in said handover sequence, at least one road section where said handovers can occur, and the correlation between said handovers and said road section; a first confidence module for determining the credibility of the nodes in said handover pattern according to a
  • confidence parameter with the nodes in said handover pattern being said at least one road section or the handovers in said handover sequence and said confidence parameter includes one of the following or any combination thereof: the parameters of said handovers per se, the geometric topological
  • a computing module for searching, according to the credibility of the nodes in the handover pattern, for a path with the highest credibility corresponding to said handover sequence, with said path being composed of at least one stretch of said road section.
  • a path with higher probability corresponding to the handover information can obtained based on the handover information of mobile terminals according to the handover pattern and the
  • Fig. 1 is a flow chart of a method based on mobile terminal handover information for acquiring path information provided by the embodiments of the present invention
  • Fig. 2a is a schematic diagram of a handover pattern provided by the embodiments of the present invention.
  • Fig. 2b is a schematic diagram of another handover pattern provided by the embodiments of the present invention.
  • Fig. 2c is a schematic diagram of still another handover pattern provided by the embodiments of the present invention.
  • Fig. 2d is a schematic diagram of yet another handover pattern provided by the embodiments of the present invention
  • Fig. 3 is a flow chart of a method based on mobile terminal handover information for acquiring path information provided by the embodiments of the present invention
  • Fig. 4a is a structural schematic diagram of means based on mobile terminal handover information for acquiring path information provided by the embodiments of the present invention
  • Fig. 4b is a structural schematic diagram of another means based on mobile terminal handover information for acquiring path information provided by the embodiments of th present invention.
  • Fig. 4c is a structural schematic diagram of still another means based on mobile terminal handover information for acquiring path information provided by the embodiments o the present invention.
  • Fig. 4d is a structural schematic diagram of yet another means based on mobile terminal handover information for acquiring path information provided by the embodiments of th present invention
  • Fig. 4e is a structural schematic diagram of even still another device based on mobile terminal handover information for acquiring path information provided by the embodiments o the present invention.
  • Fig. 4f is a structural schematic diagram of yet still another device based on mobile terminal handover information for acquiring path information provided by the embodiments o the present invention.
  • Fig. 1 is a method based on mobile terminal handover information for acquiring path information provided by the embodiments of the present invention. This method comprises:
  • Step 101 acquiring the handover information of a mobil terminal .
  • th mobile terminal can be, for example, a mobile mainframe, cell phone, etc., without limitation.
  • the access network for this mobile terminal is not limited, for example, it can be a WLAN network, a GSM network, a UMTS network or other wireless network.
  • the handover information is, for example, a handover sequence constructed for a series of handovers of the same mobile terminal.
  • each handover can include for example the ID of a source cell and the ID of a target cell, the occurrence position of the handover, and other information. That is, the handover information at least contains two handovers.
  • Step 102 determining a handover pattern according to the handover sequence.
  • the handover pattern includes the handovers in this handover sequence, at least one path where these handovers can take place, and the correlation of these handovers and paths.
  • the handover pattern is, for example, the patterns shown in Figs. 2a, and 2b.
  • the handover pattern can also be represented in the form of table, and it can in particular refer to table 1.
  • Step 103 determining the credibility of the nodes in the handover pattern.
  • the nodes in the handover pattern can be either a handover or a road section.
  • the credibility of the nodes can be determined for example according to one of the following: parameters of the handovers per se, the geometric topological relationship of the road section, the restriction of road conditions of the road section, and the traffic flow
  • the parameters of the handovers per se therein include for example one of the following or any combination thereof: the frequency of handover occurrence, the maximum deviation of the handover occurrence position, and the mean square deviation of the handover occurrence position.
  • the way of determining the credibility of the nodes according to the parameters of the handovers per se is herein described by using the following three modes as examples.
  • Mode I the higher the handover occurrence probability, the more credible it is, that is, the higher the handover occurrence probability, the higher the credibility of the node corresponding to that handover is.
  • the road section was traveled 10 times, in which handover 1 occurred times while handover 2 occurred 3 times, therefore the credibility of handover 1 is higher than that of handover 2.
  • the credibility of handover 1 is 0.7 while the credibility of handover 2 is 0.3.
  • Mode II the smaller the maximum deviation of the handover occurrence position, the more credible the handover is. That is, the smaller the maximum deviation between the handover position and the theoretical handover position of each handover, the higher the credibility of the node corresponding to this handover.
  • Mode III the smaller the mean square deviation of the handover occurrence position, the more credible the handover is. That is, the smaller the mean square deviation between the handover position and the theoretical handover position of each handover, the higher the credibility of the node corresponding to this handover is.
  • the above three modes can be used alone or combined in any way to determine the credibility of the nodes. During practical implementation, the above three modes can use for example the occurrence probability, the maximum deviation, the mean square deviation, etc. as parameters for a function to compute the credibility of the nodes.
  • the relationship of the road section includes for example one of the following or any combination thereof: the included angle between the road sections corresponding to successively adjoining handovers in the handover sequence; the connection relationship between the road sections corresponding to successively adjoining handovers in the handover sequence; and the distance between the road sections corresponding to successively adjoining handovers in the handover sequence.
  • the connection relationship between the road sections corresponding to successively adjoining handovers in the handover sequence is for example one of the following: the road sections corresponding to successively adjoining handovers are the same road section; the road sections corresponding to successively adjoining handovers are the road sections connected end to end; the road sections
  • the following manner can be used to determine the credibility of the nodes.
  • Mode I the closer the included angle formed between the road sections where two successively adjoining handovers are located is to 180°, the more credible it is, that is, the closer the included angle between the road sections
  • mode I can also be expressed as: the larger the included angle between the road sections corresponding to the successively adjoining handovers, the higher the
  • Mode II the fewer the number of connected road sections between the road sections corresponding to the successively adjoining handovers, the higher the credibility of the node corresponding to this road section is. In particular, for example, if two successive handovers are on the same road section, i.e. the road sections corresponding to two
  • the above three modes can be used alone or combined in any way to determine the credibility of the nodes.
  • the above three modes can use for example any one of the included angle between the road sections, the number of road sections separating them, and the distance separating them, or any combination thereof as parameters for a function to compute the credibility of the nodes .
  • a handover pattern as shown in Fig. 2c can be formed according to the handover sequence, and in this handover pattern, the road section is used as node, and there is no connection relationship between the road sections corresponding to the same handover while there is a
  • relationship of road sections can be used to determine the credibility of the connection between nodes. For example as to a given connection, the closer the included angle between the two end road sections is to 180°, the higher the credibility of the connection; and/or the lower the number of connected road sections between the two end road sections, the higher the credibility of the
  • connection and/or the shorter the distance between the two end road sections, the higher the credibility of this connection .
  • a function can be used in calculation to determine the credibility of the connection between nodes.
  • the credibility of the nodes and/or the connection between nodes can be determined according to the restriction of path conditions of the road section.
  • the restriction of path conditions can include the driving speed of the road section and/or the driving speed restriction of the road section, etc.
  • the credibility of the node or connection corresponding to this road section is reduced.
  • the credibility of the node or connection corresponding to this road section is significantly reduced.
  • the driving speed of this road section can be calculated, for example, by dividing the length of the road section by the time difference before and after handover of this road section .
  • the restriction of path conditions of the road section can be used not only to determine the credibility of the nodes and/or the connection between nodes, but also to exclude paths so as to improve the speed and efficiency of searching for the most credible path.
  • a road section in which the driving speed exceeds the speed restriction of the road section can be excluded, without being taken into account any more.
  • the credibility of the nodes and/or the connection between nodes can be determined according to the traffic flow conditions of the road section.
  • Traffic flow conditions includes for example the driving speeds of the successively adjoining road sections. For example as to a given road section, if the driving speed difference between this road section and that of the former or the latter road section is too large, then the credibility of the nodes and/or the connection between nodes corresponding to this road section is reduced.
  • the traffic monitoring information can also be combined, and if the traffic monitoring information shows that the travel in one certain road section is unblocked, then in the case that the calculated driving speed is obviously lower than the speed of the unblocked travel, then the credibility of the nodes and/or the connection between the nodes corresponding to this road section is reduced; and if the traffic
  • monitoring information shows that one certain road section is jammed, then in the case that the calculated driving speed is apparently higher than the speed of the jammed travel, then the credibility of the nodes and/or the connection between the nodes corresponding to this road section is reduced.
  • Those skilled in the art can obtain other manners of determining the credibility of the nodes and connection between nodes from the above examples.
  • the credibility of this connection is set to be 1; if the road sections connecting two ends are connected end to end, then the credibility of the connection is set to be 0.8; if the road sections connecting two ends are connected via one road section, then the credibility of the connection is set to be 0.6; if the road sections connecting two ends are connected via two road sections, then the credibility of the connection is set to be 0.4; and if the road sections connecting two ends are connected via more sections, then the credibility of the connection is set to be 0.2.
  • Step 104 searching, according to the credibility of the nodes in the handover pattern, for a path with the highest credibility corresponding to the handover sequence.
  • step 104 also includes searching for a path with the highest
  • the road section with the highest credibility consists of at least one road section, and these road sections may be of the highest credibility, or may not be of the highest credibility but have the highest
  • the handover pattern can be traversed with a breadth-first branch-and-bound approach so as to obtain the path with the highest credibility
  • the breadth- first branch-and-bound approach can always select a node with the highest probability when selecting a node to be expanded, so as to enter the branches which most probably have the optimal solution as quickly as possible; and it can also abandon the subnodes which lead to infeasible branches or non-optimal solution during the expansion of nodes. Accordingly, the searching process can be accelerated and the processing efficiency can be improved.
  • the handover pattern can also be traversed with a depth-first branch backtracking approach to obtain the path with the highest credibility, and this method sifts out the nodes which are less than one certain feasibility solution, i.e. the node is no longer computed, which can further improve the processing speed.
  • step 104 it is also possible to use the dynamic programming approach to search for the path with highest credibility corresponding to the handover sequence. Detailed description of the dynamic programming approach can be found at http ://en. wikipedia . org/wiki/Dynamic programming . Since the computation complexity of the dynamic programming approach is low, the efficiency is high and the space
  • the method based on mobile terminal handover information for acquiring path information can utilize the handover information of a mobile terminal to determine the driving path of this mobile terminal, and can further carry out other traffic information applications according to this driving path, for example to judge the traffic conditions on the roads of a city. Since the handover information of the mobile terminal can be obtained from currently available networks, it is not required to build new infrastructures or to modify the mobile terminals, therefore its application costs are low and it is easy to promote. Moreover, according to the technical
  • Step 301 acquire the handover information of a mobile terminal .
  • This handover information includes handover sequence 1, with handover sequence 1 including handover 1, handover 2, handover 3 and handover 4.
  • handover 1 a an example, it includes the ID of a target cell and the ID o a source cell, and the handover occurrence position.
  • Step 302 determine a handover pattern according to the handover sequence.
  • handover 1 can occur on road section 1, road section 2, or road section 3; handover 2 can occur on road section 1, and road section 4; handover 3 can occur on road section 5, road section 6, and road section 7; and handover 4 can occur on road section 8 and road section 9.
  • a handover pattern as shown in Fig. 2c can be formed.
  • Step 303 determine the credibility of the connection between the nodes in the handover pattern.
  • Table 2 table of accumulated credibility
  • the above computation results can be stored.
  • Step 305 record the previous adjoining node on the
  • Step 307 reversely infer the optimal path from the optimal previous adjoining node.
  • the optimal paths reversely inferred from the optimal previous adjoining node are as follows: the first road section corresponding to handover 1, the first road section corresponding to handover 2, the second road section corresponding to handover 3, and the second road section corresponding to handover 4. Then the final path is obtained according to the connection table.
  • the path corresponding to the handover sequence can be determined with higher accuracy in a shorter time with less storage space occupation, thereby enabling the handover information of mobile terminals to be applied in traffic applications without building new infrastructures or modifying the mobile terminals and also enabling cost
  • the embodiments of the present invention further provi means based on mobile terminal handover information for acquiring path information.
  • the means can be, for example, single device, or integrated into a device in the
  • this means comprises: an acquiring module 401 for acquiring the handover information of a mobile terminal.
  • This handover information can refer to, for
  • a pattern module 402 for determining a handover pattern according to the handover sequence, which handover pattern includes the handovers in a handover sequence, at least one road section where the handovers can occur, and the correlation between the handovers and the road sections, with the nodes in the handover pattern being the handovers or road sections; a first confidence module 403 for determining the credibility of the nodes in the handover pattern according to a
  • the confidence parameter includes for example one of the following or any combination thereof: the parameters of the handovers per se, the
  • the means provided by the embodiments of the present invention can be used, for example, to perform the method provided in the above method embodiments. Also, with the means provided by this embodiment, the mobile path of a mobile terminal can be obtained accurately based on the handover information of the mobile terminal, so that it can be used in a variety of traffic applications. Moreover, during the determination of the path of the mobile terminal, this means is faster, occupies less storage space, and is more accurate, and can meet the requirements of the
  • the computing module 404 can also include, for example, one of the following: a first computing submodule 4041 for
  • a third computing submodule 4042 for traversing the handover pattern with a breadth-first branch- and-bound approach to obtain the path with the highest credibility corresponding to the handover sequence according to the credibility of the nodes in the handover pattern; a second computing submodule 4042 for traversing the handover pattern with a depth-first branch backtracking algorithm to obtain the path with the highest credibility corresponding t the handover sequence according to the credibility of the nodes in the handover pattern; and a third computing
  • submodule 4043 for processing the handover pattern with a dynamic programming approach to obtain the path with the highest credibility corresponding to the handover sequence according to the credibility of the nodes in the handover pattern.
  • the particular implementation of the above computin module 404 and its submodules can refer to the embodiment shown in Fig . 1.
  • this means can also include a second confidence module 405 for determining the credibility of the connection between nodes in the handover pattern.
  • the nodes in this handover pattern are road sections, and there is no connection between the road sections corresponding to the same handover in the handover sequence, while there is connection between the road sections corresponding to the former handover and the road section corresponding to the latter handover in the
  • the second confidence module 405 for example can determine the credibility of the connection according to one of the following or any
  • the computing module 404 can also be used, for example for searching for a path with the highest credibility corresponding to the handover sequence according to the credibility of connections and nodes.
  • the submodules included in the computing module 404 can also be used for traversing or processing according to the
  • the first confidence module 403 can, for example, include one of the following or any combination thereof: a first confidence submodule 4031 for determining the credibility of the nodes and/or connections corresponding to the handover according to the occurrence probability of the handover, and particularly the higher the handover occurrence probability is, the higher the credibility of the node and/or connection corresponding to the handover is; a second confidence submodule 4032 for determining the credibility of the nodes and/or connections corresponding to the handover according to the handover occurrence position, and particularly the smaller the maximum deviation of the handover occurrence position, the higher the credibility of the node and/or connection corresponding to the handover is, and/or, the smaller the mean square
  • a third confidence submodule 4033 for determining the
  • a fourth confidence submodule 4034 for determining the credibility of the nodes and/or connections corresponding to the handover according to the number of connected road sections between the road sections corresponding to the successively adjoining
  • a fifth confidence submodule 4035 for determining the
  • a sixth confidence submodule 4036 for determining the credibility of the nodes and/or connections corresponding to the road sections according to the driving speed of the road section and/or the driving speed restriction of the road section, the particular implementation of which can refer to the embodiment shown in Fig. 1; and a seventh confidence submodule 4037 for
  • the above confidence submodule can also be provided in the first confidence module 403 and the second confidence module 405 respectively, i.e. the submodules for determining the

Landscapes

  • Chemical & Material Sciences (AREA)
  • Analytical Chemistry (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Navigation (AREA)

Abstract

La présente invention concerne un procédé d'acquisition d'informations d'itinéraire sur la base des informations de transfert d'un terminal mobile, ledit procédé comportant les étapes consistant à : acquérir les informations de transfert du terminal mobile, lesdites informations de transfert comportant au moins une séquence de transferts du terminal mobile, ladite séquence de transferts comportant au moins deux transferts du terminal mobile ; déterminer, en fonction de la séquence de transferts, un schéma de transfert, ledit schéma de transfert comportant les transferts figurant dans ladite séquence de transferts, au moins une section de route où lesdits transferts peuvent avoir lieu, et la corrélation entre lesdits transferts et ladite section de route ; déterminer la crédibilité des nœuds compris dans le schéma de transfert, les nœuds du schéma de transfert étant constitués de ladite ou desdites sections de route ou desdits transferts de la séquence de transferts ; et rechercher, en fonction de la crédibilité des nœuds du schéma de transfert, un itinéraire de crédibilité maximale correspondant à la séquence de transferts, ledit itinéraire étant composé d'au moins un tronçon de ladite section de route. La présente invention concerne en outre un moyen correspondant d'acquisition d'informations d'itinéraire. La solution technique selon la présente invention est capable de réduire les coûts des applications intelligentes de trafic sans affecter les appareils actuellement disponibles.
PCT/EP2011/066198 2010-09-30 2011-09-19 Procédé et moyen d'acquisition d'informations d'itinéraire sur la base d'informations de transfert d'un terminal mobile Ceased WO2012041732A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010506401.6 2010-09-30
CN2010105064016A CN102446413A (zh) 2010-09-30 2010-09-30 一种基于移动终端切换信息获取路径信息方法和装置

Publications (1)

Publication Number Publication Date
WO2012041732A1 true WO2012041732A1 (fr) 2012-04-05

Family

ID=44773051

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2011/066198 Ceased WO2012041732A1 (fr) 2010-09-30 2011-09-19 Procédé et moyen d'acquisition d'informations d'itinéraire sur la base d'informations de transfert d'un terminal mobile

Country Status (2)

Country Link
CN (1) CN102446413A (fr)
WO (1) WO2012041732A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014018481A3 (fr) * 2012-07-24 2014-03-27 Alcatel Lucent Composant de gestionnaire de transfert intercellulaire
US9198158B2 (en) 2012-05-25 2015-11-24 Alcatel Lucent Predictive paging based on mobility history and movement patterns

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6558393B2 (ja) * 2017-04-06 2019-08-14 トヨタ自動車株式会社 進路設定装置及び進路設定方法
EP3695373B1 (fr) * 2017-10-10 2024-05-15 Telefonaktiebolaget LM Ericsson (publ) Horaires de lignes de transport en commun issus de transferts intercellulaires de réseau mobile

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007103180A2 (fr) * 2006-03-03 2007-09-13 Inrix, Inc. Évaluation des conditions de circulation routière au moyen de données provenant de sources de données mobiles

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4680739B2 (ja) * 2005-09-30 2011-05-11 三菱電機株式会社 交通情報生成装置
JP4360419B2 (ja) * 2007-04-26 2009-11-11 アイシン・エィ・ダブリュ株式会社 交通状況判定システム
CN101470947A (zh) * 2007-12-25 2009-07-01 上海爱国者数码科技有限公司 可显示道路交通信息的信息获取终端

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007103180A2 (fr) * 2006-03-03 2007-09-13 Inrix, Inc. Évaluation des conditions de circulation routière au moyen de données provenant de sources de données mobiles

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
YUEMING YUAN ET AL: "Map matching of mobile probes based on handover location technology", NETWORKING, SENSING AND CONTROL (ICNSC), 2010 INTERNATIONAL CONFERENCE ON, IEEE, PISCATAWAY, NJ, USA, 10 April 2010 (2010-04-10), pages 587 - 592, XP031674589, ISBN: 978-1-4244-6450-0 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9198158B2 (en) 2012-05-25 2015-11-24 Alcatel Lucent Predictive paging based on mobility history and movement patterns
WO2014018481A3 (fr) * 2012-07-24 2014-03-27 Alcatel Lucent Composant de gestionnaire de transfert intercellulaire

Also Published As

Publication number Publication date
CN102446413A (zh) 2012-05-09

Similar Documents

Publication Publication Date Title
CN109405839B (zh) 一种基于多路径的交通网络离线地图匹配算法
CN103544291B (zh) 道路网络中基于RRN-Tree的移动对象CKNN查询方法
CN106781478B (zh) 一种基于lte信令数据的轨迹跟踪方法
CN104914862B (zh) 基于目标方向约束的路径规划算法
CN102521973A (zh) 一种手机切换定位的道路匹配方法
CN103149576A (zh) 一种浮动车数据的地图匹配方法
WO2013182032A1 (fr) Procédé et dispositif d'appariement d'un itinéraire de transport public avec un réseau routier
CN103020130B (zh) 一种面向城市路网的位置服务中支持区域的k最近邻查询方法
WO2012041732A1 (fr) Procédé et moyen d'acquisition d'informations d'itinéraire sur la base d'informations de transfert d'un terminal mobile
CN113959452A (zh) 基于城市路网的地图匹配方法、系统及终端
CN103700314A (zh) 一种位置定位方法、装置及电子地图
CN105987702B (zh) 一种导航路线的路段扩张方法及其装置
CN108562296B (zh) 一种基于车辆卫星定位数据的道路匹配方法及装置
CN107917716B (zh) 固定线路导航方法、装置、终端及计算机可读存储介质
CN114281915B (zh) 一种生成几何路网的方法、装置、设备及存储介质
CN104101861B (zh) 测距定位方法及系统
Huang et al. Frequent pattern-based map-matching on low sampling rate trajectories
CN116828397B (zh) 一种轨迹信息的获取方法、装置、电子设备和存储介质
Eisner et al. Algorithms for matching and predicting trajectories
KR20160135907A (ko) Ｒ 트리 인덱스 기반의 확장된 최근접 공간개체 탐색 장치 및 방법
CN106781472A (zh) 一种基于公交车数据的路况检测方法及装置
CN107655490A (zh) 基于移动用户轨迹分段和最热搜索的热点路径发现方法
CN116935656B (zh) 道路交通数据处理方法、装置、电子设备及存储介质
CN118797377B (zh) 基于轨迹的车道路网增量生成方法、装置、设备及介质
Ahn et al. Crowd-assisted radio map construction for Wi-Fi positioning systems

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: 11767202

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: 11767202

Country of ref document: EP

Kind code of ref document: A1