Admissible Abstractions for Near-optimal Task and Motion Planning
원문 초록
We define an admissibility condition for abstractions expressed using angelic semantics and show that these conditions allow us to accelerate planning while preserving the ability to find the optimal motion plan. We then derive admissible abstractions for two motion planning domains with continuous state. We extract upper and lower bounds on the cost of concrete motion plans using local metric and topological properties of the problem domain. These bounds guide the search for a plan while maintaining performance guarantees. We show that abstraction can dramatically reduce the complexity of search relative to a direct motion planner. Using our abstractions, we find near-optimal motion plans in planning problems involving $10^{13}$ states without using a separate task planner.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Prime the search: Using large language models for guiding geometric task and motion planning by warm-starting tree search
Interpretable Responsibility Sharing as a Heuristic for Task and Motion Planning
Temporal and Semantic Evaluation Metrics for Foundation Models in Post-Hoc Analysis of Robotic Sub-tasks
LLM3:Large Language Model-based Task and Motion Planning with Motion Failure Reasoning
Language-Grounded Hierarchical Planning and Execution with Multi-Robot 3D Scene Graphs
Understanding Physical Properties of Unseen Deformable Objects by Leveraging Large Language Models and Robot Actions
토론
이 논문과 연결된 포럼 글이 아직 없습니다.