IP Library Granted Patent US 12,259,250
Granted Patent B2
US 12,259,250 · App. 18/372,455 · Granted Mar 25, 2025

Multimodal vehicle routing system and method with vehicle parking

Inventor: Gil Emanuel Fuchs (Nes Tziona, IL)
Assignee: IP3 2024, SERIES 924 OF ALLIED SECURITY TRUST I
G01C21/3461G01C21/3446G01C21/3492G06Q10/047G06Q30/0283
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,259,250
App. No.
18/372,455
Granted
Mar 25, 2025
Kind
B2
Abstract

A system and method is provided that creates a multimodal transportation routing that originates using a road-based vehicle which then requires parking. Parking is not necessarily near the destination, but is determined based on user preferences and specification of the relative importance of speed of travel and monetary cost and/or safety. Other factors can also influence the route selection and comprise: parking availability, user preference for parking type, vehicle restrictions, maximum distance a user is willing to walk or bike and what types of public transportation a user is willing to use. Monetary factors include: fuel costs, parking costs, tolls, and public transportation costs.

Claims (46)

1. A method carried out by a computer for determining a multimodal transportation routing that originates using a personal road-based vehicle, which requires parking along the routing, the method comprising:

generating a plurality of candidate routes from an origin to a destination specified by a user, each candidate route comprising two or more legs including at least two different transportation modes and one or more parking locations with a parking location connecting two of the at least two legs, each of the at least two legs being represented by an edge and the parking locations being represented as a-nodes;

determining a total routing cost for each candidate route by, assigning a respective travel cost to each of the edges and the nodes of each candidate route, wherein the travel cost is assigned in a unit of measure that equates a plurality of factors into a single-index;

for each candidate route, calculating a total routing-cost based on the respective travel costs of the edges and the node; and

identifying an optimal route from the plurality of candidate routes based on the determined total routing cost for each candidate route; and

returning the optimal route to the user.

2. The method according to claim 1 , wherein:

the assigned travel cost of an edge is responsive to travel time, monetary cost of travel, and a weighting function defining a relative worth of travel time and monetary cost; and

the assigned travel cost of a node is responsive to a monetary cost of parking.

3. The method according to claim 2 , wherein the assigned travel cost of the node is further responsive to a safety index of parking at the parking location, as well as a weighting function defining a relative contribution of the safety index to the travel cost.

4. The method according to claim 3 , wherein the safety index reflects a level of theft or vandalism in the parking location.

5. The method according to claim 1 , wherein the assigned travel cost of the edges is further responsive to a safety index of a location traversed by the leg, as well as a weighting function defining a relative contribution of the safety index to the travel cost.

6. The method according to claim 5 , wherein the transportation mode for at least one leg is one of walking or biking and the safety index reflects safety of walking or biking through the location traversed for said leg.

7. The method according to claim 6 , wherein the safety index reflects a level of crime in the location traversed.

8. The method according to claim 1 , wherein selecting the optional route comprises selecting a candidate route having the lowest total routing cost.

9. The method according to claim 1 , wherein calculating the total routing cost of the candidate route comprises a summation of the respective travel costs of the edges and the node.

10. The method according to claim 1 , further comprising calculating a total monetary cost of the edges and the node, wherein the optimal route is selected further based on the total monetary cost being below a predetermined threshold.

11. The method according to claim 1 , wherein selecting-identifying an optimal route comprises:

(a) generating a driving-only route to the destination;

(b) selecting a parking location near the destination; and

(c) generating a multimodal route comprising a portion of the driving-only route to the parking location as a first leg and a walking route from the parking space to the destination as a second leg;

(d) calculating a total routing cost to the multimodal route based on the respective travel costs of the first and second legs and the parking space;

(e) if the calculated total routing cost of the multimodal route is below a threshold value, then designating the multimodal route as the optimal route; and

(f) if the calculated total routing cost of the multimodal route exceeds a threshold value, then selecting a first updated parking location along or near the driving only route that is farther from the destination and generating a first updated multimodal route.

12. The method according to claim 11 , further comprising:

(g) if the calculated total routing cost of the first updated multimodal route generated in step (f) exceeds a threshold value, then selecting a second updated parking location along or near the driving only route and at or near a public transit stop, the second updated parking location being further from the destination compared to the first updated parking location; and

(h) generating a second updated multimodal route comprising a portion of the driving-only route to the second updated parking location as a first leg and a public transit route from the public transit stop to the destination as a second leg.

13. The method according to claim 12 , further comprising:

