CS326 1 An Intelligent User Interface with Motion Planning for 3D Navigation Tsai-Yen Li and Hung-Kai Ting Computer Science Department, National Chengchi.

Slides:



Advertisements
Similar presentations
Probabilistic Roadmaps. The complexity of the robot’s free space is overwhelming.
Advertisements

Motion Planning for Point Robots CS 659 Kris Hauser.
NUS CS5247 Motion Planning for Camera Movements in Virtual Environments By Dennis Nieuwenhuisen and Mark H. Overmars In Proc. IEEE Int. Conf. on Robotics.
By Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars Emre Dirican
Probabilistic Roadmap
Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.
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.
1 Reactive Pedestrian Path Following from Examples Ronald A. Metoyer Jessica K. Hodgins Presented by Stephen Allen.
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.
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles (1991) Jerome Barraquand Jean-Claude Latombe.
Integrating FEM-based deformable obstacles in PRM Comp768 project presentation Mert Sedef.
David Hsu, Robert Kindel, Jean- Claude Latombe, Stephen Rock Presented by: Haomiao Huang Vijay Pradeep Randomized Kinodynamic Motion Planning with Moving.
Nearest Neighborhood Search in Motion Planning Lakshmi Reddy B Advisor: Nancy M. Amato Parasol lab Department of Computer Science Texas A&M University.
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
“Visibility-based Probabilistic Roadmaps for Motion Planning” Siméon, Laumond, Nissoux Presentation by: Eric Ng CS326A: Paper Review Spring 2003.
Precomputed Search Trees: Planning for Interactive Goal-Driven Animation Manfred Lau and James Kuffner Carnegie Mellon University.
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
Motion Planning for Camera Movements in Virtual Environments Authors: D. Nieuwenhuisen, M. Overmars Presenter: David Camarillo.
Planning Paths for Elastic Objects Under Manipulation Constraints Florent Lamiraux Lydia E. Kavraki Rice University Presented by: Michael Adams.
CS326 1 An Intelligent User Interface with Motion Planning for 3D Navigation Tsai-Yen Li and Hung-Kai Ting Computer Science Department, National Chengchi.
Providing Haptic ‘Hints’ to Automatic Motion Planners Providing Haptic ‘Hints’ to Automatic Motion Planners Burchan Bayazit Joint Work With Nancy Amato.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Probabilistic Roadmaps: Basic Techniques.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Dongkyu, Choi.
Simulating Virtual Human Crowds with a Leader-Follower Model Tsai-Yen Li, Ying-Juin Jeng, Shih-I Chang National Chengchi University Presented by Romain.
Simulating Virtual Human Crowds with a Leader-Follower Model Tsai-Yen Li, Ying-Juin Jeng, Shih-I Chang National Chengchi University Slides updated and.
Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Presented by Mohammed Irfan Rafiq.
1 Path Planning in Expansive C-Spaces D. HsuJ. –C. LatombeR. Motwani Prepared for CS326A, Spring 2003 By Xiaoshan (Shan) Pan.
NUS CS 5247 David Hsu1 Last lecture  Multiple-query PRM  Lazy PRM (single-query PRM)
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,
CS 326A: Motion Planning Kynodynamic Planning + Dealing with Moving Obstacles + Dealing with Uncertainty + Dealing with Real-Time Issues.
Robot Motion Planning Bug 2 Probabilistic Roadmaps Bug 2 Probabilistic Roadmaps.
Path Planning in Expansive C-Spaces D. HsuJ.-C. LatombeR. Motwani CS Dept., Stanford University, 1997.
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Constraint-Based Motion Planning using Voronoi Diagrams Maxim Garber and Ming C. Lin Department of Computer.
Integrated Grasp and Motion Planning For grasping an object in a cluttered environment several tasks need to take place: 1.Finding a collision free path.
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Chris Allocco.
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.
June 12, 2001 Jeong-Su Han An Autonomous Vehicle for People with Motor Disabilities by G. Bourhis, O.Horn, O.Habert and A. Pruski Paper Review.
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
© Manfred Huber Autonomous Robots Robot Path Planning.
Robotics Chapter 5 – Path and Trajectory Planning
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
By: James Ross. Outline  Collision Conecpts  Axis Aligned Bounding Box  ECMs  Objective  Methodology  Expected Results.
Institute for Visualization and Perception Research 1 © Copyright 2000 Haim Levkowitz Introduction (Foley & Van Dam Ch 1) Uses of computer graphics … Some.
CLASS 10 SCENE GRAPHS BASIC ANIMATION CS770/870. A scene Graph A data structure to hold components of a scene Usually a Tree of a Directed Acyclic Graph.
Deterministic Sampling Methods for Spheres and SO(3) Anna Yershova Steven M. LaValle Dept. of Computer Science University of Illinois Urbana, IL, USA.
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.
Interface Opportunities for 3D Data and Media User Interface Software TechNote Panel Virginia Tech CS Fall 2002 Nicholas F. Polys Umur Yilmaz Will Lee.
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
HIERARCHICAL TREES OF UNSTEADY SIMULATION DATASETS Marek Gayer and Pavel Slavík C omputer G raphics G roup Department of Computer Science and Engineering.
Laboratory of mechatronics and robotics Institute of solid mechanics, mechatronics and biomechanics, BUT & Institute of Thermomechanics, CAS Mechatronics,
City College of New York 1 John (Jizhong) Xiao Department of Electrical Engineering City College of New York Mobile Robot Control G3300:
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Planning Tracking Motions for an Intelligent Virtual Camera Tsai-Yen Li & Tzong-Hann Yu Presented by Chris Varma May 22, 2002.
Project by: Qi-Xing & Samir Menon. Motion Planning for the Human Hand Generate Hand Skeleton Define Configuration Space Sample Configuration Space for.
Autonomous Robots Robot Path Planning (2) © Manfred Huber 2008.
Instructor Prof. Shih-Chung Kang 2008 Spring
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
Last lecture Configuration Space Free-Space and C-Space Obstacles
Humanoid Motion Planning for Dual-Arm Manipulation and Re-Grasping Tasks Nikolaus Vahrenkamp, Dmitry Berenson, Tamim Asfour, James Kuffner, Rudiger Dillmann.
Klaas Werkman Arjen Vellinga
Chapter 4 . Trajectory planning and Inverse kinematics
Robotics meet Computer Science
Presentation transcript:

