IP Library › Granted Patent US 12,319,286
Granted Patent B2
US 12,319,286 · App. 18/354,430 · Granted Jun 3, 2025

Network computer system to control freight vehicle operation configurations

Inventors: Luis Madrigal (San Francisco, CA); Eyal Lasker (San Francisco, CA); Padmini Pyapali (San Francisco, CA)
Assignee: UBER TECHNOLOGIES, INC.
B60W30/16G06F16/24553G06Q10/08355B60W2300/147B60W2754/10
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,319,286
App. No.
18/354,430
Granted
Jun 3, 2025
Kind
B2
Abstract

A network computer system can monitor a plurality of mobile computing devices to determine a current location of a corresponding freight operator of a plurality of freight operators. The network computer system can record the current location of each of the plurality of freight operators in a data store of the set of memory resources. Additionally, the network computer system can repeatedly query the data store to determine when at least two freight operators of the plurality of freight operators that satisfy a set of drafting conditions. The set of drafting conditions including a proximity condition as between the at least two freight operators and a candidate commencement location in response to the determination, the network computer system can implement a drafting arrangement between the at least two freight operators.

Claims (41)

1. A network computer system comprising:

one or more processors;

a set of memory resources to store a set of instructions, that when executed by the one or more processors, cause the network computer system to perform operations, the operations comprising:

assigning a freight operator to a shipping order, the shipping order including a pickup location, a permitted window of time for pickup, and a permitted window of time for delivery, wherein assigning the shipping order includes:

(i) monitoring, over one or more networks, a plurality of mobile computing devices comprising one or more sensors used to determine a current location of a corresponding freight operator of a plurality of freight operators,

each respective freight operator of the plurality of freight operators being associated with a mobile computing device of the plurality of mobile computing devices;

(ii) determining one or more freight operators for the shipping order based on a pickup window time for each of one or more shipping orders and the current location of the one or more freight operators; and

(iii) selecting a freight operator for the shipping order based on the pickup window of time for each of the one or more shipping orders and the current location of the freight operator;

selecting a drafting arrangement for the selected freight operator based on an expected location of the freight operator; and

scheduling the freight operator to load the shipping order during a specific time interval within the permitted window of time based on the selected drafting arrangement.

2. The network computer system of claim 1 , wherein the drafting arrangement is selected from a plurality of candidate drafting arrangements based on the pickup location and the permitted window of time for pickup.

3. The network computer system of claim 1 , wherein the expected location of the freight operator is at least one of: (i) an expected location before the freight operator picks up the shipping order or (ii) an expected location after the freight operator picks up the shipping order.

4. The network computer system of claim 1 , wherein selecting the drafting arrangement for the freight operator is based on an availability of the freight operator.

5. The network computer system of claim 1 , wherein selecting the drafting arrangement for the freight operator is based on a destination of the shipping order.

6. The network computer system of claim 1 , wherein selecting the drafting arrangement for the freight operator is based on an expected route for the shipping order.

7. The network computer system of claim 1 , wherein scheduling the freight operator to load the shipping order during the specific time interval is based on minimizing delay to when the selected drafting arrangement can commence.

8. The network computer system of claim 7 , wherein minimizing the delay to when the selected drafting arrangement can commence is determined based on a threshold time of arrival for the freight operator to arrive at a commencement location for the drafting arrangement.

9. The network computer system of claim 8 , wherein the threshold time of arrival comprises a latest time at which the freight operator can be expected to arrive at the commencement location after picking up the shipping order during the specific time interval.

10. The network computer system of claim 1 , wherein the scheduling the freight operator to load the shipping order during the specific time interval is based on an arrival time of the freight operator at a commencement location being within a threshold permitted wait time with respect to an arrival time of a second freight operator of the drafting arrangement.

11. A computer-implemented method comprising:

assigning a freight operator to a shipping order, the shipping order including a pickup location, a permitted window of time for pickup, and a permitted window of time for delivery, wherein assigning the shipping order includes:

(i) monitoring, over one or more networks, a plurality of mobile computing devices comprising one or more sensors used to determine a current location of a corresponding freight operator of a plurality of freight operators, each respective operator of the plurality of freight operators being associated with a mobile computing device of the plurality of mobile computing devices;

(ii) determining one or more freight operators for the shipping order based on a pickup window time for each of one or more shipping orders and the current location of the one or more freight operators; and

