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
  • Adobe portable document format (pdf) (1MB)
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.

Notes

Text Reference
Sven Koenig and Reid Simmons, "Complexity Analysis of Real-Time Reinforcement Learning Applied to Finding Shortest Paths in Deterministic Domains," tech. report CMU-CS-93-106, Computer Science Department, Carnegie Mellon University, December, 1992

BibTeX Reference
@techreport{Koenig_1992_1324,
   author = "Sven Koenig and Reid Simmons",
   title = "Complexity Analysis of Real-Time Reinforcement Learning Applied to Finding Shortest Paths in Deterministic Domains",
   booktitle = "",
   institution = "Computer Science Department",
   month = "December",
   year = "1992",
   number= "CMU-CS-93-106",
   address= "Pittsburgh, PA",
}