.png){kind=icon}
返回
Learning-Based Path Planning Under Co-Safe Temporal Logic Specifications
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3257185.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a path planning algorithm for efficiently generating low-cost trajectories that meet mission requirements specified in Linear Time Logic (LTL), where cost functions are defined throughout the configuration space. The main idea of the paper is to increase efficiency by adding learning-based extensions to sampling-based path planning algorithms. The proposed method includes two layers: a high-level layer that determines how to expand the search tree to satisfy logical specifications and a low-level layer that extends the search tree to search for low-cost trajectories. To efficiently find low-cost trajectories, it is learned how to extend the search tree from the data via deep learning. By leveraging the conditional variational autoencoder, we learn the ideal search tree extension distribution in a given situation, which increases solution search efficiency. Simulations show that the proposed method finds a low-cost trajectory while meeting a given mission specification. Furthermore, it is confirmed that the proposed approach performs better than the existing methods.
Keyword:
Trajectory
Path planning
Costs
Planning
Automata
Heuristic algorithms
Cost function
formal methods
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
A Hybrid Multi-Target Path Planning Algorithm for Unmanned Cruise Ship in an Unknown Obstacle Environment未知障碍物环境下无人巡航船的混合多目标路径规划算法.png)
SENSORS
OAAI
SENSORSIF3.5
OAAI分享收藏
查看更多内容