TECHNICAL FIELD
The present subject matter is related, in general to navigation, and more particularly, but not exclusively to recommending one or more route.
BACKGROUND
A user may desire to make a journey from one geographical location to another geographical location. The geographical location from which the user may be the Journey may be Origin 10 Point. The geographical location from where the user may finish the Journey may be Destination Point.
There may be one or more Routes to travel from the Origin Point to Destination Point. However, due to unknown factors, such as hidden expenditures such as Toll Tax or State Tax, the user may not be able to choose the best Route among the one or more Routes to travel. 15
BRIEF DESCRIPTION OF THE ACCOMPANYING DRAWINGS
Figure.1 illustrates an environment with a Route Planner 102 along with a Mapping Device.
Figure.2 illustrates Memory which may include Point Receiver 202, Route Module 204, Tariff Mileage Module 206, Cumulative Module 208 and Recommendation Module 210.
Figure.3 illustrates a flowchart of a method for recommending one or more routes. 20
It should be appreciated by those skilled in the art that any diagrams herein represent conceptual views of illustrative systems embodying the principles of the present subject matter.
3
SUMMARY 5
A method for recommending one or more routes; the method comprising: Receiving, by a Route Planner, an origin point and a destination point; Determining, by the Route Planner, the one or more routes between the Origin point and the Destination point; Determining, by the Route Planner, a tariff associated with each of the one or more routes, a break down score associated with each of the one or more routes, a mileage score associated with each of the one or more 10 routes; Determining, by the Route Planner, a cumulative route score associated with each of the one or more routes based on the tariff associated with each of the one or more routes, the break down score associated with each of the one or more routes, the mileage score associated with each of the one or more routes; Recommending, by the Route Planner, the one or more routes based on the cumulative route score. 15
A Route Planner System for recommending one or more route; the system comprising: at least one processor; and a memory storing instructions executable by the at least one processor, wherein the instructions configure the at least one processor to Receive an Origin Point and Destination Point; Determine the one or route between the Origin point and the Destination point; Determine a tariff associated with each of the one or more routes, a break down score 20 associated with each of the one or more routes, a mileage score associated with each of the one or more routes; Determine a cumulative route score associated with each of the one or more routes based on the tariff associated with each of the one or more routes, the break down score associated with each of the one or more routes, the mileage score associated with each of the one or more routes; Recommend one or more route based on the cumulative route score. 25
4
DETAILED DESCRIPTION 5
In the present document, the word "exemplary" is used herein to mean "serving as an example, instance, or illustration." Any embodiment or implementation of the present subject matter described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments.
While the disclosure is susceptible to various modifications and alternative forms, specific 10 embodiment thereof has been shown by way of example in the drawings and will be described in detail below. It should be understood, however that it is not intended to limit the disclosure to the particular forms disclosed, but on the contrary, the disclosure is to cover all modifications, equivalents, and alternatives falling within the spirit and the scope of the disclosure.
The terms “comprises”, “comprising”, or any other variations thereof, are intended to cover a 15 non-exclusive inclusion, such that a setup, device or method that comprises a list of components or steps does not include only those components or steps but may include other components or steps not expressly listed or inherent to such setup or device or method. In other words, one or more elements in a system or apparatus proceeded by “comprises… a” does not, without more constraints, preclude the existence of other elements or additional elements in the system or 20 method.
In the following detailed description of the embodiments of the disclosure, reference is made to the accompanying drawings that form a part hereof, and in which are shown by way of illustration specific embodiments in which the disclosure may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the disclosure, and it 25 is to be understood that other embodiments may be utilized and that changes may be made
5
without departing from the scope of the present disclosure. The following description is, 5 therefore, not to be taken in a limiting sense.
Figure.1 illustrates environment 100 with a Route Planner 102 along with a Mapping Device.
The environment 100 comprises a Route Planner 102 and Mapping Device 114. The Mapping device 114 may be capable of: containing maps, which may be displayed in human readable format via text or in a graphical format; determining a vehicle or vessel's location via sensors, 10 maps, or information from external sources; providing suggested directions to a human in charge of a vehicle or vessel via text or speech; providing directions directly to an autonomous vehicle; providing information on nearby vehicles or vessels, or other hazards or obstacles; providing information on traffic conditions and suggesting alternative directions. The Route Planner 102 may include a Processor 104, a Memory 106, an I/O interface 108, a data historian 110 which 15 may be coupled together by bus 112.
The Processor 104 may manage the operation and interaction between Memory 106, an I/O interface 108, a data historian 110. The Processor 104 may include specialized processing units such as integrated system (bus) controllers, memory management control units, floating point units, graphics processing units, digital signal processing units, etc. The Processor 104may 20 include a microprocessor, such as AMD Athlon, Duron or Opteron, ARM’s application, embedded or secure processors, IBM PowerPC, Intel’s Core, Itanium, Xeon, Celeron or other lines of processors, etc. The Processor 104 may be implemented using mainframe, distributed processor, multi-core, parallel, grid, or other architectures. Some embodiments may utilize embedded technologies like application-specific integrated circuits (ASICs), digital signal 25 processors (DSPs), Field Programmable Gate Arrays (FPGAs), etc.
6
The Processor 104 may be disposed in communication with one or more input/output (I/O) 5 devices via I/O interface 108. The I/O interface 108 may employ communication protocols/methods such as, without limitation, audio, analog, digital, monoaural, RCA, stereo, IEEE-1394, serial bus, universal serial bus (USB), infrared, PS/2, BNC, coaxial, component, composite, digital visual interface (DVI), high-definition multimedia interface (HDMI), RF antennas, S-Video, VGA, IEEE 802.n /b/g/n/x, Bluetooth, cellular (e.g., code-division multiple 10 access (CDMA), high-speed packet access (HSPA+), global system for mobile communications (GSM), long-term evolution (LTE), WiMax, or the like), etc.
The Memory 106 may comprise one or more tangible storage media, such as RAM, ROM, flash memory, CD-ROM, floppy disk, hard disk drive(s), solid state memory, DVD, or other memory storage types or devices, including combinations thereof, which are known to those of ordinary 15 skill in the art. The memory 106 may store one or more non-transitory computer-readable instructions of this technology as illustrated and described with reference to the examples herein that may be executed by the one or more processor(s) 104.
The Data Historian 110 may record and retrieve production and process data by time. The data historian 110 may log time-based data associated with one or more users on the Mapping Device 20 114. The data historian 110 may store the information in a time series database that can efficiently store data with minimal disk space and fast retrieval.
Figure.2 illustrates Memory 106 which may include Point Receiver 202, Route Module 204, Tariff Mileage Module 206, Cumulative Module 208 and Recommendation Module 210.
7
Point Receiver 202 may receive an origin point and a destination point. The Origin Point may be 5 a geographical location, or point or place, from where the user may wish to begin a journey. The Destination Point may be a geographical location, or point or place, where the Journey ends.
Route Module 204 may determine the one or more routes, between the Origin Point and the Destination Point. The one or more routes may be a way or course, or a road, taken in getting from the Origin Point to the Destination Point. The one or more routes may be roads connecting 10 the Origin Point to the Destination Point. The one or more Routes may be identified using a map or a navigation tool such as Google® Maps. For example, let there be 3 Routes between Origin Point and Destination Point: Route A, Route B, and Route C.
Tariff Mileage Module 206 may determine a tariff associated with each of the one or more routes, a break down score associated with each of the one or more routes, a mileage score 15 associated with each of the one or more routes. The tariff associated with each of the one or more routes may be based on State Tax, Toll Tax, and Parking Charges. The tariff associated with each of the one or more routes may be any kind of Tax imposed by a government body on travel by a route. The tariff associated with each of the one or more routes may be a Toll tax. Information in relation to the State Tax, the Toll Tax, and Parking Charges are generally made 20 available in the public domain. The information in relation to the State Tax, the Toll Tax, and Parking Charges may be collated into a database. Therefore, such information may be pulled out from the database to calculate the tariff associated with each of the one or more routes. In an embodiment, the tariff associated with each of the one or more routes may be extracted using a Third-Party database such as Google Maps ® and integrated through APIs. The Parking Charges 25 may be collated from a Historical data of past users. The break down score associated with each of the one or more routes is based on road conditions, distress/emergency calls, number of
8
accidents on the routes. The break down score associated with each of the one or more routes 5 may be indicative of safety of each of the one or more routes. The break down score may be determined based on the number of accidents on the route and number of emergency call on the route. The break down score associated with each of the one or more routes may be influenced by language and communication barriers. During a breakdown or accident or distress, communication with regional authorities and regional people becomes a matter of utmost 10 necessity. In such a scenario, a method to translate one language to another language may be considered as a hassle for the commuters.
For Example, Person X knows Hindi, Person Y knows Tamil. Route A is in Hindi speaking region and Route B is Tamil speaking region.
Person X
(Hindi)
Person Y
(Tamil)
Route A
(Hindi)
Low or Zero
Hindrance
High
Hindrance
Route B
(Tamil)
High
Hindrance
Low or Zero
Hindrance
Table-I 15
The language of the commuter may be determined based on Origin Point. The language of the region may be determined based on the different geographic states that may be crossed to reach the Destination Point.
9
The Low or Zero Hinderance status may be assigned to a route in the event the commuter & the 5 regional Language may be the same or similar.
The High Hinderance status may be assigned to a route in the event the commuter & the regional Language may be different.
The Low or Zero Hinderance status may incur 0 as Break down score. Whereas, The High Hinderance status may incur 30 as Break Score. 10
Therefore, break down score associated with each of the one or more routes may include a cost of translation from one language to another language. Such translation may be done by a speech translation process by which conversational spoken phrases are instantly translated and spoken aloud in a second language. The Speech Translation process may be embedded into the Vehicle GPS system and preload the different regional languages that may be required based on the 15 routes. The Speech Translation system may be an additional hidden cost to the commuters, which the commuters may not be aware of while booking the taxi.
The mileage score, associated with each of the one or more routes, is based on a demand of the route among one or more users. The mileage score associated with each of the one or more routes may be determined based on the fuel consumed to travel the route and demand of travelers 20 to travel the route. For example, the following Table illustrates tariff, break down score and mileage score associated with Route A, Route B, and Route C.
Tariff
Break down Score
Mileage Score
Route A
5
10
20
10
Route B
10
20
50
Route C
15
30
100
TABLE-A 5
In an embodiment, the Mileage score associated with each of the one or more routes may be determined based on a pre-paid multiple entry permit granted to a vehicle used by the user. For example, the following Table illustrates a priority score assigned to the vehicles have pre-paid multiple entry permit. 10
Tax
Priority (6 = highest and 0 lowest Priority)
Yearly tax (Multiple Entry)
6
Half yearly Tax (Multiple Entry)
5
Quarterly Tax (Multiple Entry)
4
Monthly Tax (Multiple Entry)
3
15 Days Entry (Multiple Entry)
2
Weekly Entry (Multiple Entry)
1
Per day Entry (Single Entry)
0
TABLE-B
11
The priority score may be added to the Mileage score. Therefore, a vehicle with a Yearly Tax 5 permit for a specific route would reduce tax to be paid on the route and decrease the expenditure associated with the route and in turn would increase the Mileage score.
In an embodiment, CAR A and CAR B are compared to be used on a route, wherein CAR A and CAR B have obtained different types of State tax permit for a route Delhi to Agra as illustrated in the following table 10 Date Destination "Car A" Per Day State Tax (Rs250 / day) "Car B" Monthly State Tax ( Rs 3000 / month ) 11-Jan Delhi to Agra , Uttar pradesh Rs ₹ 250 Rs ₹ 100 ( Per day charge from customer 3000/ 30 =100 Rs 12-Jan Agra, Uttar pradesh Rs ₹ 250 Rs ₹ 100 13-Jan Mathura, Uttar pradesh Rs ₹ 250 Rs ₹ 100 14-Jan Mathura to Delhi drop Rs ₹ 250 Rs ₹ 100
12
Total Rs ₹ 1,000 Rs ₹ 400
Price deference ₹Rs 600
TABLE-C 5
In the above embodiment, Car B will have a higher priority score and increase the Mileage Score as compared to Car A. Therefore, Car B would be assigned to the route."
Thereafter, Cumulative Module 208 may determine a cumulative route score associated with each of the one or more routes based on the tariff associated with each of the one or more routes, 10 the break down score associated with each of the one or more routes, a mileage score associated with each of the one or more routes. The cumulative route score may be in calculated using regression models created using the tariff, the break down score and the mileage score associated with each of the one or more routes. For example, the cumulative route score may be determined by convolution of the tariff, the break down score and the mileage score associated with each of 15 the one or more routes. In an exemplary embodiment, cumulative route score may be equal to subtraction of the Tariff and Breakdown Score from the Mileage Score.
Cumulative Route Score = Mileage Score - (Tariff + Break Down)
For example, the following Table illustrates the Cumulative Route Score for Route A, Route B and Route C. 20
Tariff
Break down Score
Mileage Score
Cumulative Route Score
13
Route A
5
10
20
5
Route B
10
20
50
20
Route C
15
30
100
55
TABLE-D 5
In an embodiment, in absence of Mileage Score or Breakdown Score; the Route Planner may determine the Cumulative Route Score based on the Tariff associated with one or more Routes. As a result, Cumulative Route Score would be entirely dependent on the State Tax, the Toll Tax and the Parking Costing. Therefore, the subsequent recommendation of the one or more routes would also be entirely based on the State Tax, the Toll Tax and the Parking Costing. 10
Recommendation Module 210 may recommend the one or more routes The one or more routes may be recommended to the user based on the descending value of the Cumulative Route Score associated with each of the one or more routes. In an embodiment, the Route A, Route B and Route C may be recommended to the user in the following manner:
Cumulative Route Score
Recommendation
Route C
55
Good
Route B
20
Medium
Route A
5
Bad
Table E 15
14
In an embodiment, the Route Planner may recommend a route with the lowest State Tax, Toll 5 Tax and Parking Charges.Figure.3 illustrates a flow chart method for recommending one or more routes. The method may involve receiving, by a Route Planner 102, an origin point and destination point; determining, by the Route Planner 102, the one or more routes between the Origin point and Destination point; determining, by the Route Planner 102, a tariff associated with each of the one or more routes, a break down score associated with each of the one or more 10 routes, a mileage score associated with each of the one or more routes; determining, by the Route Planner 102, a cumulative route score associated with each of the one or more routes based on a tariff associated with each of the one or more routes, a break down score associated with each of the one or more routes, a mileage score associated with each of the one or more routes; recommending, by the Route Planner 102, the one or more routes based on the cumulative route. 15
At step 302, an origin point and a destination point may be received by the Route Planner. The Origin Point may be a geographical location, or point or place, from where the user may wish to begin a journey. The Destination Point may be a geographical location, or point or place, where the Journey ends.
At step 304, after receiving the Origin Point and the Destination Point, the one or more routes are 20 determined between the Origin Point and the Destination Point. The one or more routes may be a way or course, or a road, taken in getting from the Origin Point to the Destination Point. The one or more routes may be roads connecting the Origin Point to the Destination Point. The one or more Routes may be identified using a map or a navigation tools such as Google® Maps. For example, let there be 3 Routes between Origin Point and Destination Point: Route A, Route B 25 and Route C.
15
Thereafter at step 306, a tariff associated with each of the one or more routes, a break down score 5 associated with each of the one or more routes, a mileage score associated with each of the one or more routes may be determined. The tariff associated with each of the one or more routes may be based on State Tax, Toll Tax and Parking Charges. The tariff associated with each of the one or more routes may be any kind of Tax imposed by a government body on travel by a route. The tariff associated with each of the one or more routes may be a Toll tax. Information in relation to 10 the State Tax, The Toll Tax and Parking Charges are generally made available in the public domain. The information in relation to the State Tax, The Toll Tax and Parking Charges may be collated into a database. Therefore, such information may be pull out form the database to calculate the tariff associated with each of the one or more routes. In an embodiment the tariff associated with each of the one or more routes may be extracted using third Party database such 15 as Google Maps ® and integrated through APIs. The Parking Charges may be collated from a Historical data of past users. The break down score associated with each of the one or more routes, is based on road conditions, distress/emergency calls, number of accidents on the routes. The break down score associated with each of the one or more routes may be indicative of safety of each of the one or more routes. The break down score may be determined based on the 20 number of accidents on the route and number of emergency call on the route. The break down score associated with each of the one or more routes may be influenced by language and communication barriers. During a break down or accident or distress, communication with regional authorities and regional people becomes a matter of utmost necessity. In such a scenario, a method to translate one language to another language, may be considered as a hassle 25 for the commuters.
16
For Example, Person X knows Hindi, Person Y knows Tamil. Route A is in Hindi speaking 5 region and Route B is Tamil speaking region.
Person X
(Hindi)
Person Y
(Tamil)
Route A
(Hindi)
Low or Zero
Hindrance
High
Hindrance
Route B
(Tamil)
High
Hindrance
Low or Zero
Hindrance
Table-I
The language of the commuter may be determined based on Origin Point. The language of the region may be determined based on the different geographic states that may be crossed to reach the Destination Point. 10
The Low or Zero Hinderance status may be assigned to a route in the event the commuter language & the regional language may be same or similar.
The High Hinderance status may be assigned to a route in the event that the commuter language & the regional language may be different.
The Low or Zero Hinderance status may incur 0 as Break down score. Whereas, The High 15 Hinderance status may incur 30 as Break Score.
17
Therefore, break down score associated with each of the one or more routes may include cost of 5 translation from one language to another language. Such translation may be done by a speech translation process by which conversational spoken phrases are instantly translated and spoken aloud in a second language. The Speech Translation process may be embedded into the Vehicle GPS system and preload the different regional languages that may be required based on the routes. The Speech Translation system may be an additional hidden cost to the commuters, 10 which the commuters may not be aware of while booking the taxi.
The mileage score associated with each of the one or more routes, is based on demand of the route among one or more users. The mileage score associated with each of the one or more routes may be determined based on the fuel consumed to travel the route and demand of travelers to travel the route. For example, the following Table illustrates tariff, break down score and 15 mileage score associated with Route A, Route B and Route C.
Tariff
Break down Score
Mileage Score
Route A
5
10
20
Route B
10
20
50
Route C
15
30
100
TABLE-A
In an embodiment, the Mileage score associated with each of the one or more routes may be determined based on a pre-paid multiple entry permit granted to a vehicle used by the user. For example, the following Table illustrates a priority score assigned to the vehicles have pre-paid 20 multiple entry permit.
18
5
Tax
Priority (6 = highest and 0 lowest Priority)
Yearly tax ( Multiple Entry )
6
Half yearly Tax ( Multiple Entry )
5
Quarterly Tax ( Multiple Entry )
4
Monthly Tax ( Multiple Entry )
3
15 Days Entry ( Multiple Entry )
2
Weekly Entry ( Multiple Entry )
1
Per day Entry ( Single Entry )
0
TABLE-B
The priority score may be added to the Mileage score. Therefore, a vehicle with a Yearly Tax permit for a specific route would reduce tax to be paid on the route and decrease the expenditure associated with the route and in turn would increase the Mileage score.
In an embodiment, CAR A and CAR B are compared to be used on a route, wherein CAR A and 10 CAR B have obtained different types of State tax permit for a route Delhi to Agra as illustrated in the following table Date Destination "Car A" Per Day State Tax (Rs250 / "Car B" Monthly State Tax (
19
day) Rs 3000 / month ) 11-Jan Delhi to Agra , Uttar pradesh Rs ₹ 250 Rs ₹ 100 ( Per day charge from customer 3000/ 30 =100 Rs 12-Jan Agra, Uttar pradesh Rs ₹ 250 Rs ₹ 100 13-Jan Mathura, Uttar pradesh Rs ₹ 250 Rs ₹ 100 14-Jan Mathura to Delhi drop Rs ₹ 250 Rs ₹ 100 Total Rs ₹ 1,000 Rs ₹ 400 Price deference ₹Rs 600
TABLE-C 5
In the above embodiment, Car B will have a higher priority score and increase the Mileage Score as compared to Car A. Therefore, Car B would be assigned to the route.
Further at step 308, a cumulative route score associated with each of the one or more routes is determined based on the tariff associated with each of the one or more routes, the break down score associated with each of the one or more routes, a mileage score associated with each of the 10 one or more routes. The cumulative route score may be in calculated using regression models created using the tariff, the break down score and the mileage score associated with each of the one or more routes. For example, the cumulative route score may be determined by convolution of the tariff, the break down score and the mileage score associated with each of the one or more
20
routes. In an exemplary embodiment, cumulative route score may be equal to subtraction of the 5 Tariff and Breakdown Score from the Mileage Score.
Cumulative Route Score = Mileage Score - (Tariff + Break Down)
For example, the following Table illustrates the Cumulative Route Score for Route A, Route B and Route C.
Tariff
Break down Score
Mileage Score
Cumulative Route Score
Route A
5
10
20
5
Route B
10
20
50
20
Route C
15
30
100
55
TABLE-D 10
In an embodiment, in absence of Mileage Score or Breakdown Score; the Route Planner may determine the Cumulative Route Score based on the Tariff associated with one or more Routes. As a result, Cumulative Route Score would be entirely dependent on the State Tax, the Toll Tax and the Parking Costing. Therefore, the subsequent recommendation of the one or more routes would also be entirely based on the State Tax, the Toll Tax and the Parking Costing. 15
Lastly at step 310, the one or more routes may be recommended by the Route Planner. The one or more routes may be recommended to the user based on the ascending value of the Cumulative Route Score associated with each of the one or more routes. In an embodiment, the Route A, Route B and Route C may be recommended to the user in the following manner:
21
Cumulative Route Score
Recommendation
Route C
55
Good
Route B
20
Medium
Route A
5
Bad
Table E 5
In an embodiment, the Route Planner may recommend a route with the lowest State Tax, Toll Tax and Parking Charges.
Advantages of the embodiment of the present disclosure are illustrated herein.
Embodiments of the present disclosure provides a method for recommending one or more routes for travelling. This method helps the user eliminate hidden cost of toll or mileage on a route. 10 Therefore, the user is able to select a route out of the one or more route based on an informed decision and removes arbitrariness.

We Claim:

1. A method for recommending one or more routes; the method comprising:
Receiving, by a Route Planner (102), an origin point and a destination point;
Determining, by the Route Planner (102), the one or more routes between the Origin point and the Destination point;
Determining, by the Route Planner (102), a tariff associated with each of the one or more 10 routes, a break down score associated with each of the one or more routes, a mileage score associated with each of the one or more routes;
Determining, by the Route Planner (102), a cumulative route score associated with each of the one or more routes based on the tariff associated with each of the one or more routes, the break down score associated with each of the one or more routes, the mileage 15 score associated with each of the one or more routes;
Recommending, by the Route Planner (102), the one or more routes based on the cumulative route score.
2. The method as claimed in Claim 1, wherein tariff associated with each of the one or more routes is based on State Tax, Toll Tax, and Parking Charges. 20
3. The method as claimed in Claim 1, wherein mileage score associated with each of the one or more routes, is based on a demand of the route among one or more users.
4. The method as claimed in Claim 1, wherein the break down score associated with each of the 25 one or more routes is based on the language in the Origin Point and language of regions of different geographic states that may be crossed to reach the Destination Point.
5. The method as claimed in Claim 1, wherein break down score associated with each of the one or more routes, is based on road conditions, distress/emergency calls, number of 30 accidents on the routes.
6. A Route Planner System for recommending one or more route; the system comprising:
at least one processor (104); and
a memory (106) storing instructions executable by the at least one processor (104), 35 wherein the instructions configure the at least one processor (104) to
Receive an Origin Point and Destination Point;
23
Determine the one or route between the Origin point and the Destination point; 5
Determine a tariff associated with each of the one or more routes, a break down score associated with each of the one or more routes, a mileage score associated with each of the one or more routes;
Determine a cumulative route score associated with each of the one or more routes based on the tariff associated with each of the one or more routes, the break down score 10 associated with each of the one or more routes, the mileage score associated with each of the one or more routes;
Recommend one or more route based on the cumulative route score.
7. The system as claimed in Claim 5, wherein tariff associated with each of the one or more routes is based on State Tax, Toll Tax, and Parking Charges. 15
8. The system as claimed in Claim 5, wherein mileage score associated with each of the one or more routes, is based on a demand of the route among one or more users.
9. The system as claimed in Claim 5, where in the break down score associated with each of the 20 one or more routes is based on the language in the Origin Point and language of regions of different geographic states that may be crossed to reach the Destination Point.
10. The system as claimed in Claim 5 wherein break down score associated with each of the one or more routes, is based on road conditions, distress/emergency calls, number of accidents on 25 the routes.