Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space

T. Lozano-Perez, Spatial planning: A configuration space approach . Springer, 1990

1990

Earlier work this paper cites.

C. Bajaj and M.-S. Kim, “Generation of configuration space obstacles: Moving algebraic surfaces,” The International Journal of Robotics Research , vol. 9, no. 1, pp. 92–112, 1990

1990

Earlier work this paper cites.

L. Lovász, “Hit-and-run mixes fast,” Mathematical programming , vol. 86, 1999

1999

Earlier work this paper cites.

L. Jaulin, “Path planning using intervals and graphs,” Reliable computing , vol. 7, no. 1, pp. 1–15, 2001

2001

Earlier work this paper cites.

L. Yang and S. M. LaValle, “The sampling-based neighborhood graph: An approach to computing and executing feedback motion strategies,” IEEE Transactions on Robotics and Automation , vol. 20, no. 3, pp. 419–432, 2004

2004

Earlier work this paper cites.

S. Boyd and L. Vandenberghe, Convex optimization . Cambridge uni. press, 2004

2004

Earlier work this paper cites.

A. Sarmientoy, R. Murrieta-Cidz, and S. Hutchinsony, “A sample-based convex cover for rapidly finding an object in a 3-d environment,” in Proceedings of the 2005 IEEE ICRA . IEEE, 2005, pp. 3486–3491

2005

Earlier work this paper cites.

P. E. Gill, W. Murray, and M. A. Saunders, “Snopt: An sqp algorithm for large-scale constrained optimization,” SIAM review , vol. 47, no. 1, pp. 99–131, 2005

2005

Earlier work this paper cites.

S. M. LaValle, Planning algorithms . Cambridge university press, 2006

2006

Earlier work this paper cites.

K. Mamou and F. Ghorbel, “A simple and efficient approach for 3d mesh approximate convex decomposition,” in 2009 16th IEEE international conference on image processing (ICIP) . IEEE, 2009, pp. 3501–3504

2009

Earlier work this paper cites.

C. Lauterbach, M. Garland, S. Sengupta, D. Luebke, and D. Manocha, “Fast bvh construction on gpus,” in Computer Graphics Forum . Wiley Online Library, 2009

2009

Cited alongside, same era.

J.-C. Latombe, Robot motion planning . Springer Science & Business Media, 2012, vol. 124

2012

Cited alongside, same era.

J. Pan and D. Manocha, “Efficient configuration space construction and optimization for motion planning,” Engineering , vol. 1, no. 1, pp. 046–057, 2015

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.

N. Alon and J. H. Spencer, The probabilistic method . John Wiley & Sons, 2016

2016

Cited alongside, same era.

T. 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.

R. Tedrake, Robotic Manipulation , 2023. [Online]. Available: http://manipulation.mit.edu

2023

Later among the works it cites.

H. Dai, A. Amice, P. Werner, A. Zhang, and R. Tedrake, “Certified polyhedral decompositions of collision-free configuration space,” The International Journal of Robotics Research , 2023

2023

Later among the works it cites.

A. Jaitly and S. Farzan, “Paamp: Polytopic action-set and motion planning for long horizon dynamic motion planning via mixed integer linear programming,” arXiv preprint arXiv:2403.10924 , 2024

Original

2024

Closest in time.