activity
20192026
most citedReachability Games with Relaxed Energy Constraints

5 citations · 6 across the 9 of their papers we have counts for

collaborators
Showing 2025Show all

5 papers · 1 filter

cs.AI2025

About Time: Model-free Reinforcement Learning with Timed Reward Machines

Rajarshi Roy, Anirban Majumdar, Ritam Raha +2

Reward specification plays a central role in reinforcement learning (RL), guiding the agent's behavior. To express non-Markovian rewards, formalisms such as reward machines have be…

cs.RO2025

Maximal Adaptation, Minimal Guidance: Permissive Reactive Robot Task Planning with Humans in the Loop

Oz Gitelson, Satya Prakash Nayak, Ritam Raha +1

We present a novel framework for human-robot \emph{logical} interaction that enables robots to reliably satisfy (infinite horizon) temporal logic tasks while effectively collaborat…

cs.AI2025

Follow the STARs: Dynamic -Regular Shielding of Learned Policies

Ashwani Anand, Satya Prakash Nayak, Ritam Raha +1

This paper presents a novel dynamic post-shielding framework that enforces the full class of -regular correctness properties over pre-computed probabilistic policies. This const…

cs.GT2025

Quantitative Strategy Templates

Ashwani Anand, Satya Prakash Nayak, Ritam Raha +2

This paper presents (permissive) \emph{Quantitative Strategy Templates} (QaSTels) to succinctly represent infinitely many winning strategies in two-player energy and mean-payoff ga…

cs.GT2025

Fair Quantitative Games

Ashwani Anand, Satya Prakash Nayak, Ritam Raha +2

We examine two-player games over finite weighted graphs with quantitative (mean-payoff or energy) objective, where one of the players additionally needs to satisfy a fairness objec…