IP Library › Granted Patent US 12,688,432
Granted Patent B2
US 12,688,432 · App. 17/893,628 · Granted Jul 21, 2026

Exploration method and apparatus in multi-agent reinforcement learning

Inventors: Byunghyun Yoo (Daejeon, KR); Hyun Woo Kim (Daejeon, KR); Jeon Gue Park (Daejeon, KR); Hwa Jeon Song (Daejeon, KR); Jeongmin Yang (Daejeon, KR); Sungwon Yi (Daejeon, KR); Euisok Chung (Daejeon, KR); Ran Han (Daejeon, KR)
Assignee: Electronics and Telecommunications Research Institute
G06N3/092G06N20/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,688,432
App. No.
17/893,628
Filed
Aug 23, 2022
Granted
Jul 21, 2026
Kind
B2
Art Unit
2144
USPC
706/12
Abstract

An exploration method used by an exploration apparatus in multi-agent reinforcement learning to collect training samples during the training process is provided. The exploration method includes calculating the influence of a selected action of each agent on the actions of other agents in a current state, calculating a linear sum of the value of a utility function representing the action value of each agent and the influence on the actions of the other agent calculated for the selected action of each agent, and obtaining a sample to be used for training an action policy of each agent by probabilistically selecting the action in which the linear sum is the maximum, and the random action.

Claims (19)

1 . A method for exploring training samples used in learning action policy applied to actions of a plurality of agents included in a multi-agent reinforcement learning system, the plurality of agents configured to perform actions according to the learned action policy, and receive rewards for the actions performed, the method comprising:

calculating, by an exploration apparatus, in a current state and while a selected action of a target agent is fixed, a variance value of a joint value function for actions of other agents, the joint value function configured to estimate an expected return of cumulative reward by taking, as inputs, observation information, action information, and reward values of all agents;

calculating, by the exploration apparatus, a linear sum of a value of a utility function of the target agent and the variance value of the joint value function for the actions of the other agents calculated for the selected action of the target agent, the utility function configured, for each agent, to estimate an expected return of cumulative reward using only observation information of respective agents as an input; and

obtaining, by the exploration apparatus, a sample to be used for training an action policy of each agent by probabilistically selecting an action in which the linear sum is a maximum and a random action,

wherein the calculating of the variance value comprises:

determining, by the exploration apparatus, a variance of values of the utility function for respective actions of each of the agents, as a variance of an input; and

applying, by the exploration apparatus, the variance of the input to an approximate variance propagation algorithm configured to have a deep neural network function as a mapping function, to obtain a variance of an output of the deep neural network function, wherein variance propagation at each layer of the deep neural network function is performed using a Jacobian matrix for respective layers of the deep neural network function.

2 . The method of claim 1 , further comprising:

transitioning to a next state after each agent has taken the selected action in the current state;

reflecting a reward for the selected action to the utility function of a corresponding agent; and

performing the calculating of the variance value of the joint value function, the calculating of the linear sum, and the obtaining of the sample.

3 . An exploration apparatus for exploring training samples used in learning action policy applied to actions of a plurality of agents included in a multi-agent reinforcement learning system, the plurality of agents configured to perform actions according to the learned action policy, and receive rewards for the actions performed, the exploration apparatus comprising:

an information obtainer that obtains observation information and action information of each agent;

an agent influence calculator that calculates, in a current state and while a selected action of a target agent is fixed, a variance value of a joint value function for actions of other agents, the joint value function configured to estimate an expected return of cumulative reward by taking, as inputs, observation information, action information, and reward values of all agents; and

an action explorer that calculates a linear sum of the value of the utility function of the target agent and the variance value of the joint value function for the actions of the other agents calculated for a selected action of each agent, and obtains a sample to be used for training an action policy of each agent by probabilistically selecting an action in which the linear sum is a maximum, and a random action, the utility function configured, for each agent, to estimate an expected return of cumulative reward using only observation information of respective agents as an input,

wherein the action explorer is configured to:

determine a variance of values of the utility function for respective actions of each of the agents, as a variance of an input, and

apply the variance of the input to an approximate variance propagation algorithm configured to have a deep neural network function as a mapping function, to obtain a variance of an output of the deep neural network function, wherein variance propagation at each layer of the deep neural network function is performed using a Jacobian matrix for respective layers of the deep neural network function.

4 . The exploration apparatus of claim 3 , wherein the information obtainer, the agent influence calculator, and the action explorer are sequentially and repeatedly executed according to a state transition of each agent in a training process.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 23, 2022
From: YOO, BYUNGHYUN; KIM, HYUN WOO; PARK, JEON GUE; SONG, HWA JEON; YANG, JEONGMIN; YI, SUNGWON; CHUNG, EUISOK; HAN, RAN
To: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE
Reel/Frame 060870/0548 →
Priority Claims (1)
KR 10-2021-0177364 · Dec 13, 2021 · national
Continuity (1)
Related Publication 20230186154A1 · Jun 15, 2023
References Cited (19)
US 11480972B2 · Naghshvar · 2022 [cited by examiner]
US 12428946B2 · Pournazari · 2025 [cited by examiner]
US 20200150672A1 · Naghshvar · 2020 [cited by examiner]
US 20200160168A1 · Yang et al. · 2020 [cited by applicant]
US 20200167611A1 · Yoon et al. · 2020 [cited by applicant]
US 20200202272A1 · Aravamudhan · 2020 [cited by examiner]
US 20200308952A1 · Pournazari · 2020 [cited by examiner]
US 20210073912A1 · Da Silva · 2021 [cited by examiner]
US 20210168827A1 · Shin · 2021 [cited by applicant]
KR 1020190087023A · 2019 [cited by applicant]
KR 102267316B1 · 2021 [cited by applicant]
Postels, Janis et al. Sampling-free Epistemic Uncertainty Estimation Using Approximated Variance Propagation. Dec. 2, 2019. International Conference on Computer Vision 2019. <https://doi.org/10.48550/arXiv.1908.00598> (… [cited by examiner]
Wan, Lipeng et al. Greedy-based value representation for optimal coordination in multi-agent reinforcement learning. Dec. 8, 2021 <https://doi.org/10.48550/arXiv.2112.04454> (Year: 2019). [cited by examiner]
Yi, Sungwon. Foundational Aspects of Machine Learning in Multi-agent Online Games as Serious Games. <https://apps.dtic.mil/sti/html/trecms/AD1152078/> (Year: 2021). [cited by examiner]
Rashid, T. et al., “Weighted QMIX: Expanding Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning”, 34th Conference on Neural Information Processing Systems (NeurIPS 2020), Vancouver, Canad… [cited by applicant]
Wang, T. et al., “Influence-Based Multi-Agent Exploration”, ICLR 2020 Conference, pp. 1-23. [cited by applicant]
Yoo, B. et al., “A Novel and Efficient Influence Seeking Exploration in Deep Multi-Agent Reinforcement Learning”, IEEE Access, vol. 4, pp. 1-11, 2021. [cited by applicant]
Liu, Iou-Jen, et al., ‘Cooperative Exploration for Multi-Agent Deep Reinforcement Learning’, ICML 2021, pp. 1-18, Jul. 23, 2021. [cited by applicant]
Zheng, Lulu, et al., ‘Episodic Multi-agent Reinforcement Learning with Curiosity-driven Exploration’, Advances in Neural Information Processing Systems, 2021. [cited by applicant]