IP Library Granted Patent US 12,346,987
Granted Patent B2
US 12,346,987 · App. 17/069,597 · Granted Jul 1, 2025

Price time priority queue routing for transportation capacity units

Inventor: Erik Mowery Simpson (Houston, TX)
Assignee: CIRCLESX LLC
G06Q50/40G01C21/3423G01C21/3484G06Q10/02G06Q10/047G06Q10/083G06Q10/08355G06Q10/10G06Q30/0205G06Q30/0206G06Q30/08G06Q30/0282G06Q50/265
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,346,987
App. No.
17/069,597
Granted
Jul 1, 2025
Kind
B2
Abstract

Various implementations directed to price time priority queue routing for transportation capacity units are provided. In one implementation, a method may include receiving origin location data and destination location data. The method may also include generating routes based on the origin location data and the destination location data. The method may further include determining virtual hubs along the routes, where the virtual hubs include a first virtual hub based on the origin location data and a second virtual hub based on the destination location data. The method may additionally include receiving travel cost data for the routes for geolocation exchange units. In addition, the method may include receiving market depth data for a geolocation exchange for the geolocation exchange units based on the routes. The method may also include selecting an optimized route of the routes for the geolocation exchange units based on an objective function.

Claims (84)

1. A method, comprising:

tracking origin location data and destination location data for a plurality of users from respective satellite navigation systems;

receiving updates to the origin location data and the destination location data in real-time from one or more of the plurality of users over a wireless or wired communication network, wherein the origin location data corresponds to a geographic origin and the destination location data corresponds to a geographic destination;

generating a plurality of routes based on the updates to the origin location data and the updates to the destination location data;

receiving constraint data from the one or more of the plurality of users, wherein the constraint data indicates a selection by the one or more of the plurality of users of one or more conditions for traveling along the plurality of routes, wherein:

the one or more conditions comprise cheapest route, single mode of transportation, multiple modes of transportation, fastest route, most scenic route, highest rated route, most available route, highest volume of participants for route, most frequent route, service level for route, emissions reduction, highest safety and security level for route, gender of driver, security of driver, and rating of driver;

determining a plurality of virtual hubs along the plurality of routes, wherein the plurality of virtual hubs comprises a first virtual hub based on the updates to the origin location data and a second virtual hub based on the updates to the destination location data;

storing virtual hub location data corresponding to the first and second virtual hubs on a first database server;

generating one or more geolocation units for at least a first subset of the plurality of users based on travel cost data for the plurality of routes, wherein:

the one or more geolocation units correspond to a predetermined space traveling from the first virtual hub to the second virtual hub,

the travel cost data for the plurality of routes comprises data relating to travel time, travel expenses, or combinations thereof, and

the travel cost data for the plurality of routes is based on the constraint data;

generating a geolocation market platform for trading the one or more geolocation units, comprising:

receiving, over the wireless or wired communication network, market depth data for the geolocation market platform for the one or more geolocation units based on the plurality of routes, wherein:

the market depth data comprises one or more bid prices and one or more offer prices for the one or more geolocation units, and

the market depth data is based on the plurality of routes and the constraint data;

storing the market depth data for the geolocation market platform on a second database server;

selecting an optimized route of the plurality of routes for the one or more geolocation units based on an objective function, wherein the objective function uses the travel cost data, the market depth data, or combinations thereof;

detecting, at respective user interfaces of the plurality of users, respective user network logins of the user interfaces using facial recognition or fingerprint recognition for authentication;

generating one or more graphical layers, on at least one of the detected user interfaces, based on the travel cost data and at least a subset of the market depth data, wherein the one or more graphical layers are configured to be integrated on a respective navigational map interface;

generating, on the generated one or more graphical layers on the at least one of the detected user interfaces, the selected optimized route as a visualization on the respective navigational map interface; and

generating a forward commodity contract based on the selected optimized route, wherein the forward commodity contract is used for physical delivery of the one or more geolocation units, and wherein the forward commodity contract comprises one or more conditional attributes to provide substitutability between first and second geolocation units of the one or more geolocation units.

2. The method of claim 1 , wherein:

the detected user interfaces comprise touchscreen displays or augmented non-screen displays of the plurality of users; and

the objective function comprises a function configured to minimize travel time, travel expenses, cost of bid prices, or combinations thereof, and wherein the geolocation market platform comprises a market exchange for the one or more geolocation units, and wherein the one or more geolocation units comprises one or more commodity contract specifications.

3. The method of claim 1 , wherein:

the one or more graphical layers comprise one or more integrated or overlayed layers;

the one or more integrated or overlayed layers comprise at least one or more of: buttons, icons, settings tables, or menus configured for selection or manipulation by a respective user of the plurality of users; and

the optimized route comprises a route for travel for the one or more geolocation units using one or more transportation vehicles, wherein the one or more transportation vehicles comprise an automobile, an aircraft, an autonomous vehicle, a motorcycle, a bicycle, a boat, a bus, a subway car, a taxicab, a train, a taxicab, a drone, an unmanned aircraft, a virtual transportation vehicle, or a delivery vehicle.

4. The method of claim 1 , wherein:

at least one of the market depth data and the travel cost data are transmitted to the detected user interfaces as one or more overlayed or integrated layers, wherein the one or more overlayed or integrated layers comprise one or more of the graphical layers or graphical list views; and

the predetermined space comprises a seat or cargo capacity in one or more vehicles traveling from the first virtual hub to the second virtual hub.

5. A computing system, comprising:

one or more processors; and

