IP Library Granted Patent US 12,437,353
Granted Patent B2
US 12,437,353 · App. 16/688,052 · Granted Oct 7, 2025

Systems and methods for managing ridesharing vehicles

Inventors: Daniel Ramot (New York, NY); Oren Shoval (Jerusalem, IL); Shmulik Marcovitch (Kfar Saba, IL); Yaron Rakah (Givatayim, IL); Udi Eylat (Tel Aviv, IL)
Assignee: VIA TRANSPORTATION, INC.
G06Q50/40G06Q10/047G06Q30/0621G06Q30/0641G08G1/202
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,437,353
App. No.
16/688,052
Filed
Nov 19, 2019
Granted
Oct 7, 2025
Kind
B2
Art Unit
3627
USPC
705/15
Abstract

A system for enabling varied ridesharing services is provided. The system may include: a communications interface; a memory for storing accounts of the users including a restriction associated with a user, the restriction including limiting a distance from a starting point to a pick-up location and limiting a distance from a drop-off location to a destination; and a processor configured to: receive a request for a shared-ride from the user, the request including an indication of a starting point and a destination; access the database to retrieve the restriction; receive vehicle location data for a fleet of vehicles; identify candidate vehicles to pick up the user based on location information and an ability of candidate vehicles to comply with the restriction; provide to the user offers associated with candidate vehicles; receive a selection of an offer; and direct a vehicle associated with the offer to pick up the user.

Claims (45)

1. A computerized-method:

receiving, via a communications interface at a ridesharing management server, a shared-ride request from a user, the shared-ride request including an indication of a starting point and a desired destination;

accessing, via a database, at least one preselected restriction associated with the user, the at least one restriction including limiting a walking distance from the starting point to a pick-up location and limiting a walking distance from a drop-off location to the desired destination, wherein the at least one restriction includes not crossing the street to access a pick-up location or a drop-off location;

receive, from a global positioning system component within each ridesharing vehicle in communication with a global positioning system (GPS), current vehicle location data for a fleet of ridesharing vehicles;

identifying at least one candidate ridesharing vehicle to pick up the user based on current vehicle location information and an ability of the at least one candidate ridesharing vehicle to comply with the at least one preselected restriction associated with the user;

providing to the user, via the ridesharing management server to the communications interface multiple offers associated with the at least one candidate ridesharing vehicle, wherein each offer includes a walking distance from the drop off location to the desired destination that is different than the at least one restriction of the walking distance from a drop-off location to the desired destination specified by the user, and wherein the walking distance from the drop-off location to the desired destination allows additional subsequent pick-ups;

receiving, by the ridesharing management server via the communication interface a selection of an offer; and

redirecting, by the ridesharing management server, a ridesharing vehicle associated with the selected offer to pick up the user at a location of the selected offer.

2. The computerized-method of claim 1 , wherein the at least one preselected restriction includes limiting the walking distance to the pick-up location to a distance between 25 to 70 meters.

3. The computerized-method of claim 1 , wherein the at least one preselected restriction further includes limiting a number of riders in a ridesharing vehicle with the user, limiting an estimated delay to a ride of the user, limiting a number of pick-ups while the user is in the ridesharing vehicle, limiting a number of drop-offs while the user is in the ridesharing vehicle, and toll road avoidance.

4. The computerized-method of claim 3 , wherein the at least one preselected restriction includes limiting the number of riders in the ridesharing vehicle to less than five ridesharing riders.

5. The computerized-method of claim 3 , wherein the at least one preselected restriction including limiting the estimated delay to the user's ride to less than 10 minutes.

6. The computerized-method of claim 3 , wherein the at least one preselected restriction includes limiting the number of pick-ups while the user is in the ridesharing vehicle to less than three pick-ups.

7. The computerized-method of claim 3 , wherein the at least one preselected restriction includes limiting the number of drop-offs while the user is in the ridesharing vehicle to less than three drop-offs.

8. The computerized-method of claim 3 , wherein the at least one preselected restriction includes toll road avoidance when the estimated time saved using toll roads is less than 5 minutes.

9. The computerized-method of claim 1 , wherein the multiple offers differ by at least one of cost, pick-up location, pick-up time, and type of service.

10. The computerized-method of claim 1 , wherein the multiple offers differ by pick-up location, and wherein the method further comprises visually displaying on a map multiple proposed pick-up locations associated with the multiple offers.

11. The computerized-method of claim 1 , wherein the method further comprises visually displaying on a map a drop-off location other than the desired destination.

12. The computerized-method of claim 1 , wherein the method further comprises visually displaying to the user at least one option for customizing shared-ride requests with at least one restriction.

13. The computerized-method of claim 1 , wherein the account of the user includes a series of preselected conditions associated with a stored pick-up location or a stored desired destination.

14. The computerized-method of claim 1 , wherein the indication of the starting point is generated by at least one global positioning system (GPS) component included in a mobile device associated with the user.

15. A system for enabling varied ridesharing services, the system comprising:

a communications interface for receiving shared-ride requests from prospective passengers and for transmitting information to the prospective passengers;

a memory for storing accounts of the users including at least one preselected restriction associated with a user, the at least one restriction including limiting a walking distance from a starting point to a pick-up location and limiting a walking distance from a drop-off location to a desired destination; and

at least one ridesharing management server configured to:

