2026-09-19T08:06:45Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1394702022-01-15T04:01:07Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Shrobe, Howard
Yang, Zhutian
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2022-01-14T15:13:18Z
2022-01-14T15:13:18Z
2021-06
2021-06-24T19:42:55.390Z
https://hdl.handle.net/1721.1/139470
To create socially intelligent artificial assistants for humans in complex, naturalistic search environments, we need to develop algorithms that build models of human planning given their past decisions. In this thesis project, I focused on modeling human planning in Maze Orienteering Problems (MOP), an optimization problem with the objective to maximize collected rewards within a time limit in a partially known maze.
The project has two main components: developing planning algorithms to find approximate solutions to the MOP and using those algorithms to model human behavior with Bayesian inference.
For the planning part, I designed a hierarchical planning framework to solve the MOP as a room-level orienteering problem and a Partially Observable Markov Decision Process (POMDP) inside each room. My evaluation of algorithms shows that a Closest-Room heuristic model for room-level planning performs comparable to Branch-and-Bound exhaustive search while bearing a much smaller computational cost.
For the inference part, I implemented an online Bayesian inverse planning framework to fit candidate hierarchical planners to individual human traces. My experiments of human modeling shows that Closest-Room heuristic model also outperforms BnB in fitting humans’ room-level decisions and predicting their next rooms to visit.
S.M.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright MIT
http://rightsstatements.org/page/InC-EDU/1.0/
Modeling Human Planning in Maze Orienteering Problems
Thesis
application/pdf
Master
Master of Science in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="25474c39-1f2e-4ade-987b-e393a03b0294">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Modeling Human Planning in Maze Orienteering Problems</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2021-06</PublicationDate>
<Authors>
<Author>
<DisplayName>Yang, Zhutian</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://rightsstatements.org/page/InC-EDU/1.0/</License>
<Abstract>To create socially intelligent artificial assistants for humans in complex, naturalistic search environments, we need to develop algorithms that build models of human planning given their past decisions. In this thesis project, I focused on modeling human planning in Maze Orienteering Problems (MOP), an optimization problem with the objective to maximize collected rewards within a time limit in a partially known maze.
The project has two main components: developing planning algorithms to find approximate solutions to the MOP and using those algorithms to model human behavior with Bayesian inference.
For the planning part, I designed a hierarchical planning framework to solve the MOP as a room-level orienteering problem and a Partially Observable Markov Decision Process (POMDP) inside each room. My evaluation of algorithms shows that a Closest-Room heuristic model for room-level planning performs comparable to Branch-and-Bound exhaustive search while bearing a much smaller computational cost.
For the inference part, I implemented an online Bayesian inverse planning framework to fit candidate hierarchical planners to individual human traces. My experiments of human modeling shows that Closest-Room heuristic model also outperforms BnB in fitting humans’ room-level decisions and predicting their next rooms to visit.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>