← Search

Hazhar Rahmani

8 accepted papers

2023

Probabilistic Planning with Partially Ordered Preferences over Temporal Goals

ICRA 2023poster

In this paper, we study planning in stochastic systems, modeled as Markov decision processes (MDPs), with preferences over temporally extended goals. Prior work on temporal planning with preferences assumes that the user preferences form a total order, meaning that every pair of outcomes are compara…

Cited by 6SourceScholar
2023

Probabilistic Planning with Prioritized Preferences over Temporal Logic Objectives

IJCAI 2023poster

This paper studies temporal planning in probabilistic environments, modeled as labeled Markov decision processes (MDPs), with user preferences over multiple temporal goals. Existing works reflect such preferences as a prioritized list of goals. This paper introduces a new specification language, te…

Cited by 2SourcePDFScholar
2021

Accelerating combinatorial filter reduction through constraints

ICRA 2021poster

Reduction of combinatorial filters involves compressing state representations that robots use. Such optimization arises in automating the construction of minimalist robots. But exact combinatorial filter reduction is an NP-complete problem and all current techniques are either inexact or formalized…

Cited by 6SourceScholar
2021

Conditioning Style on Substance: Plans for Narrative Observation

ICRA 2021poster

We consider a robot tasked with observing its environment and later selectively summarizing what it saw as a vivid, structured narrative. The robot interacts with an uncertain environment, modelled as a stochastic process, and must decide what events to pay attention to (substance), and how to best…

Cited by 4SourceScholar
2020

What to Do When You Can’t Do It All: Temporal Logic Planning with Soft Temporal Logic Constraints

IROS 2020poster

In this paper, we consider a temporal logic planning problem in which the objective is to find an infinite trajectory that satisfies an optimal selection from a set of soft specifications expressed in linear temporal logic (LTL) while nevertheless satisfying a hard specification expressed in LTL. Ou…

Cited by 13SourceScholar