IP Library › Granted Patent US 12,620,310
Granted Patent B2
US 12,620,310 · App. 19/337,341 · Granted May 5, 2026

Systems and methods for delivery verification in a shared transport network

Inventor: Sean O'Sullivan (Princeton, NJ)
Assignee: CARMA TECHNOLOGY LIMITED
G08G1/123G06Q10/00G06Q10/02G06Q10/025G06Q10/063112G06Q50/40
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,620,310
App. No.
19/337,341
Granted
May 5, 2026
Kind
B2
Abstract

The network system triggers registration of the start of a transport journey in response to a communication of a transport user device and a transport provider device with each other, performs a continuous coordinated proximity monitoring to verify the identity of a transport user and a transport provider vehicle, and triggers registration of the end of the transport journey through communication of the transport user device and the transport provider device with each other.

Claims (48)

1 . A computer-implemented method for transporting a good using a shared transport system, the computer-implemented method comprising:

obtaining, via the shared transport system, information regarding a transport request of a good, the information identifying a pick-up location and a drop-off location, and the transport request associated with a transport user and a transport provider;

transmitting, via the shared transport system, transport instructions to a transport provider device associated with the transport provider;

transmitting, via the shared transport system, a first Personal Identification Number (PIN) to a transport user device associated with the transport user, wherein the transmitting of the first PIN to the transport user device is performed in response to one or more of:

verifying that the transport provider has accepted the transport request via the transport provider device; or

determining an estimated time of arrival of the transport provider to the drop-off location;

receiving, via the shared transport system, a second PIN from the transport provider device, wherein the second PIN is received by the transport provider device upon:

the transport provider prompting the transport user to provide the first PIN; and

the transport provider then providing the first PIN to the transport provider device; and

verifying, via the shared transport system, that the good has been delivered to the drop-off location based on the second PIN matching the first PIN.

2 . The computer-implemented method of claim 1 , wherein the first PIN is generated automatically and communicated to the transport user device via SMS, e-mail, or a mobile application of the transport user device.

3 . The computer-implemented method of claim 1 , further comprising:

verifying, via the shared transport system, that the transport provider arrived at the drop-off location based on determining a coordinated proximity between the transport user device and the transport provider device.

4 . The computer-implemented method of claim 3 , wherein the determining of the coordinated proximity between the transport user device and the transport provider device is based on polling location information of each of the transport user device and the transport provider device.

5 . The computer-implemented method of claim 1 , further comprising:

matching the transport provider to the transport request based on one or more of a physical proximity of the transport provider device to the pick-up location, a travel direction of the transport provider, or an estimated time of arrival for the transport provider at the pick-up location.

6 . A shared transport system for transporting a good, the shared transport system comprising:

at least one memory storing instructions; and

at least one processor operatively connected to the at least one memory and configured to execute the instructions to perform operations, including:

obtaining, via the shared transport system, information regarding a transport request of a good, the information identifying a pick-up location and a drop-off location, and the transport request associated with a transport user and a transport provider;

transmitting, via the shared transport system, transport instructions to a transport provider device associated with the transport provider;

transmitting, via the shared transport system, a first Personal Identification Number (PIN) to a transport user device associated with the transport user, wherein the transmitting of the first PIN to the transport user device is performed in response to one or more of:

verifying that the transport provider has accepted the transport request via the transport provider device; or

determining an estimated time of arrival of the transport provider to the drop-off location;

receiving, via the shared transport system, a second PIN from the transport provider device, wherein the second PIN is received by the transport provider device upon:

the transport provider prompting the transport user to provide the first PIN; and

the transport provider then providing the first PIN to the transport provider device; and

verifying, via the shared transport system, that the good has been delivered to the drop-off location based on the second PIN matching the first PIN.

7 . The shared transport system of claim 6 , wherein the first PIN is generated automatically and communicated to the transport user device via SMS, e-mail, or a mobile application of the transport user device.

