Safe learning-based optimal motion planning for automated driving
원문 초록
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 solution was still guaranteed since dynamic obstacles can only increase the cost. However, significant variations in the search efficiency are observed depending whether dynamic obstacles are present or not. This paper introduces machine learning (ML) based heuristic that takes into account dynamic obstacles, thus adding to the performance consistency for achieving real-time implementation.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Dashing for the Golden Snitch: Multi-Drone Time-Optimal Motion Planning with Multi-Agent Reinforcement Learning
Mixed Bernstein-Fourier Approximants for Optimal Trajectory Generation with Periodic Behavior
Epona: Autoregressive Diffusion World Model for Autonomous Driving
Re4MPC: Reactive Nonlinear MPC for Multi-model Motion Planning via Deep Reinforcement Learning
Prime the search: Using large language models for guiding geometric task and motion planning by warm-starting tree search
RefAV: Towards Planning-Centric Scenario Mining
토론
이 논문과 연결된 포럼 글이 아직 없습니다.