US20150285649A1 - Method and apparatus for determining traffic route in electronic map - Google Patents

Method and apparatus for determining traffic route in electronic map Download PDF

Info

Publication number
US20150285649A1
US20150285649A1 US14/742,315 US201514742315A US2015285649A1 US 20150285649 A1 US20150285649 A1 US 20150285649A1 US 201514742315 A US201514742315 A US 201514742315A US 2015285649 A1 US2015285649 A1 US 2015285649A1
Authority
US
United States
Prior art keywords
route
sectional
riding
walking
traffic
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.)
Abandoned
Application number
US14/742,315
Inventor
Xianxin ZHANG
Kang Zhou
Haibo Lu
Jianyu Wang
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.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Assigned to TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED reassignment TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: LU, HAIBO, WANG, JIANYU, ZHANG, Xianxin, ZHOU, Kang
Publication of US20150285649A1 publication Critical patent/US20150285649A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/3407Route searching; Route guidance specially adapted for specific applications
    • G01C21/3423Multimodal routing, i.e. combining two or more modes of transportation, where the modes can be any of, e.g. driving, walking, cycling, public transport
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/20Instruments for performing navigational calculations
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/28Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network with correlation of data from several navigational instruments
    • G01C21/30Map- or contour-matching
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/3453Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3476Special cost functions, i.e. other than distance or default speed limit of road segments using point of interest [POI] information, e.g. a route passing visible POIs
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/36Input/output arrangements for on-board computers
    • G01C21/3667Display of a road map

