![Dyna(k): A Multi-Step Dyna Planning thumbnail](https://apiminio.videolectures.net/vln/lectures/9566/1/en/thumbnail.jpg?X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=masoud%2F20241222%2Fus-east-1%2Fs3%2Faws4_request&X-Amz-Date=20241222T055047Z&X-Amz-Expires=604800&X-Amz-SignedHeaders=host&X-Amz-Signature=6af7f86fbfd593aa6aa571fa94adbc417ff63137d422fe0c3075777cfefd1527)
Dyna(k): A Multi-Step Dyna Planning
Published on Aug 26, 20093399 Views
Dyna planning is an efficient way of learning from real and imaginary experience. Existing tabular and linear Dyna algorithms are single-step, because an "imaginary" feature is predicted only one