Dealing with Difficult Instances of Object Rearrangement
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Rearranging multiple objects is a critical skill for robots so that they can effectively deal with clutter in human spaces.This is a challenging problem as it involves combinatorially large, continuous C-spaces involving multiple movable bodies and complex kinematic constraints.This work initially revisits an existing search-based approach, which solves monotone challenges, i.e., when objects need to be grasped only once so as to be rearranged.The first contribution is the extension of this technique to a method that addresses many non-monotone challenges.The second contribution is the use of either the monotone or of the new non-monotone method as a local planner in the context of a higher-level task planner that searches the space of object placements and which provides stronger guarantees.The paper aims to emphasize the benefit of using more powerful motion primitives in the context of task planning for object rearrangement than an individual pick-andplace.Experiments in simulation using a model of a Baxter robot arm show the capability of solving difficult instances of rearrangement problems and evaluate the methods in terms of success ratio, running time, scalability and path quality.
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
Cites
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
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
Cited by
Analysis and Observations From the First Amazon Picking Challenge
Correll, N., Bekris, K. E., Berenson, D., Brock, O., Causo, A., Hauser, K., Okada, K., Rodriguez, A., Romano, J. M., & Wurman, P. R. (2018) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2016.2600527 · Cited by 425
“…their poor ability to manipulate an object; this capability was not prominent in the APC so far, however future contests are expected to have more populated bins that may require more flexible manipulation and object rearrangement [37], or a more explicit exploitation of the environment [38], [39].”
BackgroundSelf-citationIntegrated 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
A dataset for improved RGBD-based object detection and pose estimation for warehouse pick-and-place
Rennie, C., Shome, R., Bekris, K. E., & De Souza, A. F. (2016) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2016.2532924 · Cited by 182
Self-citationWeihs, 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
“…performance, they consider complete observability of the state from perfect visual perception [11, 27], a planar surface as the environment [30, 42], a static robot [15, 32], same environment for evaluation of generalization [39, 26], or a limited set of object categories or limited…”
Background
Metadata
- Authors
- Krontiris, A., & Bekris, K.
- Venue
- Robotics: Science and Systems XI
- Published
- 2015-07-13
- OpenAlex
- W2293698677
- Cited by
- 112
- References
- 3
- FWCI
- 9.38
- Type
- conference paper
- Language
- en
- Open access
- gold
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: Dealing with Difficult Instances of Object Rearrangement. https://app.cochat.ai/papers/10.15607/rss.2015.xi.045
- The paper
- Krontiris, A., & Bekris, K. (2015). Dealing with Difficult Instances of Object Rearrangement. Robotics: Science and Systems XI. https://doi.org/10.15607/rss.2015.xi.045
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.