Definitions

  • Embodiments of the present disclosure relate to the field of electronic map technologies, and more particularly, to a method and an apparatus for determining a traffic route in an electronic map.
  • Electronic map is stored and viewed digitally by utilizing computer technologies.
  • traffic route search services for example, a bus or metro route search service
  • a bus or metro route result may be obtained after a start point and an end point are input.
  • the result is generally described as “Take Bus No. XXX, and reach XXX after XX stations; walk XX meters towards X, and then reach the end point”.
  • a map route is presented as a direct connecting line from the start point to a pick-up point of a bus or metro station and a direct connecting line from a drop-off point of a bus or metro station to the end point.
  • a user upon making a search for a bus or metro route, a user expects more indication information related to walking, such as indicating information for indicting how the user is to walk to a bus or metro station, how the user is to walk to a destination after the user gets off a bus or metro train, whether the user is to turn left or turn right, and how far the user is to walk, and the like. Otherwise, the user may easily get lost, and even fail to find a corresponding bus or metro station. In such a case, with the existing technology employing a point-to-point path planning algorithm, reasonable results cannot always be obtained, which does not satisfies user demands.
  • walking indication information cannot be presented to a user, thereby reducing a matching rate of a traffic route in an electronic map.
  • a method for determining a traffic route in an electronic map by which not only a riding route can be presented to a user, but also walking route information can be presented to the user, thereby improving a matching rate of a traffic route in an electronic map.
  • an apparatus for determining a traffic route in an electronic map by which not only a riding route can be presented to a user, but also walking route information can be presented to the user, thereby improving a matching rate of a traffic route in an electronic map.
  • a method for determining a traffic route in an electronic map including:
  • An apparatus for determining a traffic route in an electronic map including one or more processors and a memory, where the memory has multiple processor-executable instruction units stored therein, and the multiple instruction units include:
  • a non-volatile computer-readable storage medium including a computer instruction, where the computer instruction is executable by one or more processors to execute the following operations:
  • a route start point and a route end point are determined; a sectional riding route between the route start point and the route end point is calculated in an electronic map road network, and identification information is set in the sectional riding route; and a sectional walking route corresponding to the sectional riding route is calculated in the electronic map road network, the sectional walking route and the sectional riding route are integrated into a traffic route according to the identification information of the sectional riding route, and the traffic route is displayed.
  • a walking route result can be integrated into a bus or metro riding route result for presentation.
  • a user is provided with detailed and abundant walking route indication information, thereby improving a matching rate of a traffic route in an electronic map.
  • FIG. 1 is a schematic diagram of an apparatus for determining a traffic route in an electronic map according to an embodiment of the present disclosure
  • FIG. 2 is a flowchart of a method for determining a traffic route in an electronic map according to an embodiment of the present disclosure
  • FIG. 3 is a schematic diagram of displaying a traffic route in an electronic map according to an embodiment of the present disclosure
  • FIG. 4 is a schematic diagram of displaying a traffic route in an electronic map according to another embodiment of the present disclosure.
  • FIG. 5 is a structural diagram of an apparatus for determining a traffic route in an electronic map according to an embodiment of the present disclosure.
  • FIG. 1 is a schematic diagram of an apparatus for determining a traffic route in an electronic map according to an embodiment of the present disclosure.
  • An apparatus 100 may implement a method provided by the embodiments of the present disclosure.
  • the apparatus 100 includes one or more processors 151 and a non-volatile computer-readable memory 152 .
  • the memory 152 has an operating system 131 and an application program 132 stored therein, for example, an application for determining a traffic route in an electronic map that is used to implement a method provided by an embodiment of the present disclosure.
  • the apparatus 100 may be a server that provides an electronic map service.
  • a user provides, by using a terminal device, the server with start point information and end point information of a route that needs to be searched for.
  • the server performs calculation according to the start point information and the end point information, to obtain route information and then return the route information to the terminal device of the user for displaying.
  • a user may submit, to a background server, start point and end point for searching for a bus/metro route.
  • the background server obtains information about the bus or metro route from the start point to the end point through calculation, and then performs, according to the obtained information about the bus or metro route, calculation for detailed walking information about walking to a bus or metro station, walking to a transfer station, and walking to a destination after the user gets off a bus or metro train. Finally, the background server integrates the information about the bus or metro route and the detailed walking information, and returns the integrated information to the terminal device. The terminal device then presents the integrated information to the user.
  • the apparatus 100 may also be user equipment.
  • the application program 132 in the memory 152 performs calculation according to start point and end point information input by a user, and displays, to the user, route information obtained through calculation.
  • a walking route result is integrated into a bus/metro riding route result for presentation, so as to provide a user with how the user is to walk to a start point such as a bus or metro station of the riding route, how the user is to walk to a stopover point such as a transfer station of the riding route, and how the user is to walk to a destination after the user gets off at a bus or metro station, so that a user is provided with detailed and abundant walking route indication information, thereby improving a matching rate of a traffic route in an electronic map.
  • FIG. 2 is a flowchart of a method for determining a traffic route in an electronic map according to an embodiment of the present disclosure.
  • the method includes steps 201 to 203 .
  • step 201 a route start point and a route end point are determined.
  • a satellite positioning system for example, Global Positioning System (GPS) from the United States, Beidou Positioning System from China, GLONASS Positioning System from Russia, Galileo Positioning System from Europe, or wireless communication network positioning, Bluetooth positioning and other manners may be used to achieve informatization of physical coordinate data of a real road network.
  • GPS Global Positioning System
  • Beidou Positioning System from China
  • GLONASS Positioning System from Russia
  • Galileo Positioning System Galileo Positioning System from Europe
  • wireless communication network positioning Bluetooth positioning and other manners
  • a route start point and a route end point may be selected in a manner of direct clicking on an electronic map, and may also be set by inputting a name of a geographic location, and so forth.
  • An electronic map road network includes geographical coordinate data information of a real road network, called electronic map road network data.
  • the electronic map road network describes coordinate series of each road section and a connection relationship between different road sections.
  • the route start point and the route end point are respectively introduced into the electronic map road network, that is, correspondences between are between the route start point and the route end point and specific geographical coordinate data in the electronic map road network are respectively established.
  • the specific introduction process may include: determining coordinate data of display positions of the route start point and the route end point in the electronic map; and respectively determining, based on the coordinate data of the display positions of the route start point and the route end point in the electronic map, geographical coordinate data of the route start point and the route end point in the electronic map road network.
  • a sectional riding route between the route start point and the route end point as well as distance values of sections of the sectional riding route may be calculated with a distance measurement algorithm based on coordinates of the route start point and the route end point.
  • the existing common public transportation means includes: taxi, bus, subway, light rail, motorcycle, civil aircraft, and the like.
  • a pick-up point of interest (POI) and a drop-off point of interest between the route start point and the route end point in the electronic map road network may be calculated by using a shortest path algorithm; and then the sectional riding route between the route start point and the route end point is determined according to the calculated pick-up point of interest and drop-off point of interest.
  • POI point of interest
  • a drop-off point of interest between the route start point and the route end point in the electronic map road network may be calculated by using a shortest path algorithm; and then the sectional riding route between the route start point and the route end point is determined according to the calculated pick-up point of interest and drop-off point of interest.
  • shortest path algorithm is used to calculate a route.
  • the most commonly-used shortest path algorithms include a Dijkstra's algorithm, an A* algorithm, an SPFA algorithm, a Bellman-Ford algorithm, and a Floyd-Warshall algorithm, and the like.
  • the Dijkstra's algorithm may be used for calculation.
  • the Dijkstra's algorithm is a typical shortest path algorithm, which is used to calculate the shortest path from a point to another point, with a main characteristic of extending toward an outer layer with a start point as a center until extending to an end point.
  • the Dijkstra's algorithm may be used to obtain an optimal solution of the shortest path.
  • the stopover point may be updated on the electronic map in a manner of dragging, and then the updated stopover point is introduced into the electronic map road network.
  • step 202 may include: presenting on the electronic map a riding route from the route start point to the updated stopover point and then to the route end point as well as a distance value.
  • a riding route and a distance value may be calculated according to a sequence of the stopover points that are preset by a user.
  • the above shortest path algorithm may also be used to calculate the riding route between the stopover points and distance value.
  • the route start point or the route end point may also be changed directly in a manner of dragging on the electronic map. Specifically, after the route start point or the route end point is changed on the electronic map, the updated route start point or the updated route end point is introduced into the electronic map road network, and an updated riding route and distance value continue to be calculated by using the distance measurement algorithm.
  • identification information is set in each sectional riding route, where the identification information is used for identifying each sectional riding route.
  • the first sectional riding route from the route start point is identified as 1
  • the second sectional riding route from the route start point is identified as 2
  • the N-th sectional riding route from the route start point is identified as N, and so forth.
  • step 203 a sectional walking route corresponding to the sectional riding route in the electronic map road network is calculated, the sectional walking route and the sectional riding route are integrated into a traffic route according to the identification information, display the traffic route is displayed.
  • a walking start point of interest and a walking end point of interest may be determined according to the route start point, route end point, and sectional riding route; and a shortest path algorithm may be used to determine the sectional walking route corresponding to the sectional riding route according to the walking start point of interest and the walking end point of interest.
  • walking information of a POI from the route start point to a pick-up station of the first section of the riding route may be first calculated; then walking information of a POI from a drop-off station of the first section of the riding route to a pick-up station of the second section of the riding route may be calculated; and so forth, until walking information of a POI from a drop-off station of the N-th section of the riding route to the route end point is calculated.
  • a start point and an end point of each sectional walking route For calculation of the sectional walking route, a start point and an end point of each sectional walking route, an adjacency matrix of a turning point and a process of storing of searching traffic routes are initialized. It is then determined whether the start point and the end point are valid, that is, whether the start point and the end point are already present in a database of existing route points.
  • the start point is set to be the first point, and an adjacency matrix of the first point is used to search for all turning points, which are linked in sequence; then, all turning points of points in the link are searched for in turn, and characteristics of the turning points are determined; finally, all the points in the link are searched for and traversed in a reverse order of parent points until the end point, so as to output a walking path from the start point to the end point.
  • a sectional walking route corresponding to a sectional riding route is determined according to the identification information of the sectional riding route; and the sectional riding route is integrated with the corresponding sectional walking route, to form a traffic route.
  • a sectional walking route corresponding to the route identification is from the route start point to a pick-up point of the first sectional riding route; if the second sectional riding route from the route start point is identified as 2, a sectional walking route corresponding to the route identification is from a drop-off point of the first sectional riding route to a pick-up point of the second sectional riding route; and so forth.
  • a process of integrating the sectional riding route and the sectional walking route may include: firstly reading sectional data from the sectional riding route through traversal, then determining, through traversal, whether each of the sectional data is information of a route from the start point to a pick-up station of the first section, a route from a drop-off station of the first section to a pick-up station of the N-th section, or a route from a drop-off station of the Nth section to the end point.
  • a brief display manner may be used, that is, only brief information is displayed on the page; and when a user needs to view a detailed content, the user unfold the brief information through an operation, to view all detailed content. After viewing, the user may further fold the displayed detailed content, so as to save the display space. For example, a user may unfold or fold a foldable portion through a mouse click operation.
  • displaying the traffic route includes: displaying the sectional walking route in the traffic route briefly, or displaying the sectional walking route in the traffic route in detail; or displaying the sectional riding route in the traffic route briefly, or displaying the sectional riding route in the traffic route in detail.
  • FIG. 3 is a schematic diagram of displaying a traffic route in an electronic map according to an embodiment of the present disclosure.
  • the three sectional walking routes include the walking routes of walking to a bus or metro station, walking to a transfer station, and walking to a destination after getting off from a bus or metro train (as shown in walking information 1 , 2 , and 3 in FIG. 3 ).
  • the walking information 1 and 2 includes more detailed information, and a brief display manner is used to reduce occupied page space, which is represented by a drop-down arrow “V” on the right. After a user clicks the drop-down arrow, more details may be unfolded and displayed. As shown in FIG. 3 , detailed walking information 11 and 12 is detailed information of the walking information 1 , and detailed walking information 21 and 22 is detailed information of the walking information 2 . The walking information 3 does not include details, and therefore there is no drop-down arrow on the right. The user can directly access the map by clicking the walking information 3 .
  • FIG. 5 is a structural diagram of an apparatus for determining a traffic route in an electronic map according to an embodiment of the present disclosure.
  • the apparatus includes: one or more processors 510 , and a memory 520 , where the memory 520 has multiple instruction units stored therein that are executable by the processor 510 , and the multiple instruction units include:
  • the sectional walking route determining unit 503 is configured to display the sectional walking route in the traffic route briefly, or display the sectional walking route in the traffic route in detail; or display the sectional riding route in the traffic route briefly, or display the sectional riding route in the traffic route in detail.
  • the sectional riding route determining unit 502 may calculate a pick-up point of interest and a drop-off point of interest between the route start point and the route end point by using a shortest path algorithm; and determine the sectional riding route between the route start point and the route end point according to the calculated pick-up point of interest and drop-off point of interest.
  • the sectional walking route determining unit 503 is configured to determine a walking start point of interest and a walking end point of interest according to the route start point, route end point, and sectional riding route; and determine, according to the walking start point of interest and the walking end point of interest, the sectional walking route between the sectional riding routes by using a shortest path algorithm.
  • an apparatus for determining a traffic route in an electronic map may be specifically implemented in many forms.
  • a plug-in program installed in an electronic map may be written by using an application programming interface that conforms to a particular specification, or an application program may be encapsulated for download and use by a user.
  • the plug-in program may be implemented in many plug-in forms such as ocx, dll, and cab.
  • the apparatus for determining a traffic route in an electronic map provided in this embodiment of the present disclosure may also be implemented by a Flash plug-in, a RealPlayer plug-in, an MMS plug-in, a MIDI plug-in, an ActiveX plug-in and other specific technologies.
  • the memory 520 may include, but is not limited to, a floppy disk, an optical disc, a DVD, a hard disk, a flash memory, a USB flash disk, a CF card, an SD card, an MMC card, an SM card, a memory stick, an xD card, and the like.
  • a route start point and a route end point are determined; a sectional riding route between the route start point and the route end point is calculated in an electronic map road network, and identification information is set in the sectional riding route; and a sectional walking route from the sectional riding route is calculated in the electronic map road network, the sectional walking route and the sectional riding route are integrated into a traffic route according to the identification information, and the traffic route is displayed.
  • a walking route result can be integrated into a bus or metro riding route result for presentation.
  • a user is provided with detailed and abundant walking route indication information, thereby improving a matching rate of a traffic route in an electronic map.
  • embodiments of the present disclosure may be applied in various terminals, and may also be used across platforms and terminals.
  • the application scope is very wide.
  • the embodiments of the disclosure for determining a traffic route in an electronic map may be embodied as computer instruction stored in a computer readable medium, when executed by one or more processors on a server, may cause the server to execute the steps in the described method or performing the functions by the server.
  • the computer instructions may be stored in a memory (e.g., a computer-readable storage medium, such as a hard disk, an optical disk, a solid state memory such as a flash memory) on a server, or in a cloud memory accessed via an Internet connection.
  • the computer instructions may be hardware program codes modules constituted as logic gates microcodes within a ROM, a processor or a controller, or as functional modules constituted by both software/hardware together.

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Navigation (AREA)
  • Traffic Control Systems (AREA)

