logo

For the Inventor, By the Inventor

The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Patent No.:

US 11580190 B1

PDFFull Text
Date of Patent:
Feb. 14, 2023

Filed:

Jul. 06, 2021

Automation system and method

Applicant:

Grokit Data, Inc., Stuart, FL (US);

Inventors:

James A. Harding, Issaquah, WA (US);

Anthony J. Paquin, Stuart, FL (US);

Scott Thibault, Colchester, VT (US);

Jason A. Boatman, Charlottesville, VA (US);

Assignee:

Grokit Data, Inc., Stuart, FL (US);

Attorneys:

Brian J. Colandreo

Heath M. Sargeant

Holland & Knight LLP

Primary Examiner:

Andy Ho

Int. Cl.
CPC ...
G06F 9/54 (2006.01); G06F 16/958 (2019.01); G06N 20/00 (2019.01); G06F 9/48 (2006.01); G06N 5/02 (2023.01); G06Q 30/0201 (2023.01); G06F 16/955 (2019.01); G06F 16/957 (2019.01); G06F 16/951 (2019.01); G06Q 30/0282 (2023.01); G06Q 10/04 (2023.01); G06Q 10/0631 (2023.01); G06Q 10/0637 (2023.01); G06Q 10/067 (2023.01); G06F 11/36 (2006.01); G06F 16/84 (2019.01); G06F 9/50 (2006.01); G06F 16/80 (2019.01); G06F 40/14 (2020.01); G06F 3/0481 (2022.01); G06K 9/62 (2022.01); G06Q 30/0601 (2023.01); G06Q 10/0633 (2023.01); G06Q 10/0833 (2023.01); G06Q 10/083 (2023.01); G06Q 10/10 (2023.01); G06Q 30/04 (2012.01);
U.S. Cl.
CPC ...
G06F 16/958 (2019.01); G06F 3/0481 (2013.01); G06F 9/485 (2013.01); G06F 9/4806 (2013.01); G06F 9/4843 (2013.01); G06F 9/5066 (2013.01); G06F 9/542 (2013.01); G06F 9/547 (2013.01); G06F 11/3612 (2013.01); G06F 11/3616 (2013.01); G06F 16/80 (2019.01); G06F 16/84 (2019.01); G06F 16/951 (2019.01); G06F 16/955 (2019.01); G06F 16/9577 (2019.01); G06F 16/986 (2019.01); G06F 40/14 (2020.01); G06K 9/6256 (2013.01); G06N 5/027 (2013.01); G06N 20/00 (2019.01); G06Q 10/04 (2013.01); G06Q 10/067 (2013.01); G06Q 10/0633 (2013.01); G06Q 10/06315 (2013.01); G06Q 10/06375 (2013.01); G06Q 30/0201 (2013.01); G06Q 30/0282 (2013.01); G06Q 30/0641 (2013.01); G06Q 10/0833 (2013.01); G06Q 10/0838 (2013.01); G06Q 10/10 (2013.01); G06Q 30/04 (2013.01);
Abstract

A computer-implemented method, computer program product and computing system for receiving a complex task; processing the complex task to define a plurality of discrete tasks each having a discrete goal; executing the plurality of discrete tasks on a plurality of machine-accessible public computing platforms; determining if any of the plurality of discrete tasks failed to achieve its discrete goal; and if a specific discrete task failed to achieve its discrete goal, defining a substitute discrete task having a substitute discrete goal.

Find Patent Forward Citations

Loading…