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,657 papers · 148 categories

Trend · papers per month

24487195 · Jun 202019922001200920172026
48 results for 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.

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.

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 ↗

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 ↗

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.

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.

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.

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.

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 ↗

Improves DRL for long-term causal inference with semiparametric methods.

problem Efficient inference for policy values in nonparametric MDPs with stringent conditions.
method Semiparametric Double Reinforcement Learning (DRL) with superefficient nonparametric estimators.
result Relaxes overlap conditions and reduces high-dimensional density-ratio estimation.

In this paper, we analyze a real-valued reflected backward stochastic differential equation (RBSDE) with an unbounded obstacle and an unbounded terminal condition when its generator ff has quadratic growth in the zz-variable. In particular, we obtain existence, comparison, and stability results, and consider the opti…

2010-05-19abs ↗pdf ↗

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 ↗

Regularizes 3D inverse scattering with tangent-point energy for better solutions.

problem Ill-conditioned inverse obstacle scattering problems in 3D.
method Tikhonov regularization using tangent-point energy to penalize surface roughness and ensure well-posedness.
result Regularized solutions converge to true solution as noise level decreases.

Develops RL for dynamic risk assessment in stochastic optimization.

problem Time-consistent risk assessment in stochastic optimization problems.
method Model-free reinforcement learning with dynamic convex risk measures, time-consistent dynamic programming, policy gradient updates, actor-critic neural network optimization.
result Demonstrates optimal policies for statistical arbitrage, financial hedging, and robot control.

Billiard trajectories (broken generalised geodesics) are considered in the exterior of an obstacle KK with smooth boundary on an arbitrary Riemannian manifold. We prove a generalisation of the well-known Santalo's formula. As a consequence, it is established that if the set of trapped points has positive measure, then…

2016-01-15abs ↗pdf ↗

A framework for navigating environments with spatially correlated obstacles and uncertain blockage status.

problem Navigation in environments with spatially correlated obstacles of uncertain blockage status.
method Modeling spatial correlation with Gaussian Random Field, developing Bayesian belief updates, proposing a two-stage learning framework with offline and online phases.
result Consistent performance gains over baselines in environments with adversarial interruptions or clustered natural hazards.

In this paper, we introduce an actor-critic algorithm called Deep Value Model Predictive Control (DMPC), which combines model-based trajectory optimization with value function estimation. The DMPC actor is a Model Predictive Control (MPC) optimizer with an objective function defined in terms of a value function estimat…

2019-10-08abs ↗pdf ↗

Convolutional neural networks are commonly used to control the steering angle for autonomous cars. Most of the time, multiple long range cameras are used to generate lateral failure cases. In this paper we present a novel model to generate this data and label augmentation using only one short range fisheye camera. We p…

2018-08-20abs ↗pdf ↗

Cyber-physical systems, such as mobile robots, must respond adaptively to dynamic operating conditions. Effective operation of these systems requires that sensing and actuation tasks are performed in a timely manner. Additionally, execution of mission specific tasks such as imaging a room must be balanced against the n…

2012-03-15abs ↗pdf ↗

The Heston stochastic volatility process is 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 process with killing, called the elliptic Heston operator, is a second-order, degenerat…

2012-06-05abs ↗pdf ↗