A. Yershova, L. Jaillet, T. Simeon and S. M. LaValle. Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain. In Proc. IEEE International Conference on Robotics and Automation, 2005. Under review.
S. R. Lindemann and S. M. LaValle. Current issues in sampling-based motion planning. In P. Dario and R. Chatila, editors, Proc. Eighth Int'l Symp. on Robotics Research. Springer-Verlag, Berlin, 2004. To appear.
P. Cheng and S. M. LaValle. Resolution completeness for sampling-based motion planning with differential constraints. Submitted to International Journal of Robotics Research.
P. Cheng, E. Frazzoli, and S. M. LaValle. Improving the performance of sampling-based planners by using a symmetry-exploiting gap reduction algorithm. In Proc. IEEE International Conference on Robotics and Automation, 2004.
A. Yershova and S. M. LaValle. Deterministic sampling methods for spheres and SO(3). In Proc. IEEE International Conference on Robotics and Automation, 2004.
S. R. Lindemann and S. M. LaValle. Incrementally reducing dispersion by increasing Voronoi bias in RRTs. In Proc. IEEE International Conference on Robotics and Automation, 2004. Under review.
S. M. LaValle, M. S. Branicky, and S. R. Lindemann. On the relationship between classical grid search and probabilistic roadmaps. International Journal of Robotics Research (to appear), 24, 2004.
S. M. LaValle. Pointers to quasi-monte carlo literature. University of Illinois, Dec. 2002.
S. R. Lindemann and S. M. LaValle. Incremental low-discrepancy lattice methods for motion planning. In Proc. IEEE International Conference on Robotics and Automation, 2003.
L. Yang and S. M. LaValle. The sampling-based neighborhood graph: A framework for planning and executing feedback motion strategies. To appear in IEEE Transactions on Robotics and Automation, 2003.
S. M. LaValle. From dynamic programming to RRTs: Algorithmic design of feasible trajectories. In A. Bicchi, H. I. Christensen, and D. Prattichizzo, editors, Control Problems in Robotics, pages 19--37. Springer-Verlag, Berlin, 2002.
S. M. LaValle and M. S. Branicky. On the relationship between classical grid search and probabilistic roadmaps. In Proc. Workshop on the Algorithmic Foundations of Robotics, December 2002.
M. S. Branicky, S. M. LaValle, K. Olson, and L. Yang. Deterministic vs. probabilistic roadmaps. Unpublished manuscript, 2002.
S. M. LaValle and J. J. Kuffner. Randomized kinodynamic planning. International Journal of Robotics Research, 20(5):378--400, May 2001.
P. Cheng, Z. Shen, and S. M. LaValle. RRT-based trajectory design for autonomous automobiles and spacecraft. Archives of Control Sciences, 11(3-4):167--194, 2001.
A. Atramentov and S. M. LaValle. Efficient nearest neighbor searching for motion planning. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 632--637, 2002.
P. Cheng and S. M. LaValle. Resolution complete rapidly-exploring random trees. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 267--272, 2002.
L. Yang and S. M. LaValle. An improved random neighborhood graph approach. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 254--259, 2002.
P. Cheng and S. M. LaValle. Reducing metric sensitivity in randomized trajectory design. In Proc. IEEE/RSJ Int'l Conf. on Intelligent Robots and Systems, pages 43--48, 2001.
M. S. Branicky, S. M. LaValle, K. Olson, and L. Yang. Quasi-randomized path planning. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 1481--1487, 2001.
J. Yakey, S. M. LaValle, and L. E. Kavraki. Randomized path planning for linkages with closed kinematic chains. IEEE Transactions on Robotics and Automation, 17(6):951--958, December 2001.
P. Cheng, Z. Shen, and S. M. LaValle. Using randomization to find and optimize feasible trajectories for nonlinear systems. In Proc. Annual Allerton Conference on Communications, Control, Computing, pages 926--935, 2000.
S. M. LaValle and J. J. Kuffner. Rapidly-exploring random trees: Progress and prospects. In B. R. Donald, K. M. Lynch, and D. Rus, editors, Algorithmic and Computational Robotics: New Directions, pages 293--308. A K Peters, Wellesley, MA, 2001.
S. M. LaValle and J. J. Kuffner. Rapidly-exploring random trees: Progress and prospects. In Workshop on the Algorithmic Foundations of Robotics, 2000.
J. J. Kuffner and S. M. LaValle. RRT-connect: An efficient approach to single-query path planning. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 995--1001, 2000.
L. Yang and S. M. LaValle. A framework for planning feedback motion strategies based on a random neighborhood graph. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 544--549, 2000.
S. M. LaValle and J. J. Kuffner. Randomized kinodynamic planning. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 473--479, 1999.
S. M. LaValle, J. Yakey, and L. E. Kavraki. A probabilistic roadmap approach for systems with closed kinematic chains. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 1671--1676, 1999.
S. M. LaValle. Rapidly-exploring random trees: A new tool for path planning. TR 98-11, Computer Science Dept., Iowa State University, Oct. 1998.
L. Guilamo, B. Tovar, and S. M. LaValle. Pursuit-evasion in an unknown environment using gap navigation graphs. In Proc. IEEE International Conference on Robotics and Automation, 2004. Under review.
B. Tovar, S. M. LaValle, and R. Murrieta. Locally-optimal navigation in multiply-connected environments without geometric maps. In IEEE/RSJ Int'l Conf. on Intelligent Robots and Systems, 2003.
B. Tovar, S. M. LaValle, and R. Murrieta. Optimal navigation and object finding without geometric maps or localization. In Proc. IEEE International Conference on Robotics and Automation, 2003.
B. Simov, G. Slutzki, and S. M. LaValle. Clearing a polygon with two 1-searchers. Submitted to International Journal of Computational Geometry and Applications, 2003.
S. Sachs, S. Rajko, and S. M. LaValle. Visibility-based pursuit-evasion in an unknown planar environment. To appear in International Journal of Robotics Research, 2003.
B. Simov, S. M. LaValle, and G. Slutzki. A complete pursuit-evasion algorithm for two pursuers using beam detection. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 618--623, 2002.
S. M. LaValle, B. Simov, and G. Slutzki. An algorithm for searching a polygonal region with a flashlight. International Journal of Computational Geometry and Applications, 12(1-2):87--113, 2002.
S. Rajko and S. M. LaValle. A pursuit-evasion bug algorithm. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 1954--1960, 2001.
S. M. LaValle, B. Simov, and G. Slutzki. An algorithm for searching a polygonal region with a flashlight. In Proc. ACM Annual Symposium on Computational Geometry, 2000.
B. Simov, G. Slutzki, and S. M. LaValle. Pursuit-evasion using beam detection. In Proc. IEEE Int'l Conf. on Robotics and Automation, 2000.
S. M. LaValle and J. Hinrichsen. Visibility-based pursuit-evasion: An extension to curved environments. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 1677--1682, 1999.
L. J. Guibas, J.-C. Latombe, S. M. LaValle, D. Lin, and R. Motwani. Visibility-based pursuit-evasion in a polygonal environment. International Journal of Computational Geometry and Applications, 9(5):471--494, 1999.
L. J. Guibas, J.-C. Latombe, S. M. LaValle, D. Lin, and R. Motwani. Visibility-based pursuit-evasion in a polygonal environment. In F. Dehne, A. Rau-Chaplin, J.-R. Sack, and R. Tamassia, editors, WADS '97 Algorithms and Data Structures (Lecture Notes in Computer Science, 1272), pages 17--30. Springer-Verlag, Berlin, 1997.
S. M. LaValle, D. Lin, L. J. Guibas, J.-C. Latombe, and R. Motwani. Finding an unpredictable target in a workspace with obstacles. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 737--742, 1997.
P. Cheng and S. M. LaValle. Resolution completeness for sampling-based motion planning with differential constraints. Submitted to International Journal of Robotics Research.
P. Cheng, E. Frazzoli, and S. M. LaValle. Improving the performance of sampling-based planners by using a symmetry-exploiting gap reduction algorithm. In Proc. IEEE International Conference on Robotics and Automation, 2004.
P. Cheng, E. Frazzoli, and S. M. LaValle. Exploiting group symmetries to improve precision in kinodynamic and nonholonomic planning. In IEEE/RSJ Int'l Conf. on Intelligent Robots and Systems, 2003.
S. M. LaValle. From dynamic programming to RRTs: Algorithmic design of feasible trajectories. In A. Bicchi, H. I. Christensen, and D. Prattichizzo, editors, Control Problems in Robotics, pages 19--37. Springer-Verlag, Berlin, 2002.
P. Cheng and S. M. LaValle. Resolution complete rapidly-exploring random trees. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 267--272, 2002.
S. M. LaValle and J. J. Kuffner. Randomized kinodynamic planning. International Journal of Robotics Research, 20(5):378--400, May 2001.
P. Cheng, Z. Shen, and S. M. LaValle. RRT-based trajectory design for autonomous automobiles and spacecraft. Archives of Control Sciences, 11(3-4):167--194, 2001.
S. M. LaValle and P. Konkimalla. Algorithms for computing numerical optimal feedback motion strategies. International Journal of Robotics Research, 20(9):729--752, September 2001.
S. M. LaValle and J. J. Kuffner. Rapidly-exploring random trees: Progress and prospects. In B. R. Donald, K. M. Lynch, and D. Rus, editors, Algorithmic and Computational Robotics: New Directions, pages 293--308. A K Peters, Wellesley, MA, 2001.
P. Cheng and S. M. LaValle. Reducing metric sensitivity in randomized trajectory design. In Proc. IEEE/RSJ Int'l Conf. on Intelligent Robots and Systems, pages 43--48, 2001.
S. M. LaValle. Robot motion planning: A game-theoretic foundation. Algorithmica, 26(3):430--465, 2000.
P. Cheng, Z. Shen, and S. M. LaValle. Using randomization to find and optimize feasible trajectories for nonlinear systems. In Proc. Annual Allerton Conference on Communications, Control, Computing, pages 926--935, 2000.
S. M. LaValle and J. J. Kuffner. Randomized kinodynamic planning. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 473--479, 1999.
P. Konkimalla and S. M. LaValle. Efficient computation of optimal navigation functions for nonholonomic planning. In Proc. First IEEE Int'l Workshop on Robot Motion and Control, pages 187--192, 1999.
S. M. LaValle. Rapidly-exploring random trees: A new tool for path planning. TR 98-11, Computer Science Dept., Iowa State University, Oct. 1998.
S. M. LaValle and R. Sharma. On motion planning in changing, partially-predictable environments. International Journal of Robotics Research, 16(6):775--805, December 1997.
S. M. LaValle. A game-theoretic framework for robot motion planning. PhD thesis, University of Illinois, Urbana, IL, July 1995.
B. Tovar, S. M. LaValle, and R. Murrieta. Optimal navigation and object finding without geometric maps or localization. In Proc. IEEE International Conference on Robotics and Automation, 2003.
S. M. LaValle, H. H. Gonz\'alez-Ba\ nos, C. Becker, and J.-C. Latombe. Motion strategies for maintaining visibility of a moving target. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 731--736, 1997.
H. H. Gonz\'alez-Ba\ nos, L. Guibas, J.-C. Latombe, S. M. LaValle, D. Lin, R. Motwani, and C. Tomasi. Motion planning with visibility constraints: Building autonomous observers. In Y. Shirai and S. Hirose, editors, Proc. Eighth Int'l Symp. on Robotics Research, pages 95--101. Springer-Verlag, Berlin, 1998.
L. Yang and S. M. LaValle. The sampling-based neighborhood graph: A framework for planning and executing feedback motion strategies. To appear in IEEE Transactions on Robotics and Automation, 2003.
S. M. LaValle and P. Konkimalla. Algorithms for computing numerical optimal feedback motion strategies. International Journal of Robotics Research, 20(9):729--752, September 2001.
L. Yang and S. M. LaValle. An improved random neighborhood graph approach. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 254--259, 2002.
L. Yang and S. M. LaValle. A framework for planning feedback motion strategies based on a random neighborhood graph. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 544--549, 2000.
P. Konkimalla and S. M. LaValle. Efficient computation of optimal navigation functions for nonholonomic planning. In Proc. First IEEE Int'l Workshop on Robot Motion and Control, pages 187--192, 1999.
S. M. LaValle. Numerical computation of optimal navigation functions on a simplicial complex. In P. Agarwal, L. Kavraki, and M. Mason, editors, Robotics: The Algorithmic Perspective, pages 339--350. A K Peters, Wellesley, MA, 1998.
R. Sharma, S. M. LaValle, and S. A. Hutchinson. Optimizing robot motion strategies for assembly with stochastic models of the assembly process. IEEE Trans. on Robotics and Automation, 12(2):160--174, April 1996.
S. M. LaValle and S. A. Hutchinson. Optimal motion planning for multiple robots having independent goals. IEEE Trans. on Robotics and Automation, 14(6):912--925, December 1998.
S. M. LaValle and S. A. Hutchinson. An objective-based framework for motion planning under sensing and control uncertainties. International Journal of Robotics Research, 17(1):19--42, January 1998.
S. M. LaValle and R. Sharma. On motion planning in changing, partially-predictable environments. International Journal of Robotics Research, 16(6):775--805, December 1997.
S. M. LaValle and R. Sharma. Motion planning in stochastic environments: Theory and modeling issues. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 3057--3062, 1995.
S. M. LaValle and R. Sharma. Motion planning in stochastic environments: Applications and computational issues. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 3063--3068, 1995.
S. M. LaValle. A game-theoretic framework for robot motion planning. PhD thesis, University of Illinois, Urbana, IL, July 1995.
S. M. LaValle and S. A. Hutchinson. An objective-based stochastic framework for manipulation planning. In Proc. IEEE/RSJ/GI Int'l Conf. on Intelligent Robots and Systems, pages 1772--1779, September 1994.
S. M. LaValle and R. Sharma. Robot motion planning in a changing, partially predictable environment. In Proc. IEEE Int'l Symp. on Intelligent Control, pages 261--266, August 1994.
S. M. LaValle, P. Finn, L. Kavraki, and J.-C. Latombe. A randomized kinematics-based approach to pharmacophore-constrained conformational search and database screening. J. Computational Chemistry, 21(9):731--747, 2000.
S. M. LaValle, P. Finn, L. Kavraki, and J.-C. Latombe. Efficient database screening for rational drug design using pharmacophore-constrained conformational search. In Proc. RECOMB (Annual International Conference on Molecular Biology), pages 250--259, 1999.
H. Chitsaz, J. M. O'Kane, and S. M. LaValle. Pareto-optimal coordination of two translating polygonal robots on an acyclic roadmap. In Proc. IEEE International Conference on Robotics and Automation, 2004. Under review.
S. M. LaValle and S. A. Hutchinson. Optimal motion planning for multiple robots having independent goals. IEEE Trans. on Robotics and Automation, 14(6):912--925, December 1998.
S. M. LaValle. A game-theoretic framework for robot motion planning. PhD thesis, University of Illinois, Urbana, IL, July 1995.
S. M. LaValle and S. A. Hutchinson. Path selection and coordination of multiple robots via Nash equilibria. In Proc. 1994 IEEE Int'l Conf. Robot. \& and Autom., pages 1847--1852, May 1994.
S. M. LaValle and S. A. Hutchinson. Game theory as a unifying structure for a variety of robot tasks. In Proc. IEEE Int'l Symp. on Intelligent Control, pages 429--434, August 1993.
S. M. LaValle. Robot motion planning: A game-theoretic foundation. Algorithmica, 26(3):430--465, 2000.
S. M. LaValle. Robot motion planning: A game-theoretic foundation. In Proc. 2nd Int'l Workshop on the Algorithmic Foundations of Robotics, July 1996.
S. M. LaValle. A game-theoretic framework for robot motion planning. PhD thesis, University of Illinois, Urbana, IL, July 1995.
S. M. LaValle and S. A. Hutchinson. Game theory as a unifying structure for a variety of robot tasks. In Proc. IEEE Int'l Symp. on Intelligent Control, pages 429--434, August 1993.
S. M. LaValle, K. J. Moroney, and S. A. Hutchinson. Methods for numerical integration of high-dimensional probability densities with application to statistical image models. IEEE Transactions on Image Processing, 6(12):1659--1672, December 1997.
S. M. LaValle and S. A. Hutchinson. A framework for constructing probability distributions on the space of segmentations. Computer Vision and Image Understanding, 61(2):203--230, March 1995.
S. M. LaValle and S. A. Hutchinson. A Bayesian segmentation methodology for parametric image models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(2):211--218, February 1995.
S. M. LaValle and S. A. Hutchinson. On considering uncertainty and alternatives in low-level vision. In Proc. Ninth Conf. on Uncertainty in Artificial Intelligence, pages 55--63, July 1993.
K. J. Moroney S. M. LaValle and S. A. Hutchinson. Methods for numerical integration of high-dimensional probability densities with application to statistical image models. In Proc. 1993 SPIE Conf. on Neural and Stochastic Methods in Image and Signal Processing, pages 292--303, July 1993.
S. M. LaValle and S. A. Hutchinson. Bayesian region merging probability for parametric image models. In Proc. 1993 IEEE Conf. on Computer Vision and Pattern Recognition, pages 778--779, June 1993.
K. J. Moroney S. M. LaValle and S. A. Hutchinson. Agglomerative clustering on range data with a unified probabilistic merging function and termination criterion. In Proc. 1993 IEEE Conf. on Computer Vision and Pattern Recognition, pages 798--799, June 1993.
S. M. LaValle. A bayesian framework for considering probability distributions of image segments and segmentations. Master's thesis, University of Illinois, Urbana, IL, December 1992.
G. Leavens, A. Baker, V. Honavar, S. M. LaValle, and G. Prabhu. Programming is writing: Why student programs must be carefully evaluated. Mathematics and Computer Education, 32(3):284--295, Fall 1998.