.png){kind=icon}
.png){kind=icon}
Return
UCB-Driven Utility Function Search for Multi-objective Reinforcement Learning
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-06106-5_10.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In Multi-objective Reinforcement Learning (MORL) agents are tasked with optimising decision-making behaviours that trade-off between multiple, possibly conflicting, objectives. MORL based on decomposition is a family of solution methods that employ a number of utility functions to decompose the multi-objective problem into individual single-objective problems solved simultaneously in order to approximate a Pareto front of policies. We focus on the case of linear utility functions parametrised by weight vectors w. We introduce a method based on Upper Confidence Bound to efficiently search for the most promising weight vectors during different stages of the learning process, with the aim of maximising the hypervolume of the resulting Pareto front. The proposed method demonstrates consistency and strong performance across various MORL baselines on Mujoco benchmark problems. The code is released in: https://github.com/SYCAMORE-1/ucb-MOPPO
Keywords:
Multi-objective Reinforcement Learning
Upper Confidence Bound
Mujoco benchmark problems
Journal
M
IF:
0
Papers:
25
Citations:
0