Fetching the paper…
Reading the bibliography…
For tabletop rearrangement problems with overhand grasps, storage space outside the tabletop workspace, or buffers, can temporarily hold objects which greatly facilitates the resolution of a given rearrangement task.
R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of computer computations . Springer, 1972, pp. 85–103
1972
Earlier work this paper cites.
D. Adolphson and T. C. Hu, “Optimal linear ordering,” SIAM Journal on Applied Mathematics , vol. 25, no. 3, pp. 403–423, 1973
1973
Earlier work this paper cites.
M. R. Garey, D. S. Johnson, and L. Stockmeyer, “Some simplified np-complete problems,” in Proceedings of the sixth annual ACM symposium on Theory of computing , 1974, pp. 47–63
1974
Earlier work this paper cites.
C. H. Papadimitriou, “The np-completeness of the bandwidth minimization problem,” Computing , vol. 16, no. 3, pp. 263–270, 1976
1976
Earlier work this paper cites.
C. H. Papadimitriou, “The euclidean travelling salesman problem is np-complete,” Theoretical computer science , vol. 4, no. 3, pp. 237–244, 1977
1977
Earlier work this paper cites.
F. Gavril, “Some np-complete problems on graphs,” John Hopkins University, Baltimore, MD, 1977, pp. 91–95
1977
Earlier work this paper cites.
M. R. Garey and D. S. Johnson, “Vertex ordering,” in Computers and Intractability: a Guide to The Theory of NP-Completeness , 1979, pp. 199–201
1979
Earlier work this paper cites.
R. J. Lipton and R. E. Tarjan, “A separator theorem for planar graphs,” SIAM Journal on Applied Mathematics , vol. 36, no. 2, pp. 177–189, 1979
1979
Earlier work this paper cites.
Y. Shiloach, “A minimum linear arrangement algorithm for undirected trees,” SIAM Journal on Computing , vol. 8, no. 1, pp. 15–32, 1979
1979
Earlier work this paper cites.
J. E. Hopcroft, J. T. Schwartz, and M. Sharir, “On the complexity of motion planning for multiple independent objects; pspace-hardness of the ‘warehouseman’s problem’,” The International Journal of Robotics Research , vol. 3, no. 4, pp. 76–88, 1984
1984
Earlier work this paper cites.
J. R. Gilbert, J. P. Hutchinson, and R. E. Tarjan, “A separator theorem for graphs of bounded genus,” Journal of Algorithms , vol. 5, no. 3, pp. 391–407, 1984
1984
Earlier work this paper cites.
L. M. Kirousis and C. H. Papadimitriou, “Searching and pebbling,” Theoretical Computer Science , vol. 47, pp. 205–218, 1986
1986
Earlier work this paper cites.
R. H. Taylor, M. T. Mason, and K. Y. Goldberg, “Sensor-based manipulation planning as a game with nature,” in Fourth International Symposium on Robotics Research , 1987, pp. 421–429
1987
Earlier work this paper cites.
M. R. Fellows and M. A. Langston, “On search decision and the efficiency of polynomial-time algorithms,” in Proceedings of the twenty-first annual ACM symposium on Theory of computing , 1989, pp. 501–512
1989
Earlier work this paper cites.
N. Alon, P. Seymour, and R. Thomas, “A separator theorem for graphs with an excluded minor and its applications,” in Proceedings of the twenty-second annual ACM symposium on Theory of computing , 1990, pp. 293–299
1990
Earlier work this paper cites.
G. Wilfong, “Motion planning in the presence of movable obstacles,” Annals of Mathematics and Artificial Intelligence , vol. 3, no. 1, pp. 131–150, 1991
1991
Earlier work this paper cites.
N. G. Kinnersley, “The vertex separation number of a graph equals its path-width,” Information Processing Letters , vol. 42, no. 6, pp. 345–350, 1992
1992
Earlier work this paper cites.
K. Y. Goldberg, “Orienting polygonal parts without sensors,” Algorithmica , vol. 10, no. 2, pp. 201–225, 1993
1993
Earlier work this paper cites.
H. L. Bodlaender, J. R. Gilbert, H. Hafsteinsson, and T. Kloks, “Approximating treewidth, pathwidth, frontsize, and shortest elimination tree,” Journal of Algorithms , vol. 18, no. 2, pp. 238–255, 1995
1995
Earlier work this paper cites.
U. Elsner, Graph partitioning-a survey . Techn. Univ., 1997
1997
Earlier work this paper cites.
O. Ben-Shahar and E. Rivlin, “Practical pushing planning for rearrangement tasks,” IEEE Transactions on Robotics and Automation , vol. 14, no. 4, pp. 549–565, 1998
1998
Cited alongside, same era.
K. M. Lynch and M. T. Mason, “Dynamic nonprehensile manipulation: Controllability, planning, and experiments,” The International Journal of Robotics Research , vol. 18, no. 1, pp. 64–92, 1999
1999
Cited alongside, same era.
J. Díaz, J. Petit, and M. Serna, “A survey of graph layout problems,” ACM Computing Surveys (CSUR) , vol. 34, no. 3, pp. 313–356, 2002
2002
Cited alongside, same era.
M. Stilman and J. J. Kuffner, “Navigation among movable obstacles: Real-time reasoning in complex environments,” International Journal of Humanoid Robotics , vol. 2, no. 04, pp. 479–503, 2005
2005
Cited alongside, same era.
S. Bereg and A. Dumitrescu, “The lifting model for reconfiguration,” Discrete & Computational Geometry , vol. 35, no. 4, pp. 653–669, 2006
M. Gualtieri, A. Ten Pas, K. Saenko, and R. Platt, “High precision grasp pose detection in dense clutter,” in 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2016, pp. 598–605
2016
Later among the works it cites.
J. E. King, M. Cognetti, and S. S. Srinivasa, “Rearrangement planning using object-centric and robot-centric action spaces,” in 2016 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2016, pp. 3940–3947
2016
Later among the works it cites.
S. Levine, C. Finn, T. Darrell, and P. Abbeel, “End-to-end training of deep visuomotor policies,” The Journal of Machine Learning Research , vol. 17, no. 1, pp. 1334–1373, 2016
2016
Later among the works it cites.
M. Laskey, J. Lee, C. Chuck, D. Gealy, W. Hsieh, F. T. Pokorny, A. D. Dragan, and K. Goldberg, “Robot grasping in clutter: Using a hierarchy of supervisors for learning from demonstrations,” in 2016 IEEE International Conference on Automation Science and Engineering (CASE) . IEEE, 2016, pp. 827–834
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
M. Stilman, J.-U. Schamburek, J. Kuffner, and T. Asfour, “Manipulation planning among movable obstacles,” in Proceedings 2007 IEEE international conference on robotics and automation . IEEE, 2007, pp. 3327–3332
2007
Cited alongside, same era.
A. Saxena, J. Driemeyer, and A. Y. Ng, “Robotic grasping of novel objects using vision,” The International Journal of Robotics Research , vol. 27, no. 2, pp. 157–173, 2008
2008
Cited alongside, same era.
J. van Den Berg, J. Snoeyink, M. C. Lin, and D. Manocha, “Centralized path planning for multiple robots: Optimal decoupling into sequential plans.” in Robotics: Science and systems , vol. 2, no. 2.5, 2009, pp. 2–3
2009
Cited alongside, same era.
M. Dogar and S. Srinivasa, “A framework for push-grasping in clutter,” Robotics: Science and systems VII , vol. 1, 2011
2011
Cited alongside, same era.
L. P. Kaelbling and T. Lozano-Pérez, “Hierarchical task and motion planning in the now,” in 2011 IEEE International Conference on Robotics and Automation . IEEE, 2011, pp. 1470–1477
2011
Cited alongside, same era.
T.-h. Shin, H. Oh, and S. Ha, “Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph,” in 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011) . IEEE, 2011, pp. 165–170
2011
Cited alongside, same era.
L. Chang, J. R. Smith, and D. Fox, “Interactive singulation of objects from a pile,” in 2012 IEEE International Conference on Robotics and Automation . IEEE, 2012, pp. 3875–3882
2012
Cited alongside, same era.
2016
Later among the works it cites.
C. Mitash, K. E. Bekris, and A. Boularias, “A self-supervised learning system for object detection using physics simulation and multi-view pose estimation,” in 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2017, pp. 545–551
2017
Later among the works it cites.
2017
Later among the works it 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
Later among the works it cites.
Y. Xiang, T. Schmidt, V. Narayanan, and D. Fox, “Posecnn: A convolutional neural network for 6d object pose estimation in cluttered scenes,” in Robotics: Science and Systems , 2018
2018
Later among the works it cites.
A. Zeng, S. Song, K.-T. Yu, E. Donlon, F. R. Hogan, M. Bauza, D. Ma, O. Taylor, M. Liu, E. Romo, et al. , “Robotic pick-and-place of novel objects in clutter with multi-affordance grasping and cross-domain image matching,” in 2018 IEEE international conference on robotics and automation (ICRA) . IEEE, 2018, pp. 3750–3757
2018
Later among the works it cites.
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
Later among the works it cites.
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
Later among the works it cites.
A. M. Wells, N. T. Dantam, A. Shrivastava, and L. E. Kavraki, “Learning feasibility for task and motion planning in tabletop environments,” IEEE robotics and automation letters , vol. 4, no. 2, pp. 1255–1262, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
A. Eitel, N. Hauff, and W. Burgard, “Learning to singulate objects using a push proposal network,” in Robotics research . Springer, 2020, pp. 405–419
2020
Later among the works it cites.
2021
Closest in time.
L. Gurobi Optimization, “Gurobi optimizer reference manual,” 2021. [Online]. Available: http://www.gurobi.com
2021
Closest in time.