IP Library Granted Patent US 12,632,721
Granted Patent B2
US 12,632,721 · App. 17/167,842 · Granted May 19, 2026

Actor ensemble for continuous control

Inventors: Shangtong Zhang (Oxford, GB); Hengshuai Yao (Markham, CA); Hao Chen (Ottawa, CA)
Assignee: Huawei Technologies Co., Ltd.
G06N3/08G06F18/211G06F18/214G06N3/045G06N20/20
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,632,721
App. No.
17/167,842
Granted
May 19, 2026
Kind
B2
Abstract

A method of training a reinforcement learning agent to output actions from a continuous action space, comprising: providing an actor ensemble that includes a plurality of actor neural networks that each output a respective action from the continuous action space in response to an observed state of an environment; providing a critic neural network that approximates a state-action value function indicating an impact of an action on the environment based on a reward from the environment and the observed state of the environment; training the actor ensemble and the critic neural network to maximize a state-action value from the state-action value function over successive time steps by, in each time step: selecting from the respective actions output by the plurality of actor neural networks the action that will provide a best state-action value from the state-action value function; applying the selected action to the environment; based on an observed state of the environment of in response to the selected action, determine a gradient ascent for the plurality of actor neural networks for updating the parameters of the plurality of actor neural networks and determine a gradient descent for the critic neural network for updating the parameters of the critic neural network.

Claims (359)

1 . A method of using a reinforcement learning (RL) agent of an artificial intelligence (AI) system, the RL agent comprising an action selector and a critic, the method comprising the steps of:

(a-1) initializing parameters of each actor neural network among a plurality of actor neural networks of the RL agent, wherein the plurality of actor neural networks forms an actor ensemble, and wherein the parameters of each actor neural network of the plurality of actor neural networks in the actor ensemble are initialized differently;

(a-2) at each actor neural network among the plurality of actor neural networks in the actor ensemble of the RL agent, receiving a current state, (s), of an environment for a current time step and outputting a continuous action, (a), for the current state based on a deterministic policy approximated by the respective actor neural network, thereby outputting a plurality of continuous actions;

(b) at a critic neural network of the critic of the RL agent, receiving the current state of the environment and the continuous action output by each respective actor neural network in the actor ensemble and outputting a state-action value for the current state and the respective continuous action based on a state-action value function approximated by the critic neural network, thereby outputting a plurality of state-action values, each state-action value, among the plurality of state-action values, associated with a respective continuous action among the plurality of continuous actions;

(c) selecting, at the action selector of the RL agent, a particular continuous action from among the plurality of continuous actions, wherein the selected continuous action is associated with a state-action value that is maximum among the plurality of state-action values;

(d) causing the AI system comprising the RL agent to carry out the selected continuous action in the environment;

(e) generating an experience tuple (s, a, r, s′) comprising the current state of the environment(s), the selected continuous action (a), a reward provided by the environment (r), and a subsequent state of the environment (s′);

(f) storing the experience tuple (s, a, r, s′) in a replay buffer comprising a set of experience tuples;

(g) sampling the replay buffer to obtain a batch of tuples from the set of experience tuples;

(h) determining, by an actor parameter update determiner connected to receive the output of each actor neural network and the output of the critic neural network, a respective update for the parameters of each respective actor neural network of the plurality of actor neural networks in the actor ensemble based on the batch of tuples;

(i) providing, by the actor parameter update determiner, to each actor neural network among the plurality of actor neural networks in the actor ensemble, the respective update;

(j) training the plurality of actor neural networks in the actor ensemble by causing the respective update for the parameters of each respective actor neural network to be applied;

(k) determining, by a critic parameter update determiner connected to receive the output of the critic neural network, an update for the parameters of the critic neural network based on the batch of tuples, a determined state-action value, and a target state-action value (y);

(l) providing to the critic neural network, by the critic parameter update determiner, the update for the parameters of the critic neural network; and

(m) training the critic neural network by causing the update for the parameters of the critic neural network to be applied.

2 . The method of claim 1 , further comprising repeating steps (a-2) to (m) for a predetermined number of time steps.

3 . The method of claim 1 , further comprising:

