Dynamic Planning Networks
At a glance
- Citations
- 2
- References
- 53
- Comments
- 0
Abstract
We introduce Dynamic Planning Networks (DPN), a novel architecture for deep reinforcement learning, that combines model-based and model-free aspects for online planning. Our architecture learns to dynamically construct plans using a learned state-transition model by selecting and traversing between simulated states and actions to maximize information before acting. DPN learns to efficiently form plans by expanding a single action-conditional state transition at a time instead of exhaustively evaluating each action, reducing the number of state-transitions used during planning. We observe emergent planning patterns in our agent, including classical search methods such as breadth-first and depth-first search. DPN shows improved performance over existing baselines across multiple axes.
Publication details
- DOI
- 10.1109/ijcnn52387.2021.9533459
- OpenAlex
- W2906796853
- Document type
- conference-paper
- Language
- EN
- Last metadata update
Comments
Log in to join the discussion.