PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
September 1, 2014162 citationsOpen Access

A constraint-based method for solving sequential manipulation planning problems

View Full Paper
TLTomás Lozano‐PérezLKLeslie Pack Kaelbling

Key Points

Key points are not available for this paper at this time.

Abstract

In this paper, we describe a strategy for integrated task and motion planning based on performing a symbolic search for a sequence of high-level operations, such as pick, move and place, while postponing geometric decisions. Partial plans (skeletons) in this search thus pose a geometric constraint-satisfaction problem (CSP), involving sequences of placements and paths for the robot, and grasps and locations of objects. We propose a formulation for these problems in a discretized configuration space for the robot. The resulting problems can be solved using existing methods for discrete CSP.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Lozano‐Pérez et al. (2014) studied this question.

synapsesocial.com/papers/6a10afe639dd87f6d0ee2e9bhttps://doi.org/10.1109/iros.2014.6943079
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Increasing tree search efficiency for constraint satisfaction problems1980 · 1,118 citations
  2. 2HANDEY: A Robot Task Planner1992 · 51 citations
  3. 3A geometrical approach to planning manipulation tasks. The case of discrete placements and grasps1990 · 79 citations