Related papers: Constrained Rough Paths
This paper combines image metamorphosis with deep features. To this end, images are considered as maps into a high-dimensional feature space and a structure-sensitive, anisotropic flow regularization is incorporated in the metamorphosis…
Balancing the trade-off between safety and efficiency is of significant importance for path planning under uncertainty. Many risk-aware path planners have been developed to explicitly limit the probability of collision to an acceptable…
This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be…
Stable fold maps are fundamental tools in a generalization of the theory of Morse functions on smooth manifolds and its application to studies of geometric properties of smooth manifolds. Round fold maps were introduced as stable fold maps…
Continuum robots (CR) offer excellent dexterity and compliance in contrast to rigid-link robots, making them suitable for navigating through, and interacting with, confined environments. However, the study of path planning for CRs while…
Whenever an It\^o-Wentsel type of formula holds for composition of flows of a certain differential dynamics, there exists locally a decomposition of the corresponding flow according to complementary distributions (or foliations, in the case…
We tackle high-dimensional, path-dependent valuation and control and introduce a deep BSDE/2BSDE solver that couples truncated log-signatures with a neural rough differential equation (RDE) backbone. The architecture aligns stochastic…
We examine the relation between a stochastic version of the rough path integral with the symmetric-Stratonovich integral in the sense of regularization. Under mild regularity conditions in the sense of Malliavin calculus, we establish…
Axiomatizing covarieties of coalgebras for an endofunctor is less intuitive than axiomatizing varieties of algebras via equations (Dahlqvist and Schmid, 2022). Existing techniques come from coalgebraic modal logic, pattern avoidance…
Given only a collection of points sampled from a Riemannian manifold embedded in a Euclidean space, in this paper we propose a new method to solve elliptic partial differential equations (PDEs) supplemented with boundary conditions. Notice…
We use simple sub-Riemannian techniques to prove that an arbitrary geometric p-rough path in the sense of Lyons (98) is the limit in sup-norm of a sequence of canonically lifted smooth paths, which are uniformly bounded in p-variation,…
Path planning has long been one of the major research areas in robotics, with PRM and RRT being two of the most effective classes of planners. Though generally very efficient, these sampling-based planners can become computationally…
This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph…
We study controlled differential equations driven by a rough path (in the sense of T. Lyons) with an additional, possibly unbounded drift term. We show that the equation induces a solution flow if the drift grows at most linearly.…
Neural networks are known to give better performance with increased depth due to their ability to learn more abstract features. Although the deepening of networks has been well established, there is still room for efficient feature…
A theory of differential equations driven by a non-differentiable path has recently been developed by Lyons. We develop an alternative approach to this theory, using (modified Euler approximations), and investigate its applicability to…
Recently it was proved that the group of rough paths modulo tree-like equivalence is isomorphic to the corresponding signature group through the signature map S (a generalized notion of taking iterated path integrals). However, the proof of…
Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…
We reduce CR-structures on smooth elliptic and hyperbolic manifolds of CR-codimension 2 to parallelisms thus solving the problem of global equivalence for such manifolds. The parallelism that we construct is defined on a sequence of two…
This paper studies the obstructions to deforming a map from a complex variety to another variety which is an immersion of codimension one. We extend the classical notion of semiregularity of subvarieties to maps between varieties, and show…