I've recently finished my masters at the University of Alberta, with a perfect GPA of 4.0 out of 4.0. My research focused on Heuristic Search, and I was specifically working on developing new priority functions in Bounded Suboptimal Search under the guidance of Professor Nathan Sturtevant. Bounded suboptimal search involves sacrificing the optimal solution instead of quickly finding one. For example, this search type is commonly used in pathfinding for video games. While traditional optimal heuristic search algorithms like A* exist, bounded suboptimal search algorithms are preferred when we do not care about finding the optimal path for the monster to track us. Still, we want to find a good enough path as fast as possible. My main challenge was satisfying the constraints required to avoid re-expansions and re-ordering the OPEN list during the search. This work is published at AAAI 2025 with the title "Suboptimal Search With Dynamic Distribution of Suboptimality". It was also selected for oral presentation at the conference. 

I did my undergraduate studies at the University of Isfahan, Iran. I graduated with a cumulative GPA of 18.14 out of 20 and I ranked Top 4% among all 96 students in Computer Engineering major. As my undergraduate final thesis, I designed and developed a Hashtag Generator for Twitter via Neural Topic Modeling under supervision of Dr. Hossein Karshenas. I used BERT-based language models and created a model that generates 10 relevant hashtags based on an English tweet as the input. The hashtags may not be directly mentioned in the tweet but are targeted towards a specific and significant aspect of it. It would solve the problem of a topic not getting trend as people may use different hashtags to talk about an event.