Learning Pareto Set for Multi-Objective Continuous Robot Control

Tianye Shu, Ke Shang, Cheng Gong, Yang Nan, Hisao Ishibuchi
6/27/2024
cs.AIcs.LGcs.RO

No official code found. Best implementation: HisaoLabSUSTC/Hyper-MORL (9 stars, last commit 2024-06-27).

Abstract

For a control problem with multiple conflicting objectives, there exists a set of Pareto-optimal policies called the Pareto set instead of a single optimal policy. When a multi-objective control problem is continuous and complex, traditional multi-objective reinforcement learning (MORL) algorithms search for many Pareto-optimal deep policies to approximate the Pareto set, which is quite resource-consuming. In this paper, we propose a simple and resource-efficient MORL algorithm that learns a continuous representation of the Pareto set in a high-dimensional policy parameter space using a single hypernet. The learned hypernet can directly generate various well-trained policy networks for different user preferences. We compare our method with two state-of-the-art MORL algorithms on seven multi-objective continuous robot control problems. Experimental results show that our method achieves the best overall performance with the least training parameters. An interesting observation is that the Pareto set is well approximated by a curved line or surface in a high-dimensional parameter space. This observation will provide insight for researchers to design new MORL algorithms.

View on arXivView PDF

Code Implementations(1)

90Python, Jupyter NotebookMay 4, 20242 years ago

Cite this paper

@article{shu2024learning,
  title  = {Learning Pareto Set for Multi-Objective Continuous Robot Control},
  author = {Tianye Shu and Ke Shang and Cheng Gong and Yang Nan and Hisao Ishibuchi},
  year   = {2024},
  eprint = {2406.18924},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.18924v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.18924.svg)](https://codeofpaper.com/paper/2406.18924)

Discussion