Ufuk Topcu

Learning and Planning for Time-Varying MDPs Using Maximum Likelihood\n Estimation

2019 · arXiv (Cornell University)

This paper proposes a formal approach to online learning and planning for\nagents operating in a priori unknown, time-varying environments. The proposed\nmethod computes the maximally likely model of the environment, given the\nobservations about the environment made …

Efficient Sensitivity Analysis for Parametric Robust Markov Chains

2023 · Lecture notes in computer science

Abstract We provide a novel method for sensitivity analysis of parametric robust Markov chains. These models incorporate parameters and sets of probability distributions to alleviate the often unrealistic assumption that precise probabilities are available. We …

Differential Privacy for Stochastic Matrices Using the Matrix Dirichlet Mechanism

2023

Stochastic matrices are commonly used to analyze Markov chains, but revealing them can leak sensitive information. Therefore, in this paper we introduce a technique to privatize stochastic matrices in a way that (i) conceals the …

IG-MCTS: Human-in-the-Loop Cooperative Navigation under Incomplete Information

2025 · arXiv (Cornell University)

Human-robot cooperative navigation is challenging under incomplete information. We introduce CoNav-Maze, a simulated environment where a robot navigates with local perception while a human operator provides guidance based on an inaccurate map. The robot can …