Search Results for author: Morteza Lahijanian

Found 23 papers, 2 papers with code

Data-Driven Permissible Safe Control with Barrier Certificates

no code implementations30 Apr 2024 Rayan Mazouz, John Skovbekk, Frederik Baymler Mathiesen, Eric Frew, Luca Laurenti, Morteza Lahijanian

This paper introduces a method of identifying a maximal set of safe strategies from data for stochastic systems with unknown dynamics using barrier certificates.

Uncertainty Propagation in Stochastic Systems via Mixture Models with Error Quantification

no code implementations22 Mar 2024 Eduardo Figueiredo, Andrea Patane, Morteza Lahijanian, Luca Laurenti

Uncertainty propagation in non-linear dynamical systems has become a key problem in various fields including control theory and machine learning.

Shielded Deep Reinforcement Learning for Complex Spacecraft Tasking

no code implementations8 Mar 2024 Robert Reed, Hanspeter Schaub, Morteza Lahijanian

Autonomous spacecraft control via Shielded Deep Reinforcement Learning (SDRL) has become a rapidly growing research area.

reinforcement-learning

IntervalMDP.jl: Accelerated Value Iteration for Interval Markov Decision Processes

no code implementations8 Jan 2024 Frederik Baymler Mathiesen, Morteza Lahijanian, Luca Laurenti

In this paper, we present IntervalMDP. jl, a Julia package for probabilistic analysis of interval Markov Decision Processes (IMDPs).

Recursively-Constrained Partially Observable Markov Decision Processes

no code implementations15 Oct 2023 Qi Heng Ho, Tyler Becker, Benjamin Kraske, Zakariya Laouar, Martin S. Feather, Federico Rossi, Morteza Lahijanian, Zachary N. Sunberg

Evaluations on a set of benchmark problems demonstrate the efficacy of our algorithm and show that policies for RC-POMDPs produce more desirable behaviors than policies for C-POMDPs.

Unifying Safety Approaches for Stochastic Systems: From Barrier Functions to Uncertain Abstractions via Dynamic Programming

no code implementations3 Oct 2023 Luca Laurenti, Morteza Lahijanian

Providing safety guarantees for stochastic dynamical systems has become a central problem in many fields, including control theory, machine learning, and robotics.

Formal Abstraction of General Stochastic Systems via Noise Partitioning

no code implementations19 Sep 2023 John Skovbekk, Luca Laurenti, Eric Frew, Morteza Lahijanian

We introduce a general procedure for the finite abstraction of nonlinear stochastic systems with non-standard (e. g., non-affine, non-symmetric, non-unimodal) noise distributions for verification purposes.

Promises of Deep Kernel Learning for Control Synthesis

no code implementations12 Sep 2023 Robert Reed, Luca Laurenti, Morteza Lahijanian

Deep Kernel Learning (DKL) combines the representational power of neural networks with the uncertainty quantification of Gaussian Processes.

Gaussian Processes Uncertainty Quantification

Optimal Cost-Preference Trade-off Planning with Multiple Temporal Tasks

no code implementations22 Jun 2023 Peter Amorese, Morteza Lahijanian

Further, we show a method of computing the entire Pareto front (the set of all optimal trade-offs) via an adaptation of a multi-objective A* algorithm.

BNN-DP: Robustness Certification of Bayesian Neural Networks via Dynamic Programming

1 code implementation19 Jun 2023 Steven Adams, Andrea Patane, Morteza Lahijanian, Luca Laurenti

In this paper, we introduce BNN-DP, an efficient algorithmic framework for analysis of adversarial robustness of Bayesian Neural Networks (BNNs).

Adversarial Robustness Computational Efficiency +1

Sampling-based Reactive Synthesis for Nondeterministic Hybrid Systems

no code implementations14 Apr 2023 Qi Heng Ho, Zachary N. Sunberg, Morteza Lahijanian

This paper introduces a sampling-based strategy synthesis algorithm for nondeterministic hybrid systems with complex continuous dynamics under temporal and reachability constraints.

Motion Planning

Distributionally Robust Strategy Synthesis for Switched Stochastic Systems

no code implementations29 Dec 2022 Ibon Gracia, Dimitris Boskos, Morteza Lahijanian, Luca Laurenti, Manuel Mazo Jr

