IP Library › Granted Patent US 12,591,441
Granted Patent B2
US 12,591,441 · App. 18/447,511 · Granted Mar 31, 2026

Determining sequences of interactions, process extraction, and robot generation using generative artificial intelligence / machine learning models

Inventor: Prabhdeep Singh (Bellevue, WA)
Assignee: UiPath, Inc.
G06F9/451G06F17/18G06N20/00
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,591,441
App. No.
18/447,511
Filed
Aug 10, 2023
Granted
Mar 31, 2026
Kind
B2
Art Unit
2178
USPC
715/704
Abstract

Use of generative artificial intelligence (AI)/machine learning (ML) models is disclosed to determine sequences of user interactions with computing systems, extract common processes, and generate robotic process automation (RPA) robots. The generative AI/ML model may be trained to recognize matching n-grams of user interactions and/or a beneficial end state. Recorded real user interactions may be analyzed, and matching sequences may be implemented as corresponding activities in an RPA workflow.

Claims (71)

1 . A computer-implemented method, comprising:

providing, by a computing system, a generative artificial intelligence (AI)/machine learning (ML) model with data comprising time-ordered interactions of a plurality of users with respective user computing systems;

training the generative AI/ML model, by the computing system, to recognize related sequences of user interactions that pertain to tasks in the time-ordered sequences of user interactions of the plurality of users by comparing n-grams of sequences of user interactions in recorded data from the computing systems over a sliding window to find the related sequences, the n-grams comprising two or more values of n; and

deploying the trained generative AI/ML model.

2 . The computer-implemented method of claim 1 , wherein the deployed generative AI/ML model is configured to be called by one or more robotic process automation (RPA) robots.

3 . The computer-implemented method of claim 1 , wherein the training further comprises training the generative AI/ML model to determine a lowest value of n such that a majority of sequences of at least size n pertain to tasks performed by the users.

4 . The computer-implemented method of claim 1 , wherein a minimum number of related sequences is required for the generative AI/ML model to determine that the sequence pertains to a task.

5 . The computer-implemented method of claim 1 , wherein the training further comprises training the generative AI/ML model to determine a highest value of n such that n-grams above the highest value of n are not considered.

6 . The computer-implemented method of claim 1 , further comprising:

training the generative AI/ML model to use one or more importance metrics when determining whether a task is found in the related sequences, by the computing system.

7 . The computer-implemented method of claim 6 , wherein the one or more importance metrics comprise whether a related sequence of actions generates at least a certain amount of revenue, saves at least a certain amount of revenue, increases efficiency and/or speed of a task by at least a certain amount, speeds up a customer acquisition process, reduces a number of communications that are required, or a combination thereof.

8 . The computer-implemented method of claim 1 , further comprising:

training the generative AI/ML model or a robotic process automation (RPA) designer application to associate user interactions with RPA activities.

9 . The computer-implemented method of claim 8 , further comprising:

analyzing recorded real user interactions of a plurality of users with respective computing systems and determining sets of related sequences in the recorded real user interactions, by the generative AI/ML model; and

generating one or more respective robotic process automation (RPA) workflows comprising activities that implement user interactions of the determined sets of related sequences.

10 . The computer-implemented method of claim 9 , further comprising:

generating respective RPA robots implementing the one or more generated RPA workflows; and

deploying the one or more generated RPA robots to one or more user computing systems.

11 . The computer-implemented method of claim 9 , further comprising:

making the one or more generated RPA workflows accessible to one or more RPA designer applications.

12 . The computer-implemented method of claim 9 , wherein the determining of the sets of related sequences comprises:

generating a probability graph comprising associations between sequences of user interactions, by the generative AI/ML model;

pruning the probability graph to remove unrelated user interactions and sequences, by the generative AI/ML model; and

determining that sequences of user interactions match as part of a set of the set of related sequences based on the pruned probability graph, by the generative AI/ML model.

13 . The computer-implemented method of claim 12 , wherein the determination of whether the sequences match is performed using a Levenshtein distance, fuzzy matching, or a combination thereof.