CS326 1 An Intelligent User Interface with Motion Planning for 3D Navigation Tsai-Yen Li and Hung-Kai Ting Computer Science Department, National Chengchi University Taipei, Taiwan Shih-Chung Jessy Kang

CS D Navigation Interactive 3D graphics is becoming popular on desktop personal computers. VRML browser WALK mode

CS326 3 Difficulties in Current Technology Difficulties in 3D Navigation:Difficulties in 3D Navigation: –Using 2D mouse to navigate in 3D environment is a nightmare for novice users. –Precise navigation control is difficult to achieve with low frame rates

CS326 4 Traditional 3D User Interface How to navigate in 3D environment by 2D mouse?How to navigate in 3D environment by 2D mouse? 1.User drags a velocity vector v 2.Decompose v into v x, v y 3.V x refers to rotational velocity 4.V y refers to linear velocity forward and backward 5.Move view point (camera) V VxVx VxVx VyVy VyVy

CS326 5 Traditional 3D User Interface Potential Problem in the Mouse ControlPotential Problem in the Mouse Control 1.If there is potential collision=> stop 2.User may be stuck in certain location, and need to move backward first to escape

CS326 6 Solutions 1.Predict users’ intention 2.Generate a roadmap automatically to help users avoid unnecessary maneuvers due to collisions with the environment Integrate road map planner in 3D navigation

CS326 7 Intelligent 3D User Interface Predict Users’ IntentionPredict Users’ Intention A.No modification: A1, A2 B.Direct modification: B1, B2 C.Indirect modification: C

CS326 8 Intelligent 3D User Interface (cont.) Computing Smooth Maneuver PathComputing Smooth Maneuver Path A.Trivial path: straight line path, A1 B.Non-Trivial path: no straight line, A2 C.No path: no actions

CS326 9 Implementation Modify VRML browserModify VRML browser based on Java3D SDK library mouse events 1.The routine for processing mouse events viewpoint configuration 2.The routine for updating next viewpoint configuration Randomized Roadmap PlannerRandomized Roadmap Planner 1.Pre-compute C-space obstacle with linear-time algorithm. (Lozano-Perez 1983) 2.Store in 3D bitmap 128x128x128 3.Divide C-space into 8x8x8=512 regions and sample up to 4 free configurations in each region. 4.Give up sampling in each region after 20 trials. 5.Connect all pairs of nodes in the same or neighboring regions

CS Experiment Setting Regular PCRegular PC with a Celeron 300A processor WALK modeWALK mode in VRML browsers 10 testers –6 CS major students –2 are familiar with VRML browser –2 do not use computer regularly.

CS checking points in maze-like environment A bouncing ball helps user identify check point A 2D layout provides for testers Experiment Setting 2D-layout map of the maze VRML browser Top View of Maze Environment

CS Experiment Result Planner-generated non-trivial paths

CS Experiment Result Comparison of navigation efficiency w/ and w/o path planning Performance speed up about 73% Save 1/3 navigation steps

CS Experiment Analysis

CS Conclusion A path planner with a randomized roadmap approach is used to assist a user in navigating through difficult areas where a user often get stuck with traditional user interfaces. The researchers believe that this intelligent user interface is effective because –it can generate the geometric reasoning tasks while retaining the advantages of direct manipulation.

CS Future Work Consider dynamic and unbounded workspace with incremental roadmap construction. Extend to –Different tasks –Different virtual scenes –Different systems of various computing powers.

CS Thank You