The framework we present first learns an abstraction of a switched stochastic system as a robust Markov decision process (robust MDP) by accounting for both the stochasticity of the system and the uncertainty in the noise distribution.

Interval Markov Decision Processes with Continuous Action-Spaces

no code implementations2 Nov 2022 Giannis Delimpaltadakis, Morteza Lahijanian, Manuel Mazo Jr., Luca Laurenti

Interval Markov Decision Processes (IMDPs) are finite-state uncertain Markov models, where the transition probabilities belong to intervals.

Pareto Optimal Strategies for Event-Triggered Estimation

no code implementations18 Jul 2022 Anne Theurkauf, Nisar Ahmed, Morteza Lahijanian

A well understood technique for trading off communication costs with estimation accuracy is event triggering (ET), where measurements are only communicated when useful, e. g., when Kalman filter innovations exceed some threshold.

Automaton-Guided Control Synthesis for Signal Temporal Logic Specifications

no code implementations8 Jul 2022 Qi Heng Ho, Roland B. Ilyes, Zachary N. Sunberg, Morteza Lahijanian

This paper presents an algorithmic framework for control synthesis of continuous dynamical systems subject to signal temporal logic (STL) specifications.

Safety Guarantees for Neural Network Dynamic Systems via Stochastic Barrier Functions

1 code implementation15 Jun 2022 Rayan Mazouz, Karan Muvvala, Akash Ratheesh, Luca Laurenti, Morteza Lahijanian

A key step in our method is the employment of the recent convex approximation results for NNs to find piece-wise linear bounds, which allow the formulation of the barrier function synthesis problem as a sum-of-squares optimization program.

Formal Control Synthesis for Stochastic Neural Network Dynamic Models

no code implementations11 Mar 2022 Steven Adams, Morteza Lahijanian, Luca Laurenti

Neural networks (NNs) are emerging as powerful tools to represent the dynamics of control systems with complicated physics or black-box components.

Conflict-Based Search for Explainable Multi-Agent Path Finding

no code implementations20 Feb 2022 Justin Kottinger, Shaull Almagor, Morteza Lahijanian

In the Multi-Agent Path Finding (MAPF) problem, the goal is to find non-colliding paths for agents in an environment, such that each agent reaches its goal from its initial location.

Multi-Agent Path Finding

Formal Verification of Unknown Dynamical Systems via Gaussian Process Regression

no code implementations31 Dec 2021 John Jackson, Luca Laurenti, Eric Frew, Morteza Lahijanian

In this article, we develop a framework for verifying partially-observable, discrete-time dynamical systems with unmodelled dynamics against temporal logic specifications from a given input-output dataset.

regression

Synergistic Offline-Online Control Synthesis via Local Gaussian Process Regression

no code implementations11 Oct 2021 John Jackson, Luca Laurenti, Eric Frew, Morteza Lahijanian

The online controller may improve the baseline guarantees since it avoids the discretization error and reduces regression error as new data is collected.

regression

Strategy Synthesis for Partially-known Switched Stochastic Systems

no code implementations5 Apr 2021 John Jackson, Luca Laurenti, Eric Frew, Morteza Lahijanian

We present a data-driven framework for strategy synthesis for partially-known switched stochastic systems.

LTLf Synthesis on Probabilistic Systems

no code implementations23 Sep 2020 Andrew M. Wells, Morteza Lahijanian, Lydia E. Kavraki, Moshe Y. Vardi

Linear Temporal Logic over finite traces (LTLf) has been used to express such properties, but no tools exist to solve policy synthesis for MDP behaviors given finite-trace properties.

Online Mapping and Motion Planning under Uncertainty for Safe Navigation in Unknown Environments

no code implementations26 Apr 2020 Èric Pairet, Juan David Hernández, Marc Carreras, Yvan Petillot, Morteza Lahijanian

The proposed approach deals with the motion, probabilistic safety, and online computation constraints by: (i) incrementally mapping the surroundings to build an uncertainty-aware representation of the environment, and (ii) iteratively (re)planning trajectories to goal that are kinodynamically feasible and probabilistically safe through a multi-layered sampling-based planner in the belief space.

Autonomous Navigation Motion Planning

Cannot find the paper you are looking for? You can Submit a new open access paper.