1 Anna Yershova Dept. of Computer Science, Duke University October 20, 2009 Anna Yershova NIFP Workshop, Rice University Sampling and Searching Methods.

Slides:



Advertisements
Similar presentations
Dynamic Spatial Mixture Modelling and its Application in Cell Tracking - Work in Progress - Chunlin Ji & Mike West Department of Statistical Sciences,
Advertisements

Rapidly Exploring Random Trees Data structure/algorithm to facilitate path planning Developed by Steven M. La Valle (1998) Originally designed to handle.
Anna Yershova 1, Steven M. LaValle 2, and Julie C. Mitchell 3 1 Dept. of Computer Science, Duke University 2 Dept. of Computer Science, University of Illinois.
Complete Motion Planning
Probabilistic Roadmaps. The complexity of the robot’s free space is overwhelming.
DARPA Mobile Autonomous Robot SoftwareMay Adaptive Intelligent Mobile Robotics William D. Smart, Presenter Leslie Pack Kaelbling, PI Artificial.
Extracting Minimalistic Corridor Geometry from Low-Resolution Images Yinxiao Li, Vidya, N. Murali, and Stanley T. Birchfield Department of Electrical and.
Piecewise Convex Contouring of Implicit Functions Tao Ju Scott Schaefer Joe Warren Computer Science Department Rice University.
Watching Unlabeled Video Helps Learn New Human Actions from Very Few Labeled Snapshots Chao-Yeh Chen and Kristen Grauman University of Texas at Austin.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
Iterative Relaxation of Constraints (IRC) Can’t solve originalCan solve relaxed PRMs sample randomly but… start goal C-obst difficult to sample points.
COMPUTER GRAPHIC IN TRAINING STUDENTS WHOSE MAJOR IS SOFTWARE Yevgeny Bashkov, Donetsk National Technical University, Vitaly.
Multi-Robot Motion Planning Jur van den Berg. Outline Recap: Configuration Space for Single Robot Multiple Robots: Problem Definition Multiple Robots:
Asst. Prof. Yusuf Sahillioğlu
Graph Based Semi- Supervised Learning Fei Wang Department of Statistical Science Cornell University.
Path-Finding with Motion Constraints Amongst Obstacles in Real Time Strategies By Jeremiah J. Shepherd Committee: Jijun Tang Roger Dougal Jason O’Kane.
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
On Experimental Research in Sampling-based Motion Planning Roland Geraerts Workshop on Benchmarks in Robotics Research IROS 2006.
Search-based Path Planning with Homotopy Class Constraints Subhrajit Bhattacharya Vijay Kumar Maxim Likhachev University of Pennsylvania GRASP L ABORATORY.
1998/5/21by Chang I-Ning1 ImageRover: A Content-Based Image Browser for the World Wide Web Introduction Approach Image Collection Subsystem Image Query.
Automated Changes of Problem Representation Eugene Fink LTI Retreat 2007.
RRT-Connect path solving J.J. Kuffner and S.M. LaValle.
BINARY MORPHOLOGY and APPLICATIONS IN ROBOTICS. Applications of Minkowski Sum 1.Minkowski addition plays a central role in mathematical morphology 2.It.
Lakshmikar reddy Nearest Neighborhood Search in Motion Planning Lakshmi Reddy B Xiabing Xu Nancy M. Amato
CS 326A: Motion Planning Probabilistic Roadmaps: Sampling and Connection Strategies.
Generating Uniform Incremental Grids on SO(3) Using the Hopf Fibration Anna Yershove, Steven M LaValle, and Julie C. Mitchell Jory Denny CSCE 643.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Lydia E. Kavraki Petr Švetka Jean-Claude Latombe Mark H. Overmars Presented.
Mapping and Pursuit-Evasion Strategies For a Simple Wall-Following Robot Anna Yershova Duke University Algorithms Seminar April 20, 2010.
Modeling of interactions between physics and mathematics
Voronoi Diagram A Captivating Geometrical Construct Presented by: Lamour Roberts Preceptor: Dr. Bruno Guerrieri (Associate Professor of Mathematics) Department.
Inverse Kinematics for Molecular World Sadia Malik April 18, 2002 CS 395T U.T. Austin.
Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain Anna Yershova 1 Léonard Jaillet 2 Thierry Siméon 2 Steven M. LaValle 1 1.
Laplacian Surface Editing
CONTI’2008, 5-6 June 2008, TIMISOARA 1 Towards a digital content management system Gheorghe Sebestyen-Pal, Tünde Bálint, Bogdan Moscaliuc, Agnes Sebestyen-Pal.
Kansas State University Department of Computing and Information Sciences CIS 830: Advanced Topics in Artificial Intelligence From Data Mining To Knowledge.
Deterministic Sampling Methods for Spheres and SO(3) Anna Yershova Steven M. LaValle Dept. of Computer Science University of Illinois Urbana, IL, USA.
Anna Yershova Dept. of Computer Science University of Illinois
Pursuit / Evasion in Polygonal and General Regions The Work: by LaValle et al. The Presentation: by Geoff Hollinger and Thanasis Ke(c)hagias.
Randomized Approaches to Motion-Planning Problem Hennadiy Leontyev The University of North Carolina at Chapel Hill.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Scaling to New Heights Retrospective IEEE/ACM SC2002 Conference Baltimore, MD.
Algorithms for Robot-based Network Deployment, Repair, and Coverage Gaurav S. Sukhatme Center for Robotics and Embedded.
Dynamic-Domain RRTs Anna Yershova, Steven M. LaValle 03/08/2006.
How to start research V. Jayalakshmi. Why do we research? – To solve a problem – To satisfy an itch – To gain more market share/ Develop and improve –
Behrouz Haji Soleimani Dr. Moradi. Outline What is uncertainty? Some examples Solutions to uncertainty Ignoring uncertainty Markov Decision Process (MDP)
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
Anna Yershova Thesis Defense Dept. of Computer Science, University of Illinois August 5, 2008 Sampling and Searching Methods for Practical Motion Planning.
Representing Geometry (CAD) information in dynamic (Modelica) models MSDL August 29 th, 2009 By Chahé Adourian.
1 Distributed and Optimal Motion Planning for Multiple Mobile Robots Yi Guo and Lynne Parker Center for Engineering Science Advanced Research Computer.
Deterministic Sampling Methods for Spheres and SO(3) Anna Yershova Steven M. LaValle Dept. of Computer Science University of Illinois Urbana, IL, USA.
Raquel A. Romano 1 Scientific Computing Seminar May 12, 2004 Projective Geometry for Computer Vision Projective Geometry for Computer Vision Raquel A.
Based on the success of image extraction/interpretation technology and advances in control theory, more recent research has focused on the use of a monocular.
Similarity Access for Networked Media Connectivity Pavel Zezula Masaryk University Brno, Czech Republic.
Tree-Growing Sample-Based Motion Planning
Modeling Protein Flexibility with Spatial and Energetic Constraints Yi-Chieh Wu 1, Amarda Shehu 2, Lydia Kavraki 2,3  Provided an approach to generating.
Randomized Kinodynamics Planning Steven M. LaVelle and James J
SuperResolution (SR): “Classical” SR (model-based) Linear interpolation (with post-processing) Edge-directed interpolation (simple idea) Example-based.
BITS Pilani, Dubai Campus TECHNOFEST 2013 PAPER PRESENTATION Title of Paper Paper Area / Discipline: Students ID & Name: Date of Presentation:
Protein structure prediction Computer-aided pharmaceutical design: Modeling receptor flexibility Applications to molecular simulation Work on this paper.
Digital Elevation Models (DEMs)Constructing Grid DEMConstructing Contour Map Constructing TIN DEM Grid DEM Quality Metric A Digital Elevation Model (DEM)
Sub-fields of computer science. Sub-fields of computer science.
Brief Intro to Machine Learning CS539
Rapidly-Exploring Random Trees
Knowledge Discovery, Machine Learning, and Social Mining
29 August 2007 Sampling and Searching Methods for Practical Motion Planning Algorithms Anna Yershova PhD Preliminary Examination Dept. of Computer Science.
PRM based Protein Folding
Zaid H. Rashid Supervisor Dr. Hassan M. Alwan
Sampling and Connection Strategies for Probabilistic Roadmaps
Algorithm design (computational geometry)
Presentation transcript:

