The paper finds local minimizers for obstacle avoidance on curved spaces.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
The paper simplifies conditions for optimal paths on manifolds avoiding obstacles.
New approach for obstacle avoidance in robotics using learned representations.
By introducing a shape manifold as a solution set to solve inverse obstacle scattering problems we allow the reconstruction of general, not necessarily star-shaped curves. The bending energy is used as a stabilizing term in Tikhonov regularization to gain independence of the parametrization. Moreover, we discuss how se…
Study motion planning for points avoiding obstacles in a plane.
GP-ND avoids obstacles in trajectory planning using Gaussian Process regression.
CARML uses meta-learning to avoid obstacles in 2D vehicle navigation.
Flow adjusts curvature to avoid a fixed region, proving bounds and regularity.
This paper presents preliminary work on learning the search heuristic for the optimal motion planning for automated driving in urban traffic. Previous work considered search-based optimal motion planning framework (SBOMP) that utilized numerical or model-based heuristics that did not consider dynamic obstacles. Optimal…
Coordinated defensive escorts can aid a navigating payload by positioning themselves in order to maintain the safety of the payload from obstacles. In this paper, we present a novel, end-to-end solution for coordinating an escort team for protecting high-value payloads. Our solution employs deep reinforcement learning …
Characterizes obstacles to variational formulation of Dirac dynamics.
Study on semiconcavity of solutions to gradient obstacle problems on compact manifolds.
Develops a learning model predictive controller for competitive racing.
We study a notion of relative entropy motivated by self-expanders of mean curvature flow. In particular, we obtain the existence of this quantity for arbitrary hypersurfaces trapped between two disjoint self-expanders asymptotic to the same cone. This allows us to begin to develop the variational theory for the relativ…
Two main obstacles preventing the widespread adoption of variational Bayesian neural networks are the high parameter overhead that makes them infeasible on large networks, and the difficulty of implementation, which can be thought of as "programming overhead." MC dropout [Gal and Ghahramani, 2016] is popular because it…
In this paper, we present a novel penalty approach for the numerical solution of continuously controlled HJB equations and HJB obstacle problems. Our results include estimates of the penalisation error for a class of penalty terms, and we show that variations of Newton's method can be used to obtain globally convergent…
This paper concerns the numerical solution of the finite-horizon Optimal Investment problem with transaction costs under Potential Utility. The problem is initially posed in terms of an evolutive HJB equation with gradient constraints. In Finite-Horizon Optimal Investment with Transaction Costs: A Parabolic Double Obst…
The Heston stochastic volatility process, which is widely used as an asset price model in mathematical finance, is a paradigm for a degenerate diffusion process where the degeneracy in the diffusion coefficient is proportional to the square root of the distance to the boundary of the half-plane. The generator of this p…
Reduces necessary conditions for collision avoidance on curved spaces.
Method recovers obstacles from travel times on curved surfaces.
We establish higher-order weighted Sobolev and Holder regularity for solutions to variational equations defined by the elliptic Heston operator, a linear second-order degenerate-elliptic operator arising in mathematical finance. Furthermore, given -smooth data, we prove -regularity of solutions up t…
Boosting Variational Inference improves posterior approximations with adaptive step-sizes.
Study reveals RL game's embedding space is stratified, not a manifold.
Deep RL mimics human driving for collision avoidance in self-driving cars.
PIVID infers DAG structures from data using variational inference and permutations.
Study finds a limiting distribution for free path lengths on flat surfaces with circular obstacles.
A new method compresses large datasets for gradient descent algorithms efficiently.
We consider a finite horizon optimal stopping problem related to trade-off strategies between expected profit and cost cash-flows of an investment under uncertainty. The optimal problem is first formulated in terms of a system of Snell envelopes for the profit and cost yields which act as obstacles to each other. We th…
Variational inference has become an increasingly attractive fast alternative to Markov chain Monte Carlo methods for approximate Bayesian inference. However, a major obstacle to the widespread use of variational methods is the lack of post-hoc accuracy measures that are both theoretically justified and computationally …
Study on elastic curves pinned at the boundary, focusing on minimizers and their interaction with obstacles.
Current remote sensing image classification problems have to deal with an unprecedented amount of heterogeneous and complex data sources. Upcoming missions will soon provide large data streams that will make land cover/use classification difficult. Machine learning classifiers can help at this, and many methods are cur…
Paper tackles utility maximization with job-switching and retirement constraints.
Study of mean curvature flow with obstacles using singular perturbation.
The paper deals with some problems related to recovering information about an obstacle in an Euclidean space from certain measurements of lengths of generalized geodesics in the exterior of the obstacle. The main result is that if two obstacles satisfy some generic regularity conditions and have (almost) the same trave…
We present NAVREN-RL, an approach to NAVigate an unmanned aerial vehicle in an indoor Real ENvironment via end-to-end reinforcement learning RL. A suitable reward function is designed keeping in mind the cost and weight constraints for micro drone with minimum number of sensing modalities. Collection of small number of…
Loss functions with a large number of saddle points are one of the major obstacles for training modern machine learning models efficiently. First-order methods such as gradient descent are usually the methods of choice for training machine learning models. However, these methods converge to saddle points for certain ch…
Same travelling times imply identical obstacles in Riemannian manifolds.
Study anisotropic obstacle problem for minimal surfaces using Cahn-Hoffman transform.
Study proves uniqueness for ray transform on surfaces with obstacles.
We show that any group that is hyperbolic relative to virtually nilpotent subgroups, and does not admit peripheral splittings, contains a quasi-isometrically embedded copy of the hyperbolic plane. In natural situations, the specific embeddings we find remain quasi-isometric embeddings when composed with the inclusion m…
We consider the broken ray transform on Riemann surfaces in the presence of an obstacle, following earlier work of Mukhometov. If the surface has nonpositive curvature and the obstacle is strictly convex, we show that a function is determined by its integrals over broken geodesic rays that reflect on the boundary of th…
Anisotropic obstacle problems and Stefan problem studied with evolving surfaces.
Clarifies connections between Nyström and SVGP methods for scalable GPs.
Geometric optics describes wave behavior near convex obstacles.
We consider an obstacle problem for elastic curves with fixed ends. We attempt to extend the graph approach provided in [8]. More precisely, we investigate nonexistence of graph solutions for special obstacles and extend the class of admissible curves in a way that an existence result can be obtained by a penalization …
Most microscopic pedestrian navigation models use the concept of "forces" applied to the pedestrian agents to replicate the navigation environment. While the approach could provide believable results in regular situations, it does not always resemble natural pedestrian navigation behaviour in many typical settings. In …
We show short time existence and uniqueness of $\C^{1,1}$ solutions to the mean curvature flow with obstacles, when the obstacles are of class $\C^{1,1}$. If the initial interface is a periodic graph we show long time existence of the evolution and convergence to a minimal constrained hypersurface.
Bayesian inference for Levy density with Gibbs posterior in discrete sampling.