LTL制約とテキストプロンプトを統合した階層的サンプリングベースプランナ
Hierarchical Sampling-based Planner with LTL Constraints and Text Prompting
自然言語指示をLTL式に変換し、地図を領域分割した階層プランニングでRRTやPRMと組み合わせ、安全制約を守りながら逐次目標を達成するロボット経路計画手法を提案した。
著者: Jingzhan Ge, Zi-Hao Zhang, Sheng-En Huang
分類: cs.RO, cs.SY, eess.SY
原文アブストラクト
This project introduces a hierarchical planner integrating Linear Temporal Logic (LTL) constraints with natural language prompting for robot motion planning. The framework decomposes maps into regions, generates directed graphs, and converts them into transition systems for high-level planning. Text instructions are translated into LTL formulas and converted to Deterministic Finite Automata (DFA) for sequential goal-reaching tasks while adhering to safety constraints. High-level plans, derived via Breadth-First Search (BFS), guide low-level planners like Exploring Random Trees (RRT) and Probabilistic Roadmaps (PRM) for obstacle-avoidant navigation along with LTL tasks. The approach demonstrates adaptability to various task complexities, though challenges such as graph construction overhead and suboptimal path generation remain. Future directions include extending to considering terrain conditions and incorporating higher-order dynamics.