Abstract

A method and an apparatus for determining a traffic route in an electronic map are provided. The method includes: determining by a server that includes a processor, a route start point and a route end point entered through a terminal device that includes a processor; calculating a sectional riding route between the route start point and the route end point in an electronic map road network, setting identification information in the sectional riding route; calculating a sectional walking route corresponding to the sectional riding route in the electronic map road network, integrating the sectional walking route and the sectional riding route into a traffic route according to the identification information, and displaying the traffic route on the terminal device.

Description

    CROSS-REFERENCES TO RELATED APPLICATIONS
  • This application is a continuation of PCT/CN2013/088278, filed on Dec. 2, 2013, which claims priority to Chinese Patent Application No. 201210570511.8, filed on Dec. 25, 2012 to the State Intellectual Property Office of the People's Republic of China, and titled “METHOD AND APPARATUS FOR DETERMINING TRAFFIC ROUTE IN ELECTRONIC MAP”, which are incorporated herein by reference to their entireties.
  • TECHNICAL FIELD
  • Embodiments of the present disclosure relate to the field of electronic map technologies, and more particularly, to a method and an apparatus for determining a traffic route in an electronic map.
  • BACKGROUND
  • Electronic map is stored and viewed digitally by utilizing computer technologies. Currently, in various traffic route search services (for example, a bus or metro route search service) based on electronic maps, after a start point and an end point are input, a bus or metro route result may be obtained. The result is generally described as “Take Bus No. XXX, and reach XXX after XX stations; walk XX meters towards X, and then reach the end point”. A map route is presented as a direct connecting line from the start point to a pick-up point of a bus or metro station and a direct connecting line from a drop-off point of a bus or metro station to the end point.
  • However, under many circumstances in real life, upon making a search for a bus or metro route, a user expects more indication information related to walking, such as indicating information for indicting how the user is to walk to a bus or metro station, how the user is to walk to a destination after the user gets off a bus or metro train, whether the user is to turn left or turn right, and how far the user is to walk, and the like. Otherwise, the user may easily get lost, and even fail to find a corresponding bus or metro station. In such a case, with the existing technology employing a point-to-point path planning algorithm, reasonable results cannot always be obtained, which does not satisfies user demands.
  • Therefore, in existing technical solutions, walking indication information cannot be presented to a user, thereby reducing a matching rate of a traffic route in an electronic map.
  • SUMMARY
  • According to an embodiment of the present disclosure, it is provided a method for determining a traffic route in an electronic map, by which not only a riding route can be presented to a user, but also walking route information can be presented to the user, thereby improving a matching rate of a traffic route in an electronic map.
  • According to an embodiment of the present disclosure, it is also provided an apparatus for determining a traffic route in an electronic map, by which not only a riding route can be presented to a user, but also walking route information can be presented to the user, thereby improving a matching rate of a traffic route in an electronic map.
  • Specific solutions of the embodiments of the present disclosure are as follows.
  • A method for determining a traffic route in an electronic map is provided, the method including:
      • determining a route start point and a route end point;
      • calculating a sectional riding route between the route start point and the route end point in an electronic map road network, and setting identification information in the sectional riding route; and
      • calculating a sectional walking route corresponding to the sectional riding route in the electronic map road network, integrating the sectional walking route and the sectional riding route into a traffic route according to the identification information of the sectional riding route, and displaying the traffic route.
  • An apparatus for determining a traffic route in an electronic map is provided, the apparatus including one or more processors and a memory, where the memory has multiple processor-executable instruction units stored therein, and the multiple instruction units include:
      • a point determining unit, a sectional riding route determining unit, and a sectional walking route determining unit, where:
      • the point determining unit is configured to determine a route start point and a route end point;
      • the sectional riding route determining unit is configured to calculate a sectional riding route between the route start point and the route end point in an electronic map road network, and set identification information in the sectional riding route; and
      • the sectional walking route determining unit is configured to calculate a sectional walking route corresponding to the sectional riding route in the electronic map road network, integrate the sectional walking route and the sectional riding route into a traffic route according to the identification information of the sectional riding route, and display the traffic route.
  • A non-volatile computer-readable storage medium is provided, the storage medium including a computer instruction, where the computer instruction is executable by one or more processors to execute the following operations:
      • determining a route start point and a route end point;
      • calculating a sectional riding route between the route start point and the route end point in an electronic map road network, and setting identification information in the sectional riding route; and
      • calculating a sectional walking route corresponding to the sectional riding route in the electronic map road network, integrating the sectional walking route and the sectional riding route into a traffic route according to the identification information of the sectional riding route, and displaying the traffic route.
  • From the above technical solutions, it can be found that in the embodiments of the present disclosure, a route start point and a route end point are determined; a sectional riding route between the route start point and the route end point is calculated in an electronic map road network, and identification information is set in the sectional riding route; and a sectional walking route corresponding to the sectional riding route is calculated in the electronic map road network, the sectional walking route and the sectional riding route are integrated into a traffic route according to the identification information of the sectional riding route, and the traffic route is displayed. It can be seen that, with the embodiments of the present disclosure, a walking route result can be integrated into a bus or metro riding route result for presentation. According to the embodiments of the present disclosure, a user is provided with detailed and abundant walking route indication information, thereby improving a matching rate of a traffic route in an electronic map.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a schematic diagram of an apparatus for determining a traffic route in an electronic map according to an embodiment of the present disclosure;
  • FIG. 2 is a flowchart of a method for determining a traffic route in an electronic map according to an embodiment of the present disclosure;
  • FIG. 3 is a schematic diagram of displaying a traffic route in an electronic map according to an embodiment of the present disclosure;
  • FIG. 4 is a schematic diagram of displaying a traffic route in an electronic map according to another embodiment of the present disclosure; and
  • FIG. 5 is a structural diagram of an apparatus for determining a traffic route in an electronic map according to an embodiment of the present disclosure.
  • DETAILED DESCRIPTION
  • To make the objectives, technical solutions, and advantages of the present disclosure clearer, the following describes the present disclosure in further detail with reference to the accompanying drawings.
  • FIG. 1 is a schematic diagram of an apparatus for determining a traffic route in an electronic map according to an embodiment of the present disclosure. An apparatus 100 may implement a method provided by the embodiments of the present disclosure. As shown in FIG. 1, the apparatus 100 includes one or more processors 151 and a non-volatile computer-readable memory 152. The memory 152 has an operating system 131 and an application program 132 stored therein, for example, an application for determining a traffic route in an electronic map that is used to implement a method provided by an embodiment of the present disclosure.
  • The apparatus 100 may be a server that provides an electronic map service. In such a case, a user provides, by using a terminal device, the server with start point information and end point information of a route that needs to be searched for. The server performs calculation according to the start point information and the end point information, to obtain route information and then return the route information to the terminal device of the user for displaying. In one embodiment, a user may submit, to a background server, start point and end point for searching for a bus/metro route. The background server obtains information about the bus or metro route from the start point to the end point through calculation, and then performs, according to the obtained information about the bus or metro route, calculation for detailed walking information about walking to a bus or metro station, walking to a transfer station, and walking to a destination after the user gets off a bus or metro train. Finally, the background server integrates the information about the bus or metro route and the detailed walking information, and returns the integrated information to the terminal device. The terminal device then presents the integrated information to the user.
  • The apparatus 100 may also be user equipment. In such a case, the application program 132 in the memory 152 performs calculation according to start point and end point information input by a user, and displays, to the user, route information obtained through calculation.
  • In this embodiment of the present disclosure, a walking route result is integrated into a bus/metro riding route result for presentation, so as to provide a user with how the user is to walk to a start point such as a bus or metro station of the riding route, how the user is to walk to a stopover point such as a transfer station of the riding route, and how the user is to walk to a destination after the user gets off at a bus or metro station, so that a user is provided with detailed and abundant walking route indication information, thereby improving a matching rate of a traffic route in an electronic map.
  • FIG. 2 is a flowchart of a method for determining a traffic route in an electronic map according to an embodiment of the present disclosure.
  • As shown in FIG. 2, the method includes steps 201 to 203.
  • In step 201, a route start point and a route end point are determined.
  • A satellite positioning system, for example, Global Positioning System (GPS) from the United States, Beidou Positioning System from China, GLONASS Positioning System from Russia, Galileo Positioning System from Europe, or wireless communication network positioning, Bluetooth positioning and other manners may be used to achieve informatization of physical coordinate data of a real road network. In this step, a route start point and a route end point are first set in an electronic map.
  • In this embodiment of the present disclosure, a route start point and a route end point may be selected in a manner of direct clicking on an electronic map, and may also be set by inputting a name of a geographic location, and so forth.
  • An electronic map road network includes geographical coordinate data information of a real road network, called electronic map road network data. The electronic map road network describes coordinate series of each road section and a connection relationship between different road sections. After a route start point and a route end point are set, the route start point and the route end point are respectively introduced into the electronic map road network, that is, correspondences between are between the route start point and the route end point and specific geographical coordinate data in the electronic map road network are respectively established. The specific introduction process may include: determining coordinate data of display positions of the route start point and the route end point in the electronic map; and respectively determining, based on the coordinate data of the display positions of the route start point and the route end point in the electronic map, geographical coordinate data of the route start point and the route end point in the electronic map road network.
  • In this embodiment of the present disclosure, after the route start point and the route end point are introduced into the electronic map road network, the geographical coordinate data of the route start point and the route end point can be applied to calculate a sectional riding route between the route start point and the route end point as well as distance values.
  • In step 202, a sectional riding route between the route start point and the route end point in an electronic map road network is calculated, and identification information is set in the sectional riding route.
  • In this step, a sectional riding route between the route start point and the route end point as well as distance values of sections of the sectional riding route may be calculated with a distance measurement algorithm based on coordinates of the route start point and the route end point. There may be multiple sectional riding routes, which means routes by taking a public transportation other than walking. The existing common public transportation means includes: taxi, bus, subway, light rail, motorcycle, civil aircraft, and the like.
  • In this step, a pick-up point of interest (POI) and a drop-off point of interest between the route start point and the route end point in the electronic map road network may be calculated by using a shortest path algorithm; and then the sectional riding route between the route start point and the route end point is determined according to the calculated pick-up point of interest and drop-off point of interest.
  • After determining the sectional riding route (including bus or metro route information), the information of the sectional riding route may be stored in a preset data structure, for example, stored by using a linked list. The storage structure may include a POI at the route start point, a POI at a pick-up station of the first section of the riding route, and a POI at a drop-off station of the first section of the riding route, and so forth until a POI at a pick-up station of the Nth section of the riding route and a POI at a drop-off station of the Nth section of the riding route as well as a POI at the route end point.
  • There are many algorithms for calculating a riding route and a distance between two points in an electronic map. Generally, a shortest path algorithm is used to calculate a route. Currently, the most commonly-used shortest path algorithms include a Dijkstra's algorithm, an A* algorithm, an SPFA algorithm, a Bellman-Ford algorithm, and a Floyd-Warshall algorithm, and the like.
  • For example, in this embodiment of the present disclosure, the Dijkstra's algorithm may be used for calculation. The Dijkstra's algorithm is a typical shortest path algorithm, which is used to calculate the shortest path from a point to another point, with a main characteristic of extending toward an outer layer with a start point as a center until extending to an end point. The Dijkstra's algorithm may be used to obtain an optimal solution of the shortest path.
  • Although some path algorithms are specifically listed as above, a person skilled in the art may recognize that, the path algorithms listed are merely for exemplary purposes, but are not intended to limit the protection scope of the embodiments of the present disclosure.
  • In some cases, a user may stop over on the way of walking, and preferably in step 201, a stopover point is further set, and the stopover point is introduced into an electronic map road network, that is, a correspondence between the stopover point and a coordinate in the electronic map road network is established. In this case, step 202 may include: calculating a riding route from the route start point to the stopover point in the electronic map road network, and calculating a riding route between the stopover point and the route end point.
  • If a user changes a stopover point, the stopover point may be updated on the electronic map in a manner of dragging, and then the updated stopover point is introduced into the electronic map road network.
  • In this case, step 202 may include: presenting on the electronic map a riding route from the route start point to the updated stopover point and then to the route end point as well as a distance value.
  • In an embodiment, there may be multiple stopover points. In this case, a riding route and a distance value may be calculated according to a sequence of the stopover points that are preset by a user. Specifically, the above shortest path algorithm may also be used to calculate the riding route between the stopover points and distance value.
  • Similar to the manner of changing a stopover point, the route start point or the route end point may also be changed directly in a manner of dragging on the electronic map. Specifically, after the route start point or the route end point is changed on the electronic map, the updated route start point or the updated route end point is introduced into the electronic map road network, and an updated riding route and distance value continue to be calculated by using the distance measurement algorithm.
  • In an embodiment of the present disclosure, identification information is set in each sectional riding route, where the identification information is used for identifying each sectional riding route. For example, the first sectional riding route from the route start point is identified as 1, the second sectional riding route from the route start point is identified as 2, and in turn, the N-th sectional riding route from the route start point is identified as N, and so forth. Through identifying each sectional riding route, sectional walking routes between various sectional riding routes may be easily identified, so that the sectional riding routes and the sectional walking routes may be integrated into an integrated traffic route according to a correct sequence.
  • In step 203, a sectional walking route corresponding to the sectional riding route in the electronic map road network is calculated, the sectional walking route and the sectional riding route are integrated into a traffic route according to the identification information, display the traffic route is displayed.
  • After the sectional riding route is calculated, a sectional walking route (including a route from the route start point to the first pick-up point of the riding route, and a route from the last drop-off point of the riding route to the route end point) corresponding to the sectional riding route is further calculated.
  • In this step, a walking start point of interest and a walking end point of interest may be determined according to the route start point, route end point, and sectional riding route; and a shortest path algorithm may be used to determine the sectional walking route corresponding to the sectional riding route according to the walking start point of interest and the walking end point of interest. For example, walking information of a POI from the route start point to a pick-up station of the first section of the riding route may be first calculated; then walking information of a POI from a drop-off station of the first section of the riding route to a pick-up station of the second section of the riding route may be calculated; and so forth, until walking information of a POI from a drop-off station of the N-th section of the riding route to the route end point is calculated.
  • For calculation of the sectional walking route, a start point and an end point of each sectional walking route, an adjacency matrix of a turning point and a process of storing of searching traffic routes are initialized. It is then determined whether the start point and the end point are valid, that is, whether the start point and the end point are already present in a database of existing route points. If valid, the start point is set to be the first point, and an adjacency matrix of the first point is used to search for all turning points, which are linked in sequence; then, all turning points of points in the link are searched for in turn, and characteristics of the turning points are determined; finally, all the points in the link are searched for and traversed in a reverse order of parent points until the end point, so as to output a walking path from the start point to the end point.
  • In an embodiment, a sectional walking route corresponding to a sectional riding route is determined according to the identification information of the sectional riding route; and the sectional riding route is integrated with the corresponding sectional walking route, to form a traffic route.
  • For example, if the first sectional riding route from the route start point is identified as 1, a sectional walking route corresponding to the route identification is from the route start point to a pick-up point of the first sectional riding route; if the second sectional riding route from the route start point is identified as 2, a sectional walking route corresponding to the route identification is from a drop-off point of the first sectional riding route to a pick-up point of the second sectional riding route; and so forth.
  • A process of integrating the sectional riding route and the sectional walking route may include: firstly reading sectional data from the sectional riding route through traversal, then determining, through traversal, whether each of the sectional data is information of a route from the start point to a pick-up station of the first section, a route from a drop-off station of the first section to a pick-up station of the N-th section, or a route from a drop-off station of the Nth section to the end point. And if yes, searching for, according to the identification information of each section, walking route information corresponding to each of the sectional data from sectional walking route data; then placing the walking route information behind data of the corresponding section in sectional riding route information, and forming a new data structure by using location identification of the corresponding section; and returning the new data including the sectional riding route and sectional walking route to the terminal, so that the terminal displays, according to the data structure, the sectional walking route briefly or in detail based on displaying of the sectional riding route information. When there is less display space of a page, a brief display manner may be used, that is, only brief information is displayed on the page; and when a user needs to view a detailed content, the user unfold the brief information through an operation, to view all detailed content. After viewing, the user may further fold the displayed detailed content, so as to save the display space. For example, a user may unfold or fold a foldable portion through a mouse click operation.
  • In an embodiment, displaying the traffic route includes: displaying the sectional walking route in the traffic route briefly, or displaying the sectional walking route in the traffic route in detail; or displaying the sectional riding route in the traffic route briefly, or displaying the sectional riding route in the traffic route in detail.
  • After calculating a traffic route between the route start point and the route end point as well as a distance value of the traffic route, the traffic route and the distance value of the traffic route may be shown in an electronic map in many manners. For example, a highlighting manner may be used to display the traffic route, or the distance value of the traffic route is displayed in a prompt dialog box.
  • FIG. 3 is a schematic diagram of displaying a traffic route in an electronic map according to an embodiment of the present disclosure.
  • From FIG. 3, it can be seen that in this embodiment of the present disclosure, detailed information of three sectional walking routes are added to the electronic map, the three sectional walking routes include the walking routes of walking to a bus or metro station, walking to a transfer station, and walking to a destination after getting off from a bus or metro train (as shown in walking information 1, 2, and 3 in FIG. 3).
  • In FIG. 3, the walking information 1 and 2 includes more detailed information, and a brief display manner is used to reduce occupied page space, which is represented by a drop-down arrow “V” on the right. After a user clicks the drop-down arrow, more details may be unfolded and displayed. As shown in FIG. 3, detailed walking information 11 and 12 is detailed information of the walking information 1, and detailed walking information 21 and 22 is detailed information of the walking information 2. The walking information 3 does not include details, and therefore there is no drop-down arrow on the right. The user can directly access the map by clicking the walking information 3.
  • FIG. 4 is a schematic diagram of displaying a traffic route in an electronic map according to another embodiment of the present disclosure. In FIG. 4, a button 401 used to unfold or fold walking details is added. A user can unfold or fold all the walking details through clicking the button 401.
  • According to an embodiment of the present disclosure, it is further provided an apparatus for determining a traffic route in an electronic map.
  • FIG. 5 is a structural diagram of an apparatus for determining a traffic route in an electronic map according to an embodiment of the present disclosure.
  • As shown in FIG. 5, the apparatus includes: one or more processors 510, and a memory 520, where the memory 520 has multiple instruction units stored therein that are executable by the processor 510, and the multiple instruction units include:
      • a point determining unit 501, a sectional riding route determining unit 502, and a sectional walking route determining unit 503; where:
      • the point determining unit 501 is configured to determine a route start point and a route end point;
      • the sectional riding route determining unit 502 is configured to calculate a sectional riding route between the route start point and the route end point in an electronic map road network, and set identification information in the sectional riding route; and
      • the sectional walking route determining unit 503 is configured to calculate a sectional walking route from the sectional riding route in the electronic map road network, integrate the sectional walking route and the sectional riding route into a traffic route according to the identification information, and display the traffic route.
  • In an embodiment, the sectional walking route determining unit 503 is configured to display the sectional walking route in the traffic route briefly, or display the sectional walking route in the traffic route in detail; or display the sectional riding route in the traffic route briefly, or display the sectional riding route in the traffic route in detail.
  • The sectional riding route determining unit 502 may calculate a pick-up point of interest and a drop-off point of interest between the route start point and the route end point by using a shortest path algorithm; and determine the sectional riding route between the route start point and the route end point according to the calculated pick-up point of interest and drop-off point of interest.
  • In an embodiment, the sectional walking route determining unit 503 is configured to determine a walking start point of interest and a walking end point of interest according to the route start point, route end point, and sectional riding route; and determine, according to the walking start point of interest and the walking end point of interest, the sectional walking route between the sectional riding routes by using a shortest path algorithm.
  • In an embodiment, the sectional walking route determining unit 503 is configured to determine, according to identification information of each sectional riding route, a sectional walking route corresponding to each sectional riding route; and integrate each sectional riding route and the corresponding sectional walking route, to form the traffic route.
  • In fact, an apparatus for determining a traffic route in an electronic map provided in this embodiment of the present disclosure may be specifically implemented in many forms. For example, a plug-in program installed in an electronic map may be written by using an application programming interface that conforms to a particular specification, or an application program may be encapsulated for download and use by a user. When a plug-in program is written, the plug-in program may be implemented in many plug-in forms such as ocx, dll, and cab. The apparatus for determining a traffic route in an electronic map provided in this embodiment of the present disclosure may also be implemented by a Flash plug-in, a RealPlayer plug-in, an MMS plug-in, a MIDI plug-in, an ActiveX plug-in and other specific technologies.
  • The memory 520 may include, but is not limited to, a floppy disk, an optical disc, a DVD, a hard disk, a flash memory, a USB flash disk, a CF card, an SD card, an MMC card, an SM card, a memory stick, an xD card, and the like.
  • In conclusion, in the embodiments of the present disclosure, a route start point and a route end point are determined; a sectional riding route between the route start point and the route end point is calculated in an electronic map road network, and identification information is set in the sectional riding route; and a sectional walking route from the sectional riding route is calculated in the electronic map road network, the sectional walking route and the sectional riding route are integrated into a traffic route according to the identification information, and the traffic route is displayed. It can be seen that, with the embodiments of the present disclosure, a walking route result can be integrated into a bus or metro riding route result for presentation. According to the embodiments of the present disclosure, a user is provided with detailed and abundant walking route indication information, thereby improving a matching rate of a traffic route in an electronic map.
  • Additionally, the embodiments of the present disclosure may be applied in various terminals, and may also be used across platforms and terminals. The application scope is very wide.
  • It may be understood that the embodiments of the disclosure for determining a traffic route in an electronic map may be embodied as computer instruction stored in a computer readable medium, when executed by one or more processors on a server, may cause the server to execute the steps in the described method or performing the functions by the server. The computer instructions may be stored in a memory (e.g., a computer-readable storage medium, such as a hard disk, an optical disk, a solid state memory such as a flash memory) on a server, or in a cloud memory accessed via an Internet connection. The computer instructions may be hardware program codes modules constituted as logic gates microcodes within a ROM, a processor or a controller, or as functional modules constituted by both software/hardware together.
  • The above descriptions merely show preferred embodiments of the present disclosure, but are not intended to limit the present disclosure. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present disclosure shall fall within the protection scope of the present disclosure.

