This paper describes and evaluates the use of Generative Adversarial Networks (GANs) for path planning in support of smart mobility applications such as indoor and outdoor navigation applications, individualized wayfinding for people with disabilities (e.g., vision impairments, physical disabilities, etc.), path planni…
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
48 results for “navigation paths”
Proposes a novel path generation and evaluation method for video games.
problem Generating and evaluating realistic navigation paths for video games.
method Combines nonparametric model-free transformations and copula models.
result Demonstrates precise and interpretable generation of diverse navigation paths.
New algorithms solve time-dependent navigation problems, including zig-zag paths.
problem Finding optimal paths in moving water with varying speed profiles.
method Lorentz-Finsler geometry, novel computational algorithms.
result Optimal paths may involve zig-zag trajectories due to tacking behavior.
Study optimal paths in Zermelo's navigation problem using geometric equations.
problem Optimal control paths in Zermelo's navigation problem.
method Geometric and differential equations approach to obtain precise ODE system.
result Obtained precise equations for optimal trajectories.
A pedestrian path-planning model in accordance with obstacle's danger with reinforcement learningcs.LG
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 …
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.
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.
Study examines how wind affects shortest paths on Finsler manifolds.
problem Investigating shortest paths in Finsler manifolds with wind effects.
method Coordinate-free approach to compare isoparametric functions and mean curvatures.
result Mean curvatures differ in presence and absence of wind on Finsler manifolds.
Agent learns to navigate uncertain 3D maps using a hybrid planner.
problem Planning in 3D environments with uncertain topological maps.
method Hierarchical strategy combining graph planner and local policy, data-driven learning with neural network.
result Machine learning can overcome missing information in probabilistic topological maps.
We present a novel human-aware navigation approach, where the robot learns to mimic humans to navigate safely in crowds. The presented model, referred to as DeepMoTIon, is trained with pedestrian surveillance data to predict human velocity in the environment. The robot processes LiDAR scans via the trained network to n…
Place Cells as Multi-Scale Position Embeddings: Random Walk Transition Kernels for Path Planningq-bio.NC
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.
We consider remodeling the planar search patterns, in the presence of the river-type perturbation represented by the weak vector field, basing on the time-optimal paths as Finslerian solutions to the Zermelo navigation problem via Randers metric.
We consider the problem of path inference: given a path prefix, i.e., a partially observed sequence of nodes in a graph, we want to predict which nodes are in the missing suffix. In particular, we focus on natural paths occurring as a by-product of the interaction of an agent with a network---a driver on the transporta…
MFM improves generative model interpolations by learning approximate geodesics on data manifolds.
problem Straight interpolations fail to capture dynamics on data manifolds.
method Metric Flow Matching (MFM) learns approximate geodesics by minimizing kinetic energy of a data-induced Riemannian metric.
result MFM outperforms Euclidean baselines, achieving SOTA on single-cell trajectory prediction.
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.
Extended Predictable Feature Analysis (PFAx) [Richthofer and Wiskott, 2017] is an extension of PFA [Richthofer and Wiskott, 2015] that allows generating a goal-directed control signal of an agent whose dynamics has previously been learned during a training phase in an unsupervised manner. PFAx hardly requires assumptio…
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.
We consider the Zermelo navigation problem on the ellipsoid of revolution (spheroid) in the presence of a perturbation determined by a mild velocity vector field, , with application of Finsler metric of Randers type in the context of the corresponding optimal control represented by a time-efficient ship's he…
Adaptive learning, also known as adaptive teaching, relies on learning path recommendation, which sequentially recommends personalized learning items (e.g., lectures, exercises) to satisfy the unique needs of each learner. Although it is well known that modeling the cognitive structure including knowledge level of lear…
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 …
Modern navigation services often provide multiple paths connecting the same source and destination for users to select. Hence, ranking such paths becomes increasingly important, which directly affects the service quality. We present PathRank, a data-driven framework for ranking paths based on historical trajectories us…
Study presents a low-cost local motion planner for vineyard navigation.
problem Autonomous navigation in vineyards with limited resources.
method RGB-D camera, dual layer control algorithm, deep learning synergy.
result Robust motion planning for vineyard navigation achieved.
Paper optimizes urban navigation with deep learning models.
problem Real-time urban pathfinding challenges.
method Enhanced A* algorithm and neural network model.
result Neural network model outperforms traditional methods, reducing travel times by up to 40%.
GH-PID uses guided harmonic paths for efficient SOT with interpretable diagnostics.
problem Efficiently solving Stochastic Optimal Transport with hard terminal distributions and soft costs.
method Guided Harmonic Path-Integral Diffusion (GH-PID) framework with low-dimensional guidance.
result GH-PID generates geometry-aware, cost-reducing trajectories that match terminal distributions.
CARML uses meta-learning to avoid obstacles in 2D vehicle navigation.
problem Collision avoidance in 2D vehicle navigation.
method Model-Agnostic Meta-Learning for multi-objective reinforcement learning.
result CARML outperforms a baseline TD3 solution in obstacle avoidance.
We investigate the multi-step prediction of the drivable space, represented by Occupancy Grid Maps (OGMs), for autonomous vehicles. Our motivation is that accurate multi-step prediction of the drivable space can efficiently improve path planning and navigation resulting in safe, comfortable and optimum paths in autonom…
Introduces a natural parallel translation for navigation data.
problem Navigation data geometric representation and parallelism.
method Introduces a natural parallel translation using Riemannian parallelism.
result The natural parallel translation preserves the Randers norm and has a finite-dimensional holonomy group.
Challenge to separate Earth's magnetic field from vehicle's magnetic field for accurate navigation.
problem Separate Earth's magnetic field from vehicle's magnetic field for accurate magnetic navigation.
method Use machine learning (ML) and integrate physics of magnetic navigation (SciML) to remove aircraft magnetic field from total magnetic field.
result A model can be constructed to effectively remove aircraft magnetic field from the dataset.
HRL4IN: Hierarchical Reinforcement Learning for Interactive Navigation with Mobile Manipulatorscs.LG
Most common navigation tasks in human environments require auxiliary arm interactions, e.g. opening doors, pressing buttons and pushing obstacles away. This type of navigation tasks, which we call Interactive Navigation, requires the use of mobile manipulators: mobile bases with manipulation capabilities. Interactive N…
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.
Navigation in Lorentz Finsler geometry induces isoparametric hypersurfaces.
problem Defining and analyzing isoparametric hypersurfaces in Lorentz Finsler geometry.
method Using a navigation process with a Finsler metric and a tangent vector field, isoparametric functions and hypersurfaces are defined and analyzed.
result Local correspondences between isoparametric functions and hypersurfaces are established.
The paper solves navigation problems on conic Kropina manifolds and establishes curvature relationships.
problem Navigation problems on conic Kropina manifolds.
method Analyzes the solution of navigation problems and establishes curvature relationships.
result The solution to navigation problems on conic Kropina manifolds must be either a Randers metric or a Kropina metric.
Robotic navigation improves with RL and ultrasound images.
problem Improving accuracy in robotic navigation for ultrasound-guided procedures.
method Combines deep Q-networks with ultrasound images and binary classifier.
result Significantly improved navigation accuracy compared to pure RL and SL.
Improved robot navigation using multi-head attention for natural language instructions.
problem Improving robot navigation in unfamiliar environments.
method Proposes a multi-head attention mechanism blending layer in a neural network model.
result Significant performance gains in translating instructions for unseen environments.
The problem of pursuing a moving target is always one of the main topics in navigation. In the literatures, there are two well-known algorithms called Pure Pursuit and Pure Rendezvous navigation in the 3-dimensional space . In this paper, these two methods are combined to introduce a novel family of pursu…
Mobile robot navigation in complex and dynamic environments is a challenging but important problem. Reinforcement learning approaches fail to solve these tasks efficiently due to reward sparsities, temporal complexities and high-dimensionality of sensorimotor spaces which are inherent in such problems. We present a nov…
SLAM-net learns to navigate visually in challenging indoor environments.
problem Challenges in SLAM for visual robot navigation, especially in noisy conditions.
method Differentiable SLAM Network (SLAM-net) that encodes a particle filter SLAM algorithm in a differentiable graph and learns components through backpropagation.
result Significantly outperforms ORB-SLAM in noisy conditions and improves the Habitat Challenge 2020 PointNav task.
Improves AI agents' 3D navigation by learning from failures and 3D spatial relationships.
problem Challenges in data efficiency, obstacle avoidance, and generalization in 3D visual navigation.
method Incorporates attention on 3D spatial relationships and a target skill extension module into DRL framework.
result Significantly improves navigation performance and generalization across targets and scenes.
Bayesian model for energy consumption helps electric vehicles navigate efficiently.
problem Limited battery capacity in electric vehicles makes energy efficient navigation challenging.
method Developed an online learning framework using Bayesian models and exploration strategies like Thompson Sampling.
result Established rigorous regret bounds for Thompson Sampling in both single-agent and multi-agent settings.
This work analyzes minimum-time navigation on Riemannian manifolds using Finsler geometry.
problem Minimum-time navigation on Riemannian manifolds.
method Finsler geometry, introducing superwind concept, extending -metrics.
result Time-minimizing geodesics and necessary/sufficient conditions for strong convexity.
Deep learning agent improves pedestrian navigation in urban environments.
problem Autonomous driving among pedestrians in urban areas.
method Multi-objective deep reinforcement learning using a deep Q-learning variant.
result The multi-objective DQN agent outperforms single-objective DQN in various environments.
Bayesian model for energy-efficient EV navigation.
problem Limited battery capacity in electric vehicles.
method Bayesian modeling and online learning framework with exploration strategies.
result Established rigorous regret bounds for Thompson Sampling.
Solves time-minimizing navigation on a mountain slope using Riemann-Finsler geometry.
problem Time-minimizing navigation on a mountain slope under gravity.
method Riemann-Finsler geometry, Zermelo navigation problem, anisotropic deformation of the background Riemannian metric, rescaled gravitational wind.
result A new Finsler metric for optimal navigation on slippery mountain slopes.
Deep reinforcement learning (RL) has been successfully applied to a variety of game-like environments. However, the application of deep RL to visual navigation with realistic environments is a challenging task. We propose a novel learning architecture capable of navigating an agent, e.g. a mobile robot, to a target giv…
The paper develops a method to learn navigation costs from expert demonstrations in partially observable environments.
problem Learning navigation costs from expert demonstrations in partially observable environments.
method Develops a cost function representation composed of a probabilistic occupancy encoder and a cost encoder, optimized by differentiating the error between demonstrated controls and a control policy computed from the cost encoder.
result The method outperforms baseline IRL algorithms in robot navigation tasks, improving both training and test-time efficiency.
VALAN is a lightweight and scalable software framework for deep reinforcement learning based on the SEED RL architecture. The framework facilitates the development and evaluation of embodied agents for solving grounded language understanding tasks, such as Vision-and-Language Navigation and Vision-and-Dialog Navigation…
OtoWorld helps agents learn to navigate by listening in interactive environments.
problem Training agents to navigate using auditory information.
method Interactive environment with agents learning to listen and navigate.
result Agents can win at OtoWorld, a navigation game with sound sources.
Paper introduces timing-based adversarial attacks on DRL-based navigation systems.
problem Vulnerability of DRL-based navigation systems to adversarial attacks.
method Timing-based adversarial strategies using physical noise patterns.
result Adversarial timing attacks significantly degrade DRL-based navigation performance.