Research
On-device research index

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.

168,695 papers · 148 categories

Trend · papers per month

69139208277 · Jun 202019922001200920172026
48 results for Variational obstacle avoidance

The paper finds local minimizers for obstacle avoidance on curved spaces.

problem Finding optimal paths on curved spaces avoiding obstacles.
method Minimizing an action functional with bi-Jacobi fields and biconjugate points.
result Local minimizers are classified into two categories with local uniqueness results.

The paper simplifies conditions for optimal paths on manifolds avoiding obstacles.

problem Finding optimal paths on manifolds avoiding obstacles.
method Study of sufficient conditions for optimality on Riemannian manifolds and Lie groups.
result New conditions for optimality are provided in terms of matrix invertibility.

New approach for obstacle avoidance in robotics using learned representations.

problem Challenges in sensor-based motion planning for new and dynamic environments.
method Proposes a new obstacle representation using PointNet architecture trained jointly with policies for obstacle avoidance.
result Significant improvements in accuracy and efficiency compared to state of the art.

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…

2019-03-12abs ↗pdf ↗

GP-ND avoids obstacles in trajectory planning using Gaussian Process regression.

problem Avoiding obstacles in trajectory planning for real-world systems.
method GP-ND models negative data pairs using Gaussian distributions and maximizes their KL divergence from the GP to avoid them.
result GP-ND outperforms traditional GP learning in obstacle-aware trajectory planning.

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…

2018-05-25abs ↗pdf ↗

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 …

2019-10-09abs ↗pdf ↗

Study on semiconcavity of solutions to gradient obstacle problems on compact manifolds.

problem Gradient obstacle problems on compact Riemannian manifolds.
method Uniform semiconcavity estimates and fine convergence results for solutions and free boundaries.
result The elastic and λλ-elastic sets of solutions converge to the cut locus and λλ-cut locus of the manifold.

Develops a learning model predictive controller for competitive racing.

problem Lack of exploration in state space and complexity in obstacle avoidance.
method Explores state space through multiple initializations and develops a new method for convex terminal set selection.
result Yields a richer terminal safe set and maintains convexity.

Reduces necessary conditions for collision avoidance on curved spaces.

problem Finding non-intersecting trajectories for multiple agents on curved spaces.
method Reduction by Lie group symmetries of variational collision avoidance problems.
result Derives necessary conditions for reduced extremals.

Boosting Variational Inference improves posterior approximations with adaptive step-sizes.

problem Limited resources hinder the widespread adoption of Boosting Variational Inference.
method Characterized global curvature impact, introduced local curvature, and developed an approximate backtracking algorithm.
result New theoretical convergence rates and experimental validation demonstrate improved performance.

Deep RL mimics human driving for collision avoidance in self-driving cars.

problem Developing human-like driving policies for autonomous vehicles in mixed traffic environments.
method Model-free, deep reinforcement learning approach using a combination of rule-based and expert-driven data.
result Demonstrated human-like driving policies through Gaussian process modeling of track position and speed distributions.

PIVID infers DAG structures from data using variational inference and permutations.

problem Estimating the structure of Bayesian networks from observational data.
method PIVID uses variational inference and continuous relaxations of discrete distributions to infer a distribution over permutations and DAGs.
result PIVID outperforms deterministic and Bayesian approaches in estimating DAG structures from data.

Study finds a limiting distribution for free path lengths on flat surfaces with circular obstacles.

problem Understanding free path lengths on flat surfaces with circular obstacles.
method Proved the existence of a limiting distribution using radius of obstacles as a parameter.
result Relates the limiting distribution to heights of zippered rectangle decompositions.

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 …

2019-10-09abs ↗pdf ↗

Study on elastic curves pinned at the boundary, focusing on minimizers and their interaction with obstacles.

problem Minimizing elastic bending energy for open planar curves with obstacles.
method Investigation of global minimizers and explicit solutions for different values of the penalization parameter.
result Explicit threshold for λλ above which minimizers touch the obstacle, regardless of obstacle shape.

Paper tackles utility maximization with job-switching and retirement constraints.

problem Maximizing utility with job-switching and retirement constraints.
method Dual-martingale approach and double obstacle problem theory.
result Characterization of optimal job-switching strategy and wealth boundaries.

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…

2014-04-16abs ↗pdf ↗

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…

2019-01-21abs ↗pdf ↗

Study anisotropic obstacle problem for minimal surfaces using Cahn-Hoffman transform.

problem Anisotropic obstacle problem for minimal surfaces.
method Cahn-Hoffman transform to convert to isotropic problem with generalized Robin boundary condition.
result Optimal regularity of the solution and C1,1C^{1,1} regularity of the free boundary.

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…

2011-11-10abs ↗pdf ↗

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…

2014-03-20abs ↗pdf ↗

Anisotropic obstacle problems and Stefan problem studied with evolving surfaces.

problem Anisotropic parabolic obstacle problems and Stefan problem.
method Cahn-Hoffman transform and anisotropic mean curvature flow.
result Optimal regularity of the solution and C1,αC^{1,α}-regularity of the evolving free boundary.

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 …

2018-12-07abs ↗pdf ↗