receive, via the communications interface, a request for a shared-ride from the user, the shared-ride request including an indication of a starting point and a desired destination;

access, via the memory, the at least one preselected restriction associated with the user, the at least one restriction including limiting a walking distance from the starting point to a pick-up location and limiting a walking distance from a drop-off location to the desired destination, wherein the at least one restriction includes not crossing the street to access a pick-up location or a drop-off location;

receive, from a global positioning system component within each ridesharing vehicle in communication with a global positioning system (GPS), current vehicle location data for a fleet of ridesharing vehicles;

identify at least one candidate ridesharing vehicle to pick up the user based on the current vehicle location information and an ability of the at least one candidate ridesharing vehicle to comply with the at least one preselected restriction associated with user;

provide to the user, via the communications interface, multiple offers associated with the at least one candidate ridesharing vehicle, wherein each offer includes a walking distance from the drop off location to the desired destination that is different than the at least one restriction of the walking distance from a drop-off location to the desired destination specified by the user, and wherein the walking distance from the drop-off location to the desired destination allows additional subsequent pick-ups;

receive, via the communications interface, a selection of an offer;

receiving, by the ridesharing management server via the communication interface a selection of an offer; and

redirect, via the communications interface, a ridesharing vehicle associated with the selected offer to pick up the user at a location of the selected offer.

16. The system of claim 15 , wherein the at least one processor is further configured to identify a plurality of candidate ridesharing vehicles based on the current vehicle location data, the shared-ride request, and the at least one restriction.

17. The system of claim 16 , wherein the multiple offers are associated with the plurality of candidate ridesharing vehicles and wherein the multiple offers differ by a type of service and the walking distance from the starting point to the pick-up location.

18. The system of claim 16 , wherein the multiple offers are associated with the plurality of candidate ridesharing vehicles and wherein the multiple offers differ by a type of service and the walking distance from the drop-off location to the desired destination.

19. The system of claim 15 , wherein the at least one preselected restriction includes a plurality of restrictions and wherein the multiple offers include a first offer that satisfies all of the plurality of restrictions and a second offer satisfies some, but not all, of the plurality of restrictions.

20. The system of claim 19 , wherein the second offer costs less than the first offer.

21. The computerized-method of claim 1 wherein the at least one restriction further includes a maximum delay of arrival of the user by a subsequent pick-up of a second user, and wherein the computer program product includes further instructions for causing the at least one processor to execute the method further comprising:

calculating an estimated delay of arrival for the user if a second shared-ride request is received from a second user; and

assigning a subsequent pick-up of the second user to the ridesharing vehicle if the estimated delay is less than the maximum delay of arrival of the user.

22. The computerized-method of claim 1 wherein the computer program product includes further instructions for causing the at least one processor to execute the method further comprising:

determining a ride fare calculation based on a distance between the requested pick-up location and an actual pick-up location, a distance between the requested drop-off location and an actual drop-off location, or both, wherein as the distance between the requested pick-up location and actual pick-up location increases or the distance between the requested drop-off location and the actual drop-off location increases, or both, the ride fare calculation causes the ride fare cost to go down.

23. The computerized-method of claim 1 wherein the walking distance is further based on walking time from one location to another location, based on average walking speed.

24. The computerized-method of claim 1 wherein identifying at least one candidate ridesharing vehicle is further based on real-time traffic data received from a real-time traffic monitoring system.

