Reflected Schr\"odinger Bridge: Density Control with Path Constraints

• URL: http://arxiv.org/abs/2003.13895v2
• Date: Sat, 4 Apr 2020 23:51:40 GMT
• Title: Reflected Schr\"odinger Bridge: Density Control with Path Constraints
• Authors: Kenneth F. Caluya, and Abhishek Halder
• Abstract summary: We perform the feedback synthesis for minimum control effort density steering problem subject to state constraints. We extend the theory of Schr"odinger bridges to account the reflecting boundary conditions for the sample paths.
• Score: 1.8563342761346613
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: How to steer a given joint state probability density function to another over finite horizon subject to a controlled stochastic dynamics with hard state (sample path) constraints? In applications, state constraints may encode safety requirements such as obstacle avoidance. In this paper, we perform the feedback synthesis for minimum control effort density steering (a.k.a. Schr\"{o}dinger bridge) problem subject to state constraints. We extend the theory of Schr\"{o}dinger bridges to account the reflecting boundary conditions for the sample paths, and provide a computational framework building on our previous work on proximal recursions, to solve the same.

Related papers

• Plug-in estimation of Schrödinger bridges [15.685006881635209]
  We propose a procedure for estimating the Schr"odinger bridge between two probability distributions. We show that our proposal, which we call the emphSinkhorn bridge, provably estimates the Schr"odinger bridge with a rate of convergence that depends on the intrinsic dimensionality of the target measure.
  arXiv  Detail & Related papers  (2024-08-21T15:07:25Z)
• Weyl Calculus and Exactly Solvable Schrödinger Bridges with Quadratic State Cost [3.820235868126608]
  We explain how ideas from Weyl calculus in quantum mechanics, specifically the Weyl operator and the Weyl symbol, can help determine such Markov kernels. We illustrate these ideas by explicitly finding the Markov kernel for the case of quadratic state cost via Weyl calculus.
  arXiv  Detail & Related papers  (2024-07-21T19:05:30Z)
• Schrödinger Bridge with Quadratic State Cost is Exactly Solvable [3.820235868126608]
  We propose a regularized variant of the Schr"odinger bridge with a quadratic state cost-to-go that incentivizes the optimal sample paths to stay close to a nominal level. Unlike the conventional Schr"odinger bridge, the regularization induces a state-dependent rate of killing and creation of probability mass. We derive this Markov kernel in closed form, blackshowing that the regularized Schr"odinger bridge is exactly solvable, even for non-Gaussian endpoints.
  arXiv  Detail & Related papers  (2024-06-01T17:22:00Z)
• On the Contraction Coefficient of the Schr\"odinger Bridge for Stochastic Linear Systems [15.022863946000495]
  A popular method to numerically solve the Schr"odinger bridge problems is via contractive fixed point recursions. We study a priori estimates for the contraction coefficients associated with the convergence of respective Schr"odinger systems.
  arXiv  Detail & Related papers  (2023-09-12T22:24:05Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• Pulsed multireservoir engineering for a trapped ion with applications to state synthesis and quantum Otto cycles [68.8204255655161]
  Reservoir engineering is a remarkable task that takes dissipation and decoherence as tools rather than impediments. We develop a collisional model to implement reservoir engineering for the one-dimensional harmonic motion of a trapped ion. Having multiple internal levels, we show that multiple reservoirs can be engineered, allowing for more efficient synthesis of well-known non-classical states of motion.
  arXiv  Detail & Related papers  (2021-11-26T08:32:39Z)
• Shortest-Path Constrained Reinforcement Learning for Sparse Reward Tasks [59.419152768018506]
  We show that any optimal policy necessarily satisfies the k-SP constraint. We propose a novel cost function that penalizes the policy violating SP constraint, instead of completely excluding it. Our experiments on MiniGrid, DeepMind Lab, Atari, and Fetch show that the proposed method significantly improves proximal policy optimization (PPO)
  arXiv  Detail & Related papers  (2021-07-13T21:39:21Z)
• On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization [55.937424268654645]
  We consider algorithm-independent lower bounds for the problem of black-box optimization of functions having a bounded norm. We provide a novel proof technique for deriving lower bounds on the regret, with benefits including simplicity, versatility, and an improved dependence on the error probability.
  arXiv  Detail & Related papers  (2020-08-20T03:48:14Z)
• Constraint relation between steerability and concurrence for two-qubit states [6.687934752525343]
  Entanglement and steering are used to describe quantum inseparabilities. A natural question arises concerning how much territory steerability occupies entanglement for a general two-qubit entangled state. We investigate the constraint relation between steerability and concurrence by using two kinds of evolutionary states and randomly generated two-qubit states.
  arXiv  Detail & Related papers  (2020-07-18T05:29:44Z)
• An Integer Linear Programming Framework for Mining Constraints from Data [81.60135973848125]
  We present a general framework for mining constraints from data. In particular, we consider the inference in structured output prediction as an integer linear programming (ILP) problem. We show that our approach can learn to solve 9x9 Sudoku puzzles and minimal spanning tree problems from examples without providing the underlying rules.
  arXiv  Detail & Related papers  (2020-06-18T20:09:53Z)
• Constrained episodic reinforcement learning in concave-convex and knapsack settings [81.08055425644037]
  We provide a modular analysis with strong theoretical guarantees for settings with concave rewards and convex constraints. Our experiments demonstrate that the proposed algorithm significantly outperforms these approaches in existing constrained episodic environments.
  arXiv  Detail & Related papers  (2020-06-09T05:02:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.