IP Library Granted Patent US 12,259,946
Granted Patent B2
US 12,259,946 · App. 18/218,009 · Granted Mar 25, 2025

Robotic process automation system with hybrid workflows

Inventors: Murali Pallikonda (San Jose, CA); Abhijit Kakhandiki (San Jose, CA)
Assignee: Automation Anywhere, Inc.
G06F18/217G06F8/34G06F9/451G06N20/00G06Q10/06316G06Q10/103
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,259,946
App. No.
18/218,009
Granted
Mar 25, 2025
Kind
B2
Abstract

A computerized task automation system operates to permit automation of processes comprising one or more computer implemented tasks. Software robots may be created and retrieved to automate human user interaction with computer systems. The software robots each take one of three forms: (i) an attended software robot that is encoded to interact with one or more application programs and to accept one or more inputs from the user as required by the one or more application programs, (ii) an unattended software robot that is encoded to automatically interact with one or more application programs without any user input; and (iii) a cognitive software robot that is encoded to automatically interact with one or more application programs without any user input and is further encoded to automatically alter its interactions with the one or more application programs by way of a machine learning engine.

Claims (73)

1. A computerized task automation system, comprising:

a digital data storage containing at least:

one or more data structures that each specify a process comprising a plurality of tasks, at least a portion of the tasks are automatically performed by one or more software robots interacting with one or more application programs executing on one or more computer systems,

wherein each software robot of the one or more software robots is encoded with a set of instructions that cause the software robot to interact with one or more application programs, in order to perform one or more tasks using the one or more application programs in a manner that a user would perform the task; and

a processor programmed with instructions that when executed by the processor, cause the processor to at least:

retrieve, from the data storage, a selected process that is selected via a user;

provide to the user an interface that provides a visual representation of the selected process including at least links among tasks that specify a sequence in which the tasks are performed; and

accept, from the user by way of the interface, one or more inputs to carry out at least a portion of the selected process by one or more of the software robots, wherein at least one of the one or more software robots takes one of a plurality of forms comprising:

an attended software robot that is encoded to interact with one or more application programs and to accept one or more inputs from the user as required by the one or more application programs; and

an unattended software robot that is encoded to automatically interact with one or more application programs without any user input,

wherein at least another of the one or more software robots comprises a cognitive software robot that is encoded to automatically interact with one or more application programs without any user input and is further encoded to automatically alter its interactions with the one or more application programs by way of a machine learning engine.

2. The computerized task automation system of claim 1 , wherein the processor is further programmed to:

accept one or more inputs by the user by way of the interface to permit the user to create a new software robot and to alter an existing software robot; and

accept one or more inputs by the user by way of the interface to permit the user to select and to execute one or more processes.

3. The computerized task automation system of claim 1 , wherein the one or more software robots interact with one or more other software robots by way of an application programming interface that permits a first of the one or more software robots to invoke execution of a second of the one or more software robots by executing a call defined by an application programming interface in the first of the one or more software robots and the second of the one or more software robots.

4. The computerized task automation system of claim 1 , wherein the processor is further programmed to:

provide to the user one or more recommendations of software robots available in the computerized data storage to perform one or more of the tasks.

5. The computerized task automation system of claim 1 , wherein the processor is further programmed to:

provide to the user one or more recommendations of software robots available in the computerized data storage to perform one or more of the tasks as a function of software robots mapped to perform the one or more of the tasks.

6. The computerized task automation system of claim 1 , wherein the processor is further programmed to:

calculate an automation amount for the selected process that is indicative of a number of automated steps in the selected process as compared to a total number of steps in the selected process; and

present the automation amount to the user.

7. The computerized task automation system of claim 1 , wherein the processor is further programmed to:

provide to the user a visual interface that accepts from the user one or more inputs to specify actions to be performed by a new software robot.

8. A computerized method for performing task automation, comprising:

retrieving, from a data storage, a process selected by a user,

wherein the data storage contains at least one or more data structures that each specify a process comprising a plurality of tasks, at least a portion of the tasks are automatically performed by one or more software robots interacting with one or more application programs executing on one or more computer systems;

providing, to the user, an interface that provides a visual representation of the process including at least links among the tasks that specify a sequence in which the tasks are performed; and

accepting, from the user by way of the interface, one or more inputs to replace one or more of the tasks with one or more of the software robots, wherein each of the one or more software robots takes one of three forms comprising:

