01.10, 13:45–14:45 (Europe/Berlin), KI: Room John McCarthy
Sprache: English
Monte Carlo Search is a family of general search algorithms that have many applications in different domains. It is the state of the art in perfect and imperfect information games. Other applications include the RNA inverse folding problem, Logistics, Multiple Sequence Alignment, General Game Playing, Puzzles, 3D Packing with Object Orientation, Cooperative Pathfinding, Software testing and heuristic Model-Checking. In recent years, many researchers have explored different variants of the algorithms, their relations to Deep Reinforcement Learning and their different applications. The talk will give a broad overview of Monte Carlo Search and of its applications
Tristan Cazenave, LAMSADE, Université Paris-Dauphine, PSL, CNRS and PRAIRIE Institute, France