← Search

Necmiye Ozay

7 accepted papers

2024

A Safe Preference Learning Approach for Personalization With Applications to Autonomous Vehicles

RA-L 2024

This letter introduces a preference learning method that ensures adherence to given specifications, with an application to autonomous vehicles. Our approach incorporates the priority ordering of Signal Temporal Logic (STL) formulas describing traffic rules into a learning framework. By leveraging Pa

Cited by 8SourcecodeScholar
2022

Correction to "Planning With Learned Dynamics: Probabilistic Guarantees on Safety and Reachability Via Lipschitz Constants"

RA-L 2022

We wish to make the following corrections and clarifications to our manuscript [1]. For a version of the manuscript that has these changes integrated into the text, please see [2]. •In [1], the method is claimed to provide safety guarantees with probability $\rho$; this probability should instead be

Cited by 0SourceScholar
2021

Planning With Learned Dynamics: Probabilistic Guarantees on Safety and Reachability via Lipschitz Constants

RA-L 2021

We present a method for feedback motion planning of systems with unknown dynamics which provides probabilistic guarantees on safety, reachability, and goal stability. To find a domain in which a learned control-affine approximation of the true dynamics can be trusted, we estimate the Lipschitz const

Cited by 45SourceScholar
2020

Explaining Multi-stage Tasks by Learning Temporal Logic Formulas from Suboptimal Demonstrations

RSS 2020poster

We present a method for learning to perform multi-stage tasks from demonstrations by learning the logical structure and atomic propositions of a consistent linear temporal logic (LTL) formula. The learner is given successful but potentially suboptimal demonstrations, where the demonstrator is optimi…

Cited by 29SourcePDFScholar
2020

Learning Constraints From Locally-Optimal Demonstrations Under Cost Function Uncertainty

RA-L 2020

We present an algorithm for learning parametric constraints from locally-optimal demonstrations, where the cost function being optimized is uncertain to the learner. Our method uses the Karush-Kuhn-Tucker (KKT) optimality conditions of the demonstrations within a mixed integer linear program (MILP)

Cited by 42SourceScholar
2020

Uncertainty-Aware Constraint Learning for Adaptive Safe Motion Planning from Demonstrations

CoRL 2020

We present a method for learning to satisfy uncertain constraints from demonstrations. Our method uses robust optimization to obtain a belief over the potentially infinite set of possible constraints consistent with the demonstrations, and then uses this belief to plan trajectories that trade off pe

Cited by 0SourcePDFScholar