Fetching the paper…
Reading the bibliography…
We investigate the utility of employing multiple buffers in solving a class of rearrangement problems with pick-n-swap manipulation primitives.
S. W. Golomb, “Random permutations,” Bulletin of the American Mathematical Society , vol. 70, p. 747, 1964
1964
Earlier work this paper cites.
B. Carlisle, K. Goldberg, A. Rao, and J. Wiegley, “A pivoting gripper for feeding industrial parts,” in Proceedings of the 1994 IEEE International Conference on Robotics and Automation . IEEE, 1994, pp. 1650–1655
1994
Earlier work this paper cites.
A. Caprara, H. Kellerer, and U. Pferschy, “The multiple subset sum problem,” SIAM Journal on Optimization , vol. 11, no. 2, pp. 308–319, 2000
2000
Earlier work this paper cites.
A. Gál and P. B. Miltersen, “The cell probe complexity of succinct data structures,” in International Colloquium on Automata, Languages, and Programming . Springer, 2003, pp. 332–344
2003
Earlier work this paper cites.
M. Grunow, H.-O. Günther, M. Schleusener, and I. O. Yilmaz, “Operations planning for collect-and-place machines in pcb assembly,” Computers & Industrial Engineering , vol. 47, no. 4, pp. 409–429, 2004
2004
Earlier work this paper cites.
J. Luo and J. Liu, “An milp model and clustering heuristics for led assembly optimisation on high-speed hybrid pick-and-place machines,” International Journal of Production Research , vol. 52, no. 4, pp. 1016–1031, 2014
2014
Earlier work this paper cites.
A. Krontiris and K. E. Bekris, “Dealing with difficult instances of object rearrangement.” in Robotics: Science and Systems , vol. 1123, 2015
2015
Earlier work this paper cites.
——, “Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner,” in 2016 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2016, pp. 3924–3931
2016
Earlier work this paper cites.
M. Moghaddam and S. Y. Nof, “Parallelism of pick-and-place operations by multi-gripper robotic arms,” Robotics and Computer-Integrated Manufacturing , vol. 42, pp. 135–146, 2016
2016
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,” The International Journal of Robotics Research , vol. 37, no. 13-14, pp. 1775–1795, 2018
2018
Earlier work this paper cites.
R. Shome, K. Solovey, J. Yu, K. Bekris, and D. Halperin, “Fast, high-quality dual-arm rearrangement in synchronous, monotone tabletop setups,” in International Workshop on the Algorithmic Foundations of Robotics . Springer, 2018, pp. 778–795
2018
Cited alongside, same era.
J. Lee, Y. Cho, C. Nam, J. Park, and C. Kim, “Efficient obstacle rearrangement for object manipulation tasks in cluttered environments,” in 2019 International Conference on Robotics and Automation (ICRA) . IEEE, 2019, pp. 183–189
2019
Cited alongside, same era.
E. Huang, Z. Jia, and M. T. Mason, “Large-scale multi-object rearrangement,” in 2019 International Conference on Robotics and Automation (ICRA) . IEEE, 2019, pp. 211–218
2019
Cited alongside, same era.
S. D. Han, S. W. Feng, and J. Yu, “Toward fast and optimal robotic pick-and-place on a moving conveyor,” IEEE Robotics and Automation Letters , vol. 5, no. 2, pp. 446–453, 2019
2019
Cited alongside, same era.
M. Danielczuk, A. Mousavian, C. Eppner, and D. Fox, “Object rearrangement using learned implicit collision functions,” in 2021 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2021, pp. 6010–6017
2021
Later among the works it cites.
R. Wang, K. Gao, D. Nakhimovich, J. Yu, and K. E. Bekris, “Uniform object rearrangement: From complete monotone primitives to efficient non-monotone informed search,” in 2021 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2021, pp. 6621–6627
2021
Later among the works it cites.
S. Han, B. Huang, C. Song, S. W. Feng, M. Xu, A. Boularias, and J. Yu, “Toward fully automated metal recycling using computer vision and non-prehensile manipulation,” in Proceedings of the 17th IEEE International Conference on Automation Science and Engineering , 2021
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Szegedy and J. Yu, “On rearrangement of items stored in stacks,” in International Workshop on the Algorithmic Foundations of Robotics . Springer, 2020, pp. 518–533
2020
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 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2020, pp. 9433–9440
2020
Cited alongside, same era.
Y. Labbé, S. Zagoruyko, I. Kalevatykh, I. Laptev, J. Carpentier, M. Aubry, and J. Sivic, “Monte-carlo tree search for efficient visually guided rearrangement planning,” IEEE Robotics and Automation Letters , vol. 5, no. 2, pp. 3715–3722, 2020
2020
Cited alongside, same era.
J. Yu, “Rearrangement on lattices with pic-n-swaps: Optimality structures and efficient algorithms,” in Robotics: Sciences and Systems , 2021
2021
Cited alongside, same era.
2021
Cited alongside, same era.
A. Zeng, P. Florence, J. Tompson, S. Welker, J. Chien, M. Attarian, T. Armstrong, I. Krasin, D. Duong, V. Sindhwani, et al. , “Transporter networks: Rearranging the visual world for robotic manipulation,” in Conference on Robot Learning . PMLR, 2021, pp. 726–747
2021
Cited alongside, same era.
2021
Later among the works it cites.
B. Huang, S. D. Han, J. Yu, and A. Boularias, “Visual foresight trees for object retrieval from clutter with nonprehensile rearrangement,” IEEE Robotics and Automation Letters , vol. 7, no. 1, pp. 231–238, 2021
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 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2021, pp. 4694–4701
2021
Later among the works it cites.
K. Gao, S. W. Feng, and J. Yu, “On minimizing the number of running buffers for tabletop rearrangement,” in Robotics: Sciences and Systems , 2021
2021
Later among the works it cites.
2022
Closest in time.
2022
Closest in time.