@conference {Subramanian2018CCAI,
	title = {Combining MCTS and A3C for prediction of spatially spreading processes in forest wildfire settings},
	booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {10832 LNAI},
	year = {2018},
	pages = {285{\textendash}291},
	address = {Toronto, Ontario, Canada},
	abstract = {In recent years, Deep Reinforcement Learning (RL) algorithms have shown super-human performance in a variety Atari and classic board games like chess and GO. Research into applications of RL in other domains with spatial considerations like environmental planning are still in their nascent stages. In this paper, we introduce a novel combination of Monte-Carlo Tree Search (MCTS) and A3C algorithms on an online simulator of a wildfire, on a pair of forest fires in Northern Alberta (Fort McMurray and Richardson fires) and on historical Saskatchewan fires previously compared by others to a physics-based simulator. We conduct several experiments to predict fire spread for several days before and after the given spatial information of fire spread and ignition points. Our results show that the advancements in Deep RL applications in the gaming world have advantages in spatially spreading real-world problems like forest fires. {\textcopyright} Springer International Publishing AG, part of Springer Nature 2018.},
	keywords = {a3c, computational sustainability, monte-carlo tree search, reinforcement-learning, Wildfire-Management},
	isbn = {9783319896557},
	issn = {16113349},
	doi = {10.1007/978-3-319-89656-4_28},
	author = {Ganapathi Subramanian, Sriram and Crowley, Mark}
}
