Learning to guide task and motion planning using score-space representation
원문 초록
In this paper, we propose a learning algorithm that speeds up the search in task and motion planning problems. Our algorithm proposes solutions to three different challenges that arise in learning to improve planning efficiency: what to predict, how to represent a planning problem instance, and how to transfer knowledge from one problem instance to another. We propose a method that predicts constraints on the search space based on a generic representation of a planning problem instance, called score-space, where we represent a problem instance in terms of the performance of a set of solutions attempted so far. Using this representation, we transfer knowledge, in the form of constraints, from previous problems based on the similarity in score space. We design a sequential algorithm that efficiently predicts these constraints, and evaluate it in three different challenging task and motion planning problems. Results indicate that our approach performs orders of magnitudes faster than an unguided 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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.