WO2016195667A1 - E-car trip planner - Google Patents

E-car trip planner Download PDF

Info

Publication number
WO2016195667A1
WO2016195667A1 PCT/US2015/033856 US2015033856W WO2016195667A1 WO 2016195667 A1 WO2016195667 A1 WO 2016195667A1 US 2015033856 W US2015033856 W US 2015033856W WO 2016195667 A1 WO2016195667 A1 WO 2016195667A1
Authority
WO
WIPO (PCT)
Prior art keywords
graph
route
nodes
data structure
data
Prior art date
Application number
PCT/US2015/033856
Other languages
French (fr)
Inventor
Reginald K. PUANA, Jr.
Original Assignee
Puana Reginald K Jr
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 Puana Reginald K Jr filed Critical Puana Reginald K Jr
Priority to PCT/US2015/033856 priority Critical patent/WO2016195667A1/en
Publication of WO2016195667A1 publication Critical patent/WO2016195667A1/en

Links

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/3453Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3492Special cost functions, i.e. other than distance or default speed limit of road segments employing speed data or traffic data, e.g. real-time or historical
    • 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

Abstract

The disclosed herein is a computer-implemented route planning method which comprises of determining source and destination nodes in a graph data structure based on a route planning query, wherein the graph data structure represents a road network, identifying a plurality of locations on the road network for refilling or recharging of a vehicle, executing an initial graph search on the graph data structure using graph costs based on real-time traffic data, wherein the initial graph search starts at the source node and settles nodes until it stops, computing one or more routes to the destination node from one or more of said settled nodes using pre-computed data based on traffic prediction data, thereby to determine a route from the source node to the destination node via one of said settled nodes. Furthermore, the method comprises of estimating the refilling or recharging time of a vehicle while planning a route.

Description