Assignments (2)
SECURITY INTEREST Recorded Apr 27, 2021
From: VIA TRANSPORTATION, INC.
To: WELLS FARGO BANK, NATIONAL ASSOCIATION
Reel/Frame 056053/0512 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 19, 2019
From: RAMOT, DANIEL; SHOVAL, OREN; MARCOVITCH, SHMULIK; RAKAH, YARON; EYLAT, UDI
To: VIA TRANSPORTATION, INC.
Reel/Frame 051050/0205 →
Continuity (6)
Continuation PCTUS2018033681 · May 21, 2018
Provisional Application 62614558 · Jan 8, 2018
Provisional Application 62594325 · Dec 4, 2017
Provisional Application 62537155 · Jul 26, 2017
Provisional Application 62509376 · May 22, 2017
Related Publication 20200104965A1 · Apr 2, 2020
References Cited (400)
US 4212069A · Baumann · 1980 [cited by applicant]
US 4502123A · Minami et al. · 1985 [cited by applicant]
US 4528679A · Shahbaz · 1985 [cited by applicant]
US 5604676A · Penzias · 1997 [cited by applicant]
US 5897629A · Shinagawa · 1999 [cited by applicant]
US 6459986B1 · Boyce · 2002 [cited by applicant]
US 7136747B2 · Raney · 2006 [cited by applicant]
US 7146270B2 · Nozaki · 2006 [cited by applicant]
US 8082095B2 · Sumcad et al. · 2011 [cited by applicant]
US 8220710B2 · Hoffman · 2012 [cited by applicant]
US 8412400B2 · D'Andrea · 2013 [cited by applicant]
US 8520695B1 · Rubin · 2013 [cited by applicant]
US 8538694B2 · Conway · 2013 [cited by applicant]
US 8688532B2 · Khunger et al. · 2014 [cited by applicant]
US 8868529B2 · Lerenc · 2014 [cited by applicant]
US 8930133B2 · Wurman · 2015 [cited by applicant]
US 9068851B2 · Lerenc · 2015 [cited by applicant]
US 9074904B1 · Huang et al. · 2015 [cited by applicant]
US 9094824B2 · Jayanthi · 2015 [cited by applicant]
US 9293048B2 · Fowler · 2016 [cited by applicant]
US 9304009B2 · Beaurepaire et al. · 2016 [cited by applicant]
US 9322661B2 · Wechsler · 2016 [cited by applicant]
US 9441981B2 · Abhyanker · 2016 [cited by applicant]
US 9448560B2 · D'Andrea · 2016 [cited by applicant]
US 9494439B1 · Ross et al. · 2016 [cited by applicant]
US 9562785B1 · Racah et al. · 2017 [cited by applicant]
US 9599481B2 · Lord et al. · 2017 [cited by applicant]
US 9679489B2 · Lambert · 2017 [cited by applicant]
US 9689694B2 · Lord · 2017 [cited by applicant]
US 9706367B2 · Tao · 2017 [cited by applicant]
US 9720415B2 · Levinson · 2017 [cited by applicant]
US 9903721B2 · Choi · 2018 [cited by applicant]
US 9939279B2 · Pan · 2018 [cited by applicant]
US 9965960B1 · Mcdavitt-Van Fleet · 2018 [cited by applicant]
US 10082793B1 · Glaser · 2018 [cited by applicant]
US 10152053B1 · Smith · 2018 [cited by applicant]
US 10156848B1 · Konrardy et al. · 2018 [cited by applicant]
US 10168168B2 · Rakah · 2019 [cited by applicant]
US 10235888B2 · Lambert · 2019 [cited by applicant]
US 10248913B1 · Gururajan · 2019 [cited by applicant]
US 10467554B2 · Yoo · 2019 [cited by applicant]
US 10572964B2 · Kim · 2020 [cited by applicant]
US 10648822B2 · Newlin · 2020 [cited by applicant]
US 10677602B2 · Rakah · 2020 [cited by applicant]
US 10762447B2 · Kislovskiy · 2020 [cited by applicant]
US 11062416B1 · Jang · 2021 [cited by applicant]
US 11361594B1 · Copeland · 2022 [cited by applicant]
US 11466998B1 · Williams · 2022 [cited by applicant]
US 11574263B2 · Shoval · 2023 [cited by applicant]
US 11620592B2 · Ramot · 2023 [cited by applicant]
US 11663532B2 · Shimodaira · 2023 [cited by applicant]
US 11674811B2 · Shoval · 2023 [cited by applicant]
US 11922816B1 · Hansen · 2024 [cited by applicant]
US 12033194B2 · Fujimoto · 2024 [cited by applicant]
US 20010037174A1 · Dickerson · 2001 [cited by applicant]
US 20020011940A1 · Cappel · 2002 [cited by applicant]
US 20030177020A1 · Okamura · 2003 [cited by applicant]
US 20040076280A1 · Ando · 2004 [cited by applicant]
US 20040088392A1 · Barrett · 2004 [cited by applicant]
US 20040093280A1 · Yamaguchi · 2004 [cited by applicant]
US 20040158483A1 · Lecouturier · 2004 [cited by examiner]
US 20040215382A1 · Breed · 2004 [cited by applicant]
US 20040254721A1 · Saiki · 2004 [cited by applicant]
US 20050021227A1 · Matsumoto · 2005 [cited by applicant]
US 20050280555A1 · Warner, IV · 2005 [cited by applicant]
US 20060059023A1 · Mashinsky · 2006 [cited by applicant]
US 20060106655A1 · Lettovsky et al. · 2006 [cited by applicant]
US 20060178949A1 · McGrath · 2006 [cited by applicant]
US 20060208169A1 · Breed · 2006 [cited by applicant]
US 20060276960A1 · Adamczyk · 2006 [cited by applicant]
US 20070164726A1 · de Marcken et al. · 2007 [cited by applicant]
US 20070168239A1 · Marcken et al. · 2007 [cited by applicant]
US 20070248220A1 · Crandell · 2007 [cited by applicant]
US 20080015923A1 · Masaba · 2008 [cited by applicant]
US 20080027772A1 · Gernega et al. · 2008 [cited by applicant]
US 20080152036A1 · Breed · 2008 [cited by applicant]
US 20080189207A1 · Wurster · 2008 [cited by applicant]
US 20080195428A1 · O'Sullivan · 2008 [cited by applicant]
US 20080270204A1 · Poykko · 2008 [cited by applicant]
US 20080277183A1 · Huang et al. · 2008 [cited by applicant]
US 20090005963A1 · Jarvinen · 2009 [cited by applicant]
US 20090049044A1 · Mitchell · 2009 [cited by applicant]
US 20090083111A1 · Carr · 2009 [cited by applicant]
US 20090140887A1 · Breed · 2009 [cited by applicant]
US 20090177502A1 · Doinoff · 2009 [cited by applicant]
US 20090192851A1 · Bishop · 2009 [cited by applicant]
US 20090210276A1 · Krumm et al. · 2009 [cited by applicant]
US 20090216600A1 · Hill · 2009 [cited by applicant]
US 20090248587A1 · Van Buskirk · 2009 [cited by applicant]
US 20090271227A1 · Hayat · 2009 [cited by applicant]
US 20090327011A1 · Petroff · 2009 [cited by applicant]
US 20100030594A1 · Swart · 2010 [cited by applicant]
US 20100052945A1 · Breed · 2010 [cited by applicant]
US 20100280884A1 · Levine · 2010 [cited by applicant]
US 20100299177A1 · Buczkowski et al. · 2010 [cited by applicant]
US 20100323657A1 · Barnard · 2010 [cited by applicant]
US 20110099040A1 · Felt · 2011 [cited by applicant]
US 20110125395A1 · Mathews · 2011 [cited by applicant]
US 20110130916A1 · Mayer · 2011 [cited by applicant]
US 20110130954A1 · D'Andrea · 2011 [cited by applicant]
US 20110153629A1 · Lehmann · 2011 [cited by applicant]
US 20110191017A1 · Certain · 2011 [cited by applicant]
US 20110195699A1 · Tadayon · 2011 [cited by applicant]
US 20110213629A1 · Clark · 2011 [cited by applicant]
US 20110238457A1 · Mason · 2011 [cited by applicant]
US 20110288765A1 · Conway · 2011 [cited by applicant]
US 20110301985A1 · Camp et al. · 2011 [cited by applicant]
US 20120010912A1 · Lele · 2012 [cited by applicant]
US 20120041675A1 · Juliver · 2012 [cited by applicant]
US 20120078672A1 · Mohebbi et al. · 2012 [cited by applicant]
US 20120109721A1 · Cebon · 2012 [cited by applicant]
US 20120232943A1 · Myr · 2012 [cited by applicant]
US 20120239452A1 · Trivedi · 2012 [cited by applicant]
US 20120290652A1 · Boskovic · 2012 [cited by applicant]
US 20130006464A1 · Speiser · 2013 [cited by applicant]
US 20130046586A1 · Lerner et al. · 2013 [cited by applicant]
US 20130046795A1 · Borgerson · 2013 [cited by applicant]
US 20130054281A1 · Thakkar et al. · 2013 [cited by applicant]
US 20130060468A1 · Delling · 2013 [cited by applicant]
US 20130060586A1 · Chen · 2013 [cited by applicant]
US 20130073327A1 · Edelberg · 2013 [cited by applicant]
US 20130096827A1 · McCall et al. · 2013 [cited by applicant]
US 20130102333A1 · Dam · 2013 [cited by applicant]
US 20130110385A1 · Heed et al. · 2013 [cited by applicant]
US 20130132140A1 · Amin et al. · 2013 [cited by applicant]
US 20130132369A1 · Delling et al. · 2013 [cited by applicant]
US 20130159028A1 · Lerenc et al. · 2013 [cited by applicant]
US 20130179205A1 · Slinin · 2013 [cited by applicant]
US 20130218455A1 · Clark · 2013 [cited by applicant]
US 20130231965A1 · Tokatly · 2013 [cited by applicant]
US 20130238167A1 · Stanfield et al. · 2013 [cited by applicant]
US 20140011522A1 · Lin et al. · 2014 [cited by applicant]
US 20140052481A1 · Monteil · 2014 [cited by applicant]
US 20140074757A1 · De Gennaro et al. · 2014 [cited by applicant]
US 20140082069A1 · Varoglu · 2014 [cited by applicant]
US 20140129302A1 · Amin · 2014 [cited by applicant]
US 20140129951A1 · Amin · 2014 [cited by applicant]
US 20140172727A1 · Abhyanker · 2014 [cited by applicant]
US 20140173511A1 · Lehmann et al. · 2014 [cited by applicant]
US 20140180773A1 · Zafiroglu et al. · 2014 [cited by applicant]
US 20140188775A1 · Lehmann · 2014 [cited by applicant]
US 20140214322A1 · Tsimhoni · 2014 [cited by applicant]
US 20140229255A1 · Scofield · 2014 [cited by applicant]
US 20140236413A1 · D'Andrea · 2014 [cited by applicant]
US 20140278616A1 · Stone · 2014 [cited by examiner]
US 20140323167A1 · Spearritt · 2014 [cited by applicant]
US 20140324505A1 · Lerenc et al. · 2014 [cited by applicant]
US 20140365250A1 · Ikeda · 2014 [cited by applicant]
US 20150006072A1 · Goldberg · 2015 [cited by applicant]
US 20150095122A1 · Eramian · 2015 [cited by applicant]
US 20150100238A1 · Cai et al. · 2015 [cited by applicant]
US 20150112585A1 · Knepper · 2015 [cited by applicant]
US 20150161554A1 · Sweeney et al. · 2015 [cited by applicant]
US 20150161564A1 · Sweeney · 2015 [cited by applicant]
US 20150204684A1 · Rostamian et al. · 2015 [cited by applicant]
US 20150206437A1 · Fowler · 2015 [cited by applicant]
US 20150219464A1 · Beaurepaire et al. · 2015 [cited by applicant]
US 20150242944A1 · Willard · 2015 [cited by applicant]
US 20150248689A1 · Paul · 2015 [cited by applicant]
US 20150294430A1 · Huang · 2015 [cited by applicant]
US 20150310378A1 · van der Berg · 2015 [cited by applicant]
US 20150310379A1 · Farrelly · 2015 [cited by examiner]
US 20150324717A1 · Lord · 2015 [cited by applicant]
US 20150324718A1 · Lord · 2015 [cited by applicant]
US 20150324945A1 · Lord et al. · 2015 [cited by applicant]
US 20150345951A1 · Dutta et al. · 2015 [cited by applicant]
US 20160021154A1 · Schoeffler · 2016 [cited by applicant]
US 20160027306A1 · Lambert · 2016 [cited by applicant]
US 20160027307A1 · Abhyanker · 2016 [cited by applicant]
US 20160034845A1 · Hiyama · 2016 [cited by applicant]
US 20160069694A1 · Tao · 2016 [cited by applicant]
US 20160123756A1 · Becker · 2016 [cited by applicant]
US 20160171574A1 · Paulucci · 2016 [cited by applicant]
US 20160209220A1 · Laetz · 2016 [cited by applicant]
US 20160210675A1 · Smart · 2016 [cited by applicant]
US 20160231128A1 · Marks · 2016 [cited by applicant]
US 20160253599A1 · Lang · 2016 [cited by applicant]
US 20160320194A1 · Liu et al. · 2016 [cited by applicant]
US 20160320195A1 · Liu · 2016 [cited by applicant]
US 20160321771A1 · Liu et al. · 2016 [cited by applicant]
US 20160335576A1 · Peng · 2016 [cited by applicant]
US 20160349067A1 · Fowe · 2016 [cited by applicant]
US 20160356615A1 · Arata · 2016 [cited by applicant]
US 20160358471A1 · Hajj · 2016 [cited by examiner]
US 20160361970A1 · Pebbles · 2016 [cited by applicant]
US 20160364678A1 · Cao · 2016 [cited by applicant]
US 20160364679A1 · Cao · 2016 [cited by applicant]
US 20160364812A1 · Cao · 2016 [cited by applicant]
US 20160364823A1 · Cao · 2016 [cited by applicant]
US 20170039488A1 · Lin · 2017 [cited by applicant]
US 20170059334A1 · Mukherjee · 2017 [cited by applicant]
US 20170098377A1 · Marco · 2017 [cited by applicant]
US 20170116696A1 · Moore · 2017 [cited by applicant]
US 20170132540A1 · Hapamas · 2017 [cited by applicant]
US 20170138749A1 · Pan · 2017 [cited by applicant]
US 20170146350A1 · Beauepaire · 2017 [cited by applicant]
US 20170153714A1 · Gao et al. · 2017 [cited by applicant]
US 20170167882A1 · Ulloa Paredes et al. · 2017 [cited by applicant]
US 20170169366A1 · Klein · 2017 [cited by applicant]
US 20170176993A1 · Kato · 2017 [cited by applicant]
US 20170185948A1 · Magazinik · 2017 [cited by applicant]
US 20170192437A1 · Bier · 2017 [cited by applicant]
US 20170227371A1 · O'Mahony · 2017 [cited by applicant]
US 20170243492A1 · Lambert et al. · 2017 [cited by applicant]
US 20170248963A1 · Levinson et al. · 2017 [cited by applicant]
US 20170284819A1 · Donnelley · 2017 [cited by applicant]
US 20170286884A1 · Shoval · 2017 [cited by applicant]
US 20170293635A1 · Peterson · 2017 [cited by applicant]
US 20170300049A1 · Seally · 2017 [cited by applicant]
US 20170300053A1 · Wengreen et al. · 2017 [cited by applicant]
US 20170301054A1 · Sangoi et al. · 2017 [cited by applicant]
US 20170313208A1 · Lindsay · 2017 [cited by applicant]
US 20170365030A1 · Shoham et al. · 2017 [cited by applicant]
US 20180032928A1 · Li · 2018 [cited by applicant]
US 20180046944A1 · Barbera · 2018 [cited by applicant]
US 20180073882A1 · North · 2018 [cited by applicant]
US 20180080263A1 · Rose · 2018 [cited by applicant]
US 20180087915A1 · Marco · 2018 [cited by applicant]
US 20180091604A1 · Yamashita · 2018 [cited by applicant]
US 20180096606A1 · Moreira-Matias · 2018 [cited by applicant]
US 20180121847A1 · Zhao · 2018 [cited by applicant]
US 20180135993A1 · Thangaraj · 2018 [cited by examiner]
US 20180181128A1 · Urano · 2018 [cited by applicant]
US 20180189682A1 · Seacat · 2018 [cited by applicant]
US 20180191863A1 · Matthieson et al. · 2018 [cited by applicant]
US 20180197418A1 · Chu · 2018 [cited by applicant]
US 20180209803A1 · Rakah · 2018 [cited by applicant]
US 20180209805A1 · Rakah · 2018 [cited by applicant]
US 20180211124A1 · Alonso-Mora · 2018 [cited by applicant]
US 20180211186A1 · Rakah · 2018 [cited by applicant]
US 20180211218A1 · Berdinis · 2018 [cited by applicant]
US 20180211228A1 · Narayan · 2018 [cited by applicant]
US 20180224866A1 · Alonso-mora · 2018 [cited by applicant]
US 20180231984A1 · Alonso-mora · 2018 [cited by applicant]
US 20180251122A1 · Golston · 2018 [cited by applicant]
US 20180259976A1 · Williams · 2018 [cited by applicant]
US 20180260787A1 · Xi · 2018 [cited by examiner]
US 20180290610A1 · Zych · 2018 [cited by applicant]
US 20180338225A1 · Shimizu · 2018 [cited by applicant]
US 20180340790A1 · Kislovskiy et al. · 2018 [cited by applicant]
US 20180342035A1 · Sweeney · 2018 [cited by applicant]
US 20180342165A1 · Sweeney · 2018 [cited by applicant]
US 20180348772A1 · Stefan · 2018 [cited by applicant]
US 20180356239A1 · Marco · 2018 [cited by applicant]
US 20180376305A1 · Ramalho De Oliveira · 2018 [cited by applicant]
US 20190017839A1 · Eyler · 2019 [cited by applicant]
US 20190086221A1 · Thiyagarajan · 2019 [cited by examiner]
US 20190114595A1 · Raghunathan · 2019 [cited by applicant]
US 20190114638A1 · Flores · 2019 [cited by examiner]
US 20190120640A1 · Ho · 2019 [cited by applicant]
US 20190122561A1 · Shimizu · 2019 [cited by applicant]
US 20190156254A1 · Hansen · 2019 [cited by applicant]
US 20190156451A1 · Kitagishi · 2019 [cited by applicant]
US 20190156646A1 · Richey · 2019 [cited by applicant]
US 20190171943A1 · Pao et al. · 2019 [cited by applicant]
US 20190188608A1 · Gururajan · 2019 [cited by applicant]
US 20190195639A1 · Malewicz · 2019 [cited by examiner]
US 20190204096A1 · Cai · 2019 [cited by applicant]
US 20190205842A1 · Starns · 2019 [cited by applicant]
US 20190206258A1 · Chang et al. · 2019 [cited by applicant]
US 20190212149A1 · Ho · 2019 [cited by applicant]
US 20190259182A1 · Sarukkai et al. · 2019 [cited by applicant]
US 20190265059A1 · Warnick · 2019 [cited by applicant]
US 20190271552A1 · Choi et al. · 2019 [cited by applicant]
US 20190311307A1 · Ramot · 2019 [cited by applicant]
US 20200010090A1 · Matsuda · 2020 [cited by applicant]
US 20200019894A1 · Jin · 2020 [cited by applicant]
US 20200042019A1 · Marczuk · 2020 [cited by applicant]
US 20200082314A1 · Crapis · 2020 [cited by applicant]
US 20200104965A1 · Ramot · 2020 [cited by applicant]
US 20200151291A1 · Bhattacharya · 2020 [cited by applicant]
US 20200151631A1 · Lamers · 2020 [cited by applicant]
US 20200151885A1 · Yang · 2020 [cited by applicant]
US 20200160476A1 · Ramot · 2020 [cited by applicant]
US 20200160477A1 · Ramot · 2020 [cited by applicant]
US 20200160478A1 · Ramot · 2020 [cited by applicant]
US 20200160705A1 · Chase · 2020 [cited by applicant]
US 20200160709A1 · Ramot · 2020 [cited by applicant]
US 20200160718A1 · Saleh · 2020 [cited by applicant]
US 20200174487A1 · Viswanathan · 2020 [cited by applicant]
US 20200191584A1 · Kamata · 2020 [cited by applicant]
US 20200193834A1 · Qin · 2020 [cited by applicant]
US 20200273328A1 · Muberek · 2020 [cited by applicant]
US 20200279195A1 · Kobori · 2020 [cited by applicant]
US 20200333146A1 · Shoval · 2020 [cited by applicant]
US 20200334987A1 · Shoval · 2020 [cited by applicant]
US 20200349666A1 · Hodge · 2020 [cited by applicant]
US 20200361406A1 · Zych · 2020 [cited by applicant]
US 20200393256A1 · Sahin · 2020 [cited by applicant]
US 20210020047A1 · Kuhn · 2021 [cited by applicant]
US 20210073825A1 · Walling · 2021 [cited by examiner]
US 20210248520A1 · Krishnamurthy · 2021 [cited by examiner]
US 20210295706A1 · Shoval · 2021 [cited by applicant]
US 20220003561A1 · Shoval · 2022 [cited by applicant]
US 20220027818A1 · Jin · 2022 [cited by applicant]
US 20220120572A9 · Shoval · 2022 [cited by applicant]
US 20220164364A1 · Funk · 2022 [cited by applicant]
US 20230119116A1 · Xu · 2023 [cited by applicant]
US 20240232273A1 · Pana · 2024 [cited by applicant]
CA 2874200 · 2013 [cited by applicant]
CN 103198647 · 2013 [cited by applicant]
CN 103279669 · 2013 [cited by applicant]
CN 103327440 · 2013 [cited by applicant]
CN 104751625 · 2015 [cited by applicant]
EP 2605149 · 2013 [cited by applicant]
EP 2665050 · 2013 [cited by applicant]
EP 2792538A2 · 2014 [cited by applicant]
EP 3023740 · 2016 [cited by applicant]
EP 3472563 · 2019 [cited by applicant]
EP 3574459 · 2019 [cited by applicant]
EP 3631707 · 2020 [cited by applicant]
EP 3640596 · 2020 [cited by applicant]
EP 3659078 · 2020 [cited by applicant]
EP 3738085 · 2020 [cited by applicant]
EP 3776395 · 2021 [cited by applicant]
ES 2525738 · 2014 [cited by applicant]
GB 2397683 · 2004 [cited by applicant]
JP 2003006294 · 2003 [cited by applicant]
JP A2003006294 · 2003 [cited by applicant]
JP 2003233656 · 2003 [cited by applicant]
JP A2003233656 · 2003 [cited by applicant]
JP 2003271706 · 2003 [cited by applicant]
JP A2003271706 · 2003 [cited by applicant]
JP 2003281422 · 2003 [cited by applicant]
JP A2003281422 · 2003 [cited by applicant]
JP 2004062490 · 2004 [cited by applicant]
JP A2004062490 · 2004 [cited by applicant]
JP 2004192366 · 2004 [cited by applicant]
JP 2004362271 · 2004 [cited by applicant]
JP 2009069117 · 2009 [cited by applicant]
JP 2010231258A · 2010 [cited by applicant]
JP 2011214930 · 2011 [cited by applicant]
JP 2019525299 · 2019 [cited by applicant]
JP 2020522789 · 2020 [cited by applicant]
KR 20090044693 · 2009 [cited by applicant]
KR 20100053717 · 2010 [cited by applicant]
KR 101752159 · 2017 [cited by applicant]
KR 102064376 · 2020 [cited by applicant]
KR 20210155209 · 2021 [cited by applicant]
SG 2012065264 · 2014 [cited by applicant]
WO WO2006128946 · 2006 [cited by applicant]
WO WO2011066468 · 2011 [cited by applicant]
WO WO2012143300 · 2012 [cited by applicant]
WO WO2014106617 · 2014 [cited by applicant]
WO WO2016209595 · 2016 [cited by applicant]
WO WO2017223031 · 2017 [cited by applicant]
WO WO2018140505 · 2018 [cited by applicant]
WO WO2018217640 · 2018 [cited by applicant]
WO WO2019023324 · 2019 [cited by applicant]
WO WO2019136341 · 2019 [cited by applicant]
WO WO2019199766 · 2019 [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2018/033681, Nov. 29, 2018 (9 pages). [cited by applicant]
Tim Paul Bauer, Janick Edinger, and Christian Becker, A Qualitative and Quantitative Analysis of Real Time Traffic Information Providers, Proceedings of the 4th IEEE International Workshop on Pervasive Context, 2019. [cited by applicant]
Schreieck et al. A Matching Algorithm for Dynamic Ridesharing, Transportation Research Procedia, 19, 2016, 272-285. [cited by applicant]
Paz Linares M. et al. A simulation framework for real-time assessment of dynamic ride sharing demand responsive transportation models, Dec. 11, 2016; Dec. 11, 2016-Dec. 14, 2016, Dec. 11, 2016, pp. 2216-2227, XP05831007… [cited by applicant]
Notice of Allowance for U.S. Appl. No. 16/751,321 dated May 1, 2023. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 16/379,243 dated Nov. 29, 2022. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 15/629,919 dated Dec. 7, 2022. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 16/711,399 dated May 4, 2023. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/856,393 dated Jan. 24, 2023. [cited by applicant]
Horn, Mark et al. Procedures for planning multi-leg journeys with fixed-route and demand-responsive passenger transport services, Transportation Research Part C: Emerging Technologies 12.1 (2004):33-55 (Year: 2004). [cited by applicant]
Gruebele, P. “Interactive system for real time dynamic multi-hop carpooling.” Global Transport Knowledge Partnership (2008): 1-17. [cited by applicant]
Ridesharing in North America: Past, Present, and Future, Nelson D. Chan and Susan Shaheen, published in Transport Reviews, vol. 32, No. 1, 93-112, Jan. 2012. [cited by applicant]
Los Angeles Smart Traveler Field Operational Test Evaluation, Genevieve Giuliano, Randolph W. Hall, and Jacqueline M. Golob, University of Southern California, California PATH Research Report UCB-ITS-PRR-95-41, Dec. 199… [cited by applicant]
Seattle Smart Traveler, Daniel J. Dailey, Donald Loseff, David Meyers, Final Research Report, Washington State Transportation Center (TRAC), Oct. 1997, 1-32. [cited by applicant]
Dynamic Taxi-sharing Service Using Intelligent Transportation System Technologies, Chi-Chung Tao, IEEE, 3209-3212, 2007. [cited by applicant]
A Survey of Mobile Phone Sensing, Nicholas D. Lane, Emiliano Miluzzo, Hong Lu, Daniel Peebles, Tanzeem Choudhury, and Andrew T. Campbell, IEEE Communications Magazine, 140-150, Sep. 2010. [cited by applicant]
The Research and Implementation of GPS Intelligent Transmission Strategy Based on on-board Android Smartphones, Zhiqiang Wei, Yaqing Song, Hao Liu, Yanxiu Sheng, and Xi Wang, IEEE, 1230-1233, 2013. [cited by applicant]
Smarter transportation case study #10: Dynamic Ridesharing in Cork., Transportation for America, https://web.archive.org/web/20111007214904/http://t4america.org/blog/2...ter-transportation-case-study-10-dynamic-rideshar… [cited by applicant]
Avego Real-Time Ridesharing, Avego Ltd., https://web.archive.org/web/20111021225957/http://www.avego.com:80/st/realtime.php , Crawled 2011, Retrieved Nov. 15, 2021. [cited by applicant]
Avego Introduction, Avego Ltd., https://web.archive.org/web/20111102165609/http://www.avego.com:80/st/index.php, Crawled 2011, Retrieved Nov. 15, 2021. [cited by applicant]
Understanding the NAVSTAR GPS, GIS, and IVHS 2nd Edition, Tom Logsdon, Van Nostrand Reinhold, 1995. [cited by applicant]
Behind the Success of the CVCC Engine, Honda Worldwide, https://web.archive.org/web/20070219081359/http://world.honda.com/history/challenge/1981navigationsystem/text/01.html, Crawled 2007, Retrieved Dec. 13, 2021. [cited by applicant]
The Final Test: From Suzuka to Tokyo, Honda Worldwide, https://web.archive.org/web/20070221131328/http://world.honda.com/history/challenge/1981navigationsystem/text/06.html, Crawled 2007, Retrieved Dec. 13, 2021. [cited by applicant]
Creating a Progressive Strategy, Honda Worldwide, https://web.archive.org/web/20070221131445/http://world.honda.com/history/challenge/1981navigationsystem/text/02.html, Crawled 2007, Retrieved Dec. 13, 2021. [cited by applicant]
Map Navigation Software of the Electro-Multivision of the '91 Toyota Soarer, Kunihiro Ishikawa, Michima Ogawa, Shiegtoshi Azuma, and Tooru Ito, IEEE Vehicle Navigation and Information Systems Conference, 463-473, 1991. [cited by applicant]
Automobile Navigation: Where is it Going?, Robert L. French, IEEE Aerospace and Electronic Systems Magazine, vol. 2, Issue: 5, 6-12, May 1987. [cited by applicant]
TravTek Global Evaluation and Executive Summary, V.W. Imnan and J.I. Peters, U.S. Department of Transportation Federal Highway Administration, Pub. No. FHWA-RD-96-031, Mar. 1996. [cited by applicant]
TravTek System Architecture Evaluation, C. Blumentritt, K. Balke, E. Symour, and R. Sanchez, U.S. Department of Transportation Federal Highway Administration, Pub. No. FHWARD-94-141, Jul. 1995. [cited by applicant]
Historical overview of automobile navigation technology, Robert L. French, 36th IEEE Vehicular Technology Conference, 1986. [cited by applicant]
The Dynamic Traffic Information Collection and Processing Methods of ITS Common Information Platform Based on Floating Car Technology, Haowei Su and Wei Zhang, IEEE 2008 International Seminar on Future BioMedical Inform… [cited by applicant]
Furuhata, et al., Ridesharing: The state-of-the-art and future directions, Transportation Research Part B 57 (2013) 28-46U. [cited by applicant]
Celes Clayson ClaysonCeles@DCC UFMG BR et al: “Mobility Trace Analysis for Intelligent Vehicular Networks”, ACM Computing Surveys, ACM, New York, NY, US, US, vol. 54, No. 3, Apr. 17, 2021 (Apr. 17, 2021) pp. 1-38, XP058… [cited by applicant]
Rahul Das et al: “Automated Urban Travel Interpretation: A Bottom-up Approach for Trajectory Segmentation”, Sensors, vol. 16, No. 11, Nov. 23, 2016 (Nov. 23, 2016), p. 1962, XP055709160. [cited by applicant]
Goel, Preeti, Lars Kulik and Kotagiri Ramamohanarao , Optimal pick up point selection for effective ride sharing, IEEEE Transactions on Big Data 3.2 (2016): 154-168 (Year:2016). [cited by applicant]
Ta, Na, et al. “An efficient ride-sharing framework for maximizing shared route.” IEEE Transactions on Knowledge and Data Engineering 30.2 (2018): 219-233. (Year: 2018). [cited by applicant]
Tong, Wei, Jingyu Hua, and Sheng Zhong. “A jointly differentially private scheduling protocol for ridesharing services.” IEEE Transactions on Information Forensics and Security 12.10 (2017): 2444-2456. (Year: 2017). [cited by applicant]
Ota, Masayo, et al. “Stars: Simulating taxi ride sharing at scale.” IEEE Transactions on Big Data 3.3 (2016): 349-361. (Year: 2016). [cited by applicant]
Freiberg, German, et al. Demand Responsive Transit: Understanding Emerging Solutions, WR, Mexico, May 2021: 1-58. [cited by applicant]
Sottini, Francesco et al., Andiamo: A multiagent system to provide a mobile-based rideshare service, 2006. [cited by applicant]
Wang et al., Utilizing taxi empty cruise time to solve the short distance trip problem, ITS World Congress, year 2010. [cited by applicant]
Office Action for U.S. Appl. No. 17/856,393 dated Jan. 24, 2023. [cited by applicant]
Office Action for U.S. Appl. No. 17/856,393 dated Jan. 29, 2024. [cited by applicant]
Office Action for U.S. Appl. No. 17/856,393 dated Sep. 12, 2022. [cited by applicant]
Office Action for U.S. Appl. No. 17/856,393 dated Aug. 25, 2023. [cited by applicant]
Office Action for U.S. Appl. No. 16/711,399 dated Aug. 30, 2022. [cited by applicant]
Office Action for U.S. Appl. No. 17/220,688 dated Jan. 25, 2024. [cited by applicant]
Office Action for U.S. Appl. No. 16/688,052 dated Sep. 1, 2022. [cited by applicant]
Office Action for U.S. Appl. No. 16/920,100 dated Aug. 30, 2023. [cited by applicant]
Office Action for U.S. Appl. No. 16/921,382 dated Aug. 16, 2023. [cited by applicant]