1 Anna Yershova Dept. of Computer Science, Duke University October 20, 2009 Anna Yershova NIFP Workshop, Rice University Sampling and Searching Methods in Robotics and Computational Biology

2 Anna Yershova Introduction Research Theme Underlying spaces in many real-world problems have similar geometric and topological structures. Ideas and methods used to solve these problems are shared across disciplines. Examples:  Configuration and state spaces in motion planning  Information spaces in robotics  Conformation spaces in structural computational biology High-dimensional manifolds, or collections of manifolds NIFP Workshop, Rice University

3 Motion Planning Technical Contributions Contributions by Topic Anna Yershova Motion Planning uniform deterministic sampling over configuration spaces uniform deterministic sampling over configuration spaces efficient nearest-neighbor computations guided sampling for efficient exploration Planning Under Sensing Uncertainty mapping and pursuit-evasion with a wall-following robot Structural Computational Biology exact protein structure determination from sparse NMR data NIFP Workshop, Rice University

4 Sampling Spheres Anna Yershova Technical Contributions Motion Planning + uniform  deterministic + incremental  grid structure Ordering on faces + Ordering inside faces Performance of many motion planning algorithms can be significantly improved using careful sampling over configuration spaces NIFP Workshop, Rice University

5 Sampling SO(3) Anna Yershova Technical Contributions Motion Planning Hopf coordinates preserve the fiber bundle structure of RP 3 Locally, RP 3 is a product of S 1 and S 2 Joint work with J.C.Mitchell NIFP Workshop, Rice University