8 . The shared transport system of claim 6 , wherein the operations further include: verifying, via the shared transport system, that the transport provider arrived at the drop-off location based on determining a coordinated proximity between the transport user device and the transport provider device.

9 . The shared transport system of claim 8 , wherein the determining of the coordinated proximity between the transport user device and the transport provider device is based on polling location information of each of the transport user device and the transport provider device.

10 . The shared transport system of claim 6 , wherein the operations further include:

matching the transport provider to the transport request based on one or more of a physical proximity of the transport provider device to the pick-up location, a travel direction of the transport provider, or an estimated time of arrival for the transport provider at the pick-up location.

11 . A non-transitory computer-readable medium comprising instructions for transporting a good, the instructions executable by one or more processors to perform operations, including:

obtaining, via the processor, information regarding a transport request of a good, the information identifying a pick-up location and a drop-off location, and the transport request associated with a transport user and a transport provider;

transmitting, via the processor, transport instructions to a transport provider device associated with the transport provider;

transmitting, via the processor, a first Personal Identification Number (PIN) to a transport user device associated with the transport user, wherein the transmitting of the first PIN to the transport user device is performed in response to one or more of:

verifying that the transport provider has accepted the transport request via the transport provider device; or

determining an estimated time of arrival of the transport provider to the drop-off location;

receiving, via the processor, a second PIN from the transport provider device, wherein the second PIN is received by the transport provider device upon:

the transport provider prompting the transport user to provide the first PIN; and

the transport provider then providing the first PIN to the transport provider device; and

verifying, via the processor, that the good has been delivered to the drop-off location based on the second PIN matching the first PIN.

12 . The non-transitory computer-readable medium of claim 11 , wherein the first PIN is generated automatically and communicated to the transport user device via SMS, e-mail, or a mobile application of the transport user device.

13 . The non-transitory computer-readable medium of claim 11 , wherein the operations further include verifying, via the processor, that the transport provider arrived at the drop-off location based on determining a coordinated proximity between the transport user device and the transport provider device.

14 . The non-transitory computer-readable medium of claim 13 , wherein the determining of the coordinated proximity between the transport user device and the transport provider device is based on polling location information of each of the transport user device and the transport provider device.

15 . The non-transitory computer-readable medium of claim 11 , wherein the operations further include:

