Fetching the paper…
Reading the bibliography…
Prehensile object rearrangement in cluttered and confined spaces has broad applications but is also challenging.
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.
P. C. Chen and Y. K. Hwang, “Practical path planning among movable obstacles,” Sandia National Labs., Albuquerque, NM (USA), Tech. Rep., 1990
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.
K. M. Lynch, “Estimating the friction parameters of pushed objects,” in Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS’93) , vol. 1. IEEE, 1993, pp. 186–193
1993
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
Earlier work this paper cites.
J. Ota, “Rearrangement planning of multiple movable objects by using real-time search methodology,” in Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No. 02CH37292) , vol. 1. IEEE, 2002, pp. 947–953
2002
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, 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
Earlier work this paper cites.
D. Nieuwenhuisen, A. F. van der Stappen, and M. H. Overmars, “An effective framework for path planning amidst movable obstacles,” in Algorithmic Foundation of Robotics VII . Springer, 2008, pp. 87–102
2008
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, M. Stilman, J. Kuffner, M. Lin, and D. Manocha, “Path planning among movable obstacles: a probabilistically complete approach,” in Algorithmic Foundation of Robotics VIII . Springer, 2009, pp. 599–614
2009
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.
Y. Kakiuchi, R. Ueda, K. Kobayashi, K. Okada, and M. Inaba, “Working with movable obstacles using on-line environment perception reconstruction using active sensing and color range sensor,” in 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems . IEEE, 2010, pp. 1696–1701
2010
Earlier work this paper cites.
H.-n. Wu, M. Levihn, and M. Stilman, “Navigation among movable obstacles in unknown environments,” in 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems . IEEE, 2010, pp. 1433–1438
2010
Earlier work this paper cites.
L. Kaelbling and T. Lozano-Perez, “Hierarchical task and motion planning inthe now,” in Proceedings of the IEEE International Conference on Robotics and Automation, ICRA , 2010
2010
Earlier work this paper cites.
M. R. Dogar and S. S. Srinivasa, “A planning framework for non-prehensile manipulation under clutter and uncertainty,” Autonomous Robots , vol. 33, no. 3, pp. 217–236, 2012
2012
Earlier work this paper cites.
M. Levihn, M. Stilman, and H. Christensen, “Locally optimal navigation among movable obstacles in unknown environments,” in 2014 IEEE-RAS International Conference on Humanoid Robots . IEEE, 2014, pp. 86–91
2014
Cited alongside, same era.
G. Havur, G. Ozbilgin, E. Erdem, and V. Patoglu, “Geometric rearrangement of multiple movable objects on cluttered surfaces: A hybrid reasoning approach,” in 2014 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2014, pp. 445–452
2014
Cited alongside, same era.
K. Hauser, “The minimum constraint removal problem with three robotics applications,” The International Journal of Robotics Research , vol. 33, no. 1, pp. 5–17, 2014
2014
Cited alongside, same era.
M. R. Dogar, M. C. Koval, A. Tallavajhula, and S. S. Srinivasa, “Object search by manipulation,” Autonomous Robots , vol. 36, no. 1, pp. 153–167, 2014
2014
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 Proceedings of the International Conference on Automated Planning and Scheduling , vol. 30, 2020, pp. 440–448
2020
Later among the works it cites.
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
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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
——, “Dealing with difficult instances of object rearrangement.” in Robotics: Science and Systems , 2015
2015
Cited alongside, same era.
M. C. Koval, J. E. King, N. S. Pollard, and S. S. Srinivasa, “Robust trajectory selection for rearrangement planning as a multi-armed bandit problem,” in 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2015, pp. 2678–2685
2015
Cited alongside, same era.
A. Krontiris and K. E. Bekris, “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
Cited alongside, same era.
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
Cited alongside, same era.
W. Yuan, J. A. Stork, D. Kragic, M. Y. Wang, and K. Hang, “Rearrangement with nonprehensile manipulation using deep reinforcement learning,” in 2018 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2018, pp. 270–277
2018
Cited alongside, same era.
A. S. Anders, L. P. Kaelbling, and T. Lozano-Perez, “Reliably arranging objects in uncertain domains,” in 2018 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2018, pp. 1603–1610
2018
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.
A. R. Dabbour, “Placement generation and hybrid planning for robotic rearrangement on cluttered surfaces,” Ph.D. dissertation, 2019
2019
Cited alongside, same era.
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
Later among the works it cites.
R. Wang, C. Mitash, S. Lu, D. Boehm, and K. E. Bekris, “Safe and effective picking paths in clutter given discrete distributions of object poses,” in 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2020, pp. 5715–5721
2020
Later among the works it cites.
2020
Later among the works it cites.
B. Wen, C. Mitash, S. Soorian, A. Kimmel, A. Sintov, and K. E. Bekris, “Robust, occlusion-aware pose estimation for objects grasped by adaptive hands,” in 2020 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2020, pp. 6210–6217
2020
Later among the works it cites.
2020
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 IEEE International Conference on Robotics and Automation , 2021
2021
Closest in time.
R. Shome, K. Solovey, J. Yu, K. Bekris, and D. Halperin, “Fast, high-quality two-arm rearrangement in synchronous, monotone tabletop setups,” IEEE Transactions on Automation Science and Engineering , 2021
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
C. Nam, S. H. Cheong, J. Lee, D. H. Kim, and C. Kim, “Fast and resilient manipulation planning for object retrieval in cluttered and confined environments,” IEEE Transactions on Robotics , 2021
2021
Closest in time.
B. Huang, S. D. Han, A. Boularias, and J. Yu, “Dipn: Deep interaction prediction network with application to clutter removal,” in IEEE International Conference on Robotics and Automation , 2021
2021
Closest in time.