Claims (15)

What is claimed is:
1. A method for determining a traffic route in an electronic map, comprising:
determining by a server that includes a processor, a route start point and a route end point entered through a terminal device that includes a processor, wherein the terminal communicates to the server through a network connection;
calculating by the server, a sectional riding route between the route start point and the route end point in an electronic map road network, and setting identification information in the sectional riding route; and
calculating by the server, a sectional walking route corresponding to the sectional riding route in the electronic map road network, integrating the sectional walking route and the sectional riding route into a traffic route according to the identification information of the sectional riding route, and
displaying the traffic route on the terminal device.
2. The method for determining a traffic route in an electronic map according to claim 1, wherein the displaying of the traffic route on the terminal device, comprises:
displaying the sectional walking route in the traffic route briefly, or displaying the sectional walking route in the traffic route in detail; or
displaying the sectional riding route in the traffic route briefly, or displaying the sectional riding route in the traffic route in detail.
3. The method for determining a traffic route in an electronic map according to claim 1, wherein the calculating of the sectional riding route between the route start point and the route end point, comprises the server:
calculating a pick-up point of interest and a drop-off point of interest between the route start point and the route end point in the electronic map road network by using a shortest path algorithm; and
determining the sectional riding route between the route start point and the route end point according to the calculated pick-up point of interest and drop-off point of interest.
4. The method for determining a traffic route in an electronic map according to claim 1, wherein the calculating of the sectional walking route corresponding to the sectional riding route in the electronic map road network, comprises the server:
determining a walking start point of interest and a walking end point of interest according to the route start point, the route end point, and the sectional riding route; and
determining, according to the walking start point of interest and the walking end point of interest, the sectional walking route corresponding to the sectional riding route by using a shortest path algorithm.
5. The method for determining a traffic route in an electronic map according to claim 1, wherein the integrating of the sectional walking route and the sectional riding route into a traffic route according to the identification information of the sectional riding route, comprises the server:
determining, according to the identification information of the sectional riding route, the sectional walking route corresponding to the sectional riding route; and
integrating the sectional riding route and the sectional walking route, to form the traffic route.
6. An apparatus for determining a traffic route in an electronic map, wherein the apparatus comprises one or more processors and a memory having processor-executable instructions stored therein, and the instructions when executed by one or more processors, configures the apparatus to:
determine a route start point and a route end point entered through a terminal device that includes a processor, wherein the terminal communicates to the apparatus through a network connection;
calculate a sectional riding route between the route start point and the route end point in an electronic map road network, and set identification information in the sectional riding route; and
calculate a sectional walking route corresponding to the sectional riding route in the electronic map road network, integrate the sectional walking route and the sectional riding route into a traffic route according to the identification information of the sectional riding route, and display the traffic route on the terminal device.
7. The apparatus for determining a traffic route in an electronic map according to claim 6, wherein the apparatus is further configured to display one or more of the following on the terminal device:
display the sectional walking route in the traffic route briefly,
display the sectional walking route in the traffic route in detail;
display the sectional riding route in the traffic route briefly, and
display the sectional riding route in the traffic route in detail.
8. The apparatus for determining a traffic route in an electronic map according to claim 6, wherein the apparatus is further configured to:
calculate a pick-up point of interest and a drop-off point of interest between the route start point and the route end point in the electronic map road network by using a shortest path algorithm; and
determine the sectional riding route between the route start point and the route end point according to the calculated pick-up point of interest and drop-off point of interest.
9. The apparatus for determining a traffic route in an electronic map according to claim 6, wherein the apparatus is further configured to:
determine a walking start point of interest and a walking end point of interest according to the route start point, the route end point, and the sectional riding route; and
determine, according to the walking start point of interest and the walking end point of interest, the sectional walking route corresponding to the sectional riding route by using a shortest path algorithm.
10. The apparatus for determining a traffic route in an electronic map according to claim 6, wherein the apparatus is further configured to:
determine, according to the identification information of the sectional riding route, the sectional walking route corresponding to the sectional riding route; and
integrate the sectional riding route and the corresponding sectional walking route, to form the traffic route.
11. A non-volatile computer-readable storage medium, comprising computer instructions stored there-on, wherein the computer instruction being executable by one or more processors on a server to cause the server to execute the following operations:
determining a route start point and a route end point entered through a terminal device that includes a processor, wherein the terminal communicates to the server through a network connection;
calculating a sectional riding route between the route start point and the route end point in an electronic map road network, and setting identification information in the sectional riding route; and
calculating a sectional walking route corresponding to the sectional riding route in the electronic map road network, integrating the sectional walking route and the sectional riding route into a traffic route according to the identification information of the sectional riding route, and displaying the traffic route on the terminal device.
12. The storage medium according to claim 11, wherein the displaying of the traffic route on the terminal device, comprises:
displaying the sectional walking route in the traffic route briefly, or displaying the sectional walking route in the traffic route in detail; or
displaying the sectional riding route in the traffic route briefly, or displaying the sectional riding route in the traffic route in detail.
13. The storage medium according to claim 11, wherein the calculating of the sectional riding route between the route start point and the route end point, comprises causing the server:
calculating a pick-up point of interest and a drop-off point of interest between the route start point and the route end point in the electronic map road network by using a shortest path algorithm; and
determining a sectional riding route between the route start point and the route end point according to the calculated pick-up point of interest and drop-off point of interest.
14. The storage medium according to claim 11, wherein the calculating of the sectional walking route from the sectional riding route in the electronic map road network, comprises causing the server:
determining a walking start point of interest and a walking end point of interest according to the route start point, the route end point, and the sectional riding route; and
determining, according to the walking start point of interest and the walking end point of interest, the sectional walking route corresponding to the sectional riding route by using a shortest path algorithm.
15. The storage medium according to claim 11, wherein the integrating of the sectional walking route and the sectional riding route into a traffic route according to the identification information of the sectional riding route, comprises causing the server:
determining, according to the identification information of the sectional riding route, the sectional walking route corresponding to the sectional riding route; and
integrating the sectional riding route and the sectional walking route, to form a traffic route.
US14/742,315 2012-12-25 2015-06-17 Method and apparatus for determining traffic route in electronic map Abandoned US20150285649A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
CN201210570511.8 2012-12-25
CN201210570511.8A CN103900584A (en) 2012-12-25 2012-12-25 Electronic map traffic route determination method and apparatus
PCT/CN2013/088278 WO2014101628A1 (en) 2012-12-25 2013-12-02 Method and device for determining traffic route of electronic map

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/088278 Continuation WO2014101628A1 (en) 2012-12-25 2013-12-02 Method and device for determining traffic route of electronic map

