3 citations · 4 across the 4 of their papers we have counts for
9 papers
No-Regret Learning in Dynamic Stackelberg Games
Niklas Lauffer, Mahsa Ghasemi, Abolfazl Hashemi +2
In a Stackelberg game, a leader commits to a randomized strategy, and a follower chooses their best strategy in response. We consider an extension of a standard Stackelberg game, c…
Multiple Plans are Better than One: Diverse Stochastic Planning
Mahsa Ghasemi, Evan Scope Crafts, Bo Zhao +1
In planning problems, it is often challenging to fully model the desired specifications. In particular, in human-robot interaction, such difficulty may arise due to human's prefere…
Reactive Synthesis with Maximum Realizability of Linear Temporal Logic Specifications
Rayna Dimitrova, Mahsa Ghasemi, Ufuk Topcu
A challenging problem for autonomous systems is to synthesize a reactive controller that conforms to a set of given correctness properties. Linear temporal logic (LTL) provides a f…
Online Active Perception for Partially Observable Markov Decision Processes with Limited Budget
Mahsa Ghasemi, Ufuk Topcu
Active perception strategies enable an agent to selectively gather information in a way to improve its performance. In applications in which the agent does not have prior knowledge…
Identifying Sparse Low-Dimensional Structures in Markov Chains: A Nonnegative Matrix Factorization Approach
Mahsa Ghasemi, Abolfazl Hashemi, Haris Vikalo +1
We consider the problem of learning low-dimensional representations for large-scale Markov chains. We formulate the task of representation learning as that of mapping the state spa…
Submodular Observation Selection and Information Gathering for Quadratic Models
Abolfazl Hashemi, Mahsa Ghasemi, Haris Vikalo +1
We study the problem of selecting most informative subset of a large observation set to enable accurate estimation of unknown parameters. This problem arises in a variety of settin…