(iii) selecting a freight operator for the shipping order based on the pickup window of time for each of the one or more shipping orders and the current location of the freight operator;

selecting a drafting arrangement for the selected freight operator based on an expected location of the freight operator; and

scheduling the freight operator to load the shipping order during a specific time interval within the permitted window of time based on the selected drafting arrangement.

12. The computer-implemented method of claim 11 , wherein the scheduling the freight operator to load the shipping order during the specific time interval is based on an arrival time of the freight operator at a commencement location being within a threshold permitted wait time with respect to an arrival time of a second freight operator of the drafting arrangement.

13. The computer-implemented method of claim 12 , wherein the threshold permitted wait time is determined based on at least one of: (i) system settings or (ii) carrier preferences.

14. The computer-implemented method of claim 12 , wherein the threshold permitted wait time is determined based on freight operator preferences.

15. The computer-implemented method of claim 12 , wherein the threshold permitted wait time is determined based on scheduling requirements of the freight operator.

16. The computer-implemented method of claim 12 , wherein the threshold permitted wait time is determined based on a type of shipping order.

17. The computer-implemented method of claim 16 , wherein the type of shipping order comprises at least one of: (i) refrigerated or (ii) perishable.

18. The computer-implemented method of claim 11 , wherein the drafting arrangement is selected from a plurality of candidate drafting arrangements based on the pickup location and the permitted window of time for pickup.

19. The computer-implemented method of claim 11 , wherein the expected location of the freight operator is at least one of: (i) an expected location before the freight operator picks up the shipping order or (ii) an expected location after the freight operator picks up the shipping order.

20. One or more non-transitory computer readable media storing instructions that are executable by one or more processors to perform operations comprising:

assigning a freight operator to a shipping order, the shipping order including a pickup location, a permitted window of time for pickup, and a permitted window of time for delivery, wherein assigning the shipping order includes:

(i) monitoring, over one or more networks, a plurality of mobile computing devices comprising one or more sensors used to determine a current location of a corresponding freight operator of a plurality of freight operators, each respective freight operator of the plurality of freight operators being associated with a mobile computing device of the plurality of mobile computing devices;

(ii) determining one or more freight operators for the shipping order based on a pickup window time for each of one or more shipping orders and the current location of the one or more freight operators; and

(iii) selecting a freight operator for the shipping order based on the pickup window of time for each of the one or more shipping orders and the current location of the freight operator;

selecting a drafting arrangement for the selected freight operator based on an expected location of the freight operator; and