Publications (1)

Publication Number Publication Date
US20150285649A1 true US20150285649A1 (en) 2015-10-08

Family

ID=50992053

Family Applications (1)

Application Number Title Priority Date Filing Date
US14/742,315 Abandoned US20150285649A1 (en) 2012-12-25 2015-06-17 Method and apparatus for determining traffic route in electronic map

Country Status (3)

Country Link
US (1) US20150285649A1 (en)
CN (1) CN103900584A (en)
WO (1) WO2014101628A1 (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160069696A1 (en) * 2014-08-21 2016-03-10 Microsoft Technology Licensing, Llc Multimode transportation transitions
US10060752B2 (en) 2016-06-23 2018-08-28 Microsoft Technology Licensing, Llc Detecting deviation from planned public transit route
US10337876B2 (en) 2016-05-10 2019-07-02 Microsoft Technology Licensing, Llc Constrained-transportation directions
US10386197B2 (en) 2016-05-17 2019-08-20 Microsoft Technology Licensing, Llc Calculating an optimal route based on specified intermediate stops
WO2019155263A3 (en) * 2018-02-10 2020-03-19 سيد أحمد محمد، Wireless road
CN111854768A (en) * 2020-03-05 2020-10-30 北京嘀嘀无限科技发展有限公司 Method and system for determining map route, terminal, and computer-readable storage medium
CN114285030A (en) * 2021-12-20 2022-04-05 广东电网有限责任公司 Power grid map-based power failure and recovery station area display method, device and system
EP4081759A4 (en) * 2019-12-27 2023-10-25 INTEL Corporation Device and method for route planning

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104977008A (en) * 2014-04-09 2015-10-14 广东融讯信息科技有限公司 Navigation system achieving self-driving and bus seamless connection
CN106153066A (en) * 2015-04-28 2016-11-23 高德软件有限公司 A kind of air navigation aid and device
CN104990551A (en) * 2015-06-19 2015-10-21 中国人民解放军国防科学技术大学 Indoor and outdoor co-navigation method and system based on trajectory extraction
CN105096637B (en) * 2015-09-07 2018-09-07 百度在线网络技术(北京)有限公司 Navigation information acquisition method based on public transport and device
CN105973250A (en) * 2016-04-28 2016-09-28 华南理工大学 Two-dimensional bar code-based large hub path induction assisting method
CN107844842A (en) * 2016-09-21 2018-03-27 北京嘀嘀无限科技发展有限公司 One kind uses car order processing method and server
CN108120444B (en) * 2016-11-29 2020-05-08 高德信息技术有限公司 Electronic map data processing method and device
CN111397628B (en) * 2020-04-03 2022-07-29 腾讯科技(深圳)有限公司 Navigation method, navigation device, computer equipment and storage medium
CN112034850A (en) * 2020-09-01 2020-12-04 青岛悟牛智能科技有限公司 Method for realizing unmanned production of farm
CN112288185B (en) * 2020-11-13 2023-07-25 腾讯科技(深圳)有限公司 Traffic route display method, device, equipment and computer readable storage medium
CN113155139B (en) * 2021-06-28 2021-11-16 中移(上海)信息通信科技有限公司 Vehicle track deviation rectifying method and device and electronic equipment

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010025222A1 (en) * 1999-01-19 2001-09-27 Bechtolsheim Stephan V. Method and system for providing walking instructions with route guidance in a navigation program
US20050021227A1 (en) * 2003-06-06 2005-01-27 Shuichi Matsumoto Navigation apparatus
US20090119001A1 (en) * 2007-11-07 2009-05-07 Public Routes. Com, Llc Method and system for finding multimodal transit route directions based on user preferred transport modes
US20090177387A1 (en) * 2008-01-07 2009-07-09 Mitac International Corp. Method of planning pedestrian navigation route
US20100153004A1 (en) * 2007-05-23 2010-06-17 Navitime Japan Co., Ltd. Navigation system, route retrieval server and mobile terminal device, and route guiding method
US7957871B1 (en) * 2005-09-29 2011-06-07 Hopstop.com, Inc. Methods and apparatuses for navigation in urban environments
US8977495B1 (en) * 2011-10-27 2015-03-10 Google Inc. Time independent transit routing

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB0215217D0 (en) * 2002-06-29 2002-08-14 Spenwill Ltd Position referenced multimedia authoring and playback
JP3924683B2 (en) * 2003-10-02 2007-06-06 株式会社ナビタイムジャパン Navigation device, navigation method and program
JP2005127725A (en) * 2003-10-21 2005-05-19 Navitime Japan Co Ltd Navigation system, navigation method, and program
US7706973B2 (en) * 2006-01-03 2010-04-27 Navitrail Llc Computer-aided route selection
CN101275855A (en) * 2007-03-28 2008-10-01 阿尔派电子(中国)有限公司 Navigation circuit groping method of vehicle mounted navigation apparatus
CN101526356A (en) * 2008-03-07 2009-09-09 佛山市顺德区顺达电脑厂有限公司 Method for programming pedestrian navigation path
WO2009157069A1 (en) * 2008-06-25 2009-12-30 株式会社ナビタイムジャパン Route searching apparatus and route searching method
CN101566482B (en) * 2009-06-15 2011-12-28 江苏新科软件有限公司 Navigation apparatus for foot passengers
CN101634570A (en) * 2009-07-31 2010-01-27 深圳市凯立德计算机***技术有限公司 GPS navigation system and navigation method used by same
CN101995256A (en) * 2009-08-11 2011-03-30 宏达国际电子股份有限公司 Route planning method and device and computer program product used thereby
CN101769749B (en) * 2010-02-01 2014-06-04 深圳市凯立德科技股份有限公司 Navigation method and device

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010025222A1 (en) * 1999-01-19 2001-09-27 Bechtolsheim Stephan V. Method and system for providing walking instructions with route guidance in a navigation program
US6374182B2 (en) * 1999-01-19 2002-04-16 Navigation Technologies Corp. Method and system for providing walking instructions with route guidance in a navigation program
US20050021227A1 (en) * 2003-06-06 2005-01-27 Shuichi Matsumoto Navigation apparatus
US7957871B1 (en) * 2005-09-29 2011-06-07 Hopstop.com, Inc. Methods and apparatuses for navigation in urban environments
US20100153004A1 (en) * 2007-05-23 2010-06-17 Navitime Japan Co., Ltd. Navigation system, route retrieval server and mobile terminal device, and route guiding method
US20090119001A1 (en) * 2007-11-07 2009-05-07 Public Routes. Com, Llc Method and system for finding multimodal transit route directions based on user preferred transport modes
US20090177387A1 (en) * 2008-01-07 2009-07-09 Mitac International Corp. Method of planning pedestrian navigation route
US8977495B1 (en) * 2011-10-27 2015-03-10 Google Inc. Time independent transit routing

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160069696A1 (en) * 2014-08-21 2016-03-10 Microsoft Technology Licensing, Llc Multimode transportation transitions
US10337876B2 (en) 2016-05-10 2019-07-02 Microsoft Technology Licensing, Llc Constrained-transportation directions
US10386197B2 (en) 2016-05-17 2019-08-20 Microsoft Technology Licensing, Llc Calculating an optimal route based on specified intermediate stops
US10060752B2 (en) 2016-06-23 2018-08-28 Microsoft Technology Licensing, Llc Detecting deviation from planned public transit route
WO2019155263A3 (en) * 2018-02-10 2020-03-19 سيد أحمد محمد، Wireless road
EP4081759A4 (en) * 2019-12-27 2023-10-25 INTEL Corporation Device and method for route planning
US11940287B2 (en) 2019-12-27 2024-03-26 Intel Corporation Device and method for route planning
CN111854768A (en) * 2020-03-05 2020-10-30 北京嘀嘀无限科技发展有限公司 Method and system for determining map route, terminal, and computer-readable storage medium
CN114285030A (en) * 2021-12-20 2022-04-05 广东电网有限责任公司 Power grid map-based power failure and recovery station area display method, device and system

Also Published As

Publication number Publication date
CN103900584A (en) 2014-07-02
WO2014101628A1 (en) 2014-07-03

Similar Documents

Publication Publication Date Title
US20150285649A1 (en) Method and apparatus for determining traffic route in electronic map
US20210318131A1 (en) Systems and methods for providing mobile mapping services including trip prediction and route recommendation
US10140856B2 (en) Automatic detection of lane closures using probe data
AU2014244449B2 (en) Determining an amount for a toll based on location data points provided by a computing device
US20140188788A1 (en) Multi-modal journey planner
US11170138B2 (en) Geographic position calculation for sign placement based on destination profiling of probe data
US20140156189A1 (en) Personalized Map Routes
US20180017396A1 (en) Map having computer executable instructions embedded therein
US9726507B2 (en) Route calculation system, route calculation method, and route calculation program
CN106595682A (en) Differential updating method and system of map data, and server
US11624626B2 (en) Method, apparatus and computer program product for using a location graph to enable natural guidance
US10900804B2 (en) Methods and systems for roadwork extension identification using speed funnels
US11248929B2 (en) Methods and systems for chronicled history information in a map
US20170268894A1 (en) Predicting short term travel behavior with unknown destination
US20210123748A1 (en) Detecting defects in map data
US20200363217A1 (en) Systems, methods, and a computer program product for updating map data
CN106595681A (en) Differential updating method for path data, system and server
US11262209B2 (en) Methods and systems for road work extension identification
US20150160036A1 (en) Electronic map distance measurement method and device
US20190390972A1 (en) Polyline matching to map data for routing a trip
JP6164854B2 (en) Map data generation method and computer program
JP6270751B2 (en) Navigation device and navigation method
JP6419603B2 (en) Information processing device, position display system
US20180259346A1 (en) Vehicle display device, display method and display program
JP6581878B2 (en) Navigation system, information processing apparatus, program

Legal Events

Date Code Title Description
AS Assignment

Owner name: TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED, CHI

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ZHANG, XIANXIN;ZHOU, KANG;LU, HAIBO;AND OTHERS;REEL/FRAME:035924/0560

Effective date: 20150617

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION