A Task-Motion Planning Framework Using Iteratively Deepened AND/OR Graph Networks
We present an approach for Task-Motion Planning (TMP) using Iterative Deepened AND/OR Graph Networks (TMP-IDAN) that uses an AND/OR graph network based novel abstraction for compactly representing the task-level states and actions. While retrieving a target object from clutter, the number of object re-arrangements required to grasp the target is not known ahead of time. To address this challenge, in contrast to traditional AND/OR graph-based planners, we grow the AND/OR graph online until the target grasp is feasible and thereby obtain a network of AND/OR graphs. The AND/OR graph network allows faster computations than traditional task planners. We validate our approach and evaluate its capabilities using a Baxter robot and a state-of-the-art robotics simulator in several challenging non-trivial cluttered table-top scenarios. The experiments show that our approach is readily scalable to increasing number of objects and different degrees of clutter.
Code (0)
등록된 구현이 없습니다.
Tasks
Motion PlanningSimilar Papers 제목 키워드 기반
A Task and Motion Planning Framework Using Iteratively Deepened AND/OR Graph Networks
In this paper, we present an approach for integrated task and motion planning based on an AND/OR graph network, which is used to represent task-level states and actions, and we leverage it to implement different classes …
Motion PlanningTask and Motion PlanningLLM3:Large Language Model-based Task and Motion Planning with Motion Failure Reasoning
Conventional Task and Motion Planning (TAMP) approaches rely on manually crafted interfaces connecting symbolic task planning with continuous motion generation. These domain-specific and labor-intensive modules are limit…
Language ModelingLanguage ModellingLarge Language ModelMotion Generation+3Integrating Task-Motion Planning with Reinforcement Learning for Robust Decision Making in Mobile Robots
Task-motion planning (TMP) addresses the problem of efficiently generating executable and low-cost task plans in a discrete space such that the (initially unknown) action costs are determined by motion plans in a corresp…
Decision MakingMotion PlanningReinforcement LearningReinforcement Learning (RL)+2A Framework for Task and Motion Planning based on Expanding AND/OR Graphs
Robot autonomy in space environments presents unique challenges, including high perception and motion uncertainty, strict kinematic constraints, and limited opportunities for human intervention. Therefore, Task and Motio…
Motion PlanningReducing Collision Checking for Sampling-Based Motion Planning Using Graph Neural Networks
Sampling-based motion planning is a popular approach in robotics for finding paths in continuous configuration spaces. Checking collision with obstacles is the major computational bottleneck in this process. We propose n…
Motion Planning