scheduling the freight operator to load the shipping order during a specific time interval within the permitted window of time based on the selected drafting arrangement.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 20, 2023
From: MADRIGAL, LUIS; LASKER, EYAL; PYAPALI, PADMINI
To: UBER TECHNOLOGIES, INC.
Reel/Frame 064322/0513 →
Continuity (4)
Continuation 17509623 · Oct 25, 2021
Continuation 16374317 · Apr 3, 2019
Provisional Application 62815925 · Mar 8, 2019
Related Publication 20240017724A1 · Jan 18, 2024
References Cited (188)
US 3953720A · Kelch · 1976 [cited by applicant]
US 6411897B1 · Gaspard, II · 2002 [cited by applicant]
US 6456207B1 · Yen · 2002 [cited by applicant]
US 6516056B1 · Justice et al. · 2003 [cited by applicant]
US 6591253B1 · Dinkin et al. · 2003 [cited by applicant]
US 6879962B1 · Smith et al. · 2005 [cited by applicant]
US 7315780B2 · Sugahara et al. · 2008 [cited by applicant]
US 7353181B2 · Nel · 2008 [cited by applicant]
US 7385529B2 · Hersh et al. · 2008 [cited by applicant]
US 7552063B1 · McEachern · 2009 [cited by applicant]
US 7561069B2 · Horstmeyer · 2009 [cited by applicant]
US 8131307B2 · Lubeck et al. · 2012 [cited by applicant]
US 8271316B2 · Blackshaw et al. · 2012 [cited by applicant]
US 9135803B1 · Fields et al. · 2015 [cited by applicant]
US 9478150B1 · Fields et al. · 2016 [cited by applicant]
US 9908530B1 · Fields et al. · 2018 [cited by applicant]
US 9921070B1 · Nimchuck et al. · 2018 [cited by applicant]
US 9955326B2 · Avrahami et al. · 2018 [cited by applicant]
US 11615370B1 · Li · 2023 [cited by examiner]
US 20020034292A1 · Tuoriniemi et al. · 2002 [cited by applicant]
US 20020065738A1 · Riggs et al. · 2002 [cited by applicant]
US 20020095308A1 · Pragelas et al. · 2002 [cited by applicant]
US 20020138338A1 · Trauth et al. · 2002 [cited by applicant]
US 20020188517A1 · Banerjee et al. · 2002 [cited by applicant]
US 20020194129A1 · Furuya et al. · 2002 [cited by applicant]
US 20030087648A1 · Mezhvinsky et al. · 2003 [cited by applicant]
US 20030233190A1 · Jones · 2003 [cited by applicant]
US 20040106399A1 · Ki · 2004 [cited by applicant]
US 20040112959A1 · Jun · 2004 [cited by applicant]
US 20040158483A1 · Lecouturier · 2004 [cited by applicant]
US 20040219933A1 · Faith · 2004 [cited by applicant]
US 20040249699A1 · Laurent et al. · 2004 [cited by applicant]
US 20040249818A1 · Isaac · 2004 [cited by applicant]
US 20040260470A1 · Rast · 2004 [cited by applicant]
US 20050149382A1 · Fenner et al. · 2005 [cited by applicant]
US 20050227704A1 · Ferra et al. · 2005 [cited by applicant]
US 20050278063A1 · Hersh et al. · 2005 [cited by applicant]
US 20060059023A1 · Mashinsky · 2006 [cited by applicant]
US 20060136254A1 · Greenstein · 2006 [cited by applicant]
US 20060155460A1 · Raney · 2006 [cited by applicant]
US 20060200306A1 · Adamcyzk · 2006 [cited by applicant]
US 20060200396A1 · Satterfield · 2006 [cited by applicant]
US 20060217885A1 · Crady et al. · 2006 [cited by applicant]
US 20070103342A1 · Milleville · 2007 [cited by applicant]
US 20080086322A1 · Wallace · 2008 [cited by applicant]
US 20080114629A1 · Pavlov · 2008 [cited by applicant]
US 20080125967A1 · Sprigg · 2008 [cited by applicant]
US 20080140597A1 · Satir et al. · 2008 [cited by applicant]
US 20080158016A1 · Wang et al. · 2008 [cited by applicant]
US 20080189207A1 · Wurster · 2008 [cited by applicant]
US 20080195428A1 · O'Sullivan · 2008 [cited by applicant]
US 20080270019A1 · Anderson et al. · 2008 [cited by applicant]
US 20080270204A1 · Poykko et al. · 2008 [cited by applicant]
US 20080312991A1 · Bharadwaj et al. · 2008 [cited by applicant]
US 20090037095A1 · Jani et al. · 2009 [cited by applicant]
US 20090049119A1 · Marcinkiewicz et al. · 2009 [cited by applicant]
US 20090083111A1 · Carr · 2009 [cited by applicant]
US 20090099971A1 · Salemme et al. · 2009 [cited by applicant]
US 20090125228A1 · Dicke · 2009 [cited by applicant]
US 20090177502A1 · Doinoff et al. · 2009 [cited by applicant]
US 20090216600A1 · Hill · 2009 [cited by applicant]
US 20090222284A1 · McEachern · 2009 [cited by applicant]
US 20090254270A1 · Yu · 2009 [cited by applicant]
US 20090313077A1 · Wheeler · 2009 [cited by applicant]
US 20100017275A1 · Carlson et al. · 2010 [cited by applicant]
US 20100076988A1 · Kenedy et al. · 2010 [cited by applicant]
US 20100243724A1 · Golla · 2010 [cited by applicant]
US 20110010300A1 · Audet · 2011 [cited by applicant]
US 20110060600A1 · Fox et al. · 2011 [cited by applicant]
US 20110099040A1 · Felt et al. · 2011 [cited by applicant]
US 20110137696A1 · Meyer et al. · 2011 [cited by applicant]
US 20110153495A1 · Dixon et al. · 2011 [cited by applicant]
US 20120130627A1 · Islam et al. · 2012 [cited by applicant]
US 20120179764A1 · Erdal · 2012 [cited by applicant]
US 20120253548A1 · Davidson · 2012 [cited by applicant]
US 20130030873A1 · Davidson · 2013 [cited by applicant]
US 20130041720A1 · Spires · 2013 [cited by applicant]
US 20130245991A1 · Kriss · 2013 [cited by applicant]
US 20130335193A1 · Hanson et al. · 2013 [cited by applicant]
US 20140122147A1 · Christie et al. · 2014 [cited by applicant]
US 20140200804A1 · Wippler · 2014 [cited by applicant]
US 20140229399A1 · Ranganathan et al. · 2014 [cited by applicant]
US 20140249742A1 · Krivacic et al. · 2014 [cited by applicant]
US 20140324633A1 · Pollak et al. · 2014 [cited by applicant]
US 20140330596A1 · Depura et al. · 2014 [cited by applicant]
US 20150006428A1 · Miller et al. · 2015 [cited by applicant]
US 20150081162A1 · Mitchell et al. · 2015 [cited by applicant]
US 20150088581A1 · Ikawa · 2015 [cited by applicant]
US 20160042303A1 · Medina et al. · 2016 [cited by applicant]
US 20160047646A1 · Ochsendorf et al. · 2016 [cited by applicant]
US 20160104111A1 · Jones et al. · 2016 [cited by applicant]
US 20160202069A1 · Wippler · 2016 [cited by applicant]
US 20160300186A1 · Scharaswak et al. · 2016 [cited by applicant]
US 20160334236A1 · Mason et al. · 2016 [cited by applicant]
US 20170046658A1 · Jones et al. · 2017 [cited by applicant]
US 20170109696A1 · Serjeantson et al. · 2017 [cited by applicant]
US 20170124506A1 · Khan et al. · 2017 [cited by applicant]
US 20170144671A1 · Memani et al. · 2017 [cited by applicant]
US 20170249847A1 · Marueli · 2017 [cited by applicant]
US 20180068269A1 · Pillai et al. · 2018 [cited by applicant]
US 20180096300A1 · Boye et al. · 2018 [cited by applicant]
US 20180211217A1 · Berdinis et al. · 2018 [cited by applicant]
US 20180211218A1 · Berdinis et al. · 2018 [cited by applicant]
US 20180211541A1 · Rakah et al. · 2018 [cited by applicant]
US 20190095859A1 · Pike et al. · 2019 [cited by applicant]
US 20190118825A1 · Madrigal et al. · 2019 [cited by applicant]
US 20190122551A1 · Madrigal et al. · 2019 [cited by applicant]
US 20190130351A1 · Arena · 2019 [cited by applicant]
US 20190213529A1 · Donnelly et al. · 2019 [cited by applicant]
US 20190232967A1 · Madrigal et al. · 2019 [cited by applicant]
US 20190318298A1 · Driegert et al. · 2019 [cited by applicant]
US 20190385119A1 · Chang et al. · 2019 [cited by applicant]
US 20200027348A1 · Madrigal et al. · 2020 [cited by applicant]
US 20200080853A1 · Tam · 2020 [cited by examiner]
US 20200242932A1 · Madrigal et al. · 2020 [cited by applicant]
CN 101951545 · 2011 [cited by applicant]
CN 103692969 · 2014 [cited by applicant]
CN 103761635 · 2014 [cited by applicant]
CN 103870893 · 2014 [cited by applicant]
CN 105069594 · 2015 [cited by applicant]
EP 2827289 · 2015 [cited by applicant]
JP 2002123887 · 2002 [cited by applicant]
JP 2006323784 · 2006 [cited by applicant]
JP 2017165509 · 2017 [cited by applicant]
KR 20170026805 · 2017 [cited by applicant]
NL 2017377 · 2018 [cited by applicant]
WO WO1995027964 · 1995 [cited by applicant]
WO WO20160133594 · 2016 [cited by applicant]
WO WO20170025955 · 2017 [cited by applicant]
WO WO20170107854 · 2017 [cited by applicant]
WO WO20180106730 · 2018 [cited by applicant]
WO WO20180107046 · 2018 [cited by applicant]
WO WO20180136179 · 2018 [cited by applicant]
Scholl, Joachim, Nils Boysen, and Armin Scholl. “E-platooning: Optimizing platoon formation for long-haul transportation with electric commercial vehicles.” European Journal of Operational Research 304.2 (2023): 525-542. [cited by examiner]
Bishop, “The Three Streams of Truck Platooning Development”, Linkedin, 2018. [cited by applicant]
Chaiken, “How Platooning Trucks Use LTE Communications”, Peloton Technology, 2018. [cited by applicant]
Clevenger, “Omnitracs, Peloton Forge Platooning Alliance”, Transport Topics, Feb. 16, 2017. [cited by applicant]
Doughtery, “Self-Driving Trucks May be Closer Than They Appear”, The New York Times, Nov. 13, 2017. [cited by applicant]
Extended European Search Report for EP 10835261.8 dated Oct. 10, 2016. [cited by applicant]
Examination Report for AU 2010325793, dated Jun. 26, 2013. [cited by applicant]
Examination Report No. 2 for AU 2015202596 dated May 22, 2017. [cited by applicant]
Fleet Owner, “Peloton, Cummins, Peterbilt, ZF join Purdue Univ. to launch demonstration program in March”, Technology, Nov. 15, 2016. [cited by applicant]
Graham, “Omnitracs Partners with Peloton Technology on Driver-Assistive Truck Platooning and Development of Combined Fleet Management Solutions”, Business Wire, Feb. 16, 2017. [cited by applicant]
Gross, “What Trucks Can Learn from Bicycles”, The Juice, Jun. 8, 2015. [cited by applicant]
Haden, “Driverless Vehicles May Someday Transform the Trucking Industry, But Platooning Can do That Today”, LinkedIn, Feb. 28, 2019. [cited by applicant]
Halsey, Are those 80,000 pound trucks tailgating each other? Soon it may be perfectly normal—and safe, The Washington Post, Oct. 22, 2017. [cited by applicant]
Hogle, “Peloton Platooning Solution Headed to Cooper Hewitt”, Smithsonian Design Museum, Peloton Technology, 2018. [cited by applicant]
Hsu, “Trucking Experts Say Platooning is Near—Cross-Carrier Partnerships, Data Sharing, Trucks.com”, May 4, 2017. [cited by applicant]
Hunt, J.B. “Find a Load, Make an Offer with Carrier 360: Watch the Video, https://www.jbhunt.com/blog/2017/10/25/ carrier-360-video”, Oct. 25, 2017. [cited by applicant]
Hunt, J.B., “Booking & Dispatching Loads https:// www.jbhunt.com/blog/2018/05/22/carrier-360-dispatching-freight/”, May 22, 2018. [cited by applicant]
Hunt, J.B., “Carrier 360 Introduces I'm Not Driving Mode, https://jbhunt.com/blog/2019/06/03/ carrier-360-introduces-im-not-driving-mde/”, Jun. 3, 2019. [cited by applicant]
Hunt, J.B., “Carrier 360 Tutorial: Creating Favorite Lanes [Video] https://jbhunt.com/blog/2018/04/13/carrier-360-favorite-lanes/”, Apr. 13, 2018. [cited by applicant]
Hunt, J.B., “Carrier 360 Tutorial: Load Board Features [Video], https://www.jbhunt.com/blog/2018/03/01/360-load-board-features”, Mar. 1, 2018. [cited by applicant]
Hunt, J.B., “Eight Things you can do using your J.B. hunt 360 account, https://www.jbhunt.com/blog/2017/06/13/jbhunt-360”, Jun. 13, 2017. [cited by applicant]
Hunt, J.B., “Get your next load recommendation from J.B. Hunt 360, https://www.jbhunt.com/blog/2017/08/02/360-load-recs/”, Aug. 2, 2017. [cited by applicant]
Hunt, J.B., “Loads Delivered to You: Three Ways to Find Loads Using Carrier 360 by J.B. Hunt, https:// www.jbhunt.com/blog/2017/09/28/find-loads-carrier-360/”, Sep. 28, 2017. [cited by applicant]
Hunt, J.B., “Simpler is Better: Easy check calls and automated detention, https://www.jbhunt.com/blog/2018/11/19/ check-calls-detention-carrier-360”, Nov. 19, 2018. [cited by applicant]
International Preliminary Report on Patentability for PCT/US2019/036622, mailed on Apr. 8, 2020. [cited by applicant]
International Search Report and Written Opinion PCT/US2017/066765 mailed on Apr. 13, 2018. [cited by applicant]
International Search Report and Written Opinion PCT/US2018/057538 for dated Jan. 25, 2019. [cited by applicant]
International Search Report and Written Opinion for PCT/US2019/012516 dated Apr. 24, 2019. [cited by applicant]
International Search Report and Written Opinion for PCT/US2019/036622 dated Sep. 23, 2019. [cited by applicant]
Kuebix, “White Paper, Effectively Managing Big Data in Your Supply Chain: How to take action now that will ensure success in the figure”, Aug. 22, 2017. [cited by applicant]
Lockwood, “Truck Platooning, Past, Present and Future”, HDT Truckinginfo, Fuel Smarts, Apr. 8, 2016. [cited by applicant]
Loo, “What It's Like to Be in the Peloton Driver's Seat, Peloton Technology”, 2018. [cited by applicant]
Luckevich, “V2V Communication in Platooning, Peloton Technology”, 2018. [cited by applicant]
Martinez, “Trucks flirt with driverless features”, The Detroit News, Jun. 29, 2015. [cited by applicant]
Nakano, “Here's What we mean by putting safety first”, Peloton Technology, 2018. [cited by applicant]
Peloton, “Industry Report: Platooning systems such as from Peloton offer significant fuel efficiency & safety gains”, North American Council on Freight Efficiency and Carbon War Room, Oct. 4, 2016. [cited by applicant]
Peloton, “Majority of US freight ton miles now occur in platooning approved states”, Peloton Technology, 2018. [cited by applicant]
Peloton, “Peloton applauds Michigan for national leadership in advancing truck safety and efficiency with deployment of driver-assistive commercial truck platooning”, Peloton Technology, 2018. [cited by applicant]
Peloton, “Peloton Technology demonstrates driver-assistive truck platooning system to Florida transportation leaders in connection with Florida pilot project”, Peloton Technology, Dec. 20, 2017. [cited by applicant]
Peloton, “Peloton Technology demonstrates driver-assistive truck platooning system to Michigan Officials on Path to Commercial Deployment”, Peloton Technology, Dec. 4, 2017. [cited by applicant]
Peloton, “Platooning combines advanced technology to improve safety and fuel efficiency”, Media—Paloton Technology/ Truck Platooning and Automation, 2018. [cited by applicant]
Peloton, “The Peloton System enables teams of professional drivers to save fuel by drafting safely”, Peloton Technology 2018. [cited by applicant]
Prince, et al., “The Dreamers: Six Innovators Hoping to Revolutionize the Auto Industry, Forever, Road and Track”, Dec. 1, 2017. [cited by applicant]
Reiskin, “Panelists Say Driverless Trucks Decades Away; Platooning Pairs Coming in 2017, Transport Topics”, Oct. 6, 2016. [cited by applicant]
Roberts, “Truck Platooning to Become Reality This Year, HOT Truckinginfo”, Fuel Smarts, Apr. 13, 2017. [cited by applicant]
Round et al., “Future Ride: Adopting New Technologies to Paratransit in the United States”, Working Paper, UCTC No. 306, University of California Transportation Center, 51 pages. [cited by applicant]
European Search Report for EP 10835261.8 mailed Sep. 30, 2013. [cited by applicant]
Scholl et al. “E-platooning: Optimizing platoon formation for long-haul transportation with electric commercial vehicles.” European Journal of Operational Research 304.2 (2023): 525-542. [cited by applicant]
Shigemitsu et al. “AVM System”, Fujistu Ten Technical Journel No. 33, 27:34, (2009). [cited by applicant]
Smartt, “The Peloton Cloud: Key to Platooning Safety, Efficiency & Control”, Peloton Technology, 2018. [cited by applicant]
Staff, “Wabco Partnerships Aimed at Advancing Autonomous Vehicle Tech”, HOT Truckinginfo, Fleet Management, Sep. 22, 2016. [cited by applicant]
Straight, “Peloton set to debut truck platoons later this year”, Freight Waves, May 2, 2017. [cited by applicant]
Tingley, “How to Make Cars Cooperate”, The New York Times, Nov. 9, 2017. [cited by applicant]
Written Opinion for PCT/US2019/012516 dated Oct. 11, 2019. [cited by applicant]
Zurschmeide, “Peloton's tech lets truckers play follow the leader to boost fuel economy”, Cars, Digital Trends, Jan. 14, 2019. [cited by applicant]