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

2.5%5.0%7.5%10.0% · May 199519922001200920172026
48 results for Trajectory Planning

CoTj improves diffusion model quality and stability via graph planning.

problem Rigidity in diffusion models due to high-dimensional state space.
method Chain-of-Trajectories (CoTj) framework using Diffusion DNA for graph planning.
result CoTj discovers context-aware trajectories improving output quality and stability.

This work tackles long-term visual planning by goal-conditioned hierarchical predictors.

problem Current learning approaches fail on long-horizon tasks due to lack of goal information and coarse-to-fine planning.
method Formulate goal-conditioned predictors (GCPs) and hierarchical models to predict trajectories between observations.
result GCPs enable effective long-term planning with much longer horizons than before.

We study control systems invariant under a Lie group with application to the problem of nonlinear trajectory planning. A theory of symmetry reduction of exterior differential systems is employed to demonstrate how symmetry reduction and reconstruction is effective in the explicit, exact construction of planned system t…

2015-10-20abs ↗pdf ↗

PBCS combines RL and motion planning for better exploration.

problem RL algorithms struggle with versatile exploration in complex environments.
method PBCS uses motion planning to find a good trajectory, then trains RL on a curriculum derived from it.
result PBCS outperforms state-of-the-art RL algorithms in 2D maze environments.

In recent years, deep generative models have been shown to 'imagine' convincing high-dimensional observations such as images, audio, and even video, learning directly from raw data. In this work, we ask how to imagine goal-directed visual plans -- a plausible sequence of observations that transition a dynamical system …

2018-07-24abs ↗pdf ↗

A key challenge in complex visuomotor control is learning abstract representations that are effective for specifying goals, planning, and generalization. To this end, we introduce universal planning networks (UPN). UPNs embed differentiable planning within a goal-directed policy. This planning computation unrolls a for…

2018-04-02abs ↗pdf ↗

PlanGAN uses GANs to plan efficient trajectories for multi-goal tasks in sparse reward environments.

problem Learning with sparse rewards in multi-goal environments.
method PlanGAN combines GANs to generate trajectories leading to specified goals, then combines these into a planning algorithm.
result PlanGAN achieves comparable performance to model-free RL but is 4-8 times more sample efficient.

New method for predicting paths of unpredictable objects with high confidence.

problem Need for dependable uncertainty estimates in motion planning with diverse unpredictable objects.
method Blend online conformal prediction, multiple time series techniques, and heteroscedasticity addressing.
result Simultaneous forecasting bands that cover entire paths with high probability.

Develops a method to plan exploration that learns strong policies with fewer samples.

problem Lack of efficient exploration in reinforcement learning for real-world tasks.
method Plans an action sequence that maximizes information gain about the optimal trajectory.
result 2x fewer samples than exploration baselines and 200x fewer than model-free methods.

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.

New method learns state embeddings from demonstrations for improved reinforcement learning.

problem Difficult relationship between observed state and useful policy actions in dynamic problems.
method Variational framework for learning state embeddings that optimize trajectory linearity.
result Learning embedding spaces improves policy gradient reinforcement learning performance.

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.

This work improves motion planning for quadcopters by learning and reasoning about controller performance.

problem Improving motion planning for quadcopters with safety margins and execution reliability.
method Introspective learning and reasoning to correct execution bias and improve collision checking.
result Substantial reduction in safety margins for motion actions, leading to safer execution.

End-to-end learnable network for safer self-driving with interpretable intermediate representations.

problem Safe motion planning for self-driving vehicles.
method Differentiable semantic occupancy representation for cost calculation in motion planning.
result Significantly outperforms state-of-the-art planners in imitating human behaviors and producing safer trajectories.

Trajectory optimization using a learned model of the environment is one of the core elements of model-based reinforcement learning. This procedure often suffers from exploiting inaccuracies of the learned model. We propose to regularize trajectory optimization by means of a denoising autoencoder that is trained on the …

2019-03-28abs ↗pdf ↗

This paper surveys DRL for autonomous vehicle motion planning.

problem Designing intelligent motion planning for autonomous vehicles.
method Deep Reinforcement Learning (DRL) for hierarchical motion planning.
result Survey of state-of-the-art DRL solutions for autonomous vehicle motion planning.

Paper uses deep imitation learning to predict aircraft trajectories accurately.

problem Inefficient and costly Air Traffic Management system limits predictability.
method Generative Adversarial Imitation Learning framework with trajectory clustering and classification.
result Accurate predictions for entire trajectory stages, pre- and tactical.

This work provides safety guarantees for iterative GP predictions.

problem Analytical intractability of uncertainty tracking in iterative GP predictions.
method Deriving formal probability error bounds for iterative GP predictions.
result Formal bounds ensure that GP trajectories lie within specified regions with high probability.

Imitation Learning (IL) is an appealing approach to learn desirable autonomous behavior. However, directing IL to achieve arbitrary goals is difficult. In contrast, planning-based algorithms use dynamics models and reward functions to achieve goals. Yet, reward functions that evoke desirable behavior are often difficul…

2018-10-15abs ↗pdf ↗

A new neural network captures and explains trajectory patterns.

problem Analyzing complex spatial trajectories in urban planning and neuroscience.
method Composite Signal Neural Networks (CompSNN) combining three interpretable ANN modules.
result CompSNN outperforms individual modules and visualizes useful signal parts.

CEM-GD combines CEM and gradient descent for efficient model-based RL.

problem Efficient planning in continuous control settings with large prediction horizons.
method Combines CEM for exploration and gradient descent for exploitation.
result Achieves better performance with fewer samples and less computation time.

We introduce a method for learning the dynamics of complex nonlinear systems based on deep generative models over temporal segments of states and actions. Unlike dynamics models that operate over individual discrete timesteps, we learn the distribution over future state trajectories conditioned on past state, past acti…

2017-03-12abs ↗pdf ↗

This work improves AI's ability to solve physical tasks by optimizing world models in abstracted spaces.

problem Developing AI agents capable of solving diverse physical tasks and generalizing to new environments.
method Investigates and optimizes a family of joint-embedding predictive world models (JEPA-WMs) for efficient planning in abstracted spaces.
result Proposes a model that outperforms two established baselines in both navigation and manipulation tasks.

Vanguard uses AI to create personalized financial plans.

problem Challenges in choosing features for complex financial planning.
method Reinforcement learning for identifying optimal savings rates.
result Trains algorithms to model financial success trajectories.

This research enhances exploration in DDPG using latent trajectory optimization.

problem Limited exploration in DDPG with deterministic policies.
method Model-based trajectory optimization for exploration in DDPG, using a learned deep dynamics model.
result Improved performance in continuous control tasks, especially with sparse rewards and images.

Proposes a CNN-based method for better trajectory owner prediction.

problem Improves trajectory owner prediction for better personalized recommendations and urban planning.
method Connects POIs in a graph, encodes POIs into vectors, transforms trajectories into matrices, and uses a CNN to detect features and predict owners.
result Significantly outperforms existing methods in various metrics.