http:^^www.cs.rice.edu^~kavraki^
来自「This data set contains WWW-pages collect」· EDU^~KAVRAKI^ 代码 · 共 204 行
EDU^~KAVRAKI^
204 行
Date: Mon, 25 Nov 1996 22:12:29 GMTServer: NCSA/1.4.2Content-type: text/htmlLast-modified: Fri, 22 Nov 1996 19:07:02 GMTContent-length: 5073<html><head><title> Home Page of Lydia E. Kavraki </title></head><h1 align=center> Home Page of Lydia E. Kavraki</h1><HR> <P><dl><dl><dt> <h4> Lydia E. Kavraki, Assistant Professor </h4> <p><dt> Rice University <dt> Department of Computer Science, MS 132 <dt> 6100 Main Street <dt> Houston, TX 77005 <p> <dt> Office: (713) 737-5737 <dt> Fax: (713) 285-5930 <address>kavraki@cs.rice.edu</address> <p></dl> <p><p><HR> <P> <h2> Research Interests </h2> <p>Robotics and artificial intelligencewith emphasis on designing algorithms, analysis tools, and environments to support the solution of complex high-dimensionalproblems governed by physical laws. <p>Applications in molecular biology (computer-aidedpharmaceutical drug design), and medicine (robot-assisted surgery). <p><HR><P> <h2> Teaching </h2> <p>Spring 1997: <!WA0><a href ="http://www.cs.rice.edu/~kavraki/cs450/ad.ps"> Algorithmic Robotics </a><p><HR> <P><A NAME="publications"><H2> Selected publications: </H2></A><nl><h3> Motion Planning, Robotics, and Randomized Search</h3> <P><!WA1><img src="http://www.cs.rice.edu/~kavraki/3d.gif"> <P><menu><li> L. Kavraki and J.-C. Latombe, <!WA2><a href ="http://www.cs.rice.edu/~kavraki/papers/r_ieee94.ps"> Randomized Preprocessing of Configuration Spacefor Fast Path Planning</a>, in the Proceedings of the <i>InternationalConference on Robotics and Automation</i>, San Diego, CA, 2138-2139, 1994.<li> L. Kavraki, P. Svestka, J.-C. Latombe, and M. Overmars, <!WA3><a href = "http://www.cs.rice.edu/~kavraki/papers/utrecht.ps">Probabilistic Roadmaps for Path Planning in High DimensionalConfiguration Spaces,</a> <i>IEEE Transactions on Robotics and Automation</i>, 12(4), 1996, 566-580.(Also available as STANFORD-CS-TR-94-1519.)<li> L. Kavraki, J.-C. Latombe, R. Motwani, and P. Raghavan,<!WA4><a href ="http://www.cs.rice.edu/~kavraki/papers/stoc95.ps"> Randomized Query Processing in Robot Motion Planning</a><i> Proceedings of the 27th Annual ACM Symposium onTheory of Computing (STOC)</i>, Las Vegas, NV, 1995,353-362.<li> L. Kavraki, M. Kolountzakis, and J.-C. Latombe, <!WA5><a href ="http://www.cs.rice.edu/~kavraki/papers/icra96.ps"> Analysis of Probabilistic Networks for Path Planning</a>Proceedings of the <i>InternationalConference on Robotics and Automation</i>, Minneapolis, MN, 1996. <li> L. Kavraki, J.-C. Latombe, <!WA6><a href ="http://www.cs.rice.edu/~kavraki/papers/r_iros94.ps">Randomized Preprocessing of Configuration Space forPath Planning: Articulated Robots</a>,<i> Proceedings of the IEEE/RSJ/GI International Conference onIntelligent Robots and Systems (IROS) </i>, Munchen, Germany,1994, 1764-1771.<li> B. Barraquand, L. Kavraki, J.-C. Latombe, T.-Y. Li, R. Motwani, and P.Raghavan, <!WA7><a href="http://www.cs.rice.edu/~kavraki/papers/isrr95.ps">A Random Sampling Scheme for Robot Path Planning</a>,<i>Proc. of the 7th International Symposium on Robotics Research</i>,G.~Giralt and G.~Hirzinger (eds.), Springer, New York, NY, 1996,249-264.<li> L. Kavraki, <!WA8><a href ="http://www.cs.rice.edu/~kavraki/papers/ft.ps"> Computation of Configuration Space ObstaclesUsing the Fast Fourier Transform</a> <i>IEEE Transactions on Robotics and Automation</i>, 11(3), 1995, 408-413.</menu><P><b> Note: </b>A simplified version of PRM (Probabilistic RoadMap Planner)described in the first paper above can be obtained by anonymous ftp from:flamingo.stanford.edu/pub/kavraki/prm.tar.gz<P><h3> Molecular Biology and Medical Applications </h3> <!WA9><img src="http://www.cs.rice.edu/~kavraki/caffeine.gif"> <P><menu><li> P. Finn, D. Halperin, L. Kavraki, J.-C. Latombe, R. Motwani, C. Shelton and S. Venkat, <!WA10><a href = http://www.cs.rice.edu/~kavraki/papers/mol.ps> Geometric Manipulation of FlexibleLigands</a> <i> Proceedings of the ACM Workshop on Applied ComputationalGeometry</i> Philadelphia, May 1996. <li> A. Schweikard, R. Tombropoulos, L. Kavraki, J. Adler, and J.-C. Latombe,<!WA11><a href ="http://www.cs.rice.edu/~kavraki/papers/med94.ps">Treatment Planning for a Radiosurgical System withGeneral Kinematics</a><i> Proceedings of the IEEE InternationalConference on Robotics and Automation</i>San Diego, CA, 1994, 1720-1727.</menu><P><h3> Part Orientation and Manufacturing </h3><menu><li> L. Kavraki, <!WA12><a href ="http://www.cs.rice.edu/~kavraki/papers/orient.ps"> On the Numberof Equilibrium Placements of Mass Distributions in Elliptic Potential Fields</a>, Stanford Technical Report. CS-TR-95-1559.<li> L. Kavraki, J.-C. Latombe, and R.H. Wilson, <!WA13><a href = "http://www.cs.rice.edu/~kavraki/papers/ipl93.ps"> On the Complexity of Assembly Partitioning</a>, in <i> Information Processing Letters </i>, v 48(5), 1993, 229-235.<li> R.H. Wilson, L. Kavraki, J.-C. Latombe, and T. Lozano-Pérez, <!WA14><a href = "http://www.cs.rice.edu/~kavraki/papers/2hand.ps"> Two-Handed Assembly Sequencing</a>, <i>International Journal of Robotics Research</i>, 14(4), 1995, 335-350.<li> L. Kavraki, M.N. Kolountzakis, <!WA15><a href= "http://www.cs.rice.edu/~kavraki/papers/asm94.ps"> ``Partitioning an Assembly into Connected Parts is NP-hard'' </a><i> Information Processing Letters</i>, 55, 1995, 159-165.</menu><P><h3> Thesis </h3><i>Random Networks in Configuration Space for Fast PathPlanning</i>, Technical Report STAN-CS-TR-95-1535,Stanford University, January 1995. Can be obtained by anonymous ftp from flamingo.stanford.edu/pub/kavraki. <p><HR><nl><nl><p>Last Updated 10/30/96 <address>kavraki@cs.rice.edu</address></html>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?