Fast High-Quality Tabletop Rearrangement in Bounded Workspace

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.

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.

R. Bohlin and L. E. Kavraki, “Path planning using lazy prm,” in Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No. 00CH37065) , vol. 1. IEEE, 2000, pp. 521–528

2000

Earlier work this paper cites.

K. Okada, A. Haneda, H. Nakai, M. Inaba, and H. Inoue, “Environment manipulation planner for humanoid robots using task graph that generates action sequence,” in 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)(IEEE Cat. No. 04CH37566) , vol. 2. IEEE, 2004, pp. 1174–1179

2004

Earlier work this paper cites.

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

Earlier work this paper cites.

S. Bereg and A. Dumitrescu, “The lifting model for reconfiguration,” Discrete & Computational Geometry , vol. 35, no. 4, pp. 653–669, 2006

2006

Earlier work this paper cites.

M. Stilman, K. Nishiwaki, S. Kagami, and J. J. Kuffner, “Planning and executing navigation among movable obstacles,” Advanced Robotics , vol. 21, no. 14, pp. 1617–1634, 2007

2007

Earlier work this paper cites.

M. Stilman and J. Kuffner, “Planning among movable obstacles with artificial constraints,” The International Journal of Robotics Research , vol. 27, no. 11-12, pp. 1295–1307, 2008

2008

Earlier work this paper cites.

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

Earlier work this paper cites.

N. Chernov, Y. Stoyan, and T. Romanova, “Mathematical model and efficient algorithms for object packing problem,” Computational Geometry , vol. 43, no. 5, pp. 535–553, 2010

2010

Cited alongside, same era.

A. Cosgun, T. Hermans, V. Emeli, and M. Stilman, “Push planning for object placement on cluttered table surfaces,” in 2011 IEEE/RSJ international conference on intelligent robots and systems . IEEE, 2011, pp. 4627–4632

2011

Cited alongside, same era.

M. Levihn, J. Scholz, and M. Stilman, “Hierarchical decision theoretic planning for navigation among movable obstacles,” in Algorithmic Foundations of Robotics X . Springer, 2013, pp. 19–35

2013

Cited alongside, same era.

J. Denny, K. Shi, and N. M. Amato, “Lazy toggle prm: A single-query approach to motion planning,” in 2013 IEEE International Conference on Robotics and Automation . IEEE, 2013, pp. 2407–2414

2013

Cited alongside, same era.

C. Nam, J. Lee, Y. Cho, J. Lee, D. H. Kim, and C. Kim, “Planning for target retrieval using a robotic manipulator in cluttered and occluded environments,” arXiv preprint arXiv:1907.03956 , 2019

Original

2019

Later among the works it cites.

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

Later among the works it cites.

F. Wang and K. Hauser, “Robot packing with known items and nondeterministic arrival order,” IEEE Transactions on Automation Science and Engineering , 2020

2020

Later among the works it cites.

S. H. Cheong, B. Y. Cho, J. Lee, C. Kim, and C. Nam, “Where to relocate?: Object rearrangement inside cluttered and confined environments for robotic manipulation,” in 2020 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2020, pp. 7791–7797

2020