14 . The computer-implemented method of claim 9 , further comprising:

determining a most efficient sequence of a set of related sequences to generate an RPA workflow based on one or more efficiency metrics; and

generating the respective RPA workflow using the most efficient sequence.

15 . The computer-implemented method of claim 14 , wherein a metric of the one or more efficiency metrics for the determination of the most efficient sequence is based on a number of user interactions in the sequence, a time associated with user interactions in the sequence, or a combination thereof.

16 . The computer-implemented method of claim 1 , wherein the generative AI model is a large language model (LLM), a generative adversarial network (GAN), a variational autoencoder (VAE), or a transformer.

17 . A non-transitory computer-readable medium storing a computer program, the computer program configured to cause at least one processor to:

analyze recorded real user interactions of a plurality of users with respective computing systems and determine sets of related sequences in the recorded real user interactions, by a generative artificial intelligence (AI)/machine learning (ML) model; and

generate one or more respective robotic process automation (RPA) workflows comprising activities that implement user interactions of the determined sets of related sequences, wherein

a minimum number of related sequences is required for the generative AI/ML model to determine that the sequence pertains to a task.

18 . The non-transitory computer-readable medium of claim 17 , wherein the determining of the sets of related sequences comprises:

generating a probability graph comprising associations between sequences of user interactions, by the generative AI/ML model;

pruning the probability graph to remove unrelated user interactions and sequences, by the generative AI/ML model; and

determining that sequences of user interactions match as part of a set of the set of related sequences based on the pruned probability graph, by the generative AI/ML model.

19 . The non-transitory computer-readable medium of claim 17 , wherein the computer program is further configured to cause the at least one processor to:

determine a most efficient sequence of the set of related sequences to generate an RPA workflow based on one or more efficiency metrics; and

generate the respective RPA workflow using the most efficient sequence.

20 . The non-transitory computer-readable medium of claim 19 , wherein a metric of the one or more efficiency metrics for the determination of the most efficient sequence is based on a number of user interactions in the sequence, a time associated with user interactions in the sequence, or a combination thereof.

21 . The non-transitory computer-readable medium of claim 17 , wherein

the determining of the sets of related sequences in the recorded real user interactions comprises using one or more importance metrics, and

the one or more importance metrics comprise whether a related sequence of actions generates at least a certain amount of revenue, saves at least a certain amount of revenue, increases efficiency and/or speed of a task by at least a certain amount, speeds up a customer acquisition process, reduces a number of communications that are required, or a combination thereof.

22 . The non-transitory computer-readable medium of claim 17 , wherein the generative AI model is a large language model (LLM), a generative adversarial network (GAN), a variational autoencoder (VAE), or a transformer.

23 . A computing system, comprising:

memory storing computer program instructions; and

at least one processor configured to execute the computer program instructions, wherein the computer program instructions are configured to cause the at least one processor to:

analyze recorded real user interactions of a plurality of users with respective computing systems and determine related sequences in the recorded real user interactions, by a generative artificial intelligence (AI)/machine learning (ML) model;

determine a most efficient sequence of the related sequences;

generate a graph or data model comprising associations between sequences of user interactions, by the generative AI/ML model, and

generate one or more respective robotic process automation (RPA) workflows comprising activities that implement user interactions of the determined most efficient related sequence.

24 . The computing system of claim 23 , wherein the determination of the most efficient sequence is based on a number of user interactions in the sequence, a time associated with user interactions in the sequence, or a combination thereof.

25 . The computing system of claim 23 , wherein

the determining of the related sequences in the recorded real user interactions comprises using one or more importance metrics, and

the one or more importance metrics comprise whether a related sequence of actions generates at least a certain amount of revenue, saves at least a certain amount of revenue, increases efficiency and/or speed of a task by at least a certain amount, speeds up a customer acquisition process, reduces a number of communications that are required, or a combination thereof.

26 . The computing system of claim 23 , wherein a minimum number of related sequences are required for generation of a respective RPA workflow.

