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

18365371 · Jun 202019922001200920172026
48 results for Real-time Planning

This paper proposes a real-time signal plan recommendation system for traffic incidents.

problem Limited effectiveness of traffic incident management due to late response and workload.
method Decomposes recommendation task into real-time traffic prediction and plan association, learning from historical data and metric learning.
result Precision score of 96.75% and recall of 87.5% on testing plan, with 22.5 minutes lead time ahead of Waze alerts.

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 ↗

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.

Model learns and plans in real-time under constraints for robotic systems.

problem Challenges in applying reinforcement learning to robotic systems, especially handling continuous state and action spaces, time/resource budget, and hard constraints.
method Combines Gaussian Process regression and Receding Horizon Control. Uses sparse spectrum Gaussian Processes for incremental model updates from sensory data.
result Demonstrates benefits of online learning on autonomous racing tasks and reusability of learned dynamics.

LAD-BNet improves real-time energy forecasting on edge devices.

problem Real-time energy forecasting on edge devices for smart grid optimization and intelligent buildings.
method Hybrid neural architecture combining temporal lag exploitation and TCN with dilated convolutions.
result 14.49% MAPE at 1-hour horizon with 18ms inference time on Edge TPU, 8-12x faster than CPU.

Paper proposes a risk-averse approach to energy storage price arbitrage using conformal uncertainty quantification.

problem Inherent volatility and uncertainty of real-time electricity prices create financial risks for storage arbitrage.
method Two-layer prediction model with conformal uncertainty quantification for high coverage of real-time price uncertainty.
result The framework achieves good profit margins with minimal losses, demonstrating effectiveness in real-time market.

Generative AI agents improve ERP systems by automating complex financial tasks.

problem Static, rule-based workflows limit adaptability and intelligence in ERP systems.
method Introducing Generative Business Process AI Agents (GBPAs) that integrate generative AI with business process modeling and multi-agent orchestration.
result GBPAs achieve up to 40% reduction in processing time and 94% drop in error rate.

In this paper, we propose a novel Reinforcement Learning approach for solving the Active Information Acquisition problem, which requires an agent to choose a sequence of actions in order to acquire information about a process of interest using on-board sensors. The classic challenges in the information acquisition prob…

2019-10-23abs ↗pdf ↗

Real Time Dynamic Programming (RTDP) is an online algorithm based on Dynamic Programming (DP) that acts by 1-step greedy planning. Unlike DP, RTDP does not require access to the entire state space, i.e., it explicitly handles the exploration. This fact makes RTDP particularly appealing when the state space is large and…

2019-09-10abs ↗pdf ↗

Potential violent criminals will often need to go through a sequence of preparatory steps before they can execute their plans. During this escalation process police have the opportunity to evaluate the threat posed by such people through what they know, observe and learn from intelligence reports about their activities…

2019-07-03abs ↗pdf ↗

GO-CBED optimizes experiments for specific causal queries, improving efficiency.

problem Efficiently infer causal relationships with limited resources.
method Goal-oriented Bayesian framework that maximizes expected information gain on user-specified causal quantities.
result GO-CBED outperforms existing methods in various causal tasks, especially with limited budgets.

We propose the application of a high-speed maximum likelihood clustering algorithm to detect temporal financial market states, using correlation matrices estimated from intraday market microstructure features. We first determine the ex-ante intraday temporal cluster configurations to identify market states, and then st…

2015-08-20abs ↗pdf ↗

Spatial and visual connectivity are important metrics when developing workplace layouts. Calculating those metrics in real-time can be difficult, depending on the size of the floor plan being analysed and the resolution of the analyses. This paper investigates the possibility of considerably speeding up the outcomes of…

2019-12-29abs ↗pdf ↗

The vision for precision medicine is to use individual patient characteristics to inform a personalized treatment plan that leads to the best healthcare possible for each patient. Mobile technologies have an important role to play in this vision as they offer a means to monitor a patient's health status in real-time an…

2016-11-10abs ↗pdf ↗

We study an adaptive source seeking problem, in which a mobile robot must identify the strongest emitter(s) of a signal in an environment with background emissions. Background signals may be highly heterogeneous and can mislead algorithms that are based on receding horizon control. We propose AdaSearch, a general algor…

2018-09-27abs ↗pdf ↗

Study integrates reliability constraints into generation planning models.

problem Challenges in integrating reliability constraints with generation planning models.
method Leverages a weighted oblique decision tree (WODT) technique to embed reliability verification constraints.
result Demonstrates effectiveness in achieving reliable and optimal planning solutions.

We present a unified method, based on convex optimization, for managing the power produced and consumed by a network of devices over time. We start with the simple setting of optimizing power flows in a static network, and then proceed to the case of optimizing dynamic power flows, i.e., power flows that change with ti…

2019-03-14abs ↗pdf ↗

New approach improves black-box planning efficiency by discovering focused macros.

problem Difficulty of deterministic planning increases exponentially with depth.
method Discovering macro-actions with focused effects to improve goal-count heuristics.
result Focused macros dramatically improve black-box planning efficiency.

This work improves autonomous racing by creating diverse opponents and adapting risk.

problem Balancing performance and safety in autonomous racing environments.
method Developed a self-play method using replica-exchange Markov chain Monte Carlo for diverse opponents and a distributionally robust bandit optimization for adaptive risk adjustment.
result Demonstrated real-time motion-planning methods achieving speeds comparable to Formula One racecars.

Selective planning with imperfect models reduces harmful effects of model inadequacy.

problem Harmful effects of using an imperfect model in reinforcement learning.
method Selective planning with heteroscedastic regression to estimate predictive uncertainty from model inadequacy.
result Effective selective planning requires considering both parameter uncertainty and model inadequacy.

This article asks how planning scholarship may effectively gain impact in planning practice through media exposure. In liberal democracies the public sphere is dominated by mass media. Therefore, working with such media is a prerequisite for effective public impact of planning research. Using the example of megaproject…

2013-04-05abs ↗pdf ↗

We introduce Dynamic Planning Networks (DPN), a novel architecture for deep reinforcement learning, that combines model-based and model-free aspects for online planning. Our architecture learns to dynamically construct plans using a learned state-transition model by selecting and traversing between simulated states and…

2018-12-28abs ↗pdf ↗

A planning approach learns skills from interactions, balancing exploration and exploitation.

problem Learning robust high-level skills in noisy environments with unknown pre-conditions.
method Formulates skills as high-level policies, learns plans via bandit problems, balances exploration and exploitation.
result A planner capable of learning robust high-level skills in high-dimensional state spaces.

Fast and efficient motion planning algorithms are crucial for many state-of-the-art robotics applications such as self-driving cars. Existing motion planning methods become ineffective as their computational complexity increases exponentially with the dimensionality of the motion planning problem. To address this issue…

2018-06-14abs ↗pdf ↗

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.

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 ↗

This research optimizes energy consumption forecasting in Puno using parallel computing and ARIMA models.

problem Improving energy consumption forecasting accuracy and efficiency in Puno.
method Parallel computing and ARIMA models for forecasting energy consumption.
result Notable improvements in computational efficiency and data processing capabilities.