Fetching the paper…
Reading the bibliography…
Object rearrangement is a fundamental sub-task in accomplishing a great many physical tasks.
K. Gao, D. Lau, B. Huang, K. E. Bekris, and J. Yu, “Fast high-quality tabletop rearrangement in bounded workspace,” in
1967
Earlier work this paper cites.
R. E. Fikes and N. J. Nilsson, “Strips: A new approach to the application of theorem proving to problem solving,”
1971
Earlier work this paper cites.
R. Wang, Y. Miao, and K. E. Bekris, “Efficient and high-quality prehensile rearrangement in cluttered and confined spaces,” in
1975
Earlier work this paper cites.
T. De Fazio and D. Whitney, “Simplified generation of all mechanical assembly sequences,”
1987
Earlier work this paper cites.
L. H. De Mello and A. C. Sanderson, “A correct and complete algorithm for the generation of mechanical assembly sequences,” in
1989
Earlier work this paper cites.
——, “And/or graph representation of assembly plans,”
1990
Earlier work this paper cites.
R. H. Wilson and J.-C. Latombe, “Geometric reasoning about mechanical assembly,”
1994
Earlier work this paper cites.
C. Aeronautiques, A. Howe, C. Knoblock, I. D. McDermott, A. Ram, M. Veloso, D. Weld, D. W. SRI, A. Barrett, D. Christianson,
1998
Earlier work this paper cites.
S. J. Russell,
2010
Earlier work this paper cites.
P. Jiménez, “Survey on assembly sequencing: a combinatorial and geometrical perspective,”
2013
Earlier work this paper cites.
H. Dobashi, J. Hiraoka, T. Fukao, Y. Yokokohji, A. Noda, H. Nagano, T. Nagatani, H. Okuda, and K.-i. Tanaka, “Robust grasping strategy for assembling parts in various shapes,”
2014
Earlier work this paper cites.
M. McEvoy, E. Komendera, and N. Correll, “Assembly path planning for stable robotic construction,” in
2014
Earlier work this paper cites.
S. D. Han, N. M. Stiffler, A. Krontiris, K. E. Bekris, and J. Yu, “Complexity results and fast methods for optimal tabletop rearrangement with overhand grasps,”
2018
Earlier work this paper cites.
R. Shome, K. Solovey, J. Yu, D. Halperin, and K. Bekris, “Fast, high-quality dual-arm rearrangement in synchronous, monotone tabletop setups,” in
2018
Cited alongside, same era.
S. D. Han, N. M. Stiffler, K. E. Bekris, and J. Yu, “Efficient, high-quality stack rearrangement,”
2018
Cited alongside, same era.
W. Wan, K. Harada, and K. Nagata, “Assembly sequence planning for motion planning,”
2018
Cited alongside, same era.
E. Huang, Z. Jia, and M. T. Mason, “Large-scale multi-object rearrangement,” in
2019
Cited alongside, same era.
M. Dogar, A. Spielberg, S. Baker, and D. Rus, “Multi-robot grasp planning for sequential assembly operations,”
2019
Cited alongside, same era.
E. Coumans and Y. Bai, “Pybullet, a python module for physics simulation for games, robotics and machine learning,”
S. D. Han, B. Huang, S. Ding, C. Song, S. W. Feng, M. Xu, H. Lin, Q. Zou, A. Boularias, and J. Yu, “Toward fully automated metal recycling using computer vision and non-prehensile manipulation,” in
2021
Later among the works it cites.
B. Huang, S. D. Han, A. Boularias, and J. Yu, “DIPN: Deep Interaction Prediction Network with Application to Clutter Removal,” in
2021
Later among the works it cites.
M. Szegedy and J. Yu, “On rearrangement of items stored in stacks,” in
2021
Later among the works it cites.
2021
Later among the works it cites.
K. Gao and Jingjin, “Toward efficient task planning for dual-arm tabletop object rearrangement,” in
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
H. Song, J. A. Haustein, W. Yuan, K. Hang, M. Y. Wang, D. Kragic, and J. A. Stork, “Multi-object rearrangement with monte carlo tree search: A case study on planar nonprehensile sorting,” in
2020
Cited alongside, same era.
C. R. Garrett, T. Lozano-Pérez, and L. P. Kaelbling, “Pddlstream: Integrating symbolic planners and blackbox samplers via optimistic adaptive planning,” in
2020
Cited alongside, same era.
2020
Cited alongside, same era.
K. Gao, S. W. Feng, and J. Yu, “On minimizing the number of running buffers for tabletop rearrangement,” in
2021
Cited alongside, same era.
M. Danielczuk, A. Mousavian, C. Eppner, and D. Fox, “Object rearrangement using learned implicit collision functions,” in
2021
Cited alongside, same era.
A. Szot, A. Clegg, E. Undersander, E. Wijmans, Y. Zhao, J. Turner, N. Maestre, M. Mukadam, D. S. Chaplot, O. Maksymets,
2021
Cited alongside, same era.
R. Wang, K. Gao, J. Yu, and K. Bekris, “Lazy rearrangement planning in confined spaces,” vol. 32, no. 1, Jun. 2022, pp. 385–393. [Online]. Available:
2022
Later among the works it cites.
K. Wada, S. James, and A. J. Davison, “Reorientbot: Learning object reorientation for specific-posed placement,” in
2022
Later among the works it cites.
J. Gu, D. S. Chaplot, H. Su, and J. Malik, “Multi-skill mobile manipulation for object rearrangement,” in
2022
Later among the works it cites.
C. Gan, S. Zhou, J. Schwartz, S. Alter, A. Bhandwaldar, D. Gutfreund, D. L. Yamins, J. J. DiCarlo, J. McDermott, A. Torralba,
2022
Later among the works it cites.
K. Gao and J. Yu, “On the utility of buffers in pick-n-swap based lattice rearrangement,”
2022
Later among the works it cites.
K. Gao, S. W. Feng, B. Huang, and J. Yu, “Minimizing running buffers for tabletop object rearrangement: Complexity, fast algorithms, and applications,”
2023
Closest in time.
V. N. Hartmann, A. Orthey, D. Driess, O. S. Oguz, and M. Toussaint, “Long-horizon multi-robot rearrangement planning for construction assembly,”
2023
Closest in time.