27 . The computing system of claim 23 , wherein

a graph is generated comprising the associations between the sequences of user interactions, and

the graph is a probability graph.

28 . The computing system of claim 23 , wherein the generative AI model is a large language model (LLM), a generative adversarial network (GAN), a variational autoencoder (VAE), or a transformer.

29 . A computer-implemented method, comprising:

providing, by a computing system, a generative artificial intelligence (AI)/machine learning (ML) model with data comprising time-ordered interactions of a plurality of users with respective user computing systems;

training the generative AI/ML model, by the computing system, to recognize related sequences of user interactions that pertain to tasks in the time-ordered sequences of user interactions by comparing n-grams of sequences of user interactions in recorded data from the computing systems over a sliding window to find the related sequences, the n-grams comprising two or more values of n; and

deploying the trained generative AI/ML model, wherein

the training further comprises training the generative AI/ML model to determine a highest value of n such that n-grams above the highest value of n are not considered.

30 . The computer-implemented method of claim 29 , wherein the training further comprises training the generative AI/ML model to determine a lowest value of n such that a majority of sequences of at least size n pertain to tasks performed by the users.

31 . The computer-implemented method of claim 29 , wherein a minimum number of related sequences is required for the generative AI/ML model to determine that the sequence pertains to a task.

32 . The computer-implemented method of claim 29 , wherein the generative AI model is a large language model (LLM), a generative adversarial network (GAN), a variational autoencoder (VAE), or a transformer.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 10, 2023
From: SINGH, PRABHDEEP
To: UIPATH, INC.
Reel/Frame 064554/0919 →
Continuity (3)
Continuation In Part 17696120 · Mar 16, 2022
Continuation 17070168 · Oct 14, 2020
Related Publication 20230385085A1 · Nov 30, 2023
References Cited (67)
US 9483740B1 · Ansel et al. · 2016 [cited by applicant]
US 9555544B2 · Bataller et al. · 2017 [cited by applicant]
US 10235192B2 · Hall et al. · 2019 [cited by applicant]
US 10354225B2 · Sharma et al. · 2019 [cited by applicant]
US 10365799B2 · Hosbettu et al. · 2019 [cited by applicant]
US 10489126B2 · Kumar et al. · 2019 [cited by applicant]
US 10613838B2 · Kim et al. · 2020 [cited by applicant]
US 10956181B2 · Banne · 2021 [cited by applicant]
US 10984666B1 · DePaolo et al. · 2021 [cited by applicant]
US 11144179B2 · Sultan · 2021 [cited by applicant]
US 11176443B1 · Selva et al. · 2021 [cited by applicant]
US 11188857B1 · Hill · 2021 [cited by applicant]
US 11226832B2 · Westberg et al. · 2022 [cited by applicant]
US 11328524B2 · Cristescu et al. · 2022 [cited by applicant]
US 11347613B2 · Singh · 2022 [cited by examiner]
US 20080215397A1 · Bhattacharya et al. · 2008 [cited by applicant]
US 20110307228A1 · Kasabov · 2011 [cited by applicant]
US 20140012626A1 · Ajmera et al. · 2014 [cited by applicant]
US 20170308800A1 · Cichon et al. · 2017 [cited by applicant]
US 20180039565A1 · Rajagopalan · 2018 [cited by examiner]
US 20180052861A1 · Seetharaman et al. · 2018 [cited by applicant]
US 20180113780A1 · Kim · 2018 [cited by examiner]
US 20190051292A1 · Na · 2019 [cited by applicant]
US 20190057457A1 · Gao et al. · 2019 [cited by applicant]
US 20190102676A1 · Nazari et al. · 2019 [cited by applicant]
US 20190102684A1 · Beran et al. · 2019 [cited by applicant]
US 20190236458A1 · Taylor et al. · 2019 [cited by applicant]
US 20190250891A1 · Kumar · 2019 [cited by examiner]
US 20190250893A1 · Pandit · 2019 [cited by examiner]
US 20190324781A1 · Ramamurthy et al. · 2019 [cited by applicant]
US 20190332073A1 · Nasle · 2019 [cited by examiner]
US 20190354583A1 · Ralhan · 2019 [cited by applicant]
US 20190379589A1 · Ryan · 2019 [cited by examiner]
US 20200019418A1 · P K · 2020 [cited by examiner]
US 20200033869A1 · Palanisamy et al. · 2020 [cited by applicant]
US 20200206920A1 · Ma · 2020 [cited by examiner]
US 20200219033A1 · Smutko · 2020 [cited by examiner]
US 20200285977A1 · Brebner · 2020 [cited by examiner]
US 20210110345A1 · Iyer · 2021 [cited by examiner]
US 20210182100A1 · Zhang · 2021 [cited by examiner]
US 20210304064A1 · Mudi · 2021 [cited by examiner]
US 20210326743A1 · Iftekharuddin et al. · 2021 [cited by applicant]
US 20210358488A1 · Iyer · 2021 [cited by examiner]
CN 111124888A · 2020 [cited by applicant]
JP 2020512122A · 2020 [cited by applicant]
KR 20200094833A · 2020 [cited by applicant]
WO 2016109755A1 · 2016 [cited by applicant]
WO 2019010435A1 · 2019 [cited by applicant]
WO 2020092446A3 · 2020 [cited by applicant]
William D Titcomb, “Notice of Allowance”, issued Aug. 23, 2023, U.S. Appl. No. 17/696,120. [cited by applicant]
William D Titcomb, “Notice of Allowance”, issued Sep. 13, 2023, U.S. Appl. No. 17/751,139. [cited by applicant]
Andrew Sornborger et al., “A Pulse-gated, Neural Implementation of the Backpropagation Algorithm,” NICE '19, Albany, New York (Mar. 26-28, 2019). [cited by applicant]
International Search Report & Written Opinion, issued Feb. 3, 2022, PCT Application No. PCT/US21/53489. [cited by applicant]
International Search Report & Written Opinion, issued Jan. 24, 2022, PCT Application No. PCT/US21/53493. [cited by applicant]
Michael Nielsen, “Neural Networks and Deep Learning Chapter 2 - How the Backpropagation Algorithm Works,” available on the web at http://neuralnetworksanddeeplearning.com/chap2.html (Dec. 2019). [cited by applicant]
Wikipedia Backpropagation Page available at https://en.wikipedia.org/wiki/Backpropagation (last accessed Oct. 13, 2020). [cited by applicant]
William D Titcomb, “Letter Restarting Period for Response”, issued Mar. 31, 2023, U.S. Appl. No. 17/696,120. [cited by applicant]
William D Titcomb, “Non-Final Office Action”, issued Mar. 28, 2023, U.S. Appl. No. 17/696,120. [cited by applicant]
William D Titcomb, “Non-Final Office Action”, issued Oct. 25, 2021, U.S. Appl. No. 17/070,168. [cited by applicant]
William D Titcomb, “Non-Final Office Action”, issued Oct. 26, 2021, U.S. Appl. No. 17/129,740. [cited by applicant]
William D Titcomb, “Notice of Allowance”, issued Feb. 16, 2022, U.S. Appl. No. 17/070,168. [cited by applicant]
William D Titcomb, “Notice of Allowance”, issued Mar. 25, 2022, U.S. Appl. No. 17/129,740. [cited by applicant]
William D. Titcomb, “Non-Final Office Action”, issued May 18, 2023, U.S. Appl. No. 17/751,139. [cited by applicant]
William D Titcomb, “Non-Final Office Action”, issued Oct. 24, 2025, U.S. Appl. No. 18/448,342. [cited by applicant]
Office Action, issued Sep. 2, 2025, JP Patent Application No. 2023-518734. [cited by applicant]
Office Action, issued Nov. 18, 2025, IN Patent Application No. 202317025530. [cited by applicant]
William D Titcomb, “Notice of Allowance”, issued Jan. 7, 2026, U.S. Appl. No. 18/448,342. [cited by applicant]