an attended software robot that is encoded to interact with one or more application programs and to accept one or more inputs from the user as required by the one or more application programs,

an unattended software robot that is encoded to automatically interact with one or more application programs without any user input; and

a cognitive software robot that is encoded to automatically interact with one or more application programs without any user input and is further encoded to automatically alter its interactions with the one or more application programs by way of a machine learning engine.

9. The computerized method of claim 8 further comprising:

accepting one or more inputs by the user by way of the interface to permit the user to create a new software robot and to alter an existing software robot; and

accepting one or more inputs by the user by way of the interface to permit the user to select and to execute one or more processes.

10. The computerized method of claim 8 , wherein the one or more software robots interact with one or more other software robots by way of an application programming interface that permits a first of the one or more software robots to invoke execution of a second of the one or more software robots by executing a call defined by an application programming interface in the first of the one or more software robots and the second of the one or more software robots.

11. The computerized method of claim 8 further comprising:

providing to the user one or more recommendations of software robots available in the computerized data storage to perform one or more of the tasks.

12. The computerized method of claim 8 further comprising:

providing to the user one or more recommendations of software robots available in the computerized data storage to perform one or more of the tasks as a function of software robots mapped to perform the one or more of the tasks.

13. The computerized method of claim 8 further comprising:

calculating an automation amount for the process selected by the user that is indicative of a number of automated steps in the process selected by the user as compared to a total number of steps in the process selected by the user; and

presenting the automation amount to the user.

14. The computerized method of claim 8 further comprising:

providing to the user a visual interface that accepts from the user one or more inputs to specify actions to be performed by a new software robot.

15. The computerized method of claim 8 , wherein each software robot of the one or more software robots is encoded with a set of instructions that cause the software robot to interact with one or more application programs, as encoded by the set of instructions, to perform one or more tasks using one or more applications to complete a task in a manner that a user would perform the task.

16. A non-transitory storage medium, having stored thereupon one or more program modules comprising computer-executable instructions for execution on a computer system, the computer-executable instructions causing the computer system to implement a robotic process automation system that employs data storage containing one or more data structures that each specify a process comprising a plurality of tasks, wherein at least a portion of the tasks are automatically performed by one or more software robots interacting with one or more application programs executing on one or more computer systems, the computer executable instructions causing a processor when executing the computer executable instructions to at least:

retrieving, from the data storage, a process selected by a user;

providing, to the user, an interface that provides a visual representation of the process including at least links among the tasks that specify a sequence in which the tasks are performed; and

accepting, from the user by way of the interface, one or more inputs to replace one or more of the tasks with one or more of the software robots,

wherein at least one of the one or more software robots comprises a cognitive software robot that is encoded to automatically interact with one or more application programs without any user input and is further encoded to automatically alter its interactions with the one or more application programs by way of a machine learning engine.

17. The non-transitory storage medium of claim 16 further comprising computer executable instructions causing the processor when executing the computer executable instructions to:

accept one or more inputs by the user by way of the interface to permit the user to create a new software robot and to alter an existing software robot; and

accept one or more inputs by the user by way of the interface to permit the user to select and to execute one or more processes.

18. The non-transitory storage medium of claim 16 wherein the one or more software robots is encoded with instructions that causes interaction with one or more other software robots by way of an application programming interface that permits a first of the one or more software robots to invoke execution of a second of the one or more software robots by executing a call defined by an application programming interface in the first of the one or more software robots and the second of the one or more software robots.

19. The non-transitory storage medium of claim 16 further comprising computer executable instructions causing the processor when executing the computer executable instructions to:

provide to the user one or more recommendations of software robots available in the computerized data storage to perform one or more of the tasks.

20. The non-transitory storage medium of claim 16 further comprising computer executable instructions causing the processor when executing the computer executable instructions to:

provide to the user one or more recommendations of software robots available in the computerized data storage to perform one or more of the tasks as a function of software robots mapped to perform the one or more of the first portion of the tasks.

21. The non-transitory storage medium of claim 16 further comprising computer executable instructions causing the processor when executing the computer executable instructions to:

calculate an automation amount for the process selected by the user that is indicative of a number of automated steps in the process selected by the user as compared to a total number of steps in the process selected by the user; and

present the automation amount to the user.

22. The non-transitory storage medium of claim 21 , further comprising computer executable instructions causing the processor when executing the computer executable instructions to:

provide to the user one or more recommendations of software robots available in the computerized data storage to perform one or more of the tasks.

