• Computer Science, Mathematics
  • Published in J. Artif. Intell. Res. 2015
  • DOI:10.1613/jair.4550

Computing Convex Coverage Sets for Faster Multi-objective Coordination

@article{Roijers2015ComputingCC,
  title={Computing Convex Coverage Sets for Faster Multi-objective Coordination},
  author={Diederik M. Roijers and Shimon Whiteson and Frans A. Oliehoek},
  journal={J. Artif. Intell. Res.},
  year={2015},
  volume={52},
  pages={399-443}
}
In this article, we propose new algorithms for multi-objective coordination graphs (MO-CoGs). Key to the efficiency of these algorithms is that they compute a convex coverage set (CCS) instead of a Pareto coverage set (PCS). Not only is a CCS a sufficient solution set for a large class of problems, it also has important characteristics that facilitate more efficient solutions. We propose two main algorithms for computing a CCS in MO-CoGs. Convex multi-objective variable elimination (CMOVE… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 21 CITATIONS

Relationship Explainable Multi-objective Optimization Via Vector Value Function Based Reinforcement Learning

VIEW 7 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Multi-objective decision-theoretic planning

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND

Multi-objective multi-agent decision making: a utility-based analysis and survey

VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 41 REFERENCES

Multi-objective optimization in graphical models

VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Bucket elimination for multiobjective optimization problems

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Multiagent Planning with Factored MDPs

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Region-Based Incremental Pruning for POMDPs

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL