Related papers: Universal limit theorem for rough differential equ…
We propose a novel approach for sampling-based and control-based motion planning that combines a representation of the environment obtained via a modified version of optimal Rapidly-exploring Random Trees (RRT*), with landmark-based…
We consider rough differential equations whose coefficients contain path-dependent bounded variation terms and prove the existence and a priori estimate of solutions. These equations include classical path-dependent SDEs containing running…
The goal of traffic management is efficiently utilizing network resources via adapting of source sending rates and routes selection. Traditionally, this problem is formulated into a utilization maximization problem. The single-path routing…
Motion planning under differential constraints is a classic problem in robotics. To date, the state of the art is represented by sampling-based techniques, with the Rapidly-exploring Random Tree algorithm as a leading example. Yet, the…
Consider a mean-reverting equation, generalized in the sense it is driven by a 1-dimensional centered Gaussian process with H\"older continuous paths on $[0,T]$ ($T > 0$). Taking that equation in rough paths sense only gives local existence…
Path integrals represent a powerful route to quantization: they calculate probabilities by summing over classical configurations of variables such as fields, assigning each configuration a phase equal to the action of that configuration.…
Let E be an elliptic curve defined over a number field k. In this paper, we define the ``global discrepancy'' of a finite set Z of algebraic points on E which in a precise sense measures how far the set is from being adelically…
Based on two isomorphisms of Hopf algebras, we provide a bound in the optimal order on the remainder of the truncated Taylor expansion for controlled differential equations driven by branched rough paths.
The $k$-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed $k$ when restricted to the class of planar…
We revisit finite-dimensional linear-quadratic optimal control from the viewpoint of differential flatness. If the pair (A, B) is controllable, then the linear control system is flat, and every trajectory can be parametrized by a flat…
We check claims for a generalized central limit theorem holding at the Feigenbaum (infinite bifurcation) point of the logistic map, made recently by U. Tirnakli, C. Beck, and C. Tsallis (Phys. Rev. {\bf 75}, 040106(R) (2007)). We show that…
Abstract: we present a framework for robust autonomous driving motion planning system in urban environments which includes trajectory refinement, trajectory interpolation, avoidance of static and dynamic obstacles, and trajectory tracking.…
Semiclassical asymptotics for linear Schr\"odinger equations with non-smooth potentials give rise to ill-posed formal semiclassical limits. These problems have attracted a lot of attention in the last few years, as a proxy for the treatment…
This paper describes a data-driven framework for approximate global optimization in which precomputed solutions to a sample of problems are retrieved and adapted during online use to solve novel problems. This approach has promise for…
Exploiting our previous results on higher order controlled Lagrangians in [Nonlinear Anal. {\bf 207} (2021), 112263], we derive here an analogue of the classical first order Pontryagin Maximum Principle (PMP) for cost minimising problems…
We study a random conductance problem on a $d$-dimensional discrete torus of size $L > 0$. The conductances are independent, identically distributed random variables uniformly bounded from above and below by positive constants. The…
We address the problem of optimally controlling Connected and Automated Vehicles (CAVs) arriving from four multi-lane roads at an intersection where they conflict in terms of safely crossing (including turns) with no collision. The…
The objective of the paper is to investigate the approximate controllability property of a linear stochastic control system with values in a separable real Hilbert space. In a first step we prove the existence and uniqueness for the…
We prove quenched versions of (i) a large deviations principle (LDP), (ii) a central limit theorem (CLT), and (iii) a local central limit theorem (LCLT) for non-autonomous dynamical systems. A key advance is the extension of the spectral…
We consider the problem of designing finite-horizon safe controllers for a dynamical system for which no explicit analytical model exists and limited data only along a single trajectory of the system are available. Given samples of the…