Fetching the paper…
Reading the bibliography…
Optimization methods for long-horizon, dynamically feasible motion planning in robotics tackle challenging non-convex and discontinuous optimization problems.
A. H. Land and A. G. Doig, “An automatic method of solving discrete programming problems,” Econometrica , vol. 28, no. 3, pp. 497–520, 1960
1960
Earlier work this paper cites.
D. Eppstein, “Finding the k shortest paths,” 1997
1997
Earlier work this paper cites.
J.-M. Lien and N. M. Amato, “Approximate convex decomposition of polyhedra,” in Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling , ser. SPM ’07. New York, NY, USA: Association for Computing Machinery, 2007, p. 121–131
2007
Earlier work this paper cites.
K. Hauser and S. U. C. S. Department, Motion Planning for Legged and Humanoid Robots . Stanford University, 2008
2008
Earlier work this paper cites.
C. Liu and C. G. Atkeson, “Standing balance control using a trajectory library,” in 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems , 2009, pp. 3031–3036
2009
Earlier work this paper cites.
T. Lozano-Pérez and L. P. Kaelbling, “A constraint-based method for solving sequential manipulation planning problems,” in 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems , 2014, pp. 3684–3691
2014
Earlier work this paper cites.
R. Deits and R. Tedrake, Computing Large Convex Regions of Obstacle-Free Space Through Semidefinite Programming . Cham: Springer International Publishing, 2015, pp. 109–124
2015
Earlier work this paper cites.
M. Kelly, “An introduction to trajectory optimization: How to do your own direct collocation,” SIAM Review , vol. 59, no. 4, 2017
2017
Cited alongside, same era.
M. P. Kelly, “Transcription methods for trajectory optimization: a beginners tutorial,” 2017
2017
Cited alongside, same era.
G. Dubey, R. Madaan, and S. Scherer, “Droan - disparity-space representation for obstacle avoidance: Enabling wire mapping & avoidance,” in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , 2018, pp. 6311–6318
2018
Cited alongside, same era.
M. Chignoli and S. Kim, “Online trajectory optimization for dynamic aerial motions of a quadruped robot,” in 2021 IEEE International Conference on Robotics and Automation (ICRA) , 2021, pp. 7693–7699
2021
Cited alongside, same era.
T. B. Cohn, M. Petersen, M. Simchowitz, and R. Tedrake, “Non-Euclidean Motion Planning with Graphs of Geodesically-Convex Sets,” in Proceedings of Robotics: Science and Systems , Daegu, Republic of Korea, July 2023
2023
Later among the works it cites.
M. Petersen and R. Tedrake, “Growing convex collision-free regions in configuration space using nonlinear programming,” 2023
2023
Later among the works it cites.
H. Guo, F. Wu, Y. Qin, R. Li, K. Li, and K. Li, “Recent trends in task and motion planning for robotics: A survey,” ACM Computing Surveys , 2023
2023
Later among the works it cites.
P. Antal, T. Péni, and R. Tóth, “Backflipping with miniature quadcopters by gaussian-process-based control and planning,” IEEE Transactions on Control Systems Technology , vol. 32, no. 1, pp. 3–14, 2024
2024
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2021
Cited alongside, same era.
C. R. Garrett, R. Chitnis, R. Holladay, B. Kim, T. Silver, L. P. Kaelbling, and T. Lozano-Pérez, “Integrated task and motion planning,” Annual Review of Control, Robotics, and Autonomous Systems , vol. 4, no. 1, pp. 265–293, 2021
2021
Cited alongside, same era.
T. Marcucci, M. Petersen, D. von Wrangel, and R. Tedrake, “Motion planning around obstacles with convex optimization,” Science Robotics , vol. 8, no. 84, p. eadf7843, 2023
2023
Cited alongside, same era.
2024
Closest in time.
P. Werner, A. Amice, T. Marcucci, D. Rus, and R. Tedrake, “Approximating robot configuration spaces with few convex sets using clique covers of visibility graphs,” 2024
2024
Closest in time.