at the critic neural network, performing a look-ahead tree search and backup process to predict the state-action value for the state and the respective continuous action.

4 . The method of claim 1 , wherein the critic neural network represents a value prediction model.

5 . The method of claim 1 , wherein the critic neural network represents a transition model.

6 . The method of claim 1 , wherein the update for the parameters of the critic neural network is determined based on a loss value for the critic neural network based on a temporal-difference (TD) error of the critic neural network.

7 . The method of claim 6 , wherein the TD error of the critic neural network is represented as

1

2

(

r

t

+

1

+

y

max

i

{

1

,

,

N

}

Q

(

s

t

+

1

,

μ

i

(

s

t

+

1

)

)

-

Q

(

s

t

,

a

t

)

)

2

wherein s t is the current time step, a t is a selected continuous action at the current time step, s t+1 is a subsequent time step, Q(s t ,a t ) is a state-action value of a state-action value function for a state of the environment and the selected continuous action at the current time step, μ i (s t+1 ) is a selected continuous action at the subsequent time step, r t+1 is a reward for the selected continuous action at the subsequent time step, y is the target state-action value, ymax i∈{1, . . . , N} is a maximum of the target state-action value for the plurality of continuous actions, and N is a number of the plurality of continuous actions.

8 . The method of claim 7 , wherein the critic parameter update determiner trains the critic neural network to minimize the TD error, wherein the TD error is determined as a difference between the determined state-action value

(

f

q

d

(

z

,

a

)

)

and the target state-action value (y), and to ground a predicted reward ({circumflex over (r)}) for a current latent state (z) for the current time step and a current action (a) for the current time step by subtracting a received reward (r) from the predicted reward ({circumflex over (r)}), wherein the current latent state (z) is an n-dimensional latent state transformed from the current state(s) of the current time step via an encoding function (ƒ enc ).

9 . The method of claim 8 , wherein the critic parameter update determiner determines a per time step update (Δθ Q ) for the critic neural network parameters, θ Q , as represented by the following equation

θ

Q

θ

Q

-

α

θ

Q

(

1

2

(

f

q

d

(

z

,

a

)

-

y

)

2

+

1

2

(

r

ˆ

-

r

)

2

)

,

wherein z′ is a subsequent latent state for a state of the subsequent time step determined by the following equation

y

