Fetching the paper…
Reading the bibliography…
Configuration space (C-space) has played a central role in collision-free motion planning, particularly for robot manipulators.
T. Lozano-Perez, “Spatial planning: A configuration space approach,” IEEE Transactions on Computers , vol. 100, no. 32, 1983
1983
Earlier work this paper cites.
J. Canny, The complexity of robot motion planning . MIT press, 1988
1988
Earlier work this paper cites.
M. Branicky and W. Newman, “Rapid computation of configuration space obstacles,” in Proceedings., IEEE International Conference on Robotics and Automation , 1990
1990
Earlier work this paper cites.
C. W. Wampler, A. Morgan, and A. Sommese, “Numerical continuation methods for solving polynomial systems arising in kinematics,” 1990
1990
Earlier work this paper cites.
M. Spivak, Calculus Third Edition . Cambridge University Press, 1994
1994
Earlier work this paper cites.
L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE transactions on Robotics and Automation , vol. 12, no. 4, pp. 566–580, 1996
1996
Earlier work this paper cites.
S. M. LaValle et al. , “Rapidly-exploring random trees: A new tool for path planning,” 1998
1998
Earlier work this paper cites.
P. A. Parrilo, Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization . California Institute of Technology, 2000
2000
Earlier work this paper cites.
T. Schouwenaars, B. De Moor, E. Feron, and J. How, “Mixed integer programming for multi-vehicle path planning,” in 2001 European control conference (ECC)
2001
Earlier work this paper cites.
Z. Jarvis-Wloszek, R. Feeley, W. Tan, K. Sun, and A. Packard, “Some controls applications of sum of squares programming,” in 42nd IEEE international conference on decision and control (IEEE Cat. No. 03CH37475) , vol. 5. IEEE, 2003, pp. 4676–4681
2003
Earlier work this paper cites.
S. Boyd, S. P. Boyd, and L. Vandenberghe, Convex optimization . Cambridge university press, 2004
2004
Earlier work this paper cites.
S. Boyd, S. P. Boyd, and L. Vandenberghe, Convex optimization . Cambridge university press, 2004
2004
Earlier work this paper cites.
A. J. Sommese, C. W. Wampler et al. , The Numerical solution of systems of polynomials arising in engineering and science . World Scientific, 2005
2005
Cited alongside, same era.
J. J. Craig, Introduction to robotics: mechanics and control . Pearson Educacion, 2005
2005
Cited alongside, same era.
C. M. Bishop, “Pattern recognition,” Machine learning , vol. 128, no. 9, 2006
2006
Cited alongside, same era.
J.-M. Lien and N. M. Amato, “Approximate convex decomposition of polyhedra,” in Proceedings of the 2007 ACM symposium on Solid and physical modeling
2007
Cited alongside, same era.
R. Diankov, “Automated construction of robotic manipulation programs,” 2010
2010
Cited alongside, same era.
A. Majumdar and R. Tedrake, “Funnel libraries for real-time robust feedback motion planning,” The International Journal of Robotics Research , vol. 36, no. 8, pp. 947–982, 2017
2017
Later among the works it cites.
2019
Later among the works it cites.
M. ApS, The MOSEK optimization toolbox for MATLAB manual. Version 9.0. , 2019. [Online]. Available: http://docs.mosek.com/9.0/toolbox/index.html
2019
Later among the works it cites.
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…
R. Tedrake, I. R. Manchester, M. Tobenkin, and J. W. Roberts, “Lqr-trees: Feedback motion planning via sums-of-squares verification,” The International Journal of Robotics Research , vol. 29, no. 8, pp. 1038–1052, 2010
2010
Cited alongside, same era.
G. Blekherman, P. A. Parrilo, and R. R. Thomas, Semidefinite optimization and convex algebraic geometry . SIAM, 2012
2012
Cited alongside, same era.
A. Prestel and C. Delzell, Positive polynomials: from Hilbert’s 17th problem to real algebra . Springer Science & Business Media, 2013
2013
Cited alongside, same era.
R. Deits and R. Tedrake, “Computing large convex regions of obstacle-free space through semidefinite programming,” in Algorithmic foundations of robotics XI . Springer, 2015, pp. 109–124
2015
Cited alongside, same era.
R. Deits and R. Tedrake, “Efficient mixed-integer planning for uavs in cluttered environments,” in 2015 IEEE international conference on robotics and automation (ICRA)
2015
Cited alongside, same era.
R. Deits and R. Tedrake, “Computing large convex regions of obstacle-free space through semidefinite programming,” in Algorithmic foundations of robotics XI . Springer, 2015, pp. 109–124
2015
Cited alongside, same era.
2016
Cited alongside, same era.
S. Shen and R. Tedrake, “Sampling quotient-ring sum-of-squares programs for scalable verification of nonlinear systems,” in 2020 59th IEEE Conference on Decision and Control (CDC)
2020
Later among the works it cites.
2020
Later among the works it cites.
R. Tedrake, Robotic Manipulation , 2021. [Online]. Available: https://manipulation.mit.edu/pick.html#monogram
2021
Later among the works it cites.
H. Yin, M. Arcak, A. Packard, and P. Seiler, “Backward reachability for polynomial systems on a finite horizon,” IEEE Transactions on Automatic Control , vol. 66, no. 12, pp. 6025–6032, 2021
2021
Later among the works it cites.
R. Tedrake, Robotic Manipulation , 2021. [Online]. Available: https://manipulation.mit.edu/pick.html#monogram
2021
Later among the works it cites.
2022
Closest in time.
T. Marcucci, M. Petersen, D. von Wrangel, and R. Tedrake, “Motion planning around obstacles with convex optimization,” 2022
2022
Closest in time.