IP Library › Granted Patent US 12,408,008
Granted Patent B2
US 12,408,008 · App. 17/576,408 · Granted Sep 2, 2025

Local fleet connectivity system and methods

Inventors: Korry D. Kobel (Oshkosh, WI); Fredric L. Yutzy (Oshkosh, WI); Dan Adamson (Oshkosh, WI); Stefan Eshleman (Oshkosh, WI); Greg Pray (Oshkosh, WI); Patrick Booth (Oshkosh, WI); Brian Mohlman (Oshkosh, WI)
Assignee: OSHKOSH CORPORATION
H04W4/08B66F9/06B66F9/0755B66F9/07581B66F9/12B66F11/046G05B19/4155G05D1/0022G05D1/0027G05D1/0044G05D1/005G05D1/224G05D1/2246G05D1/225G05D1/226G05D1/692G05D1/86G06F3/0482G06F3/0484G06F3/0488G06Q10/20G06Q30/0251G06Q30/0611G06Q30/0631G06Q30/0641G07C5/006G07C5/0825G08B3/00G08B5/36G08B7/06G08B21/18H04L67/52H04L67/63H04W4/029H04W4/30H04W4/40H04W4/70H04W8/005H04W48/16H04W76/14H04W76/15H04W76/23B66F11/04B66F17/006G05B2219/45049G06F16/93H04W4/35H04W4/80H04W84/12H04W84/18H04W88/08H04W88/085
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,408,008
App. No.
17/576,408
Filed
Jan 14, 2022
Granted
Sep 2, 2025
Kind
B2
Art Unit
2688
USPC
340/3.1
Abstract

A local fleet connectivity system includes a plurality of machines disposed at a location. Each of the plurality of machines includes an implement and a prime mover configured to drive the implement. The system includes at least one control module communicably coupled with a first machine of the plurality of machines. The system includes at least one connectivity module communicably coupled with the plurality of machines. The at least one control module is configured to establish, via the at least one connectivity module, a connection between the plurality of machines. The at least one control module is configured to exchange, via the at least one connectivity module, data between the plurality of machines.

Claims (73)

1. A local fleet connectivity system, comprising:

a plurality of machines disposed at a location, each of the plurality of machines comprising an implement and a prime mover configured to drive the implement;

at least one control module communicably coupled with a first machine of the plurality of machines; and

at least one connectivity module communicably coupled with the plurality of machines;

wherein the at least one control module is configured to:

establish, via the at least one connectivity module, a connection between the plurality of machines;

detect the plurality of machines disposed at the location;

identify a classification of each of the plurality of machines;

determine which of the plurality of machines have corresponding classifications;

responsive to the determination of which of the plurality of machines have the corresponding classifications, link the plurality of machines that have the corresponding classifications together via the at least one connectivity module; and

exchange, via the at least one connectivity module, data between the plurality of machines.

2. The system of claim 1 , wherein the at least one control module is further configured to:

receive, via the at least one connectivity module, a command to perform a task; and

activate a first machine of the plurality of machines to perform the task indicated by the command.

3. The system of claim 2 , wherein the command comprises moving the first machine from a first position to a second position.

4. The system of claim 2 , wherein the at least one control module is further configured to:

determine the first machine of the plurality of machines cannot perform the task indicated by the command;

generate a notification indicating the first machine of the plurality of machines cannot perform the task indicated by the command, the notification comprising details corresponding to the first machine; and

transmit, via the at least one connectivity module, the notification to at least one user device.

5. The system of claim 4 , wherein the at least one control module is further configured to:

designate the first machine of the plurality of machines as inoperable based on determining the first machine of the plurality of machines cannot perform the task indicated by the command;

identify, via the at least one connectivity module, a second machine of the plurality of machines that is capable of performing the task indicated by the command; and

recommend, via the at least one connectivity module, the second machine as a replacement for the first machine to the at least one user device.

6. The system of claim 5 , wherein the at least one control module is further configured to actuate a visual indicator responsive to the designation of the first machine as inoperable, wherein the visual indicator is indicative of an inoperable state.

7. The system of claim 5 , wherein the at least one control module is further configured to:

determine the first machine is not disposed at the location; and

