Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Divide-and-Conquer Monte Carlo Tree Search for Goal-Directed Planning - Paper Explained

Yannic Kilcher via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking approach to AI planning in this 26-minute video explanation of the paper "Divide-and-Conquer Monte Carlo Tree Search For Goal-Directed Planning." Delve into a novel generalization of Monte Carlo Tree Search (MCTS) that revolutionizes problem-solving by recursively dividing complex tasks into manageable sub-problems. Learn how this method deviates from traditional step-by-step planning, instead focusing on identifying optimal intermediate goals. Discover the algorithm's unique ability to improve imperfect goal-directed policies through strategic sub-goal sequencing. Examine the concept of Divide-and-Conquer MCTS (DC-MCTS) and its application in both grid-world navigation and challenging continuous control environments. Gain insights into the flexibility of planning strategies and their potential to outperform sequential planning approaches.

Syllabus

Intro
What is planning
The algorithm
Finding the next action
Building your search tree
Search over subproblems
Subdivide
The Catch
Deep Learning
Training

Taught by

Yannic Kilcher

Reviews

Start your review of Divide-and-Conquer Monte Carlo Tree Search for Goal-Directed Planning - Paper Explained

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.