/Complexity Analysis of Real-Time Reinforcement Learning Applied to Finding Shortest Paths in Deterministic Domains

Complexity Analysis of Real-Time Reinforcement Learning Applied to Finding Shortest Paths in Deterministic Domains

Sven Koenig and Reid Simmons
Tech. Report, CMU-CS-93-106, Computer Science Department, Carnegie Mellon University, December, 1992

Download Publication (PDF)

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

BibTeX Reference
@techreport{Koenig-1992-13438,
author = {Sven Koenig and Reid Simmons},
title = {Complexity Analysis of Real-Time Reinforcement Learning Applied to Finding Shortest Paths in Deterministic Domains},
year = {1992},
month = {December},
institution = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-CS-93-106},
}
2017-09-13T10:51:54-04:00