disconnect the first machine from the plurality of machines disposed at the location.

8. The system of claim 1 , wherein the at least one control module is further configured to:

receive, via the at least one connectivity module, a request from at least one user device to access machine-specific data corresponding to the plurality of machines, wherein the request comprises an access indicator;

identify at least one of the plurality of machines that is associated with the access indicator; and

provide, via the at least one connectivity module, machine-specific data corresponding to the at least one of the plurality of machines to the at least one user device.

9. The system of claim 1 , wherein the at least one control module is further configured to:

receive, via the at least one connectivity module, a request from at least one user device to access machine-specific data corresponding to the plurality of machines, wherein the request comprises an access indicator;

identify a subset of the machine-specific data that is associated with the access indicator; and

provide, via the at least one connectivity module, the subset of the machine-specific data to the at least one user device.

10. A method, comprising:

establishing, by at least one control module via at least one connectivity module, a connection between a plurality of machines disposed at a location, wherein establishing the connection between the plurality of machines comprises:

detecting, by the at least one control module, the plurality of machines disposed at the location;

identifying, by the at least one control module, a classification of each of the plurality of machines;

determining, by the at least one control module, which of the plurality of machines have corresponding classifications; and

responsive to determining which of the plurality of machines have the corresponding classifications, linking the plurality of machines that have the corresponding classifications together via the at least one connectivity module; and

exchanging, by the at least one control module via the at least one connectivity module, data between the plurality of machines,

wherein each of the plurality of machines comprises an implement and a prime mover configured to drive the implement.

11. The method of claim 10 , further comprising:

receiving, by the at least one control module via the at least one connectivity module, a command comprising a task to be performed; and

activating, by the at least one control module, a first machine of the plurality of machines to perform the task.

12. The method of claim 11 , wherein the command comprises moving the first machine from a first position to a second position.

13. The method of claim 11 , further comprising:

determining, by the at least one control module, the first machine of the plurality of machines cannot perform the task indicated by the command;

generating, by the at least one control module, a notification indicating the first machine of the plurality of machines cannot perform the task indicated by the command, the notification comprising details corresponding to the first machine; and

transmitting, by the at least one control module via the at least one connectivity module, the notification to at least one user device.

14. The method of claim 13 , further comprising:

identifying, by the at least one control module via the at least one connectivity module, a second machine of the plurality of machines that is capable of performing the task indicated by the command; and

recommending, by the at least one control module via the at least one connectivity module, the second machine as a replacement for the first machine to the at least one user device.

15. The method of claim 14 , further comprising:

determining, by the at least one control module, the first machine is malfunctioning;

designating, by the at least one control module, the first machine as inoperable based on determining the first machine is malfunctioning; and

actuating, by the at least one control module, a visual indicator responsive to designating the first machine as inoperable, wherein the visual indicator is indicative of an inoperable state.

16. The method of claim 15 , further comprising:

determining, by the at least one control module, the first machine removed from the location; and

disconnecting, by the at least one control module, the first machine from the plurality of machines disposed at the location.

17. The method of claim 10 , further comprising:

receiving, by the at least one control module via the at least one connectivity module, a request from at least one user device to access machine-specific data corresponding to the plurality of machines, wherein the request comprises an access indicator;

identifying, by the at least one control module, at least one of the plurality of machines that is associated with the access indicator; and

providing, by the at least one control module via the at least one connectivity module, machine-specific data corresponding to the at least one of the plurality of machines to the at least one user device.

18. A non-transitory computer readable medium having computer-executable instructions embodied therein that, when executed by a processor of a control module, cause the control module to perform operations comprising:

establishing, via at least one connectivity module, a connection between a plurality of machines disposed at a location, wherein establishing the connection between the plurality of machines comprises:

detecting the plurality of machines disposed at the location;

identifying a classification of each of the plurality of machines;

determining which of the plurality of machines have corresponding classifications; and

responsive to determining which of the plurality of machines have the corresponding classifications, linking the plurality of machines that have the corresponding classifications together via the at least one connectivity module; and

exchanging, via the at least one connectivity module, data between the plurality of machines,

