Evaluation of Parallel Monte Carlo Tree Search Algorithms in Python Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/m900nx34x

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Monte-Carlo Tree Search (MCTS) is an online-planning algorithm for decision-theoretic planning in domains with stochastic and combinatorial structure. The general applicability of MCTS makes it an ideal first choice to investigate when developing planners for complex applications requiring automated control and planning. The first contribution of this thesis is to develop a new open-source Python MCTS planning library (PyPlan), which allows for fast prototyping of MCTS solutions in new domains. While the library can offer a final solution for applications that do not impose strict real-time constraints, for other applications the interpreted nature of Python may not meet the time constraints. This issue leads to the second contribution of this thesis, which is to study the effectiveness of various parallel versions of MCTS for speeding up the performance of PyPlan. We evaluate these algorithms on several complex planning problems using cloud-based resources. Our findings point to a preferred method for parallelizing PyPlan and also indicates that some prior methods are quite ineffective due to particular aspects of the Python language.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2015-06-16T15:54:44Z (GMT) No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) thesis.pdf: 780451 bytes, checksum: fcc9dea7c5cf48720a595e6542b29eaf (MD5)
  • description.provenance : Made available in DSpace on 2015-06-23T16:32:17Z (GMT). No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) thesis.pdf: 780451 bytes, checksum: fcc9dea7c5cf48720a595e6542b29eaf (MD5) Previous issue date: 2015-06-08
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2015-06-23T16:32:17Z (GMT) No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) thesis.pdf: 780451 bytes, checksum: fcc9dea7c5cf48720a595e6542b29eaf (MD5)
  • description.provenance : Submitted by Shankar Jothi (jothis@onid.orst.edu) on 2015-06-10T23:45:45Z No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) thesis.pdf: 780451 bytes, checksum: fcc9dea7c5cf48720a595e6542b29eaf (MD5)

Relationships

In Administrative Set:
Last modified: 08/10/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items