IP Library Granted Patent US 12,481,702
Granted Patent B2
US 12,481,702 · App. 18/959,423 · Granted Nov 25, 2025

Fast exploration and learning of latent graph models

Inventors: Sivaramakrishnan Swaminathan (Mountain View, CA); Meet Kirankumar Dave (Santa Clara, CA); Miguel Lazaro-Gredilla (Union City, CA); Dileep George (Sunnyvale, CA)
Assignee: GDM Holding LLC
G06F16/9024G06F17/12
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,481,702
App. No.
18/959,423
Granted
Nov 25, 2025
Kind
B2
Abstract

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating a graph model representing an environment being interacted with by an agent. In one aspect, one of the methods include: obtaining experience data; using the experience data to update a visitation count for each of one or more state-action pairs represented by the graph model; and at each of multiple environment exploration steps: computing a utility measure for each of the one or more state-action pairs represented by the graph model; determining, based on the utility measures, a sequence of one or more planned actions that have an information gain that satisfies a threshold; and controlling the agent to perform the sequence of one or more planned actions to cause the environment to transition from a state characterized by a last observation received after a last action in the experience data into a different state.

Claims (52)

1 . A method performed by one or more computers, wherein the method comprises:

obtaining experience data generated as a result of controlling an agent in an environment to perform a sequence of one or more actions from a possible set of actions, each action being performed in response to receiving a respective observation characterizing a respective state of the environment;

using the experience data to update a visitation count for each of one or more state-action pairs, wherein each state-action pair represents a respective state of the environment and a respective action performed by the agent; and

performing an environment exploration step to explore the environment, the performing comprising:

computing a utility measure for each of the one or more state-action pairs, wherein computing the utility measure comprises evaluating a closed form utility function using at least the updated visitation counts;

determining, based on the utility measures, a sequence of one or more planned actions that have an information gain that satisfies a threshold; and

controlling the agent to perform the sequence of one or more planned actions to cause the environment to transition from a state characterized by a last observation received after a last action in the experience data into a different state.

2 . The method of claim 1 , wherein determining the sequence of one or more planned actions comprises:

selecting, from all state-action pairs that includes a first node representing a first state characterized by a first last observation, a selected state-action pair that has a highest utility measure; and

using an action included in the selected state-action pair as one single planned action.

3 . The method of claim 1 , wherein determining the sequence of one or more planned actions comprises:

using a reinforcement learning technique to generate an action selection policy for a second node representing a second state characterized by a second last observation; and

using the action selection policy to select a sequence of multiple planned actions.

4 . The method of claim 3 , wherein the reinforcement learning technique comprises a value iteration technique that maximizes a total utility measure of actions selected by the action selection policy.

5 . The method of claim 1 , further comprising, at each of multiple environment exploration steps:

obtaining updated experience data generated as a result of controlling the agent to perform the sequence of one or more planned actions; and

using the updated experience data to update the visitation count for each of one or more state-action pairs.

6 . The method of claim 1 , wherein the information gain of the sequence of one or more planned actions comprises a combination of utility measures of the planned actions included in the sequence.

7 . The method of claim 1 , wherein the sequence of one or more actions comprise one or more randomly selected actions from the possible set of actions.

8 . The method of claim 1 , wherein the agent comprises a mechanical agent and the environment is a real-world environment.

9 . The method of claim 1 , wherein the agent comprises a computer program and the environment is a simulated environment.

10 . A method performed by one or more computers for exploring an environment being interacted with by an agent, wherein the method comprises:

computing a utility measure for each of one or more state-action pairs in a representation of the environment based on evaluating a closed form utility function, wherein each state-action pair represents a respective state of the environment and a respective action performed by the agent;

determining, based on the utility measures, a sequence of one or more planned actions that have an information gain that satisfies a threshold;

controlling the agent to perform the sequence of one or more planned actions to cause the environment to transition into one or more different states;

obtaining updated experience data generated as a result of controlling the agent to perform the sequence of one or more planned actions; and

using the updated experience data to update the representation of the environment.

11 . The method of claim 10 , wherein determining the sequence of one or more planned actions comprises:

selecting, from all state-action pairs that includes a first node representing a first state characterized by a first last observation, a selected state-action pair that has a highest utility measure; and

using an action included in the selected state-action pair as one single planned action.

12 . The method of claim 10 , wherein determining the sequence of one or more planned actions comprises:

using a reinforcement learning technique to generate an action selection policy for a second node representing a second state characterized by a second last observation; and

using the action selection policy to select a sequence of multiple planned actions.

13 . The method of claim 12 , wherein the reinforcement learning technique comprises a value iteration technique that maximizes a total utility measure of actions selected by the action selection policy.

14 . The method of claim 10 , further comprising, at each of multiple environment exploration steps:

obtaining updated experience data generated as a result of controlling the agent to perform the sequence of one or more planned actions; and

using the updated experience data to update a visitation count for each of one or more state-action pairs.

15 . The method of claim 10 , wherein the information gain of the sequence of one or more planned actions comprises a combination of utility measures of the planned actions included in the sequence.

16 . The method of claim 10 , wherein the sequence of one or more actions comprise one or more randomly selected actions from a possible set of actions.

17 . A method performed by one or more computers, wherein the method comprises:

performing one or more environment exploration steps to update a representation of an environment being interacted with by an agent, comprising, at each of the one or more environment exploration steps:

computing a utility measure for each of one or more state-action pairs in the representation of an environment based on evaluating a closed form utility function, wherein each state-action pair represents a respective state of the environment and a respective action performed by the agent;

determining, based on the utility measures, a sequence of one or more planned actions that have an information gain that satisfies a threshold;

controlling the agent to perform the sequence of one or more planned actions to cause the environment to transition into one or more different states;

obtaining updated experience data generated as a result of controlling the agent to perform the sequence of one or more planned actions; and

using the updated experience data to update the representation of the environment; and

controlling the agent to perform a task by causing the agent to perform actions selected from a possible set of actions by using the updated representation of the environment.

18 . The method of claim 17 , wherein the agent comprises a mechanical agent and the environment is a real-world environment.

19 . The method of claim 17 , wherein the agent comprises a computer program and the environment is a simulated environment.

20 . The method of claim 17 , wherein determining the sequence of one or more planned actions comprises:

selecting, from all state-action pairs that includes a node representing a state characterized by a last observation, a selected state-action pair that has a highest utility measure; and

using an action included in the selected state-action pair as one single planned action.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 6, 2025
From: DEEPMIND TECHNOLOGIES LIMITED
To: GDM HOLDING LLC
Reel/Frame 071498/0210 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 28, 2025
From: SWAMINATHAN, SIVARAMAKRISHNAN; DAVE, MEET KIRANKUMAR; LAZARO-GREDILLA, MIGUEL; GEORGE, DILEEP
To: DEEPMIND TECHNOLOGIES LIMITED
Reel/Frame 070663/0225 →