Computing Convex Coverage Sets for Faster Multi-objective Coordination

DOI10.1613/jair.4550zbMath1327.68302OpenAlexW2163526437MaRDI QIDQ5246704

Diederik M. Roijers, Frans A. Oliehoek, Shimon Whiteson

Publication date: 22 April 2015

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.4550

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Agent technology and artificial intelligence (68T42)

Related Items (2)

A multi-objective approach for PH-graphs with applications to stochastic shortest paths ⋮ Efficient Multi-objective Reinforcement Learning via Multiple-gradient Descent with Iteratively Discovered Weight-Vector Sets

This page was built for publication: Computing Convex Coverage Sets for Faster Multi-objective Coordination