one or more memory comprising program instructions executable by the one or more processors to:

track origin location data and destination location data for a plurality of users in real time from respective satellite navigation systems;

receive updates to the origin location data and the destination location data in real-time from one or more of the plurality of users over a wireless or wired communication network, wherein the origin location data corresponds to a geographic origin and the destination location data corresponds to a geographic destination;

generate a plurality of routes based on the updates to the origin location data and the updates to the destination location data;

receive constraint data from the one or more of the plurality of users, wherein the constraint data indicates a selection by the one or more of the plurality of users of one or more conditions for traveling along the plurality of routes, wherein:

the one or more conditions comprise cheapest route, single mode of transportation, multiple modes of transportation, fastest route, most scenic route, highest rated route, most available route, highest volume of participants for route, most frequent route, service level for route, emissions reduction, highest safety and security level for route, gender of driver, security of driver, and rating of driver;

determine a plurality of virtual hubs along the plurality of routes, wherein the plurality of virtual hubs comprises a first virtual hub based on the updates to the origin location data and a second virtual hub based on the updates to the destination location data;

store virtual hub location data corresponding to the first and second virtual hubs on a first database server;

generate one or more geolocation units for at least a first subset of the plurality of users based on travel cost data for the plurality of routes, wherein:

the one or more geolocation units correspond to a predetermined space traveling from the first virtual hub to the second virtual hub,

the travel cost data for the plurality of routes comprises data relating to travel time, travel expenses, or combinations thereof, and

the travel cost data for the plurality of routes is based on the constraint data;

generating a geolocation market platform for trading the one or more geolocation units, comprising:

receive, over the wireless or wired communication network, market depth data for the geolocation market platform for the one or more geolocation units based on the plurality of routes, wherein:

the market depth data comprises one or more bid prices and one or more offer prices for the one or more geolocation units, and

the market depth data is based on the plurality of routes and the constraint data;

store the market depth data for the geolocation market platform on a second database server;

select an optimized route of the plurality of routes for the one or more geolocation units based on an objective function, wherein the objective function uses the travel cost data, the market depth data, or combinations thereof;

detect, at respective user interfaces of the plurality of users, respective user network logins of the user interfaces using facial recognition or fingerprint recognition for authentication;

generate one or more graphical layers, on at least one of the detected user interfaces, based on the travel cost data and at least a subset of the market depth data, wherein the one or more graphical layers are configured to be integrated on a respective navigational map interface;

generate, on the generated one or more graphical layers on the at least one of the detected user interfaces, the selected optimized route as a visualization on the respective navigational map interface; and

generate a forward commodity contract based on the selected optimized route, wherein the forward commodity contract is used for physical delivery of the one or more geolocation units, and wherein the forward commodity contract comprises one or more conditional attributes to provide substitutability between first and second geolocation units of the one or more geolocation units.

6. The computing system of claim 5 , wherein the objective function comprises a function configured to minimize travel time, travel expenses, cost of bid prices, or combinations thereof, and wherein the geolocation market platform comprises an exchange for the one or more geolocation units, and wherein the one or more geolocation units comprises one or more commodity contract specifications.

7. The computing system of claim 5 , wherein the optimized route comprises a route for travel for the one or more geolocation units using one or more transportation vehicles, wherein the one or more transportation vehicles comprise an automobile, an aircraft, an autonomous vehicle, a motorcycle, a bicycle, a boat, a bus, a subway car, a taxicab, a train, a drone, an unmanned aircraft, a virtual transportation vehicle, or a delivery vehicle.

8. The computing system of claim 5 , wherein the predetermined space comprises a seat or cargo capacity in one or more vehicles traveling from the first virtual hub to the second virtual hub.

9. A non-transitory computer-readable medium having stored thereon a plurality of computer-executable instructions which, when executed by a computer, cause the computer to:

track origin location data and destination location data for a plurality of users in real time from respective satellite navigation systems;

receive updates to the origin location data and the destination location data in real-time from one or more of the plurality of users over a wireless or wired communication network, wherein the origin location data corresponds to a geographic origin and the destination location data corresponds to a geographic destination;

generate a plurality of routes based on the updates to the origin location data and the updates to the destination location data;

receive constraint data from the one or more of the plurality of users, wherein the constraint data indicates a selection by the one or more of the plurality of users of one or more conditions for traveling along the plurality of routes, wherein:

the one or more conditions comprise cheapest route, single mode of transportation, multiple modes of transportation, fastest route, most scenic route, highest rated route, most available route, highest volume of participants for route, most frequent route, service level for route, emissions reduction, highest safety and security level for route, gender of driver, security of driver, and rating of driver;

determine a plurality of virtual hubs along the plurality of routes, wherein the plurality of virtual hubs comprises a first virtual hub based on the updates to the origin location data and a second virtual hub based on the updates to the destination location data;

store virtual hub location data corresponding to the first and second virtual hubs on a first database server;

generate one or more geolocation units for at least a first subset of the plurality of users based on travel cost data for the plurality of routes, wherein:

the one or more geolocation units correspond to a predetermined space traveling from the first virtual hub to the second virtual hub, and

the travel cost data for the plurality of routes comprises data relating to travel time, travel expenses, or combinations thereof, and

the travel cost data for the plurality of routes is based on the constraint data;

generating a geolocation market platform for trading the one or more geolocation units, comprising:

receive, over the wireless or wired communication network, market depth data for the geolocation market platform for the one or more geolocation units based on the plurality of routes, wherein;

