Aimée Vargas, Jyh-Ming Lien, Marco Morales and Nancy M. Amato Algorithms & Applications Group Parasol Lab, Dept. of Computer Science, Texas A&M University.

Slides:



Advertisements
Similar presentations
NUS CS5247 Motion Planning for Car- like Robots using a Probabilistic Learning Approach --P. Svestka, M.H. Overmars. Int. J. Robotics Research, 16: ,
Advertisements

Configuration Space. Recap Represent environments as graphs –Paths are connected vertices –Make assumption that robot is a point Need to be able to use.
Probabilistic Roadmaps. The complexity of the robot’s free space is overwhelming.
Motion Planning for Point Robots CS 659 Kris Hauser.
Probabilistic Path Planner by Someshwar Marepalli Pratik Desai Ashutosh Sahu Gaurav jain.
By Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars Emre Dirican
Visibility Graphs May Shmuel Wimer Bar-Ilan Univ., Eng. Faculty Technion, EE Faculty.
Sampling From the Medial Axis Presented by Rahul Biswas April 23, 2003 CS326A: Motion Planning.
Presented By: Aninoy Mahapatra
Probabilistic Roadmap
A Comparative Study of Probabilistic Roadmap Planners Roland Geraerts Mark Overmars.
Probabilistic Roadmap Methods (PRMs)
Motion Planning for Tower Crane Operation. Motivation  Tower crane impacts the schedule greatly  Safety of tower crane operation is critical.
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.
Geometric Algorithms for Conformational Analysis of Long Protein Loops J. Cortess, T. Simeon, M. Remaud- Simeon, V. Tran.
Randomized Motion Planning for Car-like Robots with C-PRM Guang Song and Nancy M. Amato Department of Computer Science Texas A&M University College Station,
1 Last lecture  Configuration Space Free-Space and C-Space Obstacles Minkowski Sums.
Inspection Planning for Sensor Coverage of 3d Marine Structures Brendan Englot and Franz Hover Presented by Arvind Pereira for the CS599 Class on Sequential.
Nearest Neighborhood Search in Motion Planning Lakshmi Reddy B Advisor: Nancy M. Amato Parasol lab Department of Computer Science Texas A&M University.
Finding Narrow Passages with Probabilistic Roadmaps: The Small-Step Retraction Method Presented by: Deborah Meduna and Michael Vitus by: Saha, Latombe,
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.
1 Finding “Narrow Passages” with Probabilistic Roadmaps: The Small-Step Retraction Method Mitul Saha and Jean-Claude Latombe Research supported by NSF,
Providing Haptic ‘Hints’ to Automatic Motion Planners Providing Haptic ‘Hints’ to Automatic Motion Planners Burchan Bayazit Joint Work With Nancy Amato.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Dongkyu, Choi.
Motion Planning for Tower Crane Operation CS236A Prof. Latombe Shan Pan | Jessy Kang.
Sampling Strategies for Probabilistic Roadmaps Random Sampling for capturing the connectivity of the C-space:
RRT-Connect path solving J.J. Kuffner and S.M. LaValle.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Collision Detection and Distance Computation.
Randomized Motion Planning for Car-like Robots with C-PRM Guang Song, Nancy M. Amato Department of Computer Science Texas A&M University College Station,
A General Framework for Sampling on the Medial Axis of the Free Space Jyh-Ming Lien, Shawna Thomas, Nancy Amato {neilien,
Interactive Manipulation of Rigid Body Simulations Presenter : Chia-yuan Hsiung Proceedings of SIGGRAPH 2000 Jovan Popovi´c, Steven M. Seitz, Michael.
Robot Motion Planning Bug 2 Probabilistic Roadmaps Bug 2 Probabilistic Roadmaps.
RNA Folding Kinetics Bonnie Kirkpatrick Dr. Nancy Amato, Faculty Advisor Guang Song, Graduate Student Advisor.
Lakshmikar reddy Nearest Neighborhood Search in Motion Planning Lakshmi Reddy B Xiabing Xu Nancy M. Amato
CS 326 A: Motion Planning Collision Detection and Distance Computation.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Chris Allocco.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
Providing Haptic ‘Hints’ to Automatic Motion Planners Providing Haptic ‘Hints’ to Automatic Motion Planners Burchan Bayazit Joint Work With Nancy Amato.
Providing Haptic ‘Hints’ to Automatic Motion Planners Providing Haptic ‘Hints’ to Automatic Motion Planners by Burchan Bayazit Department of Computer Science.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Collision Detection and Distance Computation.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Lydia E. Kavraki Petr Švetka Jean-Claude Latombe Mark H. Overmars Presented.
A Randomized Approach to Robot Path Planning Based on Lazy Evaluation Robert Bohlin, Lydia E. Kavraki (2001) Presented by: Robbie Paolini.
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
May Motion Planning Shmuel Wimer Bar Ilan Univ., Eng. Faculty Technion, EE Faculty.
© Manfred Huber Autonomous Robots Robot Path Planning.
Graphics Graphics Korea University cgvr.korea.ac.kr Model Construction 고려대학교 컴퓨터 그래픽스 연구실.
Using Motion Planning to Study Protein Folding Pathways Susan Lin, Guang Song and Nancy M. Amato Department of Computer Science Texas A&M University
Khoros Yongqun He Dept. of Computer Science, Virginia Tech.
Path Planning for a Point Robot
Introduction to Robot Motion Planning Robotics meet Computer Science.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
Approximate Convex Decomposition of Polygons Reporter: Hong guang Zhou Math Dept. ZJU May 17th, 2007 Jyh-Ming Lien Nancy M. Amato Computational Geometry:
Deterministic Sampling Methods for Spheres and SO(3) Anna Yershova Steven M. LaValle Dept. of Computer Science University of Illinois Urbana, IL, USA.
Introduction to Motion Planning
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
Real-time motion planning for Manipulator based on Configuration Space Chen Keming Cis Peking University.
Laboratory of mechatronics and robotics Institute of solid mechanics, mechatronics and biomechanics, BUT & Institute of Thermomechanics, CAS Mechatronics,
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Project by: Qi-Xing & Samir Menon. Motion Planning for the Human Hand Generate Hand Skeleton Define Configuration Space Sample Configuration Space for.
Interactive Continuous Collision Detection for Polygon Soups Xin Huang 11/20/2007.
Randomized KinoDynamic Planning Steven LaValle James Kuffner.
Rapidly-Exploring Random Trees
Instructor Prof. Shih-Chung Kang 2008 Spring
PRM based Protein Folding
Last lecture Configuration Space Free-Space and C-Space Obstacles
UOBPRM: A Uniformly Distributed Obstacle-Based PRM
Presented By: Aninoy Mahapatra
Sampling and Connection Strategies for Probabilistic Roadmaps
Presentation transcript:

Aimée Vargas, Jyh-Ming Lien, Marco Morales and Nancy M. Amato Algorithms & Applications Group Parasol Lab, Dept. of Computer Science, Texas A&M University VIZMO++ A Visualization, Authoring, and Educational Tool for Motion Planning

Motion Planning consists of finding feasible motions for movable objects Many applications: robotics, computer graphics, scientific computing, … Input −Data describing the robot’s shape, articulations, constraints −Data describing the shape and configuration of obstacles −The robot’s start and goal configurations Planning Algorithm (e.g., sampling-based motion planning) −Samples configurations randomly in the Configuration Space (C-Space) −Connects each sample to one or multiple near-by samples Output −A graph describing the feasible motions −A sequence of configurations that take the robot from the start to the goal Algorithmic Motion Planning workspace

Algorithmic Motion Planning: Input 4 MultiBody Active 1 FreeBody 0 small_robot.g Connection 0 MultiBody Pasive 1 FixedBody 0 tunnel.g Connection 0 MultiBody Pasive 1 FixedBody 0 block.g Connection 0 MultiBody Pasive 1 FixedBody 0 block.g Connection … Workspace file robot obstacle Geometry files

Algorithmic Motion Planning: Output Roadmap Version Number #####PREAMBLESTART#####../obprm -cd RAPID -f serial -bbox [0.0,4.0,0.0,4.0,-5.0,14.0] -bbox_scale 1 -lp straightline rotate_at_s -gNodes OBPRM nodes 400 collPair rT rT shells 1 freePair rT rT -cNodes closest 20 components 5 5 #####PREAMBLESTOP##### #####ENVFILESTART##### serial.env #####ENVFILESTOP##### #####LPSTART##### straightline rotate_at_s 0.5 a_star_distance 6 9 #####LPSTOP##### #####CDSTART##### 3 vclip RAPID PQP #####CDSTOP##### #####DMSTART##### 5 scaledEuclidean 0.9 euclidean minkowski manhattan com #####DMSTOP##### #####GRAPHSTART##### #####GRAPHSTOP##### VIZMO_PATH_FILE Path Version … Path file Roadmap (graph) file

Motivation l Meaningful visualizations and interfaces to –Illustrate l Problems l Solutions –Help in the development and testing of motion planners –Create and modify problem instances –Try queries l Teaching aid –Illustrate how planners model motions in complex problems –Illustrate the many abstractions involved in motion planning –Allow to deal with interesting environments that otherwise may be impossible to access –Illustrate differences and similarities between motion planners –Interactive learning – Degrees of Freedom – Configuration – Configuration Space – N-dimensional Space – Graph, Tree – Connected Component – Medial Axis – Distance Metrics – …

VIZMO++ The major components include: l A user friendly interface –C++, OpenGL and Qt 4 l Visualization of the workspace/scene l Visualization of results generated by motion planners l Editor for the workspace/scene l Editor for roadmaps

VIZMO++ The major components include: l A user friendly interface l Visualization of the workspace/scene –Wired/solid modes –Change colors l Visualization of results generated by motion planners l Editor for the workspace/scene l Editor for roadmaps

VIZMO++ The major components include: l A user friendly interface l Visualization of the workspace/scene l Visualization of results generated by motion planners –path sweep volume –path animation l Editor for the workspace/scene l Editor for roadmaps

VIZMO++ The major components include: l A user friendly interface l Visualization of the workspace/scene l Visualization of results generated by motion planners –debugging –compare different methods l Editor for the workspace/scene l Editor for roadmaps

VIZMO++ The major components include: l A user friendly interface l Visualization of the workspace/scene l Visualization of results generated by motion planners l Editor for the workspace/scene –select/translate/rotate/scale –inset/delete objects –check for collision l Editor for roadmaps

VIZMO++ The major components include: l A user friendly interface l Visualization of the workspace/scene l Visualization of results generated by motion planners l Editor for the workspace/scene l Editor for roadmaps –modify –add –delete

Demo

Conclusion l VIZMO++ is a 3D tool for visualizing and editing motion planning –Environments and Problem Instances –Solutions l Future work includes –allow users to construct articulated robots –support multiple robots –support Constructive Solid Geometry (CSG) –Configuration-space visualization (2D-3D projections) –release the code

Aimée Vargas, Jyh-Ming Lien, Marco Morales and Nancy M. Amato Algorithms & Applications Group Parasol Lab, Dept. of Computer Science, Texas A&M University VIZMO++