A constraint-based method for solving sequential manipulation planning problems
Open accessThe DOI matches its Crossref record.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Integrated Task and Motion Planning
Garrett, C. R., Chitnis, R., Holladay, R., Kim, B., Silver, T., Kaelbling, L. P., & Lozano-Pérez, T. (2021) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-091420-084139 · Cited by 409
Self-citationAutomatic assembly planning based on digital product descriptions
Sierla, S., Kyrki, V., Aarnio, P., & Vyatkin, V. (2018) · Computers in Industry · doi:10.1016/j.compind.2018.01.013 · Cited by 95
“The planning is often hierarchical such that the geometric decisions are postponed (e.g. [61]).”
BackgroundMPTP: Motion-Planning-Aware Task Planning for Navigation in Belief Space
Thomas, A., Mastrogiovanni, F., & Baglietto, M. (2021) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2021.103786 · Cited by 21
“Kaelbling and Lozano-Péres [17] propose a hierarchical approach that tightly integrates logical and geometric planning.”
Background
Metadata
- Authors
- Lozano-Perez, T., & Kaelbling, L. P.
- Venue
- 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems
- Publisher
- IEEE
- Published
- 2014-09
- Pages
- 3684-3691
- OpenAlex
- W2031738727
- Cited by
- 161
- References
- 0
- FWCI
- 6.13
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A constraint-based method for solving sequential manipulation planning problems. https://app.cochat.ai/papers/10.1109/iros.2014.6943079
- The paper
- Lozano-Perez, T., & Kaelbling, L. P. (2014). A constraint-based method for solving sequential manipulation planning problems. 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems. https://doi.org/10.1109/iros.2014.6943079
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.