← Search

Ali Asadi

4 accepted papers

2026

Qualitative Analysis of ω-Regular Objectives on Robust MDPs

AAAI 2026technical

Robust Markov Decision Processes (RMDPs) generalize classical MDPs that consider uncertainties in transition probabilities by defining a set of possible transition functions. An objective is a set of runs (or infinite trajectories) of the RMDP, and the value for an objective is the maximal probabili

Cited by 0SourcePDFScholar
2026

Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives

AAAI 2026technical

Partially observable Markov decision processes (POMDPs) are a central model for uncertainty in sequential decision making. The most basic objective is the reachability objective, where a target set must be eventually visited, and the more general parity objectives can model all omega-regular specif

Cited by 0SourcePDFScholar
2025

Limit-sure Reachability for Small Memory Policies in POMDPs is NP-complete

UAI 2025

A standard model that arises in several applications in sequential decision-making is partially observable Markov decision processes (POMDPs) where a decision-making agent interacts with an uncertain environment. A basic objective in POMDPs is the reachability objective, where given a target set of

Cited by 0SourcePDFScholar
2025

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes

UAI 2025

Deterministic Markov Decision Processes (DMDPs) are a mathematical framework for decision-making where the outcomes and future possible actions are deterministically determined by the current action taken. DMDPs can be viewed as a finite directed weighted graph, where in each step, the controller ch

Cited by 0SourcePDFScholar