6 OutcomesOutcomes Anna Yershova Technical Contributions Motion PlanningPublications: Generating Uniform Incremental Grids on SO(3) Using the Hopf Fibrations (with S. Jain, S. M. LaValle and J.C. Mitchell) International Journal on Robotics Research (IJRR 2009), in press Generating Uniform Incremental Grids on SO(3) Using the Hopf Fibrations (with S. M. LaValle and J. C. Mitchell) International Workshop on the Algorithmic Foundations of Robotics (WAFR 2008) Deterministic sampling methods for spheres and SO(3) (with S. M. LaValle) IEEE International Conference on Robotics and Automation (ICRA 2004) Incremental Grid Sampling Strategies in Robotics (with S. R. Lindemann, and S. M. LaValle) International Workshop on the Algorithmic Foundations of Robotics (WAFR 2004) Open-source library: NIFP Workshop, Rice University

7 Motion Planning Technical Contributions Contributions by Topic Anna Yershova Motion Planning uniform deterministic sampling over configuration spaces efficient nearest-neighbor computations efficient nearest-neighbor computations guided sampling for efficient exploration Planning Under Sensing Uncertainty mapping and pursuit-evasion with a wall-following robot Structural Computational Biology exact protein structure determination from sparse NMR data NIFP Workshop, Rice University

l5l5 l1l1 l9l9 l6l6 l3l3 l 10 l7l7 l4l4 l8l8 l2l2 Technical Contributions Motion Planning Kd-trees with modified metric Anna Yershova Main idea: construction: unchanged procedure query: modify metric between the query point and enclosing rectangles in the kd-tree l1l1 l8l8 1 l2l2 l3l3 l4l4 l5l5 l7l7 l6l6 l9l9 l [0,1]xS 1 NIFP Workshop, Rice University

9 Technical Contributions Motion Planning Anna Yershova Publications: Improving Motion Planning Algorithms by Efficient Nearest Neighbor Searching (with S. M. LaValle) IEEE Transactions on Robotics 23(1): , February 2007 Efficient Nearest Neighbor Searching for Motion Planning (with S. M. LaValle) In Proc. IEEE International Conference on Robotics and Automation (ICRA 2002) Open-source library: Also implemented in Move3D at LAAS, and KineoWorks TM OutcomesOutcomes NIFP Workshop, Rice University

10 Sensing Uncertainty in Robotics Technical Contributions Contributions by Topic Anna Yershova Motion Planning uniform deterministic sampling over configuration spaces efficient nearest-neighbor computations guided sampling for efficient exploration Planning Under Sensing Uncertainty mapping and pursuit-evasion with a wall-following robot mapping and pursuit-evasion with a wall-following robot Structural Computational Biology exact protein structure determination from sparse NMR data NIFP Workshop, Rice University