matching, via the processor, the transport provider to the transport request based on one or more of a physical proximity of the transport provider device to the pick-up location, a travel direction of the transport provider, or an estimated time of arrival for the transport provider at the pick-up location.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 20, 2025
From: O'SULLIVAN, SEAN
To: CARMA TECHNOLOGY LTD.
Reel/Frame 072597/0588 →
Continuity (12)
Continuation 18797008 · Aug 7, 2024
Continuation 18164816 · Feb 6, 2023
Continuation 17305553 · Jul 9, 2021
Continuation 17019674 · Sep 14, 2020
Continuation 16670015 · Oct 31, 2019
Continuation 16564819 · Sep 9, 2019
Continuation 16197953 · Nov 21, 2018
Continuation 15998864 · Aug 17, 2018
Continuation 12924487 · Sep 28, 2010
Division 12069656 · Feb 12, 2008
Provisional Application 60900808 · Feb 12, 2007
Related Publication 20260018055A1 · Jan 15, 2026
References Cited (249)
US 4360875A · Behnke · 1982 [cited by applicant]
US 5168451A · Bolger · 1992 [cited by applicant]
US 5799263A · Culbertson · 1998 [cited by applicant]
US 5945919A · Trask · 1999 [cited by applicant]
US 6085976A · Sehr · 2000 [cited by applicant]
US 6240362B1 · Gaspard, II · 2001 [cited by applicant]
US 6353661B1 · Bailey, III · 2002 [cited by applicant]
US 6356838B1 · Paul · 2002 [cited by examiner]
US 6363323B1 · Jones · 2002 [cited by applicant]
US 6374176B1 · Schmier et al. · 2002 [cited by applicant]
US 6411897B1 · Gaspard, II · 2002 [cited by applicant]
US 6434510B1 · Callaghan · 2002 [cited by applicant]
US 6675150B1 · Camer · 2004 [cited by applicant]
US 6807566B1 · Bates et al. · 2004 [cited by applicant]
US 6919804B1 · Cook et al. · 2005 [cited by applicant]
US 6925381B2 · Adamczyk · 2005 [cited by applicant]
US 6975997B1 · Murakami et al. · 2005 [cited by applicant]
US 7062376B2 · Oesterling · 2006 [cited by applicant]
US 7080019B1 · Hurzeler · 2006 [cited by applicant]
US 7119716B2 · Horstemeyer · 2006 [cited by applicant]
US 7363319B2 · Cappellini · 2008 [cited by applicant]
US 7449998B1 · Au et al. · 2008 [cited by applicant]
US 7627422B2 · Adamczyk et al. · 2009 [cited by applicant]
US 7840427B2 · O'Sullivan · 2010 [cited by applicant]
US 7870025B2 · English · 2011 [cited by applicant]
US 7877204B2 · Sprigg · 2011 [cited by applicant]
US 7957871B1 · Echeruo · 2011 [cited by applicant]
US 8190878B2 · Stern et al. · 2012 [cited by applicant]
US 8635690B2 · Alperovitch et al. · 2014 [cited by applicant]
US 8682804B1 · Yoon · 2014 [cited by applicant]
US 8712397B2 · Feng · 2014 [cited by applicant]
US 9026454B2 · Hinrichs et al. · 2015 [cited by applicant]
US 9111315B2 · Mitchell · 2015 [cited by applicant]
US 9762601B2 · Truong et al. · 2017 [cited by applicant]
US 9892637B2 · Demisse · 2018 [cited by applicant]
US 9911169B1 · Geist et al. · 2018 [cited by applicant]
US 9939279B2 · Pan et al. · 2018 [cited by applicant]
US 9959512B2 · Camp et al. · 2018 [cited by applicant]
US 9978282B2 · Lambert et al. · 2018 [cited by applicant]
US 9991169B2 · Van Dal et al. · 2018 [cited by applicant]
US 10024683B2 · Moore et al. · 2018 [cited by applicant]
US 10121289B1 · Gravelle · 2018 [cited by applicant]
US 10169987B1 · Demisse · 2019 [cited by applicant]
US 10190886B2 · Droege et al. · 2019 [cited by applicant]
US 10198700B2 · Farrelly et al. · 2019 [cited by applicant]
US 10325228B2 · Khan · 2019 [cited by applicant]
US 10395525B1 · Demisse · 2019 [cited by applicant]
US 10466059B2 · O'Hare et al. · 2019 [cited by applicant]
US 10502582B2 · Yamashita et al. · 2019 [cited by applicant]
US 10520325B2 · Lewinson et al. · 2019 [cited by applicant]
US 10559199B1 · Demisse · 2020 [cited by applicant]
US 10671649B2 · Nguyen et al. · 2020 [cited by applicant]
US 10741071B2 · O'Sullivan · 2020 [cited by applicant]
US 10748417B1 · Demisse · 2020 [cited by applicant]
US 10748420B2 · O'Sullivan · 2020 [cited by applicant]
US 10803749B2 · O'Sullivan · 2020 [cited by applicant]
US 10890458B2 · Zhao et al. · 2021 [cited by applicant]
US 10916138B2 · O'Sullivan · 2021 [cited by applicant]
US 11010693B2 · Sarawgi et al. · 2021 [cited by applicant]
US 11017668B2 · O'Sullivan · 2021 [cited by applicant]
US 11164456B2 · O'Sullivan · 2021 [cited by applicant]
US 11263904B2 · O'Sullivan · 2022 [cited by applicant]
US 11302190B2 · O'Sullivan · 2022 [cited by applicant]
US 11308803B2 · O'Sullivan · 2022 [cited by applicant]
US 11392881B2 · Driegert et al. · 2022 [cited by applicant]
US 11416792B2 · Zhou et al. · 2022 [cited by applicant]
US 12372361B1 · Choi · 2025 [cited by examiner]
US 20010037174A1 · Dickerson · 2001 [cited by applicant]
US 20010056363A1 · Gantz et al. · 2001 [cited by applicant]
US 20020011940A1 · Cappel · 2002 [cited by applicant]
US 20020034292A1 · Tuoriniemi et al. · 2002 [cited by applicant]
US 20020040944A1 · Takaha et al. · 2002 [cited by applicant]
US 20020046076A1 · Baillargeon et al. · 2002 [cited by applicant]
US 20020052751A1 · Ebata · 2002 [cited by applicant]
US 20020069017A1 · Schmier et al. · 2002 [cited by applicant]
US 20020111914A1 · Terada · 2002 [cited by examiner]
US 20020121962A1 · Wolfe · 2002 [cited by applicant]
US 20020127997A1 · Karlstedt et al. · 2002 [cited by applicant]
US 20020135515A1 · Rankin et al. · 2002 [cited by applicant]
US 20020156572A1 · Bullock et al. · 2002 [cited by applicant]
US 20020173978A1 · Boies et al. · 2002 [cited by applicant]
US 20030040944A1 · Hileman · 2003 [cited by applicant]
US 20030100993A1 · Kirshenbaum et al. · 2003 [cited by applicant]
US 20030137435A1 · Haddad et al. · 2003 [cited by applicant]
US 20030139941A1 · Matsumoto · 2003 [cited by applicant]
US 20030179113A1 · Apostolopoulos et al. · 2003 [cited by applicant]
US 20030195694A1 · Kozak et al. · 2003 [cited by applicant]
US 20040015475A1 · Scheepsma · 2004 [cited by applicant]
US 20040049424A1 · Murray et al. · 2004 [cited by applicant]
US 20040076280A1 · Ando et al. · 2004 [cited by applicant]
US 20040093280A1 · Yamaguchi · 2004 [cited by applicant]
US 20040106399A1 · Ki · 2004 [cited by applicant]
US 20040119589A1 · French et al. · 2004 [cited by applicant]
US 20040124977A1 · Biffar · 2004 [cited by applicant]
US 20040158483A1 · Lecouturier · 2004 [cited by applicant]
US 20040181495A1 · Grush · 2004 [cited by applicant]
US 20040243430A1 · Horstemeyer · 2004 [cited by applicant]
US 20040249818A1 · Isaac · 2004 [cited by applicant]
US 20040260470A1 · Rast · 2004 [cited by applicant]
US 20040267449A1 · Adamczyk · 2004 [cited by applicant]
US 20050021227A1 · Matsumoto et al. · 2005 [cited by applicant]
US 20050049781A1 · Oesterling · 2005 [cited by applicant]
US 20050068178A1 · Lee · 2005 [cited by examiner]
US 20050165762A1 · Bishop · 2005 [cited by applicant]
US 20050172148A1 · Ying · 2005 [cited by applicant]
US 20050197767A1 · Nortrup · 2005 [cited by applicant]
US 20060010037A1 · Angert et al. · 2006 [cited by applicant]
US 20060015394A1 · Sorensen · 2006 [cited by applicant]
US 20060039577A1 · Sanguino et al. · 2006 [cited by applicant]
US 20060059023A1 · Mashinsky · 2006 [cited by examiner]
US 20060074755A1 · Juetten et al. · 2006 [cited by applicant]
US 20060091206A1 · Olsen et al. · 2006 [cited by applicant]
US 20060153099A1 · Feldman et al. · 2006 [cited by applicant]
US 20060155460A1 · Raney · 2006 [cited by applicant]
US 20060178949A1 · McGrath · 2006 [cited by applicant]
US 20060234631A1 · Dieguez · 2006 [cited by applicant]
US 20060259353A1 · Gutmann · 2006 [cited by applicant]
US 20060276960A1 · Adamczyk et al. · 2006 [cited by applicant]
US 20070013209A1 · Neuburger et al. · 2007 [cited by applicant]
US 20070027825A1 · Pearce et al. · 2007 [cited by applicant]
US 20070030824A1 · Ribaudo et al. · 2007 [cited by applicant]
US 20070052586A1 · Horstemeyer · 2007 [cited by applicant]
US 20070135078A1 · Ljung · 2007 [cited by applicant]
US 20070143012A1 · Keaveny et al. · 2007 [cited by applicant]
US 20070150369A1 · Zivin · 2007 [cited by applicant]
US 20070165813A1 · Dean · 2007 [cited by applicant]
US 20070179792A1 · Kramer · 2007 [cited by applicant]
US 20070243880A1 · Gits et al. · 2007 [cited by applicant]
US 20070276595A1 · Lewinson et al. · 2007 [cited by applicant]
US 20080004802A1 · Horvitz · 2008 [cited by applicant]
US 20080018730A1 · Roth · 2008 [cited by examiner]
US 20080021723A1 · Devarakonda · 2008 [cited by applicant]
US 20080041936A1 · Vawter · 2008 [cited by applicant]
US 20080091342A1 · Assael · 2008 [cited by applicant]
US 20080109852A1 · Kretz et al. · 2008 [cited by applicant]
US 20080114629A1 · Pavlov · 2008 [cited by applicant]
US 20080114829A1 · Button et al. · 2008 [cited by applicant]
US 20080125967A1 · Sprigg · 2008 [cited by applicant]
US 20080140479A1 · Mello et al. · 2008 [cited by applicant]
US 20080154683A1 · Kawada et al. · 2008 [cited by applicant]
US 20080167892A1 · Clark et al. · 2008 [cited by applicant]
US 20080169937A1 · Lowry · 2008 [cited by applicant]
US 20080172173A1 · Chang et al. · 2008 [cited by applicant]
US 20080189207A1 · Wurster · 2008 [cited by applicant]
US 20080195428A1 · O'Sullivan · 2008 [cited by applicant]
US 20080262995A1 · Zweig et al. · 2008 [cited by applicant]
US 20080270010A1 · Harumoto et al. · 2008 [cited by applicant]
US 20080270019A1 · Anderson et al. · 2008 [cited by applicant]
US 20080270204A1 · Poykko et al. · 2008 [cited by applicant]
US 20080277183A1 · Huang et al. · 2008 [cited by applicant]
US 20090089105A1 · Wu · 2009 [cited by applicant]
US 20090119006A1 · Silver et al. · 2009 [cited by applicant]
US 20090172009A1 · Schmith et al. · 2009 [cited by applicant]
US 20090182818A1 · Krywaniuk · 2009 [cited by applicant]
US 20090216663A1 · White · 2009 [cited by examiner]
US 20090326991A1 · Wei et al. · 2009 [cited by applicant]
US 20100161392A1 · Ashby et al. · 2010 [cited by applicant]
US 20110102165A1 · Rahamim · 2011 [cited by applicant]
US 20110145089A1 · Khunger et al. · 2011 [cited by applicant]
US 20110153629A1 · Lehmann et al. · 2011 [cited by applicant]
US 20110196708A1 · Huang et al. · 2011 [cited by applicant]
US 20120130872A1 · Baughman et al. · 2012 [cited by applicant]
US 20130132246A1 · Amin et al. · 2013 [cited by applicant]
US 20130185109A1 · Loabneh et al. · 2013 [cited by applicant]
US 20130246301A1 · Radhakrishnan et al. · 2013 [cited by applicant]
US 20140032282A1 · Fu · 2014 [cited by applicant]
US 20140172727A1 · Abhyanker et al. · 2014 [cited by applicant]
US 20150206166A1 · Fletcher et al. · 2015 [cited by applicant]
US 20160069694A1 · Tao et al. · 2016 [cited by applicant]
US 20160328669A1 · Droege · 2016 [cited by applicant]
US 20160344777A1 · Fahlgren et al. · 2016 [cited by applicant]
US 20170011324A1 · Truong et al. · 2017 [cited by applicant]
US 20170178416A1 · Barreira Avegliano et al. · 2017 [cited by applicant]
US 20180211541A1 · Rakah et al. · 2018 [cited by applicant]
US 20180338225A1 · Shimizu · 2018 [cited by applicant]
US 20190050880A1 · Paul et al. · 2019 [cited by applicant]
US 20190051174A1 · Haque et al. · 2019 [cited by applicant]
US 20190073737A1 · Marchio · 2019 [cited by applicant]
US 20190095965A1 · Stayner et al. · 2019 [cited by applicant]
US 20190132702A1 · Ehsani et al. · 2019 [cited by applicant]
US 20190137288A1 · Rahematpura et al. · 2019 [cited by applicant]
US 20190205812A1 · Afzal et al. · 2019 [cited by applicant]
US 20190266690A1 · Mandeno et al. · 2019 [cited by applicant]
US 20200410857A1 · O'Sullivan · 2020 [cited by applicant]
US 20220135002A1 · Hassani et al. · 2022 [cited by applicant]
CA 1186056A · 1985 [cited by applicant]
DE 10113803A1 · 2002 [cited by applicant]
DE 10237831A1 · 2004 [cited by applicant]
DE 202005016720U1 · 2006 [cited by applicant]
DE 102005051130A1 · 2007 [cited by applicant]
EP 1251475A2 · 2002 [cited by applicant]
EP 1519288A1 · 2005 [cited by applicant]
EP 1710768A2 · 2006 [cited by applicant]
EP 1804226A2 · 2007 [cited by applicant]
EP 1251475B1 · 2009 [cited by applicant]
FR 2880975A1 · 2006 [cited by applicant]
GB 2397683A · 2004 [cited by applicant]
JP 2001291192A · 2001 [cited by applicant]
JP 2002041853A · 2002 [cited by applicant]
JP 2002074119A · 2002 [cited by applicant]
JP 2002140399A · 2002 [cited by applicant]
JP 2002367086A · 2002 [cited by applicant]
JP 2003030788A · 2003 [cited by applicant]
JP 2003036498A · 2003 [cited by applicant]
JP 2003151083A · 2003 [cited by applicant]
JP 2003168195A · 2003 [cited by applicant]
JP 2003217091A · 2003 [cited by applicant]
JP 2003256982A · 2003 [cited by applicant]
JP 2003281692A · 2003 [cited by applicant]
JP 2003331013A · 2003 [cited by applicant]
JP 2005182146A · 2005 [cited by applicant]
KR 100408931B1 · 2003 [cited by applicant]
KR 20060107894A · 2006 [cited by applicant]
KR 20070042263A · 2007 [cited by applicant]
TW 1258592B · 2006 [cited by applicant]
WO 9952084A1 · 1999 [cited by applicant]
WO 2000076231A1 · 2000 [cited by applicant]
WO 0161604A1 · 2001 [cited by applicant]
WO 0206994A2 · 2002 [cited by applicant]
WO 02073546A2 · 2002 [cited by applicant]
WO 2002101683A1 · 2002 [cited by applicant]
WO 03023641A1 · 2003 [cited by applicant]
WO 03040971A1 · 2003 [cited by applicant]
WO 2004008799A1 · 2004 [cited by applicant]
WO 2004081833A1 · 2004 [cited by applicant]
WO 2005022426A1 · 2005 [cited by applicant]
WO 2005045549A2 · 2005 [cited by applicant]
WO 2005104059A2 · 2005 [cited by applicant]
WO 2006011158A2 · 2006 [cited by applicant]
WO 2006088703A2 · 2006 [cited by applicant]
WO 2007139375A1 · 2007 [cited by applicant]
Fleet Commander, “Agile Fleet Commander User's Guide” Sep. 2007 (34 pages). [cited by applicant]
Calvo R.W., et al., “A Distributed Geographic Information System for the Daily Car Pooling Problem,” Computers and Operations Research vol. 31, No. 13, 2004, Abstract and Introduction only (6 pages). [cited by applicant]
Consolidated Code of Transportation Rules and General Instructions (1939 e.d.), Northern Pacific Railway Company (73 pages). [cited by applicant]
Dial R.B., “Autonomous Dial-a-ride Transit Introductory Overview,” Transportation Research Part C: Emerging Technologies, vol. 3, No. 5, 1995, pp. 261-275. [cited by applicant]
Liao, Ziqi, “Real Time Taxi Dispatching Using Global Positioning Systems” Communication of the ACM, vol. 46 No. 5, May 2003, pp. 81-83. [cited by applicant]
Truett L., et al., “Bus 54 Where are you A School Bus Intelligent Information System,” Rural Advanced Technology and Transportation Systems, 1998, International Conference (11 pages). [cited by applicant]
Dailey D.J., et al., “Seattle Smart Traveler: Dynamic Ridematching on the World Wide Web,” Transportation Research Part C 7, Mar. 5, 1999, pp. 1-17. [cited by applicant]
Dillenburg J.F., et al., “The Intelligent Travel Assistant,” Sep. 2-6, 2002 , 7 pages. [cited by applicant]
Hall R.W., et al., “DynamicRide-Sharing: Theory and Practice,” Journal of Transportation Engineering, Jul./Aug. 1997, vol. 123, pp. 308-315. [cited by applicant]
Hu P.S., “Summary of Travel Trends 1995 National Personal Transportation Survey,” Prepared for U.S. Department of Transportation, Federal High Administration, Dec. 1999, 142 pages. [cited by applicant]
Hwang M., et al., “Advanced Public Transportation Systems: State of the Art Update 2006,” Federal Transit Administration, Final Report, Report No. FTA-NJ-26-7062-06.1, Mar. 30, 2006, pp. 1-264. [cited by applicant]
Hyrecar, “The 14 Best Apps to track your Uber and Lyft Mileage,” Dec. 30, 2017, Retrieved from the Internet: URL https://web.archive.org/web/20171230231230/ http://hyrecar.com/blog/best-apps-to-track-uber-and-lyft-milea… [cited by applicant]
Miyamoto T., et al., “Agent-Based Planning Method for an On-Demand Transportation System,” Proceedings of the 2003 IEEE International Symposium on Intelligent Control, Oct. 5-8, 2003, pp. 620-625. [cited by applicant]
Roorda M.J., et al., “Past Presidents' Award for Merit in Transportation Engineering: Assessing Transportation Policy Using an Activity-Based Microsimulation Model of Travel Demand,” Institute of Transportation Engineer… [cited by applicant]
Savelsbergh M.W.P., et al., “The General Pickup and Delivery Problem,” Transportation Science, 1995, vol. 29(1), pp. 17-29. [cited by applicant]
Steger-Vonmetz D.C., “Improving Modal Choice and Transport Efficiency with the Virtual Ridesharing Agency,” Proceedings of the 8th International IEEE Conference on Intelligent Translaporation Systems, Sep. 13-16, 2005, … [cited by applicant]
Tao C.C., “Dynamic Taxi-sharing Service Using Intelligent Transportation System Technologies,” IEEE, International Conference on Wireless Communications, Networking and Mobile Computing Wireless Communications, Networki… [cited by applicant]
Winter S., et al., “Time Geography for Ad-Hoc Shared-Ride Trip Planning,” 2006, 8 pages. [cited by applicant]