23. A non-transitory storage medium, having stored thereupon one or more program modules comprising computer-executable instructions for execution on a computer system, the computer-executable instructions causing the computer system to implement a robotic process automation system that employs data storage containing one or more data structures that each specify a process comprising a plurality of tasks, wherein at least a portion of the tasks are automatically performed by one or more software robots interacting with one or more application programs executing on one or more computer systems, the computer executable instructions causing a processor when executing the computer executable instructions to at least:

retrieving, from the data storage, a process selected by a user;

providing, to the user, an interface that provides a visual representation of the process including at least links among the tasks that specify a sequence in which the tasks are performed; and

accepting, from the user by way of the interface, one or more inputs to replace one or more of the tasks with one or more of the software robots,

wherein at least one of the one or more software robots comprises:

an unattended software robot that is encoded to automatically interact with one or more application programs without any user input; and

a cognitive software robot that is encoded to automatically interact with one or more application programs without any user input and is further encoded to automatically alter its interactions with the one or more application programs by way of a machine learning engine.

24. The non-transitory storage medium of claim 23 , wherein at least one of the one or more software robots comprises:

an attended software robot that is encoded to interact with one or more application programs and to accept one or more inputs from the user as required by the one or more application programs.

Assignments (1)
SECURITY INTEREST Recorded Dec 5, 2024
From: AUTOMATION ANYWHERE, INC.
To: FIRST-CITIZENS BANK & TRUST COMPANY
Reel/Frame 069498/0193 →
Continuity (3)
Continuation 16410999 · May 13, 2019
Provisional Application 62670820 · May 13, 2018
Related Publication 20230342430A1 · Oct 26, 2023
References Cited (316)
US 5949999A · Song et al. · 1999 [cited by applicant]
US 5983001A · Boughner et al. · 1999 [cited by applicant]
US 6133917A · Feigner et al. · 2000 [cited by applicant]
US 6226407B1 · Zabih et al. · 2001 [cited by applicant]
US 6389592B1 · Ayres et al. · 2002 [cited by applicant]
US 6427234B1 · Chambers et al. · 2002 [cited by applicant]
US 6473794B1 · Guheen et al. · 2002 [cited by applicant]
US 6496979B1 · Chen et al. · 2002 [cited by applicant]
US 6640244B1 · Bowman-Amuah · 2003 [cited by applicant]
US 6704873B1 · Underwood · 2004 [cited by applicant]
US 6898764B2 · Kemp · 2005 [cited by applicant]
US 6954747B1 · Wang et al. · 2005 [cited by applicant]
US 6957186B1 · Guheen et al. · 2005 [cited by applicant]
US 7091898B2 · Arling et al. · 2006 [cited by applicant]
US 7246128B2 · Jordahl · 2007 [cited by applicant]
US 7398469B2 · Kisamore et al. · 2008 [cited by applicant]
US 7441007B1 · Kirkpatrick et al. · 2008 [cited by applicant]
US 7533096B2 · Rice et al. · 2009 [cited by applicant]
US 7568109B2 · Powell et al. · 2009 [cited by applicant]
US 7571427B2 · Wang et al. · 2009 [cited by applicant]
US 7765525B1 · Davidson et al. · 2010 [cited by applicant]
US 7783135B2 · Gokturk · 2010 [cited by applicant]
US 7805317B2 · Khan et al. · 2010 [cited by applicant]
US 7805710B2 · North · 2010 [cited by applicant]
US 7810070B2 · Nasuti et al. · 2010 [cited by applicant]
US 7846023B2 · Evans et al. · 2010 [cited by applicant]
US 8028269B2 · Bhatia et al. · 2011 [cited by applicant]
US 8056092B2 · Allen et al. · 2011 [cited by applicant]
US 8095910B2 · Nathan et al. · 2012 [cited by applicant]
US 8132156B2 · Malcolm · 2012 [cited by applicant]
US 8209738B2 · Nicol et al. · 2012 [cited by applicant]
US 8234622B2 · Meijer et al. · 2012 [cited by applicant]
US 8245215B2 · Extra · 2012 [cited by applicant]
US 8352464B2 · Folev · 2013 [cited by applicant]
US 8365147B2 · Grechanik · 2013 [cited by applicant]
US 8396890B2 · Lim · 2013 [cited by applicant]
US 8438558B1 · Adams · 2013 [cited by applicant]
US 8443291B2 · Ku et al. · 2013 [cited by applicant]
US 8464240B2 · Fritsch et al. · 2013 [cited by applicant]
US 8498473B2 · Chong et al. · 2013 [cited by applicant]
US 8504803B2 · Shukla · 2013 [cited by applicant]
US 8631458B1 · Banerjee · 2014 [cited by applicant]
US 8682083B2 · Kumar et al. · 2014 [cited by applicant]
US 8713003B2 · Fotev · 2014 [cited by applicant]
US 8724907B1 · Sampson et al. · 2014 [cited by applicant]
US 8769482B2 · Batey et al. · 2014 [cited by applicant]
US 8819241B1 · Washbum · 2014 [cited by applicant]
US 8832048B2 · Lim · 2014 [cited by applicant]
US 8874685B1 · Hollis et al. · 2014 [cited by applicant]
US 8943493B2 · Schneider · 2015 [cited by applicant]
US 8965905B2 · Ashmore et al. · 2015 [cited by applicant]
US 8966458B2 · Asai · 2015 [cited by applicant]
US 9032314B2 · Mital et al. · 2015 [cited by applicant]
US 9104294B2 · Forstall et al. · 2015 [cited by applicant]
US 9171359B1 · Lund · 2015 [cited by applicant]
US 9213625B1 · Schrage · 2015 [cited by applicant]
US 9251413B2 · Meler · 2016 [cited by applicant]
US 9278284B2 · Ruppert et al. · 2016 [cited by applicant]
US 9444844B2 · Edery et al. · 2016 [cited by applicant]
US 9462042B2 · Shukla et al. · 2016 [cited by applicant]
US 9571332B2 · Subramaniam et al. · 2017 [cited by applicant]
US 9600519B2 · Schoning et al. · 2017 [cited by applicant]
US 9621584B1 · Schmidt et al. · 2017 [cited by applicant]
US 9934063B2 · Kania · 2018 [cited by applicant]
US 9934129B1 · Budurean · 2018 [cited by applicant]
US 9946233B2 · Brun et al. · 2018 [cited by applicant]
US 9965139B2 · Nychis · 2018 [cited by examiner]
US 9990347B2 · Raskovic et al. · 2018 [cited by applicant]
US 10015503B1 · Ahammad · 2018 [cited by applicant]
US 10043255B1 · Pathapati et al. · 2018 [cited by applicant]
US 10282280B1 · Gouskova · 2019 [cited by applicant]
US 10489682B1 · Kumar et al. · 2019 [cited by applicant]
US 10552540B2 · Marascu et al. · 2020 [cited by applicant]
US 10592738B2 · Northrup · 2020 [cited by applicant]
US 10654166B1 · Hall · 2020 [cited by applicant]
US 10706218B2 · Milward et al. · 2020 [cited by applicant]
US 10706228B2 · Buisson · 2020 [cited by applicant]
US 10713068B1 · Zohar · 2020 [cited by applicant]
US 10936807B1 · Walters · 2021 [cited by applicant]
US 10970109B1 · Berenstein · 2021 [cited by examiner]
US 11099972B2 · Puszkiewicz · 2021 [cited by applicant]
US 11176443B1 · Selva · 2021 [cited by applicant]
US 11182178B1 · Singh et al. · 2021 [cited by applicant]
US 11182604B1 · Methaniya · 2021 [cited by applicant]
US 11243803B2 · Anand et al. · 2022 [cited by applicant]
US 11263391B2 · Potts · 2022 [cited by applicant]
US 11348353B2 · Sundell et al. · 2022 [cited by applicant]
US 11604663B2 · Singh et al. · 2023 [cited by applicant]
US 11614731B2 · Anand et al. · 2023 [cited by applicant]
US 11642783B2 · Han et al. · 2023 [cited by applicant]
US 11775321B2 · Singh et al. · 2023 [cited by applicant]
US 11775339B2 · Anand et al. · 2023 [cited by applicant]
US 11775814B1 · Anand et al. · 2023 [cited by applicant]
US 11782734B2 · Ginoya et al. · 2023 [cited by applicant]
US 11820020B2 · Goyal et al. · 2023 [cited by applicant]
US 20020029232A1 · Bobrow et al. · 2002 [cited by applicant]
US 20030033590A1 · Leherbauer · 2003 [cited by applicant]
US 20030101245A1 · Srinivasan et al. · 2003 [cited by applicant]
US 20030110382A1 · Leporini · 2003 [cited by applicant]
US 20030114959A1 · Sakamoto · 2003 [cited by applicant]
US 20030159089A1 · DiJoseph · 2003 [cited by applicant]
US 20040083472A1 · Rao et al. · 2004 [cited by applicant]
US 20040153649A1 · Rhoads · 2004 [cited by applicant]
US 20040172526A1 · Tann et al. · 2004 [cited by applicant]
US 20040210885A1 · Wang et al. · 2004 [cited by applicant]
US 20040243994A1 · Nasu · 2004 [cited by applicant]
US 20050188357A1 · Derks et al. · 2005 [cited by applicant]
US 20050204343A1 · Kisamore et al. · 2005 [cited by applicant]
US 20050257214A1 · Moshir et al. · 2005 [cited by applicant]
US 20060095276A1 · Axelrod et al. · 2006 [cited by applicant]
US 20060150188A1 · Roman et al. · 2006 [cited by applicant]
US 20060218110A1 · Simske et al. · 2006 [cited by applicant]
US 20070030528A1 · Quaeler et al. · 2007 [cited by applicant]
US 20070089101A1 · Romanovskiy · 2007 [cited by applicant]
US 20070101291A1 · Forstall et al. · 2007 [cited by applicant]
US 20070112574A1 · Greene · 2007 [cited by applicant]
US 20070156677A1 · Szabo · 2007 [cited by applicant]
US 20070233741A1 · Shen · 2007 [cited by applicant]
US 20080005086A1 · Moore · 2008 [cited by applicant]
US 20080027769A1 · Eder · 2008 [cited by applicant]
US 20080028392A1 · Chen et al. · 2008 [cited by applicant]
US 20080133052A1 · Jones · 2008 [cited by applicant]
US 20080209392A1 · Able et al. · 2008 [cited by applicant]
US 20080222454A1 · Kelso · 2008 [cited by applicant]
US 20080263024A1 · Landschaft et al. · 2008 [cited by applicant]
US 20080301649A1 · Stall · 2008 [cited by applicant]
US 20090037509A1 · Parekh et al. · 2009 [cited by applicant]
US 20090103769A1 · Milov et al. · 2009 [cited by applicant]
US 20090116071A1 · Mantell · 2009 [cited by applicant]
US 20090172814A1 · Khosravi et al. · 2009 [cited by applicant]
US 20090199160A1 · Vaitheeswaran et al. · 2009 [cited by applicant]
US 20090217309A1 · Grechanik et al. · 2009 [cited by applicant]
US 20090249297A1 · Doshi et al. · 2009 [cited by applicant]
US 20090313229A1 · Fellenstein et al. · 2009 [cited by applicant]
US 20090320002A1 · Peri-Glass et al. · 2009 [cited by applicant]
US 20100023602A1 · Martone · 2010 [cited by applicant]
US 20100023933A1 · Bryant et al. · 2010 [cited by applicant]
US 20100077475A1 · Deschenes · 2010 [cited by applicant]
US 20100100605A1 · Allen et al. · 2010 [cited by applicant]
US 20100106671A1 · Li et al. · 2010 [cited by applicant]
US 20100138015A1 · Colombo et al. · 2010 [cited by applicant]
US 20100235433A1 · Ansari et al. · 2010 [cited by applicant]
US 20100251163A1 · Keable · 2010 [cited by applicant]
US 20100275113A1 · Bastos dos Santos · 2010 [cited by applicant]
US 20110022578A1 · Fotev · 2011 [cited by applicant]
US 20110106284A1 · Catoen · 2011 [cited by applicant]
US 20110145807A1 · Molinie et al. · 2011 [cited by applicant]
US 20110197121A1 · Kletter · 2011 [cited by applicant]
US 20110258550A1 · Dinh-Trong · 2011 [cited by applicant]
US 20110267490A1 · Goktekin · 2011 [cited by applicant]
US 20110276568A1 · Fotev · 2011 [cited by applicant]
US 20110276946A1 · Pletter · 2011 [cited by applicant]
US 20110302570A1 · Kurimilla et al. · 2011 [cited by applicant]
US 20120011458A1 · Xia et al. · 2012 [cited by applicant]
US 20120042281A1 · Greene · 2012 [cited by applicant]
US 20120124062A1 · Macbeth et al. · 2012 [cited by applicant]
US 20120131456A1 · Lin et al. · 2012 [cited by applicant]
US 20120143941A1 · Kim · 2012 [cited by applicant]
US 20120266149A1 · Lebert · 2012 [cited by applicant]
US 20120310625A1 · Wei · 2012 [cited by applicant]
US 20120324333A1 · Lehavi · 2012 [cited by applicant]
US 20120330940A1 · Caire et al. · 2012 [cited by applicant]
US 20130145006A1 · Tammam · 2013 [cited by applicant]
US 20130173648A1 · Tan et al. · 2013 [cited by applicant]
US 20130227535A1 · Kannan · 2013 [cited by applicant]
US 20130236111A1 · Pintsov · 2013 [cited by applicant]
US 20130290318A1 · Shapira et al. · 2013 [cited by applicant]
US 20130332511A1 · Hala · 2013 [cited by applicant]
US 20130332524A1 · Fiala · 2013 [cited by applicant]
US 20140036290A1 · Miyagawa · 2014 [cited by applicant]
US 20140045484A1 · Kim et al. · 2014 [cited by applicant]
US 20140075371A1 · Carmi · 2014 [cited by applicant]
US 20140181705A1 · Hey et al. · 2014 [cited by applicant]
US 20140189576A1 · Carmi · 2014 [cited by applicant]
US 20140379666A1 · Bryon · 2014 [cited by applicant]
US 20150082280A1 · Betak et al. · 2015 [cited by applicant]
US 20150235193A1 · Cummings · 2015 [cited by applicant]
US 20150290795A1 · Oleynik · 2015 [cited by examiner]
US 20150301926A1 · Giannelos · 2015 [cited by applicant]
US 20150310268A1 · He · 2015 [cited by applicant]
US 20150347284A1 · Hey et al. · 2015 [cited by applicant]
US 20160019049A1 · Kakhandiki et al. · 2016 [cited by applicant]
US 20160034441A1 · Nguyen et al. · 2016 [cited by applicant]
US 20160055376A1 · Koduru · 2016 [cited by applicant]
US 20160063269A1 · Liden · 2016 [cited by applicant]
US 20160078368A1 · Kakhandiki et al. · 2016 [cited by applicant]
US 20170270431A1 · Hosabettu · 2017 [cited by applicant]
US 20170352041A1 · Ramamurthy · 2017 [cited by examiner]
US 20180113781A1 · Kim · 2018 [cited by applicant]
US 20180144042A1 · Sheng · 2018 [cited by applicant]
US 20180210824A1 · Kochura · 2018 [cited by applicant]
US 20180218429A1 · Guo et al. · 2018 [cited by applicant]
US 20180275835A1 · Prag · 2018 [cited by applicant]
US 20180276462A1 · Davis · 2018 [cited by applicant]
US 20180321955A1 · Liu · 2018 [cited by applicant]
US 20180322403A1 · Ron · 2018 [cited by applicant]
US 20180349730A1 · Dixon · 2018 [cited by applicant]
US 20180370029A1 · Hall · 2018 [cited by applicant]
US 20190005050A1 · Proux · 2019 [cited by applicant]
US 20190026215A1 · Agarwal · 2019 [cited by applicant]
US 20190028587A1 · Unitt · 2019 [cited by applicant]
US 20190034041A1 · Nychis · 2019 [cited by applicant]
US 20190095440A1 · Chakra · 2019 [cited by applicant]
US 20190114370A1 · Cerino · 2019 [cited by applicant]
US 20190126463A1 · Purushothaman · 2019 [cited by applicant]
US 20190141596A1 · Gay · 2019 [cited by applicant]
US 20190188462A1 · Nishida · 2019 [cited by applicant]
US 20190205636A1 · Saraswat · 2019 [cited by applicant]
US 20190213822A1 · Jain · 2019 [cited by applicant]
US 20190250891A1 · Kumar · 2019 [cited by applicant]
US 20190266692A1 · Stach et al. · 2019 [cited by applicant]
US 20190317803A1 · Maheshwari · 2019 [cited by applicant]
US 20190324781A1 · Ramamurthy · 2019 [cited by applicant]
US 20190340240A1 · Duta · 2019 [cited by applicant]
US 20190377987A1 · Price et al. · 2019 [cited by applicant]
US 20200019767A1 · Porter et al. · 2020 [cited by applicant]
US 20200034976A1 · Stone et al. · 2020 [cited by applicant]
US 20200058387A1 · Stahel · 2020 [cited by examiner]
US 20200059441A1 · Viet · 2020 [cited by applicant]
US 20200097742A1 · Kumar et al. · 2020 [cited by applicant]
US 20200104350A1 · Allen · 2020 [cited by applicant]
US 20200125635A1 · Nuolf · 2020 [cited by applicant]
US 20200147791A1 · Safary · 2020 [cited by applicant]
US 20200151444A1 · Price et al. · 2020 [cited by applicant]
US 20200151591A1 · Li · 2020 [cited by applicant]
US 20200159647A1 · Puszkiewicz · 2020 [cited by applicant]
US 20200159648A1 · Ghare · 2020 [cited by applicant]
US 20200249964A1 · Fernandes · 2020 [cited by applicant]
US 20200257764A1 · Reisswig · 2020 [cited by applicant]
US 20200273078A1 · Xu · 2020 [cited by applicant]
US 20200285353A1 · Rezazadeh Sereshkeh · 2020 [cited by applicant]
US 20200311210A1 · Nama · 2020 [cited by applicant]
US 20200334249A1 · Canim · 2020 [cited by applicant]
US 20210042516A1 · Panakkal · 2021 [cited by applicant]
US 20210049128A1 · Kernick · 2021 [cited by applicant]
US 20210107140A1 · Singh · 2021 [cited by applicant]
US 20210141497A1 · Magureanu · 2021 [cited by applicant]
US 20210216334A1 · Barrett · 2021 [cited by applicant]
US 20210248153A1 · Sirangimoorthy · 2021 [cited by applicant]
US 20210279166A1 · Peng · 2021 [cited by applicant]
US 20210333983A1 · Singh et al. · 2021 [cited by applicant]
US 20220245936A1 · Valk · 2022 [cited by applicant]
US 20220405094A1 · Farquhar · 2022 [cited by applicant]
US 20230052190A1 · Goyal et al. · 2023 [cited by applicant]
US 20230053260A1 · Goyal et al. · 2023 [cited by applicant]
WO 2019092672A2 · 2019 [cited by applicant]
WO 2022076488 · 2022 [cited by applicant]
Al Sallami, Load Balancing in Green Cloud Computation, Proceedings of the World Congress on Engineering 2013 vol. II, WCE 2013, 2013, pp. 1-5 (Year: 2013). [cited by applicant]
B.P. Kasper “Remote: A Means of Remotely Controlling and Storing Data from a HAL Quadrupole Gass Analyzer Using an IBM-PC Compatible Computer”, Nov. 15, 1995, Space and Environment Technology Center. [cited by applicant]
Bergen et al., RPC automation: making legacy code releant, May 2013, 6 pages. [cited by applicant]
Hu et al., Automating GUI testing for Android applications, May 2011, 7 pages. [cited by applicant]
Konstantinou et al., An architecture for virtual solution composition and deployment in infrastructure clouds, 9 pages (Year: 2009). [cited by applicant]
Nyulas et al., An Ontology-Driven Framework for Deploying JADE Agent Systems, 5 pages (Year: 2006). [cited by applicant]
Tom Yeh, Tsung-Hsiang Chang, and Robert C. Miller, Sikuli: Using GUI Screenshots for Search and Automation, Oct. 4-7, 2009, 10 pages. [cited by applicant]
Yu et al., Deplying and managing Web services: issues, solutions, and directions, 36 pages (Year: 2008). [cited by applicant]
Zhifang et al., Test automation on moble device, May 2010, 7 pages. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/230,492, mailed Oct. 14, 2022. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 16/398,532, mailed Oct. 23, 2022. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 16/876,530, mailed Sep. 29, 2020. [cited by applicant]
Final Office Action for U.S. Appl. No. 16/876,530, mailed Apr. 13, 2021. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 16/876,530, mailed Jul. 22, 2021. [cited by applicant]
Dai, Jifeng et al., “R-fcn: Object detectiom via region-based fully convolutional networks”, Advances in neural information processing systems 29 (2016). (Year: 2016). [cited by applicant]
Ren, Shaoqing et al., “Faster r-cnn: Towards realtime object detection with region proposal network.” Advances in neutral information processing systems 28 (2015). (Year: 2015). [cited by applicant]
Zhifang et al., Test automation on mobile device, May 2010, 7 pages. [cited by applicant]
Ren, Shaoqing et al., “Faster r-cnn: Towards real0time object detection with region proposal network.” Advances in neutral information processing systems 28 (2015). (Year: 2015). [cited by applicant]
International Search Report for PCT/US2021/053669, dated May 11, 2022. [cited by applicant]
Embley et al., “Table-processing paradigms: a research survey”, International Journal on Document Analysis and Recognition, vol. 8, No. 2-3, May 9, 2006, pp. 66-86. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 16/925,956, mailed Sep. 16, 2021. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 16/925,956, mailed Jan. 7, 2022. [cited by applicant]
Pre-Interview Office Action for U.S. Appl. No. 16/398,532, mailed Jul. 8, 2022. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 16/398,532, mailed Jul. 8, 2022. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/139,838, mailed Feb. 22, 2022. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/139,838, mailed Nov. 15, 2023. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/139,838, mailed Apr. 5, 2023. [cited by applicant]
International Search Report and Written Opinion for PCT/US2021/015691, mailed May 11, 2021. [cited by applicant]
A density-based algorithm for discovering clusters in large spatial databases with noise, Ester, Martin; Kriegel, Hans-Peter; Sander, Jorg; Xu, Xiaowei, Simoudis, Evangelos; Han, Jiawei; Fayyad, Usama M., eds., Proceedi… [cited by applicant]
Deep Residual Learning for Image Recognition, by K. He, X. Zhang, S. Ren, and J. Sun, arXiv:1512.03385 (2015). [cited by applicant]
FaceNet: A Unified Embedding for Face Recognition and Clustering, by F. Schroff, D. Kalenichenko, J. Philbin, arXiv:1503.03832 (2015). [cited by applicant]
Muhammad et al. “Fuzzy multilevel graph embedding”, copyright 2012 Elsevier Ltd. [cited by applicant]
Sharma et al. Determining similarity in histological images using graph-theoretic description and matching methods for content-based image retrieval in medical diagnostics, Biomed Center, copyright 2012. [cited by applicant]
First Action Interview Pilot Program Pre-Interview communication for U.S. Appl. No. 16/779,462, mailed Dec. 3, 2021. [cited by applicant]
Reply under 37 CDT 1.111 to Pre-Interview Communication for U.S. Appl. No. 16/779,462, filed Jan. 25, 2022. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 16/779,462 mailed Feb. 9, 2022. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/131,674, mailed Jun. 22, 2023. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 16/731,044, mailed Jan. 25, 2021. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 16/731,044, mailed May 5, 2021. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 18/126,935, mailed Jul. 13, 2023. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/139,842, mailed Jul. 18, 2023. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/588,588, mailed Aug. 2, 2023. [cited by applicant]
Pre-lnterview Office Action for U.S. Appl. No. 16/859,488, mailed Jan. 25, 2021. [cited by applicant]
First Action Interview for U.S. Appl. No. 16/859,488, mailed Mar. 22, 2021. [cited by applicant]
Final Office Action for U.S. Appl. No. 16/859,488, mailed Jul. 8, 2021. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 16/859,488, mailed Mar. 30, 2022. [cited by applicant]
Non-Final Office Action for U.S. Appl No. 17/160,084, mailed Aug. 10, 2023. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/528,119, mailed Sep. 8, 2022. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/528,119, mailed Nov. 25, 2022. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/463,494, mailed Sep. 6, 2023. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/160,080, mailed Sep. 11, 2023. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/994,249 mailed Sep. 13, 2023. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/534,249 mailed Sep. 13, 2023. [cited by applicant]
Final Office Action for U.S. Appl. No. 16/930,247 mailed Oct. 12, 2023. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/534,443 mailed Oct. 24, 2023. [cited by applicant]
International Search Report and Written Opinion for PCT/US2022/013026, mailed Sep. 21, 2022. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/139,842, mailed Dec. 29, 2023. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 18/126,935, mailed Jan. 10, 2024. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/463,494, mailed Jan. 16, 2024. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 18/215,126, mailed Jan. 25, 2024. [cited by applicant]
Advisory Action and After Final Pilot Decision for U.S. Appl. No. 17/160,080, mailed Jan. 29, 2024. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/160,082, mailed Feb. 15, 2024. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/206,029, mailed Feb. 28, 2024. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/160,080, mailed Mar. 13, 2024. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/160,084, mailed Mar. 15, 2024. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 18/094,305, mailed May 9, 2024. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/160,084, mailed May 16, 2024. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 18/218,009, mailed May 20, 2024. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/160,080, mailed Jun. 12, 2024. [cited by applicant]