Fetching the paper…
Reading the bibliography…
Rearranging objects on a planar surface arises in a variety of robotic applications, such as product packaging.
Bulletin Calcutta Math Soc
Ghosh, B.: Random distances within a rectangle and between two rectangles · 1951
Earlier work this paper cites.
Journal of research of the National Bureau of Standards B
Edmonds, J.: Maximum matching and a polyhedron with 0, 1-vertices · 1965
Earlier work this paper cites.
In: FOCS (1976)
Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems · 1976
Earlier work this paper cites.
Networks
Lenstra, J.K., Kan, A.: Complexity of vehicle routing and scheduling problems · 1981
Earlier work this paper cites.
Combinatorica
Ajtai, M., Komlós, J., Tusnády, G.: On optimal matchings · 1984
Earlier work this paper cites.
SIAM Journal on Computing
Galil, Z., Micali, S., Gabow, H.: An O(EV log V) algorithm for finding a maximal weighted matching in general graphs · 1986
Earlier work this paper cites.
Annals of Mathematics and Artificial Intelligence
Wilfong, G.: Motion planning in the presence of movable obstacles · 1991
Earlier work this paper cites.
Artificial Intelligence Journal
Wilson, R.H., Latombe, J.C.: Geometric Reasoning about Mechanical Assembly · 1994
Earlier work this paper cites.
Transportation science
Savelsbergh, M.W., Sol, M.: The general pickup and delivery problem · 1995
Earlier work this paper cites.
IEEE Transactions on Robotics and Automation
Ben-Shahar, O., Rivlin, E.: Practical pushing planning for rearrangement tasks · 1998
Earlier work this paper cites.
In: IJCAI, vol. 99 (1999)
Leroy, S., Laumond, J.P., Siméon, T.: Multiple path coordination for mobile robots: A geometric algorithm · 1999
Earlier work this paper cites.
Algorithmica
Halperin, D., Latombe, J.C., Wilson, R.H.: A General Framework for Assembly Planning: the Motion Space Approach · 2000
Earlier work this paper cites.
Parallel Computing
Caricato, P., Ghiani, G., Grieco, A., Guerriero, E.: Parallel tabu search for a pickup and delivery problem under track contention · 2003
Earlier work this paper cites.
In: ICRA, vol. 2 (2004)
Ota, J.: Rearrangement of multiple movable objects-integration of global and local planning methodology · 2004
Earlier work this paper cites.
Cambridge University Press (2004)
Santaló, L.A.: Integral geometry and geometric probability · 2004
Cited alongside, same era.
In: IROS (2005)
Van Den Berg, J.P., Overmars, M.H.: Prioritized motion planning for multiple robots · 2005
Cited alongside, same era.
Rathinam, S., Sengupta, R.: Matroid intersection and its application to a multiple depot, multiple tsp (2006)
2006
Cited alongside, same era.
In: ICRA (2007)
Stilman, M., Schamburek, J.U., Kuffner, J., Asfour, T.: Manipulation planning among movable obstacles · 2007
Cited alongside, same era.
Journal für Betriebswirtschaft
Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery models part ii: Transportation between pickup and delivery locations · 2008
Cited alongside, same era.
In: WAFR (2008)
Van Den Berg, J., Stilman, M., Kuffner, J., Lin, M., Manocha, D.: Path planning among movable obstacles: a probabilistically complete approach · 2008
Cited alongside, same era.
IEEE T-ASE
Adler, A., de Berg, M., Halperin, D., Solovey, K.: Efficient multi-robot motion planning for unlabeled discs in simple polygons · 2015
Later among the works it cites.
In: Robotics: Science and Systems (2015)
Krontiris, A., Bekris, K.E.: Dealing with difficult instances of object rearrangement · 2015
Later among the works it cites.
arXiv preprint arXiv:1504.05218 (2015)
Solovey, K., Yu, J., Zamir, O., Halperin, D.: Motion planning for unlabeled discs with optimality guarantees · 2015
Later among the works it cites.
IEEE Transactions on Automatic Control
Yu, J., Chung, S.J., Voulgaris, P.G.: Target assignment in robotic networks: Distance optimality guarantees and hierarchical strategies · 2015
Later among the works it cites.
Gurobi Optimization, I.: Gurobi optimizer reference manual (2016)
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
In: IROS (2009)
Gharbi, M., Cortés, J., Siméon, T.: Roadmap Composition for Multi-Arm Systems Path Planning · 2009
Cited alongside, same era.
Electronic Notes in Theoretical Computer Science
Dezső, B., Jüttner, A., Kovács, P.: Lemon–an open source c++ graph template library · 2011
Cited alongside, same era.
In: ICRA (2012)
Wagner, G., Kang, M., Choset, H.: Probabilistic path planning for multiple robots with subdimensional expansion · 2012
Cited alongside, same era.
In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer (2013)
Friggstad, Z.: Multiple traveling salesmen in asymmetric metrics · 2013
Cited alongside, same era.
IEEE Transactions on Automatic Control
Treleaven, K., Pavone, M., Frazzoli, E.: Asymptotically optimal algorithms for one-to-one pickup and delivery problems with applications to transportation systems · 2013
Cited alongside, same era.
Ph.D. thesis, Carnegie Mellon University, CMU-RI-TR-14-05 (2014)
Coltin, B.: Multi-agent pickup and delivery planning with transfers · 2014
Cited alongside, same era.
Kirkpatrick, D., Liu, P.: Characterizing minimum-length coordinated motions for two discs · 2016
Later among the works it cites.
In: ICRA (2016)
Krontiris, A., Bekris, K.E.: Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner · 2016
Later among the works it cites.
In: WAFR (2016)
Vega-Brown, W., Roy, N.: Asymptotically optimal planning under piecewise-analytic constraints · 2016
Later among the works it cites.
IEEE Transactions on Robotics
Yu, J., LaValle, S.M.: Optimal multirobot path planning on graphs: Complete algorithms and effective heuristics · 2016
Later among the works it cites.
In: MRS (2017)
Dobson, A., Solovey, K., Shome, R., Halperin, D., Bekris, K.E.: Scalable Asymptotically-Optimal Multi-Robot Motion Planning · 2017
Later among the works it cites.
In: ICRA. IEEE (2017)
Schmitt, P.S., Neubauer, W., Feiten, W., Wurm, K.M., Wichert, G.V., Burgard, W.: Optimal, sampling-based manipulation planning · 2017
Later among the works it cites.
In: Humanoids (2017)
Shome, R., Bekris, K.E.: Improving the scalability of asymptotically optimal motion planning for humanoid dual-arm manipulators · 2017
Later among the works it cites.
In: WAFR (2018)
Chinta, R., Han, S.D., Yu, J.: Coordinating the motion of labeled discs with optimality guarantees under extreme density · 2018
Closest in time.
IJRR (2018)
Han, S.D., Stiffler, N., Krontiris, A., Bekris, K., Yu, J.: Complexity results and fast methods for optimal tabletop rearrangement with overhand grasps · 2018
Closest in time.