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

Trend · papers per month

0.3%0.5%0.8%0.3% · Mar 202019922001200920172026
45 results for path-planning

A novel pedestrian path-planning model using reinforcement learning.

problem Challenges in replicating natural pedestrian navigation behavior.
method Reinforcement learning for collision avoidance and path planning.
result Path planning by the agent closely resembles human pedestrian behavior.

One-shot path planning for multiple agents using neural networks.

problem Efficiently generating optimal or near-optimal paths for multiple agents in robotics.
method Utilizes fully convolutional neural networks for one-shot multi-agent path planning.
result Demonstrates successful generation of optimal or near-optimal paths in over 85% of cases for multi-path planning.

Unified approach to path planning using probabilistic inference on factor graphs.

problem Path planning problems using probabilistic inference.
method Unified framework using probabilistic factor graphs and message composition rules.
result Unified approach includes various algorithms like Sum-product, Max-product, Dynamic programming, and mixed criteria.

A new network learns to prioritize messages for efficient multi-robot path planning.

problem Efficient path planning and coordination for large-scale multi-robot systems.
method Message-Aware Graph Attention Network (MAGAT) incorporating attention mechanisms.
result MAGAT achieves performance close to a coupled centralized expert algorithm.

Adversarial reinforcement learning optimizes microswimmers' path-planning in turbulent flows.

problem Optimizing microswimmers' paths in turbulent flows for efficient target reach.
method Adversarial-reinforcement learning scheme applied to 2D and 3D turbulent flows.
result Microswimmers can reach targets faster than a naive approach in turbulent flows.

In this paper, we solve the arms exponential exploding issue in multivariate Multi-Armed Bandit (Multivariate-MAB) problem when the arm dimension hierarchy is considered. We propose a framework called path planning (TS-PP) which utilizes decision graph/trees to model arm reward success rate with m-way dimension interac…

2019-09-06abs ↗pdf ↗

Value Iteration Networks (VINs) are effective differentiable path planning modules that can be used by agents to perform navigation while still maintaining end-to-end differentiability of the entire architecture. Despite their effectiveness, they suffer from several disadvantages including training instability, random …

2018-06-17abs ↗pdf ↗

This paper uses probability tensors for efficient path planning in complex scenarios.

problem Efficient path planning in complex environments with obstacles and multiple goals.
method Probability tensors are used to model agent motion and decision-making, incorporating past and future information.
result The model finds solutions in complex scenarios, demonstrating realistic emergent behaviors.

This research introduces an autonomous robot navigation method using reinforcement learning.

problem Improving robot navigation in complex environments.
method Deep Q Network (DQN) and Proximal Policy Optimization (PPO) models for path planning and decision-making.
result The models enhance robot navigation ability and adaptive learning in unknown environments.

The paper optimizes UAV path and power for QoS in cellular networks.

problem Optimizing UAV path and power for QoS in cellular networks.
method Apprenticeship learning via deep inverse reinforcement learning (IRL) combined with Q-learning and DRL.
result The proposed method achieves expert-level performance and maintains performance in unseen situations.

HiDe learns hierarchical control for complex tasks by separating planning and control.

problem Solving long horizon control tasks with generalization to unseen scenarios.
method Functional decomposition of state-action spaces, RL-based planner, modular transfer of policy layers.
result Generalizes across unseen test environments and scales to longer horizons.

Deep RL drone trained to compete against classical path planning in drone racing.

problem Optimizing long-term drone racing strategies using reinforcement learning.
method Used PPO algorithm on a simulated quadrotor in a racing environment created with AirSim.
result Deep RL agent outperformed classical path planning in drone racing competitions.

Generative model for high-dimensional categorical data using Gaussian-Dirichlet fields.

problem Efficiently modeling and predicting high-dimensional categorical data.
method Combines Dirichlet and Gaussian processes for spatio-temporal modeling.
result Model accurately approximates categorical data in unobserved locations.

Model place cells as spatial embeddings for efficient path planning and cognitive map construction.

problem Encoding spatial navigation in the hippocampus.
method Model place cells using spectral decomposition of multi-step random walk transition kernels, inducing sparsity and adjacency.
result Place cells encode spatial information through non-negativity and inner-product structure, forming a cognitive map.

Paper tackles efficient navigation in constrained environments using supervised and reinforcement learning.

problem Building learning agents that efficiently navigate in obstacle-cluttered environments.
method Synergistic use of supervised learning for path prediction and reinforcement learning for path following.
result Proposed method achieves good generalization and faster learning compared to existing work.

DiffSlack learns neural networks with nonlinear constraints via learnable slack variables.

problem Enforcing nonlinear inequality constraints in neural networks.
method DiffSlack reformulates inequalities as equalities with learnable slack variables, predicting them as part of the network output.
result DiffSlack achieves higher planning success rates and stronger geometric constraint satisfaction compared to existing methods.

We introduce the value iteration network (VIN): a fully differentiable neural network with a `planning module' embedded within. VINs can learn to plan, and are suitable for predicting outcomes that involve planning-based reasoning, such as policies for reinforcement learning. Key to our approach is a novel differentiab…

2016-02-09abs ↗pdf ↗

2D path planning in static environment is a well-known problem and one of the common ways to solve it is to 1) represent the environment as a grid and 2) perform a heuristic search for a path on it. At the same time 2D grid resembles much a digital image, thus an appealing idea comes to being -- to treat the problem as…

2019-08-05abs ↗pdf ↗

Learning and inference movement is a very challenging problem due to its high dimensionality and dependency to varied environments or tasks. In this paper, we propose an effective probabilistic method for learning and inference of basic movements. The motion planning problem is formulated as learning on a directed grap…

2018-05-18abs ↗pdf ↗

A number of recent approaches to policy learning in 2D game domains have been successful going directly from raw input images to actions. However when employed in complex 3D environments, they typically suffer from challenges related to partial observability, combinatorial exploration spaces, path planning, and a scarc…

2016-12-01abs ↗pdf ↗

New kinematic model for a spin-rolling sphere using Darboux frame.

problem Control and planning of an underactuated sphere on a plane.
method Darboux frame transformation to fully-actuated model.
result Underactuated sphere model transformed into fully-actuated model.

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.

This paper proposes grid cells encode position via a conformal isometric embedding of 2D physical space.

problem Hexagonal grid firing patterns in grid cells.
method Learning a distance-preserving position embedding in neural space using a recurrent neural network.
result The conformal isometric embedding of 2D physical space into neural space explains hexagonal grid firing patterns.

Active learning reduces simulation needs for high-fidelity mobility maps.

problem Efficiently training machine learning classifiers for high-fidelity mobility maps.
method Active learning based on PAC learning theory to reduce simulation needs.
result Our sampling algorithm trains neural networks with higher accuracy using less than half the number of simulations.

Generative ML learns optimal pursuit trajectories in pursuit-evasion games.

problem Optimizing Blue's pursuit trajectory to intercept Red in a game of pursuit-evasion.
method Applying generative machine learning to learn optimal action policies for Blue.
result Generative ML models can learn relevant representations for pursuit-evasion dynamics.

Global routing has been a historically challenging problem in electronic circuit design, where the challenge is to connect a large and arbitrary number of circuit components with wires without violating the design rules for the printed circuit boards or integrated circuits. Similar routing problems also exist in the de…

2019-06-20abs ↗pdf ↗