the market depth data comprises one or more bid prices and one or more offer prices for the one or more geolocation units, and

the market depth data is based on the plurality of routes and the constraint data;

store the market depth data for the geolocation market platform on a second database server;

select an optimized route of the plurality of routes for the one or more geolocation units based on an objective function, wherein the objective function uses the travel cost data, the market depth data, or combinations thereof;

detect, at respective user interfaces of the plurality of users, respective user network logins of the user interfaces using facial recognition or fingerprint recognition for authentication;

generate one or more graphical layers, on at least one of the detected user interfaces, based on the travel cost data and at least a subset of the market depth data, wherein the one or more graphical layers are configured to be integrated on a respective navigational map interface;

generate, on the generated one or more graphical layers on the at least one of the detected user interfaces, the selected optimized route as a visualization on the respective navigational map interface; and

generate a forward commodity contract based on the selected optimized route, wherein the forward commodity contract is used for physical delivery of the one or more geolocation units, and wherein the forward commodity contract comprises one or more conditional attributes to provide substitutability between first and second geolocation units of the one or more geolocation units.

10. The non-transitory computer-readable medium of claim 9 , wherein the objective function comprises a function configured to minimize travel time, travel expenses, cost of bid prices, or combinations thereof.

11. The non-transitory computer-readable medium of claim 9 , wherein the optimized route comprises a route for travel for the one or more geolocation units using one or more transportation vehicles, wherein the one or more transportation vehicles comprise an automobile, an aircraft, an autonomous vehicle, a motorcycle, a bicycle, a boat, a bus, a subway car, a taxicab, a train, a drone, an unmanned aircraft, a virtual transportation vehicle, or a delivery vehicle.

