US2023140281A1PendingUtilityA1

Task delegation and cooperation for automated assistants

Assignee: AT & T IP I LPPriority: Oct 8, 2019Filed: Dec 26, 2022Published: May 4, 2023
Est. expiryOct 8, 2039(~13.2 yrs left)· nominal 20-yr term from priority
G06Q 30/0283G06F 16/245G06F 16/3329G06F 9/453G06F 16/243
69
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

The present disclosure provides task delegation and cooperation for automated assistants. In one example, a method performed by a processing system that is in communication with a plurality of automated assistants includes receiving, a query indicating a task with which a user desires assistance, parsing the task into a plurality of sub-tasks including a first sub-task and a second sub-task, identifying a first automated assistant of the plurality of automated assistants that is capable of performing the first sub-task and a second automated assistant of the plurality of automated assistants that is capable of performing the second sub-task, and formulating a proposal for responding to the query, wherein the proposal comprises a sequence in which the plurality of sub-tasks is to be performed and a mapping that assigns the first sub-task to the first automated assistant and the second sub-task to the second automated assistant.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
         1 . A method comprising:
 receiving, by a processing system that is in communication with a plurality of automated assistants, a query indicating a task with which a user desires assistance;   parsing, by the processing system, the task into a plurality of sub-tasks including a first sub-task and a second sub-task;   identifying, by the processing system, a first automated assistant of the plurality of automated assistants that is capable of performing the first sub-task and a second automated assistant of the plurality of automated assistants that is capable of performing the second sub-task; and   formulating, by the processing system, a proposal for responding to the query, wherein the proposal comprises a sequence in which the plurality of sub-tasks is to be performed and a mapping that assigns the first sub-task to the first automated assistant and the second sub-task to the second automated assistant.   
     
     
         2 . The method of  claim 1 , further comprising:
 sending, by the processing system, a first instruction to the first automated assistant, wherein the first instruction instructs the first automated assistant to perform the first sub-task; and   sending, by the processing system, a second instruction to the second automated assistant, wherein the second instruction instructs the second automated assistant to perform the second sub-task.   
     
     
         3 . The method of  claim 2 , further comprising:
 monitoring, by the processing system, a progress of the first sub-task by the first automated assistant and a progress of the second sub-task by the second automated assistant.   
     
     
         4 . The method of  claim 3 , further comprising:
 modifying, by the processing system, at least one of: the first instruction or the second instruction, in response to the monitoring.   
     
     
         5 . The method of  claim 3 , further comprising:
 receiving, by the processing system, user feedback in response to a satisfaction of the query; and   updating a profile associated with the user, in response to the user feedback.   
     
     
         6 . The method of  claim 3 , further comprising:
 receiving, by the processing system, user feedback in response to a satisfaction of the query; and   updating a profile associated with the first automated assistant, in response to the user feedback.   
     
     
         7 . The method of  claim 6 , further comprising:
 sharing, by the processing system, the user feedback with a provider of the first automated assistant.   
     
     
         8 . The method of  claim 1 , wherein the parsing is performed using natural language understanding. 
     
     
         9 . The method of  claim 1 , wherein the parsing includes disambiguating between a plurality of potential meanings of the query, and wherein the disambiguating is based on a profile of the user. 
     
     
         10 . The method of  claim 1 , wherein the parsing includes disambiguating between a plurality of potential meanings of the query, and wherein the disambiguating is based on a context of at least one present circumstance of the user. 
     
     
         11 . The method of  claim 1 , wherein the identifying comprises:
 searching, by the processing system, an exchange that stores data about respective functionalities of the plurality of automated assistants.   
     
     
         12 . The method of  claim 11 , wherein the searching comprises:
 matching a keyword associated with the first sub-task to a tag associated with the first automated assistant in the exchange.   
     
     
         13 . The method of  claim 1 , wherein the formulating comprises:
 formulating, by the processing system, a plurality of proposals for responding to the query, wherein the proposal is a selected one of the plurality of proposals that is determined to respond to the query while also satisfying a predefined constraint.   
     
     
         14 . The method of  claim 13 , wherein the predefined constraint is a monetary cost of the proposal. 
     
     
         15 . The method of  claim 13 , wherein the predefined constraint is an estimated amount of time needed to carry out the proposal. 
     
     
         16 . The method of  claim 1 , wherein the plurality of automated assistants is further in communication with each other. 
     
     
         17 . The method of  claim 1 , wherein the sequence indicates that the first sub-task is to be performed in parallel with the second sub-task. 
     
     
         18 . The method of  claim 1 , wherein the sequence indicates that the first sub-task is to be performed before the second sub-task. 
     
     
         19 . A device comprising:
 a processor that is in communication with a plurality of automated assistants; and   a computer-readable medium storing instructions which, when executed by the processor, cause the processor to perform operations, the operations comprising:
 receiving a query indicating a task with which a user desires assistance; 
 parsing the task into a plurality of sub-tasks including a first sub-task and a second sub-task; 
 identifying a first automated assistant of the plurality of automated assistants that is capable of performing the first sub-task and a second automated assistant of the plurality of automated assistants that is capable of performing the second sub-task; and 
 formulating a proposal for responding to the query, wherein the proposal comprises a sequence in which the plurality of sub-tasks is to be performed and a mapping that assigns the first sub-task to the first automated assistant and the second sub-task to the second automated assistant. 
   
     
     
         20 . A non-transitory computer-readable storage medium storing instructions which, when executed by a processor that is in communication with a plurality of automated assistants, cause the processor to perform operations, the operations comprising:
 receiving a query indicating a task with which a user desires assistance;   parsing the task into a plurality of sub-tasks including a first sub-task and a second sub-task;   identifying a first automated assistant of the plurality of automated assistants that is capable of performing the first sub-task and a second automated assistant of the plurality of automated assistants that is capable of performing the second sub-task; and   formulating a proposal for responding to the query, wherein the proposal comprises a sequence in which the plurality of sub-tasks is to be performed and a mapping that assigns the first sub-task to the first automated assistant and the second sub-task to the second automated assistant.

Join the waitlist — get patent alerts

Track US2023140281A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.