Hootan Nakhost
Hootan Nakhost
PhD Candidate
Office:   CSC 2-11
Email (in domain ualberta.ca): nakhost

Research Interests

AI planning and heuristic search.

Awards
  • Winner, Multi-Core Track at the 7th International Planning Competition (IPC'11), for the planning system ArvandHerd (with Richard Valenzano, Martin Müller, Jonathan Schaffer, and Nathan Sturtevant), 2011
     
  • iCORE ICT Graduate Scholarship ($72000), 2009-2011.
     
  • iCORE Graduate Students Scholarship for international students ($30000), 2007-2009.
     
  • Provost Doctoral Entrance Award ($16000), 2007-2009.

Publications
    Link to my Google scholar
     
  • Hootan Nakhost, and Martin Müller. A Theoretical Framework to Study Random Walk Planning. Proceedings of the 3rd Annual Symposium on Combinatorial Search (SOCS'12), 2012.
     
  • Richard Valenzano, Hootan Nakhost, Martin Müller, Jonathan Schaeffer, Nathan Sturtevant. ArvandHerd: Parallel Planning with a Portfolio. Proceedings of the 20st European Conference on AI (ECAI'12), 2012.
     
  • Hootan Nakhost, Jörg Hoffmann, and Martin Müller. Resource-Constrained Planning: A Monte-Carlo Random Walk Approach. Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS'12), 2012. PDF
     
  • Fan Xie, Hootan Nakhost, and Martin Müller. Planning via Random Walk-Driven Local Search. Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS'12), 2012. PDF
     
  • Hootan Nakhost, Jörg Hoffmann, and Martin Müller. Improving Local Search for Resource-Constrained Planning. abstract in Proceedings of the 3rd Annual Symposium on Combinatorial Search (SOCS'10), 2010. PDF PDF of longer TR
     
  • Hootan Nakhost and Martin Müller. Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement. Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS'10), pp. 137-144, 2010. PDF PDF of longer TR
     
  • Hootan Nakhost and Martin Müller. Monte-Carlo Exploration for Deterministic Planning. Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI'09), pp. 1766-1771, 2009. PDF
     
  • Hossein Hojjat, Hootan Nakhost, and Marjan Sirjani Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP). Journal of Universal Computer Science (J.UCS), vol 13, no. 13, pp. 2076-2104, 2007.
     
  • Hossein Hojjat, Hootan Nakhost, and Marjan Sirjani Formal Verification of the IEEE 802.1D Spanning Tree Protocol Using Extended Rebeca. Electr. Notes Theor. Comput. Sci. 159. pp. 139-154, 2006.