12. The non-transitory computer-readable medium of claim 9 , the predetermined space comprises a seat or cargo capacity in one or more vehicles traveling from the first virtual hub to the second virtual hub.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 25, 2021
From: SIMPSX TECHNOLOGIES LLC
To: CIRCLESX LLC
Reel/Frame 058251/0180 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 13, 2020
From: SIMPSON, ERIK MOWERY
To: SIMPSX TECHNOLOGIES LLC
Reel/Frame 054044/0230 →
Continuity (24)
Continuation In Part 16589229 · Oct 1, 2019
Continuation In Part 16556838 · Aug 30, 2019
Continuation In Part 16397685 · Apr 29, 2019
Continuation In Part 16359841 · Mar 20, 2019
Continuation In Part 16357241 · Mar 18, 2019
Continuation In Part 16274490 · Feb 13, 2019
Continuation In Part 16258658 · Jan 27, 2019
Continuation In Part 16257032 · Jan 24, 2019
Continuation In Part 16242981 · Jan 8, 2019
Continuation In Part 16242967 · Jan 8, 2019
Continuation In Part 16239485 · Jan 3, 2019
Continuation In Part 16183647 · Nov 7, 2018
Continuation In Part 16183647 · Nov 7, 2018
Continuation In Part 16167525 · Oct 22, 2018
Continuation In Part 15877393 · Jan 23, 2018
Continuation In Part 15266326 · Sep 15, 2016
Provisional Application 63052159 · Jul 15, 2020
Provisional Application 63051373 · Jul 13, 2020
Provisional Application 63044997 · Jun 26, 2020
Provisional Application 63039918 · Jun 16, 2020
Provisional Application 63027344 · May 19, 2020
Provisional Application 62927081 · Oct 28, 2019
Provisional Application 62914427 · Oct 12, 2019
Related Publication 20210042872A1 · Feb 11, 2021
References Cited (400)
US D209710S · Bruce · 1967 [cited by applicant]
US 4476954A · Johnson et al. · 1984 [cited by applicant]
US D318073S · Jang · 1991 [cited by applicant]
US 5249259A · Harvey · 1993 [cited by applicant]
US 5412560A · Dennison · 1995 [cited by applicant]
US 5604676A · Penzias · 1997 [cited by applicant]
US 5726885A · Klein et al. · 1998 [cited by applicant]
US 5751245A · Janky et al. · 1998 [cited by applicant]
US 5948040A · DeLorme · 1999 [cited by applicant]
US 5973619A · Paredes · 1999 [cited by applicant]
US 6175831B1 · Weinreich et al. · 2001 [cited by applicant]
US 6240396B1 · Walker et al. · 2001 [cited by applicant]
US 6285999B1 · Page · 2001 [cited by applicant]
US D453945S · Shan · 2002 [cited by applicant]
US 6356838B1 · Paul · 2002 [cited by applicant]
US 6400996B1 · Hoffberg · 2002 [cited by applicant]
US D460952S · Kataoka · 2002 [cited by applicant]
US 6421606B1 · Asai et al. · 2002 [cited by applicant]
US 6434530B1 · Sloane et al. · 2002 [cited by applicant]
US D468738S · Lin · 2003 [cited by applicant]
US D469089S · Lin · 2003 [cited by applicant]
US 6609103B1 · Kolls · 2003 [cited by applicant]
US 6618062B1 · Brown et al. · 2003 [cited by applicant]
US 6646659B1 · Brown et al. · 2003 [cited by applicant]
US 6663564B2 · Miller-Kovach et al. · 2003 [cited by applicant]
US 6708879B2 · Hunt · 2004 [cited by applicant]
US 6850907B2 · Lutnick et al. · 2005 [cited by applicant]
US 7010472B1 · Vasey-Glandon et al. · 2006 [cited by applicant]
US 7090638B2 · Vidgen · 2006 [cited by applicant]
US 7373320B1 · Mcdonough · 2008 [cited by applicant]
US D590396S · Lo · 2009 [cited by applicant]
US 7584123B1 · Karonis et al. · 2009 [cited by applicant]
US 7634442B2 · Alvarado · 2009 [cited by examiner]
US 7680690B1 · Catalano · 2010 [cited by applicant]
US 7680770B1 · Buyukkokten et al. · 2010 [cited by applicant]
US 7711629B2 · Laurent et al. · 2010 [cited by applicant]
US 7747739B2 · Bridges et al. · 2010 [cited by applicant]
US 7756633B2 · Huang et al. · 2010 [cited by applicant]
US 7788207B2 · Alcorn et al. · 2010 [cited by applicant]
US D628171S · Hakopian · 2010 [cited by applicant]
US 7886166B2 · Shnekendorf et al. · 2011 [cited by applicant]
US D638879S · Suto · 2011 [cited by applicant]
US 7987110B2 · Cases et al. · 2011 [cited by applicant]
US 8024234B1 · Thomas et al. · 2011 [cited by applicant]
US 8065191B2 · Senior · 2011 [cited by applicant]
US D650385S · Chiu · 2011 [cited by applicant]
US 8121780B2 · Gerdes et al. · 2012 [cited by applicant]
US 8249946B2 · Froseth et al. · 2012 [cited by applicant]
US 8296335B2 · Bouve et al. · 2012 [cited by applicant]
US 8388451B2 · Auterio et al. · 2013 [cited by applicant]
US 8570244B2 · Mukawa · 2013 [cited by applicant]
US 8762035B2 · Levine et al. · 2014 [cited by applicant]
US 8798593B2 · Haney · 2014 [cited by applicant]
US 8918411B1 · Latif et al. · 2014 [cited by applicant]
US 8920175B2 · Black et al. · 2014 [cited by applicant]
US 8930490B2 · Brown et al. · 2015 [cited by applicant]
US 8968099B1 · Hanke et al. · 2015 [cited by applicant]
US 9011153B2 · Bennett et al. · 2015 [cited by applicant]
US 9020763B2 · Faaborg et al. · 2015 [cited by applicant]
US 9077204B2 · More et al. · 2015 [cited by applicant]
US 9092826B2 · Deng et al. · 2015 [cited by applicant]
US 9159088B2 · Dillahunt et al. · 2015 [cited by applicant]
US 9213957B2 · Stefik et al. · 2015 [cited by applicant]
US 9274540B2 · Anglin et al. · 2016 [cited by applicant]
US 9292764B2 · Yun et al. · 2016 [cited by applicant]
US 9387928B1 · Gentry et al. · 2016 [cited by applicant]
US 9389090B1 · Levine et al. · 2016 [cited by applicant]
US 9389094B2 · Brenner et al. · 2016 [cited by applicant]
US 9410963B2 · Martin et al. · 2016 [cited by applicant]
US 9436923B1 · Sriram et al. · 2016 [cited by applicant]
US D772828S · Kusumoto · 2016 [cited by applicant]
US 9528972B2 · Minvielle · 2016 [cited by applicant]
US 9558515B2 · Babu et al. · 2017 [cited by applicant]
US 9665983B2 · Spivack · 2017 [cited by applicant]
US 9880577B2 · Dyess et al. · 2018 [cited by applicant]
US 9952042B2 · Abovitz et al. · 2018 [cited by applicant]
US 9960637B2 · Sanders et al. · 2018 [cited by applicant]
US 9978282B2 · Lambert et al. · 2018 [cited by applicant]
US 1008279A1 · Glaser · 2018 [cited by applicant]
US D832355S · Castro · 2018 [cited by applicant]
US 10216367B1 · Patel · 2019 [cited by applicant]
US 10262289B2 · Vaananen · 2019 [cited by applicant]
US 10395332B1 · Konrardy et al. · 2019 [cited by applicant]
US 10403050B1 · Beall et al. · 2019 [cited by applicant]
US 10460520B2 · Simpson et al. · 2019 [cited by applicant]
US 10533850B2 · Abovitz et al. · 2020 [cited by applicant]
US 10586084B2 · Burch et al. · 2020 [cited by applicant]
US 10685503B2 · Ricci · 2020 [cited by applicant]
US 10737585B2 · Chaudhary et al. · 2020 [cited by applicant]
US D896315S · Castro · 2020 [cited by applicant]
US 10872381B1 · Leise et al. · 2020 [cited by applicant]
US 10832337B1 · Floyd et al. · 2020 [cited by applicant]
US D903657S · Catania · 2020 [cited by applicant]
US D903658S · Catania · 2020 [cited by applicant]
US D903659S · Catania · 2020 [cited by applicant]
US D910758S · Leong · 2021 [cited by applicant]
US 11138827B2 · Simpson · 2021 [cited by applicant]
US D938375S · Zhang · 2021 [cited by applicant]
US 11288563B2 · Lee et al. · 2022 [cited by applicant]
US 11296897B2 · Endress et al. · 2022 [cited by applicant]
US 11298017B2 · Tran · 2022 [cited by applicant]
US 11298591B2 · Evancha · 2022 [cited by applicant]
US 11537953B2 · Beaurepaire · 2022 [cited by applicant]
US 11555709B2 · Simpson · 2023 [cited by applicant]
US 11586993B2 · Handler et al. · 2023 [cited by applicant]
US D980210S · Wu · 2023 [cited by applicant]
US 11651464B2 · Park · 2023 [cited by applicant]
US D993316S · Lin · 2023 [cited by applicant]
US 11704219B1 · Lerner et al. · 2023 [cited by applicant]
US 11722500B2 · Singh · 2023 [cited by applicant]
US 11734618B2 · Ogden · 2023 [cited by applicant]
US 1000137A1 · Shuster · 2023 [cited by applicant]
US 1007451A1 · Im · 2023 [cited by applicant]
US 1024065A1 · Kim · 2024 [cited by applicant]
US 20020004788A1 · Gros et al. · 2002 [cited by applicant]
US 20020013718A1 · Cornwell · 2002 [cited by applicant]
US 20020013761A1 · Bundy · 2002 [cited by applicant]
US 20020017977A1 · Wall · 2002 [cited by examiner]
US 20020017997A1 · Wall · 2002 [cited by applicant]
US 20020065738A1 · Riggs et al. · 2002 [cited by applicant]
US 20020065766A1 · Brown et al. · 2002 [cited by applicant]
US 20020128952A1 · Melkomaian · 2002 [cited by applicant]
US 20020133456A1 · Lancaster et al. · 2002 [cited by applicant]
US 20020161689A1 · Segal · 2002 [cited by applicant]
US 20030055776A1 · Samuelson · 2003 [cited by applicant]
US 20030191725A1 · Ratliff et al. · 2003 [cited by applicant]
US 20030233311A1 · Bramnick et al. · 2003 [cited by applicant]
US 20040019552A1 · Tobin · 2004 [cited by applicant]
US 20040115596A1 · Snyder et al. · 2004 [cited by applicant]
US 20040249742A1 · Laurent et al. · 2004 [cited by applicant]
US 20040254819A1 · Halim · 2004 [cited by applicant]
US 20040260581A1 · Baranowski et al. · 2004 [cited by applicant]
US 20050021346A1 · Nadan et al. · 2005 [cited by applicant]
US 20050027637A1 · Kohler · 2005 [cited by applicant]
US 20050132070A1 · Redlich et al. · 2005 [cited by applicant]
US 20050288974A1 · Baranowski et al. · 2005 [cited by applicant]
US 20050288986A1 · Barts et al. · 2005 [cited by applicant]
US 20060104224A1 · Singh · 2006 [cited by applicant]
US 20060184321A1 · Kawakami · 2006 [cited by applicant]
US 20070005224A1 · Sutardja · 2007 [cited by applicant]
US 20070260723A1 · Cohen · 2007 [cited by applicant]
US 20080033833A1 · Senior · 2008 [cited by applicant]
US 20080040232A1 · Perchthaler · 2008 [cited by applicant]
US 20080077309A1 · Cobbold · 2008 [cited by applicant]
US 20080129490A1 · Linville et al. · 2008 [cited by applicant]
US 20080140557A1 · Bowlby et al. · 2008 [cited by applicant]
US 20080157990A1 · Belzer et al. · 2008 [cited by applicant]
US 20080195432A1 · Fell et al. · 2008 [cited by applicant]
US 20080262892A1 · Prager et al. · 2008 [cited by applicant]
US 20090221338A1 · Stewart · 2009 [cited by applicant]
US 20090231687A1 · Yamamoto · 2009 [cited by applicant]
US 20090271236A1 · Ye et al. · 2009 [cited by applicant]
US 20090275002A1 · Hoggle · 2009 [cited by applicant]
US 20090276154A1 · Subramanian et al. · 2009 [cited by applicant]
US 20090287401A1 · Levine et al. · 2009 [cited by applicant]
US 20090309729A1 · Nichols · 2009 [cited by applicant]
US 20100042421A1 · Bai et al. · 2010 [cited by applicant]
US 20100081548A1 · Labedz · 2010 [cited by applicant]
US 20100114790A1 · Strimling · 2010 [cited by examiner]
US 20100191834A1 · Zampiello · 2010 [cited by applicant]
US 20100208029A1 · Marti · 2010 [cited by applicant]
US 20100211441A1 · Sprigg et al. · 2010 [cited by applicant]
US 20100217680A1 · Fusz et al. · 2010 [cited by applicant]
US 20100228574A1 · Mundinger et al. · 2010 [cited by applicant]
US 20100280748A1 · Mundinger et al. · 2010 [cited by applicant]
US 20100280884A1 · Levine et al. · 2010 [cited by applicant]
US 20100306078A1 · Hwang · 2010 [cited by applicant]
US 20100318373A1 · Harris · 2010 [cited by applicant]
US 20110025267A1 · Kamen et al. · 2011 [cited by applicant]
US 20110059693A1 · O'Sullivan · 2011 [cited by applicant]
US 20110098056A1 · Rhoads et al. · 2011 [cited by applicant]
US 20110106660A1 · Ajjarapu et al. · 2011 [cited by applicant]
US 20110184784A1 · Rudow · 2011 [cited by applicant]
US 20110191248A1 · Bishop · 2011 [cited by applicant]
US 20110202418A1 · Kempton et al. · 2011 [cited by applicant]
US 20120023032A1 · Visdomini · 2012 [cited by applicant]
US 20120072925A1 · Jenkins et al. · 2012 [cited by applicant]
US 20120075067A1 · Attaluri · 2012 [cited by applicant]
US 20120078743A1 · Betancourt · 2012 [cited by examiner]
US 20120101629A1 · Olsen et al. · 2012 [cited by applicant]
US 20120136527A1 · McQuade · 2012 [cited by applicant]
US 20120158762A1 · IwuchukWu · 2012 [cited by applicant]
US 20120303259A1 · Prosser · 2012 [cited by applicant]
US 20120323645A1 · Spiegel et al. · 2012 [cited by applicant]
US 20130024041A1 · Golden et al. · 2013 [cited by applicant]
US 20130035973A1 · Desai et al. · 2013 [cited by applicant]
US 20130132261A1 · Ebersole · 2013 [cited by applicant]
US 20130147820A1 · Kalai et al. · 2013 [cited by applicant]
US 20130173326A1 · Anglin et al. · 2013 [cited by applicant]
US 20130179205A1 · Slinin · 2013 [cited by applicant]
US 20130191237A1 · Tenorio · 2013 [cited by applicant]
US 20130211863A1 · White · 2013 [cited by applicant]
US 20130265174A1 · Scofield et al. · 2013 [cited by applicant]
US 20130268325A1 · Dembo · 2013 [cited by applicant]
US 20130275156A1 · Kinkaid et al. · 2013 [cited by applicant]
US 20130304522A1 · Cundle · 2013 [cited by applicant]
US 20130311264A1 · Solomon et al. · 2013 [cited by applicant]
US 20140032034A1 · Raptopoulos · 2014 [cited by applicant]
US 20140038781A1 · Foley · 2014 [cited by applicant]
US 20140052500A1 · Vallapuzha et al. · 2014 [cited by applicant]
US 20140075528A1 · Matsuoka · 2014 [cited by examiner]
US 20140098009A1 · Prest et al. · 2014 [cited by applicant]
US 20140122190A1 · Wolfson et al. · 2014 [cited by applicant]
US 20140129302A1 · Amin et al. · 2014 [cited by applicant]
US 20140149157A1 · Shaam et al. · 2014 [cited by applicant]
US 20140162598A1 · Villa-Real · 2014 [cited by applicant]
US 20140180732A1 · Rotchin · 2014 [cited by applicant]
US 20140220516A1 · Marshall et al. · 2014 [cited by applicant]
US 20140229258A1 · Seriani · 2014 [cited by applicant]
US 20140236641A1 · Dawkins · 2014 [cited by applicant]
US 20140244413A1 · Senior · 2014 [cited by applicant]
US 20140282586A1 · Shear et al. · 2014 [cited by applicant]
US 20140310019A1 · Blander et al. · 2014 [cited by applicant]
US 20140310149A1 · Singh · 2014 [cited by applicant]
US 20140324633A1 · Pollak · 2014 [cited by examiner]
US 20140349672A1 · Kern et al. · 2014 [cited by applicant]
US 20150006428A1 · Miller et al. · 2015 [cited by applicant]
US 20150016777A1 · Abovitz et al. · 2015 [cited by applicant]
US 20150058051A1 · Movshovich · 2015 [cited by applicant]
US 20150097864A1 · Alaniz · 2015 [cited by applicant]
US 20150154516A1 · Joachim · 2015 [cited by applicant]
US 20150161564A1 · Sweeney et al. · 2015 [cited by applicant]
US 20150178642A1 · Abboud · 2015 [cited by applicant]
US 20150198459A1 · MacNeille et al. · 2015 [cited by applicant]
US 20150206443A1 · Aylesworth et al. · 2015 [cited by applicant]
US 20150220916A1 · Prakash et al. · 2015 [cited by applicant]
US 20150241236A1 · Slusar et al. · 2015 [cited by applicant]
US 20150248689A1 · Paul et al. · 2015 [cited by applicant]
US 20150260474A1 · Rublowsky et al. · 2015 [cited by applicant]
US 20150269865A1 · Volach et al. · 2015 [cited by applicant]
US 20150324831A1 · Barua et al. · 2015 [cited by applicant]
US 20150348282A1 · Gibbon et al. · 2015 [cited by applicant]
US 20150371186A1 · Podgurny et al. · 2015 [cited by applicant]
US 20160018969A1 · Sundarraman · 2016 [cited by applicant]
US 20160026253A1 · Bradski et al. · 2016 [cited by applicant]
US 20160034305A1 · Shear et al. · 2016 [cited by applicant]
US 20160041628A1 · Verma · 2016 [cited by applicant]
US 20160063436A1 · Coles · 2016 [cited by applicant]
US 20160117657A1 · Forbes, Jr. et al. · 2016 [cited by applicant]
US 20160117756A1 · Carr et al. · 2016 [cited by applicant]
US 20160148289A1 · Altschuler · 2016 [cited by applicant]
US 20160162989A1 · Cole et al. · 2016 [cited by applicant]
US 20160171891A1 · Banatwala et al. · 2016 [cited by applicant]
US 20160203422A1 · Demarchi et al. · 2016 [cited by applicant]
US 20160221935A1 · Jaworska-Maslanka · 2016 [cited by applicant]
US 20160224935A1 · Burnett · 2016 [cited by examiner]
US 20160225115A1 · Levy et al. · 2016 [cited by applicant]
US 20160253662A1 · Sriram · 2016 [cited by applicant]
US 20160307276A1 · Young · 2016 [cited by applicant]
US 20160297316A1 · Penilla et al. · 2016 [cited by applicant]
US 20160298977A1 · Newlin · 2016 [cited by applicant]
US 20160300296A1 · Alonso Cembrano · 2016 [cited by applicant]
US 20160307288A1 · Yehuda et al. · 2016 [cited by applicant]
US 20160307373A1 · Dean et al. · 2016 [cited by applicant]
US 20160321609A1 · Dube · 2016 [cited by examiner]
US 20160349835A1 · Shapira · 2016 [cited by applicant]
US 20160364679A1 · Cao · 2016 [cited by applicant]
US 20170019496A1 · Orbach · 2017 [cited by applicant]
US 20170039770A1 · Lanier et al. · 2017 [cited by applicant]
US 20170046658A1 · Jones et al. · 2017 [cited by applicant]
US 20170046664A1 · Haldenby et al. · 2017 [cited by applicant]
US 20170046799A1 · Chan et al. · 2017 [cited by applicant]
US 20170046806A1 · Haldenby et al. · 2017 [cited by applicant]
US 20170048216A1 · Chow et al. · 2017 [cited by applicant]
US 20170053461A1 · Pal et al. · 2017 [cited by applicant]
US 20170061509A1 · Rosenberg et al. · 2017 [cited by applicant]
US 20170089710A1 · Slusar · 2017 [cited by applicant]
US 20170122746A1 · Howard et al. · 2017 [cited by applicant]
US 20170146360A1 · Averbuch · 2017 [cited by applicant]
US 20170232300A1 · Tran et al. · 2017 [cited by applicant]
US 20170243286A1 · Castinado et al. · 2017 [cited by applicant]
US 20170243310A1 · Dawkins · 2017 [cited by applicant]
US 20170249626A1 · Marlatt · 2017 [cited by applicant]
US 20170276500A1 · Margalit et al. · 2017 [cited by applicant]
US 20170293881A1 · Narkulla · 2017 [cited by examiner]
US 20170293950A1 · Rathod · 2017 [cited by applicant]
US 20170318325A1 · Ortiz · 2017 [cited by applicant]
US 20170330274A1 · Conant, II et al. · 2017 [cited by applicant]
US 20170356749A1 · Shelby · 2017 [cited by applicant]
US 20170357914A1 · Tulabandhula · 2017 [cited by applicant]
US 20180012149A1 · Yust · 2018 [cited by applicant]
US 20180013211A1 · Ricci · 2018 [cited by applicant]
US 20180025417A1 · Brathwaite et al. · 2018 [cited by applicant]
US 20180046431A1 · Thagadur Shivappa et al. · 2018 [cited by applicant]
US 20180053226A1 · Hutton et al. · 2018 [cited by applicant]
US 20180053237A1 · Hayes et al. · 2018 [cited by applicant]
US 20180068355A1 · Garry · 2018 [cited by applicant]
US 20180075695A1 · Simpson · 2018 [cited by applicant]
US 20180088455A1 · Cippant · 2018 [cited by applicant]
US 20180095471A1 · Allan et al. · 2018 [cited by applicant]
US 20180102053A1 · Hillman et al. · 2018 [cited by applicant]
US 20180111494A1 · Penilla et al. · 2018 [cited by applicant]
US 20180117447A1 · Bao et al. · 2018 [cited by applicant]
US 20180121958A1 · Aist et al. · 2018 [cited by applicant]
US 20180129276A1 · Nguyen et al. · 2018 [cited by applicant]
US 20180140903A1 · Poure · 2018 [cited by applicant]
US 20180143029A1 · Nikulin et al. · 2018 [cited by applicant]
US 20180157999A1 · Arora · 2018 [cited by applicant]
US 20180165354A1 · Jagota et al. · 2018 [cited by applicant]
US 20180173742A1 · Liu et al. · 2018 [cited by applicant]
US 20180173800A1 · Chang et al. · 2018 [cited by applicant]
US 20180188715A1 · Cella et al. · 2018 [cited by applicant]
US 20180209801A1 · Stentz · 2018 [cited by applicant]
US 20180209803A1 · Rakah · 2018 [cited by applicant]
US 20180238705A1 · O'Herlihy · 2018 [cited by applicant]
US 20180240542A1 · Grimmer · 2018 [cited by applicant]
US 20180278984A1 · Aimone et al. · 2018 [cited by applicant]
US 20180293638A1 · Simpson · 2018 [cited by applicant]
US 20180313798A1 · Chokshi et al. · 2018 [cited by applicant]
US 20180342106A1 · Rosado · 2018 [cited by applicant]
US 20180348863A1 · Aimone et al. · 2018 [cited by applicant]
US 20180357899A1 · Krivacic et al. · 2018 [cited by applicant]
US 20180365598A1 · Jamail · 2018 [cited by applicant]
US 20180365904A1 · Holmes · 2018 [cited by applicant]
US 20180374268A1 · Niles · 2018 [cited by applicant]
US 20190019144A1 · Gillen · 2019 [cited by applicant]
US 20190020973A1 · Harish · 2019 [cited by applicant]
US 20190047427A1 · Pogorelik · 2019 [cited by applicant]
US 20190050634A1 · Nerayoff et al. · 2019 [cited by applicant]
US 20190066528A1 · Hwang et al. · 2019 [cited by applicant]
US 20190102946A1 · Spivack et al. · 2019 [cited by applicant]
US 20190108686A1 · Spivack et al. · 2019 [cited by applicant]
US 20190139448A1 · Marshall et al. · 2019 [cited by applicant]
US 20190143828A1 · Sawada et al. · 2019 [cited by applicant]
US 20190146974A1 · Chung et al. · 2019 [cited by applicant]
US 20190158603A1 · Nelson et al. · 2019 [cited by applicant]
US 20190160958A1 · Chaudhary et al. · 2019 [cited by applicant]
US 20190178654A1 · Hare · 2019 [cited by applicant]
US 20190180862A1 · Wisser et al. · 2019 [cited by applicant]
US 20190186942A1 · Rubin · 2019 [cited by applicant]
US 20190188450A1 · Spivack et al. · 2019 [cited by applicant]
US 20190202448A1 · Pal et al. · 2019 [cited by applicant]
US 20190204110A1 · Dubielzyk · 2019 [cited by applicant]
US 20190205798A1 · Rosas-Maxemin et al. · 2019 [cited by applicant]
US 20190228269A1 · Brent et al. · 2019 [cited by applicant]
US 20190236741A1 · Bowman et al. · 2019 [cited by applicant]
US 20190236742A1 · Tomskii et al. · 2019 [cited by applicant]
US 20190251503A1 · Simpson · 2019 [cited by applicant]
US 20190251509A1 · Simpson · 2019 [cited by applicant]
US 20190259008A1 · Lindsey · 2019 [cited by applicant]
US 20190271553A1 · Simpson · 2019 [cited by applicant]
US 20190272589A1 · Simpson · 2019 [cited by applicant]
US 20190293438A1 · Simpson · 2019 [cited by applicant]
US 20190304000A1 · Simpson · 2019 [cited by applicant]
US 20190311431A1 · Simpson · 2019 [cited by applicant]
US 20190318286A1 · Simpson · 2019 [cited by applicant]
US 20190324989A1 · Borochoff et al. · 2019 [cited by applicant]
US 20190325541A1 · Simpson · 2019 [cited by applicant]
US 20190333166A1 · Simpson · 2019 [cited by applicant]
US 20190333181A1 · Simpson · 2019 [cited by applicant]
US 20190353499A1 · Stenneth · 2019 [cited by applicant]
US 20200013498A1 · Gelber · 2020 [cited by applicant]
US 20200027096A1 · Cooner · 2020 [cited by applicant]
US 20200047055A1 · Ward · 2020 [cited by applicant]
US 20200098071A1 · Jackson · 2020 [cited by applicant]
US 20200125999A1 · Simpson · 2020 [cited by applicant]
US 20200151816A1 · Simpson · 2020 [cited by applicant]
US 20200156495A1 · Lindup · 2020 [cited by applicant]
US 20200160461A1 · Kaniki · 2020 [cited by applicant]
US 20200173808A1 · Beaurepaire et al. · 2020 [cited by applicant]
US 20200219017A1 · Simpson · 2020 [cited by applicant]
US 20200226853A1 · Ahmed et al. · 2020 [cited by applicant]
US 20200317074A1 · Miller et al. · 2020 [cited by applicant]
US 20200317075A1 · Yokoyama et al. · 2020 [cited by applicant]
US 20200389301A1 · Detres et al. · 2020 [cited by applicant]
US 20210004909A1 · Farmer et al. · 2021 [cited by applicant]
US 20210012278A1 · Alon et al. · 2021 [cited by applicant]
US 20210041258A1 · Simpson · 2021 [cited by applicant]
US 20210042835A1 · Simpson · 2021 [cited by applicant]
US 20210065100A1 · Hwang · 2021 [cited by applicant]
US 20210158447A1 · Simpson · 2021 [cited by applicant]
US 20210166317A1 · Simpson · 2021 [cited by applicant]
US 20210248633A1 · Simpson · 2021 [cited by applicant]
US 20210318132A1 · Simpson · 2021 [cited by applicant]
US 20210326872A1 · Robotham · 2021 [cited by applicant]
US 20210379447A1 · Lee · 2021 [cited by applicant]
US 20210382924A1 · Aaltonen et al. · 2021 [cited by applicant]
US 20220020073A1 · Farmer · 2022 [cited by applicant]
US 20220068081A1 · Pariseau · 2022 [cited by applicant]
US 20220100731A1 · Tirapu Azpiroz et al. · 2022 [cited by applicant]
US 20220122026A1 · Okabe et al. · 2022 [cited by applicant]
US 20230157579A1 · Sato · 2023 [cited by applicant]
US 20230377409A1 · Rye · 2023 [cited by applicant]
CN 107341968A · 2017 [cited by applicant]
GB 2539556A · 2016 [cited by applicant]
JP 2003177034A · 2001 [cited by applicant]
KR 20170078094A1 · 2015 [cited by applicant]
WO 2001041084A2 · 2001 [cited by applicant]
WO 2015059691A1 · 2015 [cited by applicant]
WO 2015161307A1 · 2015 [cited by applicant]
WO 2018024844A1 · 2018 [cited by applicant]
WO 2019134005A1 · 2019 [cited by applicant]
WO 2019183468A1 · 2019 [cited by applicant]
WO 2021163675A1 · 2021 [cited by applicant]
PCT International Search Report and Written Opinion; PCT/US2020/027543; Jul. 1, 2020. [cited by applicant]
PCT International Search Report and Written Opinion; PCT/US2020/023223; Jun. 19, 2020. [cited by applicant]
PCT International Search Report and Written Opinion; PCT/US2020/023729; Jun. 18, 2020. [cited by applicant]
PCT International Search Report and Written Opinion; PCT/US2020/021546; Jun. 8, 2020. [cited by applicant]
PCT International Search Report and Written Opinion; PCT/US2020/018012; Apr. 21, 2020. [cited by applicant]
PCT International Search Report and Written Opinion; PCT/US2020/012208; Mar. 24, 2020. [cited by applicant]
Cited By (1)
US 12,731,107