(i) if the total routing cost of the second updated multimodal route generated in step (h) exceeds the threshold value, then generating a third updated multimodal route comprising a first leg comprising a new driving route to a third updated parking location at or near a second public transit stop, and a second leg comprising a public transit route from the parking location to the destination.

14. The method according to claim 11 , wherein steps (a)-(f) are performed as ordered steps.

15. A system for determining a multimodal transportation routing that originates using a personal road-based vehicle which requires parking along the routing, the system comprising at least one processor communicating with input and output devices, said at least one processor configured to execute instructions causing the system, in response to user input of a routing request including an origin and destination, to:

generate a plurality of candidate routes from the origin to the destination, each candidate route comprising two or more legs including at least two different transportation modes and one or more parking locations with a parking location connecting two of the at least two legs, each of the at least two legs being represented by an edge and the parking locations being represented as a-nodes;

determine a total routing cost for each candidate route, by assigning a respective travel cost to each of the edges and the nodes;

identify an optimal route from the plurality of candidate routes based on the determined total routing costs for each candidate route;

return the optimal route to the user through an output device communicating with the processor.

16. The system according to claim 15 , wherein:

the assigned travel cost of an edge is responsive to travel time, monetary cost of travel, and a weighting function defining a relative worth of travel time and monetary cost; and

the assigned travel cost of a node is responsive to a monetary cost of parking.

17. The system according to claim 16 , wherein:

the assigned travel cost of the node is further responsive to a safety index of parking at the parking location, as well as a weighting function defining a relative contribution of the safety index to the travel cost; and

the safety index reflects a level of theft or vandalism in the parking location.

18. The system according to claim 15 , wherein:

the assigned travel cost of the edges is further responsive to a safety index of a location traversed by the leg, as well as a weighting function defining a relative contribution of the safety index to the travel cost; and

the transportation mode for at least one leg is one of walking or biking and the safety index reflects safety of walking or biking through the location traversed for said leg.

19. The system according to claim 15 , wherein said processor is further configured to rank candidate routes by determined total travel cost and present plural candidate routes with associated total travel costs to the user for selection of a user preferred route.

20. The system according to claim 19 , wherein said system comprises a portable navigation device incorporating a display device as a part of a user interface.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 22, 2024
From: FUCHS, GIL EMANUEL
To: IP3 2024, SERIES 924 OF ALLIED SECURITY TRUST I
Reel/Frame 069373/0249 →
Continuity (7)
Continuation 17990328 · Nov 18, 2022
Continuation 17198047 · Mar 10, 2021
Continuation 16797708 · Feb 21, 2020
Continuation PCTUS2018049277 · Aug 31, 2018
Provisional Application 62553721 · Sep 1, 2017
Related Publication 20240133700A1 · Apr 25, 2024
Related Publication 20240230350A9 · Jul 11, 2024
References Cited (24)
US 5893081A · Poppen · 1999 [cited by applicant]
US 6826472B1 · Kamei et al. · 2004 [cited by applicant]
US 8847791B1 · Urbach · 2014 [cited by applicant]
US 8949028B1 · Klampfl et al. · 2015 [cited by applicant]
US 9857193B2 · Vulcano et al. · 2018 [cited by applicant]
US 9958280B2 · Scofield et al. · 2018 [cited by applicant]
US 10156848B1 · Konrardy et al. · 2018 [cited by applicant]
US 20050107951A1 · Brulle-Drews et al. · 2005 [cited by applicant]
US 20070263590A1 · Abileah et al. · 2007 [cited by applicant]
US 20120004841A1 · Schunder · 2012 [cited by applicant]
US 20120158299A1 · Cerecke et al. · 2012 [cited by applicant]
US 20120310520A1 · Kanno et al. · 2012 [cited by applicant]
US 20130046456A1 · Scofield et al. · 2013 [cited by applicant]
US 20140278105A1 · Canfield · 2014 [cited by applicant]
US 20140350853A1 · Proux · 2014 [cited by applicant]
US 20140350978A1 · Li · 2014 [cited by applicant]
US 20140350979A1 · Paetzold · 2014 [cited by applicant]
US 20170059337A1 · Barker et al. · 2017 [cited by applicant]
US 20170176205A1 · Jones et al. · 2017 [cited by applicant]
US 20170356751A1 · Iagnemma · 2017 [cited by applicant]
US 20180313661A1 · Eyster et al. · 2018 [cited by applicant]
US 20200103242A1 · Chachra et al. · 2020 [cited by applicant]
WO 2016026865A1 · 2016 [cited by applicant]
International Search Report and Written Opinion dated Dec. 6, 2018, in connection with PCT/US18/49277, filed Aug. 31, 2018. [cited by applicant]