E-CAR TRIP PLANNER
(l)FIELD OF THE INVENTION
The present invention relates to a route planning method, particularly to a method and apparatus for planning the route of an electric vehicle.
(2}BACKGROUND In recent years, developments of navigation systems for automobiles, which are generally called "car navigation systems," have become Increasingly popular- As a matter of fact, such navigation systems are now finding widespread commercial utility. A navigation system of this type Is provided with means for detecting the present position of an automobile, and means for storing road map information in a CD-ROM or the like. When the destination of the automobile (which may hereinafter be also called the "vehicle") is set by the driver, the navigation system selects the best route from the present position to the destination, and then guides the driver along the best route.
Computerized mapping systems have been developed to search for, identify, and discover information about geographic locations. One form of such computerized mapping systems includes travel-planning Internet websites. With an excess of 50 million unique monthly users, such map sites are a very popular offering. Examples of such sites include AOL's MapQuest, Yahoo's Teleontar-based maps, and Microsoft's MdpPoint.net suite. Such sites all work along the lines of $ common model, as will now be described. When a Web Msejr asks for a new map view (e.g., by entering a postal address, or by clicking a navigation link next to a current map view), the user's Web browser sends a request indicating the boundaries of the new map view to a Web server. The Web server, in turn, extracts the corresponding vector-based map data from a database, and draws a bitmap image of the map. The server then converts the bitmap to an image format that is supported by the user's Web browser and returns the image, sometimes embedded in HTML, to the user's Web browser so that it can be displayed. Other map Web sites, such as Britain's MuWMaps or Australia's Wherels, utilize a raster- based map database instead. In these cases, it is not necessary to extract vectors and draw a map image. Rather, these functions are replaced by simply extracting the appropriate part of a larger, pre-rendered image.
For the detection of the present position of the vehicle, (Global Positioning System) navigation or an autonomous navigation is generally used. With the GPS navigation, for example, a navigation system receives radio waves (GPS information) that are transmitted from plural (three or more) satellites and, based on this GPS information, detects the present position of the automobile;, in combination with the above-described navigation, map matching, which is a method of correcting the thus- detected present position of the vehicle such that the detected present position can be correlated to a point: along a road on a map, is also practiced. This makes it possible to detect the present position of the vehicle more accurately. Such a navigation system is designed to display the present position of a vehicle, which has been detected as described above* together with the best route selected according to a destination on a screen. If a right-hand or left-hand turn is needed at an intersection or the like, the system guides accordingly by a voice before the vehicle enters the intersection, in addition, navigation systems that have been developed include those capable of estimating a time required to reach, from the present position of a. vehicle, 9 destination along the best route, and displaying the same.
Simultaneous to the developments of such navigation systems, electric automobiles; which do not emit exhaust gas, are now receiving attention again from the standpoint of protection of the global environment, With a view to enhance the utility of electric automobiles, a variety of techniques are now under development There are, however, still various problems with electric automobiles at this stage in terms of practical application.
Furthermore, computer-implemented route planning methods have also been developed. These generate a route from a start location to a destination location. Also known route planning methods have a pre-computation phase (i.e.: a computation phase prior to query time) in which map data is processed to form a graph data structure representing possible routes between locations. Costs may be assigned to arcs of the graph to apply weights based on the travel time between locations. These may take into account the distance between particular locations, the type of road, traffic conditions, and other factors that may affect travel time. Costs can alternatively or additionally be assigned to other parts of the graph, e.g.: to nodes or sub-paths.
(F) BRIEF SUMMARY OF THE INVENTION
The invention primarily is a computer-implemented route planning method that determines the source and destination nodes in a graph data structure based on a route planning query, herein the graph data Structure represents a road network, identifies a plurality of locations on the road network for refilling or recharging of a vehicle, executes an initial graph search on the graph data structure using graph costs based on real-time traffic data, wherein the initial graph search starts at the source node and settles nodes until it stops, computes one or more routes to the destination node from one or more of said settled nodes using pre-computed data based on traffic prediction data, thereby to determine a route from the source node to the destination node via one of said settled nodes.
One embodiment of the present invention can be a system that is comprised of one or more communication modules for communication with one or more client devices, a pre-computation module that is configured to generate a graph data structure based on map data, wherein the graph data structure represents a road network, and a query processing module that is configured to determine the source and destination nodes in the graph data structure based on a route planning query. The query-processing module is comprised of: a first graph search module that is configured to execute an initial graph search on the graph data structure using graph costs based on real-time traffic data. The initial graph search starts at the source: node arid settles nodes until it stops. A second graph search module is configured to compute one or more routes to the destination node from one or more of said settled nodes using pre-computed data based on traffic prediction data, thereby to determine a route from the source node to the destination node via one of said settled nodes. in yet another preferred embodiment, the invention is a machine-readable medium that is encoded with instructions. When executed by a processor, the instructions cause the processor to carry out a process for generating human-centric driving directions. The process generates a route in response to a user request for travel directions. The request specifies at least one target destination, and distinctive Waypoints along the route* The waypoints are physical structures along the route/ including road names and road topology. Each waypotnt is associated with a distinctiveness score, wherein the distinctiveness score of each waypoirit is based at least in part on a visual prominence of the respective vfaypoint, and based at Least in part on an advertising fee per use for incorporating the respective waypoint in travel directions and incorporating one or more of the waypoints into travel directions responsive to the associated distinctiveness score.
Furthermore* the computer-implemented route planning method has a blending phase between the real-time traffic data and the traffic prediction data. It also includes an estimation of the refilling or recharging time of a vehicle while planning a route.
The summary is provided to introduce a selection of concepts, in a simplified form, that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the subject matter, nor is it intended to be used as an aid in determining the scope of the subject matter, in this respect, before explaining at least one embodiment of the invention in detail, it is to be understood that the invention is not limited in its application to the details of construction and to the arrangements of the components set forth in the following description or illustrated in the drawings. The invention is capable of other embodiments, and of being practiced and carried out in various: ways. Also, it is to be understood that the phraseology and terminology employed herein are for the purpose of description, and should not be regarded as limiting. These, together with other objectives of the invention and the various features of novelty that characterize the invention, are pointed out with particularity in the disclosure. For a better understanding of the invention, its operating advantages, and the specific objectives attained by its uses, reference should be had to the accompanying drawings and descriptive matter, in Which there are illustrated preferred embodiments of the invention. (G) BRIEF DESCRIPTION OF THE DRAWINGS
The drawings, constitute a part of this specification and include exemplary embodiments to the invention, which may he embodied in various forms. It is to be understood that in some instances various aspects of the invention may be shown exaggerated or enlarged to facilitate an understanding of the invention.
Figure.l illustrates the various components of the invention. (H) DETAILED DESCRIPTIONS OF THE INVENTION
The following is a detailed description of example embodiments of the invention depicted in the accompanying drawings. The example embodiments are in such detail as to clearly communicate the invention. However, the amount of detail offered is not intended to limit the anticipated variations of embodiments. On the contrary, the intention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the present Invention. The detailed descriptions below are designed to make such embodiments obvious to a person of ordinary skill in the art.
The present invention as shown on Fig. 1 can be implemented on any communication device that has hardware components that can perform wireless and wired communication, such as (but not limited to) - multi-purpose pocket computers, personal multimedia devices, etc.
The various devices on which the applications that implement the present invention run may use one or more processors with different instruction-sets, architectures, clock-speeds, etc and memory that may include high speed random access memory, and may include non-volatile memory, such as one or more magnetic disk storage devices, flash memory devices and other kinds of solid state memory devices. the various applications that can implement the present invention run on electronic devices that may use at least one physical user interface device that provide the means of control and navigation within the operating system. Applications that run on the devices include (but not limited to ) touch-pads, such as those described in (but not limited to) - (1) U.S. patent application No. Application number: lQ/722>948 (Touch pad for handheld device", filed Nov 25, 2003) ;{2} U.S. patent application No. Application number: 10/188,182 (Touch pad for handheld device", filed Mar 21, 2006) ;(3) UJS. patent application No: 08/210,610 ("Computer system with touchpad support in operating system", filed March 18, 1994); {4>U.S. patent application No.643,256("Movable touch pad with added functionality", filed 10/643,256), touch screens, such as those described in(but riot limited to) (1) U.S. patent application Ser. No. 11/381,313, "Multipoint Touch Surface Controller/ filep* on May 2. 2006 ;(2) UJS. patent application Ser, No. 10/840,862, "Multipoint Touchscreen/' filed on May 6, 2004 ;(3) U.S. patent application Ser, No, 10/903,964,'Gesture? For Touch Sensitive Input Devices," filed on Jul. 30, 2004; (4) U.S. patent application Ser. No. 11/048,264, "Gestures For Touch Sensitive Input Devices," filed on Jan. 31, 2005 ; (5) U.S. patent application Ser. No. 11/038,590, "Mode-Based Graphical User interfaces For Touch Sensitive Input Devices," filed on Jan. 18, 2005 ;{6) U.S. patent application Ser, No. 11/228,758, "Virtual Input Device Placement On A Touch Screen User Interface," filed on Sep. 16, 2005 ;{7) US, patent application Ser. Mo. 11/228,700, "Operation Of A Computer With A Touch Screen Interface,0 filed on Sep. 16, 2005 ;(8) U.S. patent application Ser, No. 11/228,737, "Activating Virtual Keys Of A Touch-Screen Virtual Keyboard," filed on Sep. 16, 2005 and (9) U-S. patent application Ser. No. 11/367,749, "Multi-Functionai Hand-Held Device," filed on Mar, 3, 2006, click wheel such as those described in U.S. patent application Ser. No. 11/549,619 "Method, device, and graphical user interface for dialing with a dick wheel* filed oft Oct 13, 2006 , keyboards such as those mentioned in(but not limited to) U.S, patent application number 07/711,760 ("Ergonomic keyboard input device" , filed on June 6, 1991) , mouse such as those described in (but not limited to) (l)Application number: 09/167,314 { "Computer mouse with enhance control button (s) * filed oh October §, 1998 (2)Application number: 08/288,945("Ro!ler mouse for implementing fcrolliri^ in windows applications "filed on August 10, 1994) and gesture recognition means such as those described in(but not limited to} (1) European Patent application publication number: EP2482176 A2 ("Mult*- input gesture control for a display screen", filed on Nov 4, 2011) and{2) UJS. patent application with publication number 20120317511 Al ("DISPLAY WITH BUILT IN 3D SENSING CAPABILITY AND GESTURE CONTROL OF TV, filed on August 21,2012).
Display means used by these devices may use LCD (liquid crystal display) technology, LED (light Emitting Diode) technology, CRT (Cathode ray tube) technology, LPD (light emitting polymer) technology, or any other display technologies. Various realizations of graphics display circuitry that implement a Graphics Processing Unit (GPU) are used to achieve video interface between the user and these electronic devices.
Connectivity of these devices with networks, such as the internet, an intranet and/or wireless network such as cellular telephone network, a wired or wireless local area network (LAN) and/or metropolitan area network (MAN) and/or WAN (wide area network) and other wireless communication is achieved by use of a plurality of communication standards, protocols, and technologies, such as Bluetooth, Wireless Fidelity (Wi-Fi) and/or any other suitable communication protocol, including communication protocols not yet developed as of the filing date of this document.
The present invention maybe implemented on applications that run on a single or variety of operating system platforms, including but not limited to OS X, WINDOWS, UNIX, IOS, ANDROID, SYMBIAN, LINUX, or embedded operating systems, such as VxWorks. The present invention may also be implemented to work with Various web browsers, including but hot limited to Internet Explorer, Mozitla Firefox, Safari, and Opera that access and handle various types of web pages constructed with various mark- up languages, such as HTML, HTML-5, XHTML, XML, etc, and the associated CSS (cascading style sheet) files and Jaya-script files.
A route planning system and methodology is provided that efficiently computes optimal routes between locations whilst taking into account real-time traffic data, in an embodiment an initial graph search is carried out using graph costs that are based on real-time traffic data. The initial graph search Is stopped when the search is beyond an initial part within. Real-time traffic data is considered relevant. Pre-computed data that is based on traffic prediction data is then used to calculate the shortest paths to the destination node from each of the nodes at which tire initial graph search was stopped. The best of these paths is selected as the optimal route.
The initial graph search is stopped based on a preset condition, which is set based on the observation that real-time traffic data is only good to use for some time {e,g: 30 minutes in the future). Pre-computed data based on traffic prediction data available at pre-cpmputatlon time is then used for the later part of the route.
Thus, the invention is a computer-implemented route planning method that includes determining source and destination nodes in a graph data structure based on a route planning query, wherein the graph data structure represents a road network, identifying a plurality of locations on the road network for refilling or recharging of a vehicle, executing an Initial graph search on the graph data structure using graph costs based on real-time traffic data, wherein the initial graph search starts at the source node and settles nodes until it stops, computing one or more routes to the destination node from one or more of said settled nodes using pre-computed data based on traffic prediction data, and thereby determining a route from the source node to the destination node via one of said settled nodes.
In one embodiment, the present invention can be a system that is comprised of one or more communication modules for communication with one or more client devices, a pre-computation module that is configured to generate a graph data structure based on map data, wherein the graph data structure represents a road network, and a query processing module that is configured to determine source and destination nodes in the graph data structure based on $ route planning query. The query-processing module is comprised oh a first graph search module that is configured to execute an initial graph search oh the graph data structure using graph costs based on real-time traffic data, wherein the initial graph search starts at the source node and settles nodes until it stops, and a second graph search module that is configured to compute one or more routes: to the destination node from one or more of said settled nodes using precompiled data based on traffic prediction data. These determine a route from the source node to the destination node via one of said settled nodes. in yet another preferred embodiment, the invention is a machine-readable medium that is encoded with instructions that, when executed by a processor, cause the processor to carry out a process for generating humanrcentrie driving directions. The process includes generating a route in response to a user request for travel directions, the request specifying at least a target destination, identifying distinctive waypoints along the route, wherein the waypoints are physical structures along the route arid are in addition to road names and road topology and each waypoint is associated with a distinctiveness score, wherein the distinctiveness score of each waypoint is based at least in part on a visual prominence of the respective waypoint and based at least in part on an advertising fee per use for incorporating the respective waypoint in travel directions, and incorporating one or more of the waypoints into travel directions responsive to the associated distinctiveness score.
Furthermore, the computer-implemertted route planning method has a blending phase between the real-time traffic data and the traffic prediction data. It estimates the refilling or recharging time Of a vehicle while planning a route.
Although specific embodiments have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that any arrangement that is calculated to achieve the same purpose may be substituted for the specific embodiment shown, This application is intended to cover any adaptations or variations of the present invention.
Although the invention has been explained in relation to its preferred embodiment, it is to be understood that many other possible modifications and variations can be made Without departing from the spirit and scope of the invention.

Claims

CLAIMS I Claim:
1. A computer-implemented route planning method for electronic cars, comprising: determining source and destination nodes in a graph data structure based on a route planning query, wherein said graph data structure represents a road network; identifying a plurality of locations on the road network for refilling or recharging of a vehicle; executing an initial graph search on said graph data structure using graph costs based on realtime traffic data, wherein the initial graph search starts at the source node and settles nodes until it stops; and computing one or more routes: to the destination node from one or more of said settled nodes using precomputed data based on traffic prediction data, thereby to determine a route from the source node to the destination node via one of said settled nodes.
2. A computer-implemented route planning method as claimed in claim 1, wherein there is a blending phase between the real-time traffic data and the traffic prediction data.
3. A computer-implemented route planning method as claimed in claim 1 further
comprises of estimating the refilling or recharging time of a vehicle.
4. A system, comprising; one or more communication modules for communication with one or more client devices, a precomputation module configured to generate a graph data structure based on map data, wherein said graph data structure represents a road network; a query processing module configured to determine source and destination nodes in said graph data structure based on a route planning query, wherein, the query processing module comprises: a first graph search module configured to execute an initial graph search on said graph data structure using graph costs based on real-time traffic data, wherein said initial graph search starts at the source node and settles nodes until it stops; and a second graph search module configured to compute one or more routes to the destination node from one or more of said settled nodes using precomputed data based on traffic prediction data, thereby to determine a route from the source node to the destination node via one of said settled nodes.
5. A machine-readable medium encoded with instructions, that when executed by a processor, cause the processor to carry Put a process for generating human-centric driving directions, the process comprising: generating a route in response to a user request for travel directions, the request specifying at least a target destination; identifying distinctive waypoints along the route, wherein said waypoints are physical structures along the route and are in addition to road names and road topology and each said wavpoint is associated with a distinctiveness score, wherein the distinctiveness score of each said wavpoint is based at least in part on a visual prominence of the respective wavpoint and based at (east in part on an advertising fee per use for incorporating the respective waypoirit in travel directions; and incorporating one or more of said waypoints into travel directions responsive to the associated distinctiveness score.
PCT/US2015/033856 2015-06-03 2015-06-03 E-car trip planner WO2016195667A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/US2015/033856 WO2016195667A1 (en) 2015-06-03 2015-06-03 E-car trip planner

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/US2015/033856 WO2016195667A1 (en) 2015-06-03 2015-06-03 E-car trip planner

Publications (1)

Publication Number Publication Date
WO2016195667A1 true WO2016195667A1 (en) 2016-12-08

Family

ID=57440842

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2015/033856 WO2016195667A1 (en) 2015-06-03 2015-06-03 E-car trip planner

Country Status (1)

Country Link
WO (1) WO2016195667A1 (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090063045A1 (en) * 2007-08-30 2009-03-05 Microsoft Corporation Gps based fuel efficiency optimizer
US20110288765A1 (en) * 2010-05-21 2011-11-24 Verizon Patent And Licensing Inc. Real-time route and recharge planning
US20120290506A1 (en) * 2011-05-09 2012-11-15 Denso Corporation Vehicular navigation apparatus

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090063045A1 (en) * 2007-08-30 2009-03-05 Microsoft Corporation Gps based fuel efficiency optimizer
US20110288765A1 (en) * 2010-05-21 2011-11-24 Verizon Patent And Licensing Inc. Real-time route and recharge planning
US20120290506A1 (en) * 2011-05-09 2012-11-15 Denso Corporation Vehicular navigation apparatus

Similar Documents

Publication Publication Date Title
CN102027325B (en) Navigation apparatus and method of detection that a parking facility is sought
US6574551B1 (en) Autoscaling of recommended route
EP3109593A2 (en) E-car trip planner
JP3171145B2 (en) Information display device provided with touch panel and storage medium
CN103185600B (en) Navigation system and air navigation aid and device
US20070162224A1 (en) Systems and method for providing a navigation route on a geographical map based on a road portion selected by a pointer placed thereon
EP2068257B1 (en) Search device, navigation device, search method and computer program product
JP2006039745A (en) Touch-panel type input device
US10866107B2 (en) Navigation system
JP2015191256A (en) Risk degree determination device, risk degree determination method and risk degree determination program
JP4835413B2 (en) Vehicle navigation device
JP2011232270A (en) Navigation device and help presentation method thereof
JP4421667B2 (en) Information guidance device, information guidance method, information guidance program, and computer-readable recording medium
JP2010128838A (en) Input device
JP2009097981A (en) Apparatus, method, and program for navigation, and recording medium
JP5873038B2 (en) Navigation device
EP2071478A2 (en) Search device, navigation device, search method and computer program product
JP4341283B2 (en) Information terminal device and information acquisition method
WO2016195667A1 (en) E-car trip planner
JP2011145189A (en) Navigation system, route search method, and program
JP2008157737A (en) Route search device, route search method, route search program, and computer-readable recording medium
US8150618B2 (en) Method and apparatus to select city name associated with street located on border of two cities
US20090234568A1 (en) Destination setting support devices, methods, and programs
JP6419604B2 (en) Route search apparatus, route search method, and computer program
JP4086148B2 (en) In-vehicle navigation device and route guidance method thereof

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

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

Country of ref document: EP

Kind code of ref document: A1