{

0

if

s

is

terminal

max

i

f

q

d

(

z

,

f

μ

i

(

z

)

)

otherwise

,

y

r

+

γ

y

,

y is a target state-action value for the subsequent latent state (z′) and a best action is selected from the plurality of actor neural networks in the actor ensemble using the critic neural network by performing a look-ahead tree search, a is an action from the transition in the batch of tuples, r is an immediate reward received by the critic parameter update determiner from the replay buffer, and y′ is a maximum state-action value of the subsequent latent state (z′).

10 . The method of claim 9 , wherein the update for the parameters of the critic neural network is determined using gradient descent, the critic neural network of the critic being trained by taking one gradient descent algorithm step at each time, t, to minimize the TD error, wherein the critic parameter update determiner determines a gradient for the critic neural network parameters, θ Q , through use of the following equation

θ

Q

(

1

2

(

f

q

d

(

z

,

a

)

-

y

)

2

+

1

2

(

r

ˆ

-

r

)

2

)

.

11 . The method of claim 10 , wherein the respective update for the parameters of each respective actor neural network of the plurality of actor neural networks in the actor ensemble is determined using a gradient ascent algorithm, the plurality of actor neural networks being trained, in parallel, to optimize the actor ensemble parameters, θ μ , via the gradient ascent algorithm, to maximize each state-action value associated with the action output from each actor neural network to find a global maximum.

12 . The method of claim 11 , wherein the actor parameter update determiner may determine a per time step update (Δθ μ ) to the actor ensemble parameters, θ μ , as represented by the following equation:

θ

μ

θ

μ

+

β

θ

μ

i

=

1

N

b

f

q

d

(

z

,

b

)

|

b

=

f

μ

i

(

z

)

θ

μ

f

μ

i

(

z

)

wherein

b

f

q

d

(

z

,

b

)

|

b

=

f

μ

i

(

z

)

θ

μ

f

μ

i

(

z

)

is used by the actor parameter update determiner to determine a gradient for the actor ensemble parameters θ μ ,

b

f

q

d

(

z

,

b

)

|

b

=

f

μ

i

(

z

)

is a respective gradient for a state-action value function

f

q

d

(

z

,

b

)

|

b

=

f

μ

i

(

z

)

for a corresponding actor neural network at the current latent state (z), and ∇ θ μ θ μ i (z) is a respective gradient function for the action function (ƒ μ i (z)) for corresponding actor neural network at the current latent state (z).

13 . The method of claim 1 , wherein the AI system is coupled to a control system of a vehicle, robot or machine interacting with the environment to accomplish a particular task, wherein each continuous action in the plurality of continuous actions corresponds to a set of control inputs to control the vehicle, robot or machine to accomplish a particular task, and wherein step (c) and (d) comprise:

(c) selecting, at the action selector of the RL agent, a particular set of control inputs from among a plurality of set of control inputs corresponding to the plurality of continuous action, wherein the selected set of control inputs is associated with a state-action value that is maximum among the plurality of state-action values; and

(d) causing the control system of the vehicle, robot or machine to execute the control inputs to control the vehicle, robot or machine interacting with the environment to accomplish the particular task.

14 . The method of claim 1 , wherein the environment is a simulation environment generated by a computing system and the AI system is coupled to the computing system, wherein each continuous action in the plurality of continuous actions corresponds to a set of control inputs to control a simulated user, vehicle, robot or machine in the simulation environment to accomplish a particular task, and wherein step (c) and (d) comprise:

(c) selecting, at the action selector of the RL agent, a particular set of control inputs from among a plurality of set of control inputs corresponding to the plurality of continuous action, wherein the selected set of control inputs is associated with a state-action value that is maximum among the plurality of state-action values; and

(d) causing the computing system to execute the control inputs to control the simulated user, vehicle, robot or machine in the simulation environment to accomplish the particular task.

15 . A processing unit comprising:

a non-transitory computer-readable medium having tangibly stored thereon executable instructions;

a processor configured, by the executable instructions, to use train a reinforcement learning (RL) agent of an artificial intelligence (AI) system, the RL agent comprising an action selector and a critic, wherein the executable instructions, in response to execution by the processor, cause the processor to train the (RL) agent by:

(a-1) initializing parameters of each actor neural network among a plurality of actor neural networks of the RL agent, wherein the plurality of actor neural networks forms an actor ensemble, and wherein the parameters of each actor neural network of the plurality of actor neural networks in the actor ensemble are initialized differently;

(a-2) at each actor neural network among the plurality of actor neural networks in the actor ensemble of the RL agent, receiving a current state, (s), of an environment for a current time step and outputting a continuous action, (a), for the current state based on a deterministic policy approximated by the respective actor neural network, thereby outputting a plurality of continuous actions;

(b) at a critic neural network of the critic of the RL agent, receiving the current state of the environment and the continuous action output by each respective actor neural network in the actor ensemble and outputting a state-action value for the current state and the respective continuous action based on a state-action value function approximated by the critic neural network, thereby outputting a plurality of state-action values, each state-action value, among the plurality of state-action values, associated with a respective continuous action among the plurality of continuous actions;

(c) selecting, at the action selector of the RL agent, a particular continuous action from among the plurality of continuous actions, wherein the selected continuous action is associated with a state-action value that is maximum among the plurality of state-action values;

(d) causing the AI system comprising the RL agent to carry out the selected continuous action in the environment;

(e) generating an experience tuple (s, a, r, s′) comprising the current state of the environment(s), the selected continuous action (a), a reward provided by the environment (r), and a subsequent state of the environment (s′);

(f) storing the experience tuple (s, a, r, s′) in a replay buffer comprising a set of experience tuples;

(g) sampling the replay buffer to obtain a batch of tuples from the set of experience tuples;

(h) determining, by an actor parameter update determiner connected to receive the output of each actor neural network and the output of the critic neural network, a respective update for the parameters of each respective actor neural network of the plurality of actor neural networks in the actor ensemble based on the batch of tuples;

(i) providing, by the actor parameter update determiner, to each actor neural network among the plurality of actor neural networks in the actor ensemble, the respective update;

(j) training the plurality of actor neural networks in the actor ensemble by causing the respective update for the parameters of each respective actor neural network to be applied;

(k) determining, by a critic parameter update determiner connected to receive the output of the critic neural network, an update for the parameters of the critic neural network based on the batch of tuples, a determined state-action value, and a target state-action value (y);

(l) providing to the critic neural network, by the critic parameter update determiner, the update for the parameters of the critic neural network; and

(m) training the critic neural network by causing the update for the parameters of the critic neural network to be applied.

16 . The processing unit of claim 15 , wherein the processor is further configured, by execution of the executable instructions, to train the RL agent by repeating steps (a-2) to (m) for a predetermined number of time steps.

17 . The processing unit of claim 15 , wherein the processor is further configured, by execution of the executable instructions, to train the RL agent by, at the critic neural network, performing a look-ahead tree search and backup process to predict the state-action value for the state and the respective continuous action.

18 . The processing unit of claim 15 , wherein the critic neural network represents a value prediction model.

19 . The processing unit of claim 15 , wherein the critic neural network represents a transition model.

20 . A non-transitory computer-readable medium comprising executable instructions that, in response to execution by a processor, cause the processor to train use a reinforcement learning (RL) agent of an artificial intelligence (AI) system, the RL agent comprising an action selector and a critic, by:

(a-1) initializing parameters of each actor neural network among a plurality of actor neural networks of the RL agent, wherein the plurality of actor neural networks forms an actor ensemble, and wherein the parameters of each actor neural network of the plurality of actor neural networks in the actor ensemble are initialized differently;

(a-2) at each actor neural network among the plurality of actor neural networks in the actor ensemble of the RL agent, receiving a current state, (s), of an environment for a current time step and outputting a continuous action, (a), for the current state based on a deterministic policy approximated by the respective actor neural network, thereby outputting a plurality of continuous actions;

(b) at a critic neural network of the critic of the RL agent, receiving the current state of the environment and the continuous action output by each respective actor neural network in the actor ensemble and outputting a state-action value for the current state and the respective continuous action based on a state-action value function approximated by the critic neural network, thereby outputting a plurality of state-action values, each state-action value, among the plurality of state-action values, associated with a respective continuous action among the plurality of continuous actions;

(c) selecting, at the action selector of the RL agent, a particular continuous action from among the plurality of continuous actions, wherein the selected continuous action is associated with a state-action value that is maximum among the plurality of state-action values;

(d) causing the AI system comprising the RL agent to carry out the selected continuous action in the environment;

(e) generating an experience tuple (s, a, r, s′) comprising the current state of the environment(s), the selected continuous action (a), a reward provided by the environment (r), and a subsequent state of the environment (s′);

(f) storing the experience tuple (s, a, r, s′) in a replay buffer comprising a set of experience tuples;

(g) sampling the replay buffer to obtain a batch of tuples from the set of experience tuples;

(h) determining, by an actor parameter update determiner connected to receive the output of each actor neural network and the output of the critic neural network, a respective update for the parameters of each respective actor neural network of the plurality of actor neural networks in the actor ensemble based on the batch of tuples;

(i) providing, by the actor parameter update determiner, to each actor neural network among the plurality of actor neural networks in the actor ensemble, the respective update;

(j) training the plurality of actor neural networks in the actor ensemble by causing the respective update for the parameters of each respective actor neural network to be applied;

(k) determining, by a critic parameter update determiner connected to receive the output of the critic neural network, an update for the parameters of the critic neural network based on the batch of tuples, a determined state-action value, and a target state-action value (y);

(l) providing to the critic neural network, by the critic parameter update determiner, the update for the parameters of the critic neural network; and

(m) training the critic neural network by causing the update for the parameters of the critic neural network to be applied.

21 . The non-transitory computer-readable medium of claim 20 , wherein the instructions, to train the RL agent by, at the critic neural network, performing a look-ahead tree search and backup process to predict the state-action value for the state and the respective continuous action.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 4, 2021
From: ZHANG, SHANGTONG; YAO, HENGSHUAI; CHEN, HAO
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 055154/0224 →
Continuity (3)
Continuation PCTCN2019090092 · Jun 5, 2019
Provisional Application 62736914 · Sep 26, 2018
Related Publication 20210232922A1 · Jul 29, 2021
References Cited (48)
US 11436529B1 · Londeree · 2022 [cited by examiner]
US 11593878B2 · Kim · 2023 [cited by examiner]
US 11625604B2 · Budden · 2023 [cited by examiner]
US 20130346614A1 · Baughman · 2013 [cited by examiner]
US 20160260024A1 · Campos · 2016 [cited by examiner]
US 20170024643A1 · Lillicrap · 2017 [cited by examiner]
US 20170213126A1 · Hammond · 2017 [cited by applicant]
US 20180012137A1 · Wright · 2018 [cited by examiner]
US 20190025917A1 · Francis · 2019 [cited by examiner]
US 20200293883A1 · Budden · 2020 [cited by examiner]
US 20210012227A1 · Fang · 2021 [cited by examiner]
CN 107065881A1 · 2017 [cited by applicant]
WO 2017139507A1 · 2017 [cited by applicant]
WO 2018083532A1 · 2018 [cited by applicant]
Andrew et al.(“Reinforcement Learning in Artificial Intelligence”, Advances in Psychology, vol. 121, 1997, pp. 358-386) (Year: 1997). [cited by examiner]
DQN—Mnih et al.; “Human-level control through deep reinforcement learning”; Nature—vol. 518; Feb. 26, 2015. [cited by applicant]
DDPG—Lillicrap et al.; “Continuous control with deep reinforcement learning”; Published as a conference paper at ICLR 2016; arXiv preprint arXiv:1509.02971. [cited by applicant]
Farquhar et al.; “TreeQN:TreeQN and ATreeC: Differentiable Tree-Structured Models for Deep Reinforcement Learning”; Published as a conference paper at ICLR 2018. [cited by applicant]
Bacon, P.L.; Harb, J.; and Precup, D; “The option-critic architecture”; In Proceedings of the 31st AAAI Conference on Artificial Intelligence; 2017. [cited by applicant]
Barth-Maron, G.; Hoffman, M. W.; Budden, D.; Dabney, W.; Horgan, D.; Muldal, A.; Heess, N.; and Lillicrap, T. 2018; Distributed distributional deterministic policy gradients; arXiv preprint arXiv:1804.08617. [cited by applicant]
Browne, C. B.; Powley, E.; Whitehouse, D.; Lucas, S. M.; Cowling, P. I.; Rohlfshagen, P.; Tavener, S.; Perez, D.; Samothrakis, S.; and Colton, S.; “A survey of Monte Carlo tree search methods”; IEEE Transactions on Comp… [cited by applicant]
Coulom, R.; “Efficient selectivity and backup operators in Monte Carlo tree search”; In Proceedings of the International Conference on Computers and Games; May 2006, Turin, Italy. [cited by applicant]
Degris, T.; White, M.; and Sutton, R. S.; “Off-policy actor-critic”; arXiv preprint arXiv:1205.4839; 2012. [cited by applicant]
Gu, S.; Lillicrap, T.; Sutskever, I.; and Levine, S.; “Continuous deep Q-learning with model-based acceleration”; In Proceedings of the 33rd International Conference on Machine Learning; 2016. [cited by applicant]
Hans, A., and Udluft, S; “Ensembles of neural networks for robust reinforcement learning”; In Proceedings of the 9th International Conference on Machine Learning and Applications; 2010. [cited by applicant]
Huang, Z.; Zhou, S.; Zhuang, B.; and Zhou, X.; “Learning to run with actor-critic ensemble”; arXiv preprint arXiv:1712.08987; 2017. [cited by applicant]
Klissarov, M.; Bacon, P.-L.; Harb, J.; and Precup, D.; “Learnings options end-to-end for continuous action tasks”; arXivpreprint arXiv:1712.00004; 31st conference of Neural Information Processing Systems; 2017. [cited by applicant]
Knuth, D. E., and Moore, R. W.; “An analysis of alpha-beta pruning”; Artificial Intelligence; vol. 6; Issue 4; 1975. [cited by applicant]
Lin, L.-J; “Self-improving reactive agents based on reinforcement learning, planning and teaching”; Machine Learning, 8, 293-321; 1992. [cited by applicant]
Mansley, C. R.; Weinstein, A.; and Littman, M. L.; “Sample-based planning for continuous action markov decision processes”; Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 20… [cited by applicant]
Nair, V. and Hinton, G.E.; “Rectified Linear Units Improve Restricted Boltzmann Machines”; Proceedings of the 27th International Conference on Machine Learning, Haifa, Jun. 21, 2010, 807-814. [cited by applicant]
Nitti, D.; Belle, V.; and De Raedt, L.; “Planning in Discrete and Continuous Markov Decision Processes by Probabilistic Programming”; In Proceedings of the 17th Joint European Conference on Machine Learning and Knowledg… [cited by applicant]
Oh, J.; Singh, S.; and Lee, H.; “Value prediction network”; In Advances in Neural Information Processing Systems; 2017. [cited by applicant]
Osband, I.; Blundell, C.; Pritzel, A.; and Van Roy, B.; “Deep exploration via bootstrapped DQN”; In Advances in Neural Information Processing Systems; Jul. 2016. [cited by applicant]
Silver, D.; Lever, G.; Heess, N.; Degris, T.; Wierstra, D.; and Riedmiller, M.; “Deterministic policy gradient algorithms”; In Proceedings of the 31st International Conference on Machine Learning; 2014. [cited by applicant]
Silver, D.; Huang, A.; Maddison, C. J.; Guez, A.; Sifre, L.; Van Den Driessche, G.; Schrittwieser, J.; Antonoglou, I.; Panneershelvam, V.; Lanctot, M.; et al.; “Mastering the game of go with deep neural networks and tre… [cited by applicant]
Sturtevant, N.; “An analysis of UCT in multi-player games”; In Proceedings of the International Conference on Computers and Games; Dec. 2008. [cited by applicant]
Sutton, R. S.; McAllester, D. A.; Singh, S. P.; and Mansour, Y.; “Policy gradient methods for reinforcement learning with function approximation”; In Advances in Neural Information Processing Systems; 2000. [cited by applicant]
Sutton, R. S.; Precup, D.; and Singh, S.; “Between MDPs and semi-MDPS: a framework for temporal abstraction in reinforcement learning”. Artificial Intelligence; 112 (1999); 181-121. [cited by applicant]
Sutton, R. S.; “Integrated architectures for learning, planning, and reacting based on approximating dynamic programming”; In Proceedings of the 7th International Conference on Machine Learning; pp. 216-224; 1990. [cited by applicant]
Tassa, Y. et al.; “DeepMind control suite”; arXiv preprint arXiv:1801.00690; Jan. 2018. [cited by applicant]
Tesauro, G.; “Temporal difference learning and TD-gammon”; Communications of the ACM, vol. 38, No. 3, pp. 58-68; 1995. [cited by applicant]
Uhlenbeck, G.E. and Omstein, L.S.; “On the Theory of Brownian Motion”; Physical Review, 36, 823-841. https://doi.org/10.1103/PhysRev.36.823; Sep. 1, 1930. [cited by applicant]
Watkins, C. J., and Dayan, P.; “Q-leaming”; Machine Learning, 8, 279-292; 1992. [cited by applicant]
Weber, T; Racaniere, S.; Reichert, D. P.; Buesing, L.; Guez, A.; Rezende, D. J.; Badia, A. P.; Vinyals, O.; Heess, N.; Li, Y; et al.; “Imagination-augmented agents for deep reinforcement learning”; arXiv preprint arXiv:… [cited by applicant]
Wiering, M. A., and Van Hasselt, H.; “Ensemble algorithms in reinforcement learning”; IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics); 2008. [cited by applicant]
Yao, H.; Bhatnagar, S.; Diao, D.; Sutton, R. S.; and Szepesvari, C. 2009. Multi-step dyna planning for policy evaluation and control. In Advances in Neural Information Processing Systems. [cited by applicant]
Yee, T; Lisy, V.; and Bowling, M. H.; “Monte Carlo tree search in continuous action spaces with execution uncertainty”; In Proceedings of the 25th International Joint Conference on Artificial Intelligence; 2016. [cited by applicant]