The DOI matches its Crossref record.
Manipulation Planning Among Movable Obstacles
Abstract
This paper presents the resolve spatial constraints (RSC) algorithm for manipulation planning in a domain with movable obstacles. Empirically we show that our algorithm quickly generates plans for simulated articulated robots in a highly nonlinear search space of exponential dimension. RSC is a reverse-time search that samples future robot actions and constrains the space of prior object displacements. To optimize the efficiency of RSC, we identify methods for sampling object surfaces and generating connecting paths between grasps and placements. In addition to experimental analysis of RSC, this paper looks into object placements and task-space motion constraints among other unique features of the three dimensional manipulation planning domain.
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
Incremental Sampling-based Algorithms for Optimal Motion Planning
Karaman, S., & Frazzoli, E. (2010) · Robotics: Science and Systems VI · doi:10.15607/rss.2010.vi.034 · Cited by 680
Hierarchical task and motion planning in the now
Kaelbling, L. P., & Lozano-Perez, T. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980391 · Cited by 467
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
Task Space Regions: A framework for pose-constrained manipulation planning
Berenson, D., Srinivasa, S., & Kuffner, J. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364910396389 · Cited by 368
Self-citationRearrangement: A Challenge for Embodied AI
Batra, D., Chang, A. X., Chernova, S., Davison, A. J., Deng, J., Koltun, V., Levine, S., Malik, J., Mordatch, I., Mottaghi, R., et al. (2020) · arXiv · doi:10.48550/arxiv.2011.01975 · Cited by 109
“In the task and motion planning literature, there has been a rich body of work on ‘rearrangement planning’ [6, 16, 18, 21, 41, 42, 45, 63, 64, 66], the problem of searching for a sequence of actions that transform an initial configu-ration of objects into some goal configuration.”
BackgroundWeihs, L., Deitke, M., Kembhavi, A., & Mottaghi, R. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.00586 · Cited by 98
“Rearrangement Planning is an established field in robotics research where the goal is to reach a goal state from an initial state [5, 44, 27, 31, 53, 33].”
BackgroundManipulaTHOR: A Framework for Visual Object Manipulation
Ehsani, K., Han, W., Herrasti, A., VanderBilt, E., Weihs, L., Kolve, E., Kembhavi, A., & Mottaghi, R. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.00447 · Cited by 81
“A long-standing problem in robotics research is object manipulation [12, 4, 5, 31, 39, 6, 9, 21, 10].”
BackgroundYuan, W., Hang, K., Kragic, D., Wang, M. Y., & Stork, J. A. (2019) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2019.06.007 · Cited by 54
Error-Aware Imitation Learning from Teleoperation Data for Mobile Manipulation
Wong, J., Tung, A., Kurenkov, A., Mandlekar, A., Fei-Fei, L., Savarese, S., & Martín-Martín, R. (2021) · arXiv · doi:10.48550/arxiv.2112.05251 · Cited by 19
Gan, C., Zhou, S., Schwartz, J., Alter, S., Bhandwaldar, A., Gutfreund, D., Yamins, D. L. K., DiCarlo, J. J., McDermott, J., Torralba, A., et al. (2021) · arXiv · doi:10.48550/arxiv.2103.14025 · Cited by 13
Metadata
- Authors
- Stilman, M., Schamburek, J.-U., Kuffner, J., & Asfour, T.
- Venue
- Proceedings 2007 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2007-04
- Pages
- 3327-3332
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W1989604857
- Cited by
- 242
- References
- 0
- FWCI
- 7.12
- Type
- conference paper
- Language
- en
- Open access
- closed
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
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.