
%Aigaion2 BibTeX export von HES SO Valais Publications
%Friday 20 November 2026 11:31:59 PM

@INPROCEEDINGS{Nguyen2026ICAPS,
     author = {Nguyen, Nhat and Nguyen, Duong and Rizzo, Gianluca and Nguyen, Hung},
   keywords = {Boltzmann exploration, decentralized planning, Monte Carlo tree search, multi-agent planning},
      month = jun,
      title = {Boltzmann-based Exploration for Robust Decentralized Multi-Agent Planning},
  booktitle = {Proceedings of the 36th International Conference on Automated Planning and Scheduling (ICAPS)},
     volume = {36},
     number = {1},
       year = {2026},
      pages = {404--408},
  publisher = {AAAI Press},
   location = {Dublin, Ireland},
       issn = {2334-0835},
        url = {https://ojs.aaai.org/index.php/ICAPS/article/view/42854},
        doi = {10.1609/icaps.v36i1.42854},
   abstract = {Decentralized Monte Carlo Tree Search (Dec-MCTS) is widely used for cooperative multi-agent planning but struggles in sparse or skewed reward environments. We introduce Coordinated Boltzmann MCTS (CB-MCTS), which replaces deterministic UCT with a stochastic Boltzmann policy and a decaying entropy bonus for sustained yet focused exploration. While Boltzmann exploration has been studied in single-agent MCTS, applying it in multi-agent systems poses unique challenges. CB-MCTS is the first to address this. We analyze CB-MCTS in the simple-regret setting and show in simulations that it outperforms Dec-MCTS in deceptive scenarios and remains competitive on standard benchmarks, providing a robust solution for multi-agent planning.}
}

