Speeding Up Path Planning via Reinforcement Learning in MCTS for Automated Parking

2024-03-25 · Xinlong Zheng, Xiaozhou Zhang, Donghao Xu

In this paper, we address a method that integrates reinforcement learning into the Monte Carlo tree search to boost online path planning under fully observable environments for automated parking tasks. Sampling-based planning methods under high-dimensional space can be computationally expensive and time-consuming. State evaluation methods are useful by leveraging the prior knowledge into the search steps, making the process faster in a real-time system. Given the fact that automated parking tasks are often executed under complex environments, a solid but lightweight heuristic guidance is challenging to compose in a traditional analytical way. To overcome this limitation, we propose a reinforcement learning pipeline with a Monte Carlo tree search under the path planning framework. By iteratively learning the value of a state and the best action among samples from its previous cycle's outcomes, we are able to model a value estimator and a policy generator for given states. By doing that, we build up a balancing mechanism between exploration and exploitation, speeding up the path planning process while maintaining its quality without using human expert driver data.

📄 PDF Abstract BibTeX arXiv:2403.17234

Code (0)

등록된 구현이 없습니다.

Tasks

reinforcement-learning Reinforcement Learning

Proposing Hierarchical Goal-Conditioned Policy Planning in Multi-Goal Reinforcement Learning

2025-01-03 · Gavin B. Rens

Humanoid robots must master numerous tasks with sparse rewards, posing a challenge for reinforcement learning (RL). We propose a method combining RL and automated planning to address this. Our approach uses short goal-co…

Multi-Goal Reinforcement Learning Reinforcement Learning (RL)

ACDZero: MCTS Agent for Mastering Automated Cyber Defense

2026-01-05 · Yu Li, Sizhe Tang, Rongqian Chen, Fei Xu Yu 외 arxiv

Automated cyber defense (ACD) seeks to protect computer networks with minimal or no human intervention, reacting to intrusions by taking corrective actions such as isolating hosts, resetting services, deploying decoys, o…

Reinforcement Learning Decision Making

C-MCTS: Safe Planning with Monte Carlo Tree Search

2023-05-25 · Dinesh Parthasarathy, Georgios Kontes, Axel Plinge, Christopher Mutschler

The Constrained Markov Decision Process (CMDP) formulation allows to solve safety-critical decision making tasks that are subject to constraints. While CMDPs have been extensively studied in the Reinforcement Learning li…

Decision Making

Monte-Carlo Tree Search for Multi-Agent Pathfinding: Preliminary Results

2023-07-25 · Yelisey Pitanov, Alexey Skrynnik, Anton Andreychuk, Konstantin Yakovlev 외

In this work we study a well-known and challenging problem of Multi-agent Pathfinding, when a set of agents is confined to a graph, each agent is assigned a unique start and goal vertices and the task is to find a set of…

Heuristic Search

Task-Completion Dialogue Policy Learning via Monte Carlo Tree Search with Dueling Network

2020-11-01 · EMNLP 2020 11 · Sihan Wang, Kaijie Zhou, Kunfeng Lai, Jianping Shen

We introduce a framework of Monte Carlo Tree Search with Double-q Dueling network (MCTS-DDU) for task-completion dialogue policy learning. Different from the previous deep model-based reinforcement learning methods, whic…

Model-based Reinforcement Learning reinforcement-learning Reinforcement Learning (RL)Task-Completion Dialogue Policy Learning