11 Technical Contributions Sensing Uncertainty in Robotics Planning in Information Spaces I-space: space of all cut diagrams of planar environments Anna Yershova NIFP Workshop, Rice University

12 OutcomesOutcomes Technical Contributions Sensing Uncertainty in RoboticsPublications: Mapping and Pursuit-Evasion Strategies For a Simple Wall-Following Robot (with B. Tovar, R. Ghrist, and S. M. LaValle) submitted to IEEE Transactions on Robotics, 2009 Extracting Visibility Information by Following Walls (with B. Tovar, and S. M. LaValle) In Dagstuhl Seminar Proceedings, 06421, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, Information Spaces for Mobile Robots (with B. Tovar, J. M. O'Kane, and S. M. LaValle) invited paper at Fifth International Workshop on Robot Motion and Control (RoMoCo 2005) Bitbots: Simple Robots Solving Complex Tasks (with B. Tovar, R. Ghrist, and S. M. LaValle) In Proc. The Twentieth National Conference on Artificial Intelligence (AAAI 2005) Anna Yershova NIFP Workshop, Rice University

13 Structural Computational Geometry Technical Contributions Contributions by Topic Motion Planning uniform deterministic sampling over configuration spaces efficient nearest-neighbor computations guided sampling for efficient exploration Planning Under Sensing Uncertainty mapping and pursuit-evasion with a wall-following robot Structural Computational Biology exact protein structure determination from sparse NMR data exact protein structure determination from sparse NMR data Anna Yershova NIFP Workshop, Rice University

14 Technical Contributions Structural Computational Geometry RDC Equations for a Protein Portion 14 Anna Yershova NIFP Workshop, Rice University

15 Preliminary Results: 13dz helix 15 ProteinRMSD (Hz)Alignment Tensor (S yy, S zz ) Ubq  :25-31 C  H  : 0.32 NH: 0.24 (23.66, 16.48) (53.25, 7.65) Conformation of the portion [25-31] of the helix for human ubiquitin computed using NH and CH RDCs in two media (red) has been superimposed on the same portion from high-resolution X-ray structure (PDB Id: 1UBQ) (green). The backbone RMSD is 0.58 Å. Technical Contributions Structural Computational Geometry

16 OutcomesOutcomes Technical Contributions Structural Computational Geometry Protein Structure Determination using Sparse Orientational Restraints from NMR Data (with C. Tripathy, P. Zhou, B. R. Donald) Biochemistry Department Retreat, NC Biotechnology Center, RTP, NC, Winner of Best Poster Award. Anna Yershova NIFP Workshop, Rice University

17  Apply and extend the mathematical tools needed for solving problems in  Robotics  Algebraic varieties  Trajectories  Computational Biology  Other NMR data  Other imaging techniques  potentially other disciplines  Technology transfer between disciplinesConclusions Conclusions and Future Goals Anna Yershova NIFP Workshop, Rice University

18Conclusions Conclusions and Future Directions Thank you! Anna Yershova NIFP Workshop, Rice University

19 Motion Planning Technical Contributions Contributions by Topic Anna Yershova Motion Planning uniform deterministic sampling over configuration spaces efficient nearest-neighbor computations guided sampling for efficient exploration guided sampling for efficient exploration Planning Under Sensing Uncertainty mapping and pursuit-evasion with a wall-following robot Structural Computational Biology exact protein structure determination from sparse NMR data NIFP Workshop, Rice University

20 Technical Contributions Motion Planning KD-Tree-Based Dynamic Domain Anna Yershova NIFP Workshop, Rice University Courtesy of Kineo CAM 330 degrees of freedom

21 OutcomesOutcomes Anna Yershova Technical Contributions Motion PlanningPublications: Adaptive Tuning of the Sampling Domain for Dynamic-Domain RRTs (with L. Jaillet, S. M. LaValle and T. Simeon) In Proc. IEEE International Conference on Intelligent Robots and Systems (IROS 2005) Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain (with L. Jaillet, T. Simeon, and S. M. LaValle) In Proc. IEEE International Conference on Robotics and Automation (ICRA 2005) Also implemented in Move3D at LAAS KineoWorks TM Toyota Corporation NIFP Workshop, Rice University