Corpus ID: 212644574

Convex Hull Monte-Carlo Tree Search

@article{Painter2020ConvexHM,
  title={Convex Hull Monte-Carlo Tree Search},
  author={Michael Painter and Bruno Lacerda and Nick Hawes},
  journal={ArXiv},
  year={2020},
  volume={abs/2003.04445}
}
This work investigates Monte-Carlo planning for agents in stochastic environments, with multiple objectives. We propose the Convex Hull Monte-Carlo Tree-Search (CHMCTS) framework, which builds upon Trial Based Heuristic Tree Search and Convex Hull Value Iteration (CHVI), as a solution to multi-objective planning in large environments. Moreover, we consider how to pose the problem of approximating multiobjective planning solutions as a contextual multi-armed bandits problem, giving a principled… Expand
3 Citations
Battery Charge Scheduling in Long-Life Autonomous Mobile Robots
  • 3
  • PDF
Monte Carlo Tree Search: A Review of Recent Modifications and Applications
  • PDF

References

SHOWING 1-10 OF 32 REFERENCES
Pareto Monte Carlo Tree Search for Multi-Objective Informative Planning
  • 7
  • PDF
Multiobjective Monte Carlo Tree Search for Real-Time Games
  • 17
  • Highly Influential
  • PDF
Chebyshev metric based multi-objective Monte Carlo tree search for combat simulations
  • Xiao Xu, G. Li
  • Mathematics
  • 2017 21st International Conference on System Theory, Control and Computing (ICSTCC)
  • 2017
  • 2
Bandit Based Monte-Carlo Planning
  • 2,383
  • PDF
Multi-objective Monte-Carlo Tree Search
  • 45
  • PDF
Trial-Based Heuristic Tree Search for Finite Horizon MDPs
  • 90
  • PDF
Online and offline learning in multi-objective Monte Carlo Tree Search
  • 8
  • PDF
A Survey of Multi-Objective Sequential Decision-Making
  • 309
  • PDF
A Survey of Monte Carlo Tree Search Methods
  • 1,805
  • PDF
Improved Monte-Carlo Search
  • 108
  • PDF
...
1
2
3
4
...