2015 IEEE International Conference on Robotics and Automation (ICRA) 2015
DOI: 10.1109/icra.2015.7139619
|View full text |Cite
|
Sign up to set email alerts
|

Extending the Knowledge of Volumes approach to robot task planning with efficient geometric predicates

Abstract: Abstract-For robots to solve hard tasks in real-world manufacturing and service contexts, they need to reason about both symbolic and geometric preconditions, and the effects of complex actions. We use an existing Knowledge of Volumes approach to robot task planning (KVP), which facilitates hybrid planning with symbolic actions and continuous-valued robot and object motion, and make two important additions to this approach: (i) new geometric predicates are added for complex object manipulation planning, and (i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
3
3
2

Relationship

2
6

Authors

Journals

citations
Cited by 14 publications
(9 citation statements)
references
References 14 publications
(25 reference statements)
0
9
0
Order By: Relevance
“…Altogether it features 15 degrees-of-freedom, but we will only plan for the torso and the arm, resulting in a 10-dimensional configuration space for the robot. While we show a detailed CAD model for visualization purposes, our collision detection routine utilizes a bounding convex decomposition for efficiency [17], [18]. In this scenario, the robot acts as a bartender and is supposed to clean up the workspace by aligning all three bottles on the lower support surface (Figure 1a).…”
Section: Discussionmentioning
confidence: 99%
“…Altogether it features 15 degrees-of-freedom, but we will only plan for the torso and the arm, resulting in a 10-dimensional configuration space for the robot. While we show a detailed CAD model for visualization purposes, our collision detection routine utilizes a bounding convex decomposition for efficiency [17], [18]. In this scenario, the robot acts as a bartender and is supposed to clean up the workspace by aligning all three bottles on the lower support surface (Figure 1a).…”
Section: Discussionmentioning
confidence: 99%
“…Rather than following greedy heuristics that cannot solve every case, a combined task and motion planner was developed to search in the full space of discrete actions and motion paths to solve generic pick-and-place tasks [26,27]. The integrated planner can start from an arbitrary world state, such as one where random bottles have been placed on a bar table by human interaction partners.…”
Section: Task and Motion Planning For Interactive Manipulationmentioning
confidence: 99%
“…As an example, when a customer has placed an empty bottle on the right side of the bar table, only one arm can pick it up, but it needs to put it down in the common workspace where the other arm can reach it to transfer it to the empty bottle storage region [27]. To allow concise definition of scenarios and goal conditions, predicates to model support surfaces and the inclusion relation are also available [26]. The search takes a few seconds for scenarios with four objects and two arms, with most of the time spent on collision checking.…”
Section: Task and Motion Planning For Interactive Manipulationmentioning
confidence: 99%
“…Path planning algorithms are essential for the accomplishment of many activities in different areas, for example, robot navigation [1], path apps for locomotion in cities (for pedestrian and driver) [2], autonomous-driver cars [3]. These algorithms have different approaches to treat spatial information, the most used in the literature are, Grid-based search (which transforms the environment in a grid-mesh) [4], Intervalbased search (similar to grid-based search it but uses space data instead of a grid) [5] and Reward-based (similar to a reinforcement learning in deep learning) [6].…”
Section: Introductionmentioning
confidence: 99%