wherein each of the plurality of machines comprises an implement and a prime mover configured to drive the implement.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 10, 2022
From: KOBEL, KORRY D.; YUTZY, FREDRIC L.; ADAMSON, DAN; PRAY, GREG; BOOTH, PATRICK; MOHLMAN, BRIAN; ESHLEMAN, STEFAN
To: OSHKOSH CORPORATION
Reel/Frame 058976/0496 →
Continuity (11)
Provisional Application 63138003 · Jan 15, 2021
Provisional Application 63138015 · Jan 15, 2021
Provisional Application 63137955 · Jan 15, 2021
Provisional Application 63138024 · Jan 15, 2021
Provisional Application 63137893 · Jan 15, 2021
Provisional Application 63137978 · Jan 15, 2021
Provisional Application 63137950 · Jan 15, 2021
Provisional Application 63138016 · Jan 15, 2021
Provisional Application 63137867 · Jan 15, 2021
Provisional Application 63137996 · Jan 15, 2021
Related Publication 20220229415A1 · Jul 21, 2022
References Cited (206)
US 3009747A · Pitzer · 1961 [cited by applicant]
US 4099761A · Cullings · 1978 [cited by applicant]
US 4178591A · Geppert · 1979 [cited by applicant]
US 4315652A · Barwise · 1982 [cited by applicant]
US 4426110A · Mitchell et al. · 1984 [cited by applicant]
US 4461608A · Boda · 1984 [cited by applicant]
US 4572567A · Johnson · 1986 [cited by applicant]
US 4573728A · Johnson · 1986 [cited by applicant]
US 4810020A · Powell · 1989 [cited by applicant]
US 5026104A · Pickrell · 1991 [cited by applicant]
US 5092731A · Jones et al. · 1992 [cited by applicant]
US 5209537A · Smith et al. · 1993 [cited by applicant]
US 5330242A · Lucky, Sr. · 1994 [cited by applicant]
US 5730430A · Hodson et al. · 1998 [cited by applicant]
US 5919027A · Christenson · 1999 [cited by applicant]
US 5934858A · Christenson · 1999 [cited by applicant]
US 5934867A · Christenson · 1999 [cited by applicant]
US 5938394A · Christenson · 1999 [cited by applicant]
US 5951235A · Young et al. · 1999 [cited by applicant]
US 5967731A · Brandt · 1999 [cited by applicant]
US 5984609A · Bartlett · 1999 [cited by applicant]
US 6033176A · Bartlett · 2000 [cited by applicant]
US 6062803A · Christenson · 2000 [cited by applicant]
US 6089813A · McNeilus et al. · 2000 [cited by applicant]
US 6120235A · Humphries et al. · 2000 [cited by applicant]
US 6123500A · McNeilus et al. · 2000 [cited by applicant]
US 6210094B1 · McNeilus et al. · 2001 [cited by applicant]
US 6213706B1 · Christenson · 2001 [cited by applicant]
US 6224318B1 · McNeilus et al. · 2001 [cited by applicant]
US 6264013B1 · Hodgins · 2001 [cited by applicant]
US 6315515B1 · Young et al. · 2001 [cited by applicant]
US 6336783B1 · Young et al. · 2002 [cited by applicant]
US 6350098B1 · Christenson et al. · 2002 [cited by applicant]
US 6411887B1 · Martens et al. · 2002 [cited by applicant]
US 6447239B2 · Young et al. · 2002 [cited by applicant]
US 6474928B1 · Christenson · 2002 [cited by applicant]
US 6526335B1 · Treyz et al. · 2003 [cited by applicant]
US 6565305B2 · Schrafel · 2003 [cited by applicant]
US 6611755B1 · Coffee et al. · 2003 [cited by applicant]
US 6993421B2 · Pillar et al. · 2006 [cited by applicant]
US 7070382B2 · Pruteanu et al. · 2006 [cited by applicant]
US 7207610B1 · Kauppila · 2007 [cited by applicant]
US 7284943B2 · Pruteanu et al. · 2007 [cited by applicant]
US 7398137B2 · Ferguson et al. · 2008 [cited by applicant]
US 7556468B2 · Grata · 2009 [cited by applicant]
US 7559735B2 · Pruteanu et al. · 2009 [cited by applicant]
US 7721857B2 · Harr · 2010 [cited by applicant]
US 7878750B2 · Zhou et al. · 2011 [cited by applicant]
US 7934758B2 · Stamey et al. · 2011 [cited by applicant]
US 8182194B2 · Pruteanu et al. · 2012 [cited by applicant]
US 8215892B2 · Calliari · 2012 [cited by applicant]
US 8360706B2 · Addleman et al. · 2013 [cited by applicant]
US 8514058B2 · Cameron · 2013 [cited by applicant]
US 8533604B1 · Parenti et al. · 2013 [cited by applicant]
US 8540475B2 · Kuriakose et al. · 2013 [cited by applicant]
US 8655505B2 · Sprock et al. · 2014 [cited by applicant]
US 8807613B2 · Howell et al. · 2014 [cited by applicant]
US 8833823B2 · Price et al. · 2014 [cited by applicant]
US 9028193B2 · Goedken · 2015 [cited by applicant]
US 9216856B2 · Howell et al. · 2015 [cited by applicant]
US 9387985B2 · Gillmore et al. · 2016 [cited by applicant]
US 9523582B2 · Chandrasekar et al. · 2016 [cited by applicant]
US 9624033B1 · Price et al. · 2017 [cited by applicant]
US 9694776B2 · Nelson et al. · 2017 [cited by applicant]
US 9880581B2 · Kuriakose et al. · 2018 [cited by applicant]
US 9886565B2 · Nielsen et al. · 2018 [cited by applicant]
US 9981803B2 · Davis et al. · 2018 [cited by applicant]
US 10018171B1 · Breiner et al. · 2018 [cited by applicant]
US 10035648B2 · Haddick et al. · 2018 [cited by applicant]
US 10196205B2 · Betz et al. · 2019 [cited by applicant]
US 10221012B2 · Hund, Jr. · 2019 [cited by applicant]
US 10311526B2 · Takeda · 2019 [cited by applicant]
US 10373087B1 · Yang et al. · 2019 [cited by applicant]
US 10457533B2 · Puszkiewicz et al. · 2019 [cited by applicant]
US 10663955B2 · Kuikka · 2020 [cited by applicant]
US 10796577B2 · Katou et al. · 2020 [cited by applicant]
US 10798113B2 · Muddu et al. · 2020 [cited by applicant]
US 10899538B2 · Nelson et al. · 2021 [cited by applicant]
US 10913428B2 · Dingli · 2021 [cited by applicant]
US 10977943B1 · Hayward · 2021 [cited by applicant]
US 11252149B1 · Bang et al. · 2022 [cited by applicant]
US 11493903B2 · Cella et al. · 2022 [cited by applicant]
US 11888853B2 · Childress et al. · 2024 [cited by applicant]
US 11948019B1 · Singh et al. · 2024 [cited by applicant]
US 12130780B2 · Nishii · 2024 [cited by applicant]
US 12200783B2 · Kopchinsky et al. · 2025 [cited by applicant]
US 20020070862A1 · Francis et al. · 2002 [cited by applicant]
US 20020079713A1 · Moilanen et al. · 2002 [cited by applicant]
US 20020123345A1 · Mahany et al. · 2002 [cited by applicant]
US 20030158640A1 · Pillar et al. · 2003 [cited by applicant]
US 20040114557A1 · Bryan et al. · 2004 [cited by applicant]
US 20050002354A1 · Kelly et al. · 2005 [cited by applicant]
US 20050140154A1 · Vigholm et al. · 2005 [cited by applicant]
US 20050149920A1 · Patrizi et al. · 2005 [cited by applicant]
US 20060132323A1 · Grady · 2006 [cited by applicant]
US 20070130296A1 · Kim · 2007 [cited by applicant]
US 20070213869A1 · Bandringa et al. · 2007 [cited by applicant]
US 20090005928A1 · Sells et al. · 2009 [cited by applicant]
US 20090049441A1 · Mii et al. · 2009 [cited by applicant]
US 20090088924A1 · Coffee et al. · 2009 [cited by applicant]
US 20090099897A1 · Ehrman et al. · 2009 [cited by applicant]
US 20090101447A1 · Durham et al. · 2009 [cited by applicant]
US 20100179844A1 · Lafergola et al. · 2010 [cited by applicant]
US 20100271191A1 · De Graff et al. · 2010 [cited by applicant]
US 20110010023A1 · Kunzig et al. · 2011 [cited by applicant]
US 20110040440A1 · De Oliveira et al. · 2011 [cited by applicant]
US 20110081193A1 · Nilsson · 2011 [cited by applicant]
US 20120001876A1 · Chervenka et al. · 2012 [cited by applicant]
US 20120046809A1 · Wellman · 2012 [cited by applicant]
US 20130057007A1 · Howell et al. · 2013 [cited by applicant]
US 20130127611A1 · Bernstein et al. · 2013 [cited by applicant]
US 20130132140A1 · Amin et al. · 2013 [cited by applicant]
US 20130240300A1 · Fagan et al. · 2013 [cited by applicant]
US 20140214240A1 · Funke et al. · 2014 [cited by applicant]
US 20140241332A1 · Yang et al. · 2014 [cited by applicant]
US 20140278621A1 · Medwin · 2014 [cited by examiner]
US 20140312639A1 · Petronek · 2014 [cited by applicant]
US 20150185716A1 · Wichmann et al. · 2015 [cited by applicant]
US 20150310674A1 · Humphrey et al. · 2015 [cited by applicant]
US 20150376869A1 · Jackson · 2015 [cited by examiner]
US 20160052762A1 · Swift · 2016 [cited by applicant]
US 20160057004A1 · Ge · 2016 [cited by applicant]
US 20160121490A1 · Ottersland · 2016 [cited by applicant]
US 20160208992A1 · Parsons · 2016 [cited by applicant]
US 20160221816A1 · Pollock et al. · 2016 [cited by applicant]
US 20160272471A1 · Jaipaul · 2016 [cited by applicant]
US 20160304051A1 · Archer et al. · 2016 [cited by applicant]
US 20160318438A1 · Wadell · 2016 [cited by applicant]
US 20160371433A1 · Polesskiy et al. · 2016 [cited by applicant]
US 20170149901A1 · Condeixa et al. · 2017 [cited by applicant]
US 20170167088A1 · Walker et al. · 2017 [cited by applicant]
US 20170169631A1 · Walker et al. · 2017 [cited by applicant]
US 20170269608A1 · Chandrasekar et al. · 2017 [cited by applicant]
US 20170270490A1 · Penilla et al. · 2017 [cited by applicant]
US 20170289121A1 · Harwell · 2017 [cited by applicant]
US 20170291805A1 · Hao et al. · 2017 [cited by applicant]
US 20170301210A1 · King et al. · 2017 [cited by applicant]
US 20180065544A1 · Brusco · 2018 [cited by applicant]
US 20180143734A1 · Ochenas et al. · 2018 [cited by applicant]
US 20180150885A1 · Albinger et al. · 2018 [cited by applicant]
US 20180151037A1 · Morgenthau et al. · 2018 [cited by applicant]
US 20180164993A1 · Zummo et al. · 2018 [cited by applicant]
US 20180234266A1 · Rudolph et al. · 2018 [cited by applicant]
US 20180335903A1 · Coffman et al. · 2018 [cited by applicant]
US 20190033172A1 · Montemurro et al. · 2019 [cited by applicant]
US 20190156394A1 · Karmakar · 2019 [cited by applicant]
US 20190180354A1 · Greenberger et al. · 2019 [cited by applicant]
US 20190246060A1 · Tanabe et al. · 2019 [cited by applicant]
US 20190376459A1 · Pieczko et al. · 2019 [cited by applicant]
US 20200014759A1 · Wunderlich · 2020 [cited by applicant]
US 20200065433A1 · Duff et al. · 2020 [cited by applicant]
US 20200134955A1 · Kishita · 2020 [cited by applicant]
US 20200183362A1 · Ledwith et al. · 2020 [cited by applicant]
US 20200207166A1 · Froehlich · 2020 [cited by applicant]
US 20200298801A1 · Dingli · 2020 [cited by applicant]
US 20200317489A1 · Bhatia et al. · 2020 [cited by applicant]
US 20210023985A1 · Stadnyk · 2021 [cited by applicant]
US 20210055178A1 · Hinderling et al. · 2021 [cited by applicant]
US 20210056771A1 · Federle · 2021 [cited by applicant]
US 20210087035A1 · Yip et al. · 2021 [cited by applicant]
US 20210090363A1 · Ramos et al. · 2021 [cited by applicant]
US 20210211852A1 · Ramalho De Oliveira et al. · 2021 [cited by applicant]
US 20210232137A1 · Whitfield et al. · 2021 [cited by applicant]
US 20210250178A1 · Herman et al. · 2021 [cited by applicant]
US 20220025611A1 · Kandula et al. · 2022 [cited by applicant]
US 20220035364A1 · Laclef et al. · 2022 [cited by applicant]
US 20220156921A1 · Humpston et al. · 2022 [cited by applicant]
US 20220221365A1 · Mahurkar et al. · 2022 [cited by applicant]
US 20220229415A1 · Kobel et al. · 2022 [cited by applicant]
US 20220229431A1 · Kobel et al. · 2022 [cited by applicant]
US 20220230224A1 · Kobel et al. · 2022 [cited by applicant]
US 20220230488A1 · Kobel et al. · 2022 [cited by applicant]
US 20220232649A1 · Kobel et al. · 2022 [cited by applicant]
US 20230224680A1 · Kobel et al. · 2023 [cited by applicant]
US 20230247390A1 · Kobel et al. · 2023 [cited by applicant]
US 20240073651A1 · Kobel et al. · 2024 [cited by applicant]
US 20240089708A1 · Kobel et al. · 2024 [cited by applicant]
US 20240235931A1 · Nolan et al. · 2024 [cited by applicant]
CN 102756997A · 2012 [cited by applicant]
CN 107426770B · 2017 [cited by applicant]
CN 207608281U · 2018 [cited by applicant]
CN 111126522A · 2020 [cited by applicant]
DE 102007020182A1 · 2008 [cited by applicant]
DE 102018217716A1 · 2019 [cited by applicant]
EP 1136433A2 · 2001 [cited by applicant]
EP 2886507A1 · 2015 [cited by applicant]
EP 3112312A1 · 2017 [cited by applicant]
EP 3173369A1 · 2017 [cited by applicant]
EP 3200482A1 · 2017 [cited by applicant]
EP 3896024A1 · 2021 [cited by applicant]
EP 4048842B1 · 2022 [cited by applicant]
JP H08282995A · 1996 [cited by applicant]
JP H1059698A · 1998 [cited by applicant]
JP 2016159996A · 2016 [cited by applicant]
JP 2020128270A · 2020 [cited by applicant]
JP 2021052920A · 2021 [cited by applicant]
WO WO0130671A2 · 2001 [cited by applicant]
WO WO2011019872A2 · 2011 [cited by applicant]
WO WO2012109444A2 · 2012 [cited by applicant]
WO WO2020121613A1 · 2020 [cited by applicant]
Suzuki et al., “Teleoperation of Multiple Robots through the Internet”, IEEE International Workshop on Robot and Human Communication, published 1996, pp. 84-89 (Year: 1996). [cited by applicant]
International Search Report and Written Opinion issued in connection with PCT Appl. Ser. No. PCT/US2022/012610 dated Jun. 21, 2022 (19 pages). [cited by applicant]
Invitation to Pay Additional Fees issued in connection with PCT Appl. Ser. No. PCT/US2022/012610 dated Apr. 28, 2022 (136 pages). [cited by applicant]
Invitation to Pay Additional Fees issued in connection with PCT Appl. Ser. No. PCT/US2022/012628 dated May 13, 2022 (134 pages). [cited by applicant]
Notification of Transmittal of the International Search Report and the Written Opinion of the International Search Authority, or the Declaration issued in connection with PCT Appl. Ser. No. PCT/US2022/012603 dated Jul. … [cited by applicant]
Notification of Transmittal of the International Search Report and the Written Opinion of the International Search Authority, or the Declaration issued in connection with PCT Appl. Ser. No. PCT/US2022/012628 dated Jul. … [cited by applicant]