Skip to content
Conference

DA-MCTS: Deadline-Aware Action Exploration for Safe Real-Time Planning

Aug 2026 · IEEE International Conference on Embedded and Real-Time Computing Systems and Applications · pp. 30-40 · 1 citation · 28 references

Abstract

Real-time motion planning for autonomous racing must operate under strict computational deadlines while maintaining safe and reliable behavior. However, the quality and safety of planning algorithms depend heavily on the computational budget available on the deployment hardware. Policies tuned on powerful systems can become unsafe on resource-constrained platforms, where limited planning iterations leave aggressive actions insufficiently explored. While existing planning approaches may limit the size of their search space, they do not explicitly adapt the risk profile of sampled actions to the available relative deadline. These approaches overlook how limited computational resources leave aggressive actions insufficiently explored, thereby compromising safety. We present Deadline-Aware MCTS (DA-MCTS), which adapts action exploration in continuous-space MCTS according to the available relative deadline. Our approach partitions the action space into conservative, aggressive, and Gaussian prior sampling categories, and uses a neural network that maps runtime features to a probability distribution over these categories. This enables safe behavior under tight budgets, where sampling shifts toward conservative actions, and improved performance as additional compute becomes available. We further extend DA-MCTS with a friction-aware feature representation that allows the planner to adapt its behavior and generalize to previously unseen friction conditions. In F1TENTH racing simulations with varying maps, friction conditions, and deadlines, we demonstrate that DA-MCTS drives conservatively and collisionfree across a wide range of friction conditions under tight deadlines while achieving progressively faster lap times as deadlines increase. We further validate these results with F1TENTH hardware-in-the-loop experiments. Source code is available at https://github.com/scope-lab-vu/DA_MCTS_RTCSA_2026

View source

Similar papers

Conference Aug 2026

Demo: Deadline-Aware Real-Time Planning on F1TENTH

We demonstrate a complete, real-time autonomous racing stack that deploys Deadline-Aware Monte Carlo Tree Search (DA-MCTS) on physical F1TENTH hardware powered by an NVIDIA Jetson Orin Nano. DA-MCTS adapts the risk profile of its sampled actions to the compute budget available at runtime, letting a sampling-based plann...

Samir Gupta, Michael Yuhas, Qiao-Si Lei et al. · 0 citations
Preprint Sep 2026

Time-Efficient Iterative Learning Planning for Safety-Critical Dynamic Obstacle Avoidance

Autonomous mobile robots require timeefficient planning and safety-critical dynamic obstacle avoidance under constrained onboard computation. While Iterative Learning Planning (ILP) offers lightweight and efficient traversal planning, it lacks explicit mechanisms for dynamic obstacle perception and avoidance. This arti...

Zhi-Yi Chen, Shu-Li Lv, Chen Min et al. · 0 citations
#artificial intelligence Preprint Sep 2026

SlackDrive: Reclaiming Runtime Slack for Adaptive Driving Inference

SlackDrive is proposed, a pre-inference compute allocator that reuses realized latency to select the compute budget of each control step before model execution, complementing existing profiling and resource scheduling while preserving the driving backbone and its compute actuator.

Xiao-Huan Pei, Heng-Guang Zhou, Yuan-Hao Ban et al. · 0 citations
Conference Open access Sep 2026

Safety-Aware Shared Autonomy via World-Model Constrained Planning

World Model Assisted Safety Planning is proposed, a model-predictive shared autonomy framework for explicit safety constraint satisfaction that substantially reduces safety violations while preserving task performance and reducing unnecessary interventions over prior shared autonomy baselines.

Zecheng Shi, Jia-Wei Ye, Zeyang Liu et al. · 0 citations
#machine learning Preprint Sep 2026

Think Fast, Plan Selectively: Adaptive Deliberation for Efficient Data-Driven MPC

This work proposes Fast-TD-MPC, a lightweight framework that adaptively routes between fast policy execution and test-time planning, reserving costly deliberation for states where it is most needed, and delivers competitive task performance across 103 continuous control tasks while achieving up to ~4x faster inference.

Yi-Xian Goh, Sze-Jue Yang, Hao Luan · 0 citations
Open access Aug 2024

LSTP-Nav: Lightweight Spatiotemporal Policy for Map-Free Multi-Agent Navigation With LiDAR

This paper proposes LSTP-Nav, a lightweight, decentralized navigation framework built on LSTP-Net that maps stacked 2D LiDAR observations, goal information, and velocity feedback directly to action and introduces an HS reward to provide smooth, heading-aware safety feedback, and develops PhysReplay-SimLab to improve tr...

Xingrong Diao, Zhi-Qiang Sun, Jian-Wei Peng et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.