Rising from Various Lying Postures Wen-Chieh Lin and Yi-Jheng Huang Department of Computer Science National Chiao Tung University, Taiwan.

Slides:



Advertisements
Similar presentations
Rapidly Exploring Random Trees Data structure/algorithm to facilitate path planning Developed by Steven M. La Valle (1998) Originally designed to handle.
Advertisements

CMU SCS Carnegie Mellon Univ. Dept. of Computer Science /615 – DB Applications Faloutsos & Pavlo Lecture#11 (R&G ch. 11) Hashing.
Automating Graph-Based Motion Synthesis Lucas Kovar Michael Gleicher University of Wisconsin-Madison.
Kinodynamic RRTs with Fixed Time Step and Best-Input Extension Are Not Probabilistically Complete Tobias Kunz, Mike Stilman.
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.
Geometric Algorithms for Conformational Analysis of Long Protein Loops J. Cortess, T. Simeon, M. Remaud- Simeon, V. Tran.
Tree-Based Planning Nancy M. Amato Parasol Lab,Texas A&M University.
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles (1991) Jerome Barraquand Jean-Claude Latombe.
Introduction to Data-driven Animation Jinxiang Chai Computer Science and Engineering Texas A&M University.
Presenter: Robin van Olst. Avneesh SudRussell Gayle Erik Andersen Stephen GuyMing Lin Dinesh Manocha.
Motion Editing and Retargetting Jinxiang Chai. Outline Motion editing [video, click here]here Motion retargeting [video, click here]here.
Motion Planning of Multi-Limbed Robots Subject to Equilibrium Constraints. Timothy Bretl Presented by Patrick Mihelich and Salik Syed.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Collision Detection and Distance Computation: Feature Tracking Methods.
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.
Rapidly Expanding Random Trees
Self-Collision Detection and Prevention for Humonoid Robots Paper by James Kuffner et al. Presented by David Camarillo.
Self-Collision Detection and Prevention for Humonoid Robots Paper by James Kuffner et al. Jinwhan Kim.
Filling Arbitrary Holes in Finite Element Models 17 th International Meshing Roundtable 2008 Schilling, Bidmon, Sommer, and Ertl.
Motion Planning for Legged Robots on Varied Terrain Kris Hauser, Timothy Bretl, Jean-Claude Latombe Kensuke Harada, Brian Wilcox Presented By Derek Chan.
Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Presented by Mohammed Irfan Rafiq.
Planning for Humanoid Robots Presented by Irena Pashchenko CS326a, Winter 2004.
Presented By: Huy Nguyen Kevin Hufford
RRT-Connect path solving J.J. Kuffner and S.M. LaValle.
Behavior Planning for Character Animation Manfred Lau and James Kuffner Carnegie Mellon University.
Constraint-based Motion Optimization Using A Statistical Dynamic Model Jinxiang Chai Texas A&M University.
CS274 Spring 01 Lecture 5 Copyright © Mark Meyer Lecture V Higher Level Motion Control CS274: Computer Animation and Simulation.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Constraint-Based Motion Planning using Voronoi Diagrams Maxim Garber and Ming C. Lin Department of Computer.
Randomized Planning for Short Inspection Paths Tim Danner and Lydia E. Kavraki 2000 Presented by Dongkyu, Choi On the day of 28 th May 2003 CS326a: Motion.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Collision Detection and Distance Computation.
NUS CS5247 Motion Planning for Humanoid Robots Presented by: Li Yunzhen.
A Randomized Approach to Robot Path Planning Based on Lazy Evaluation Robert Bohlin, Lydia E. Kavraki (2001) Presented by: Robbie Paolini.
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.
Multi-Layered Navigation Meshes Wouter G. van Toll, Atlas F. Cook IV, Roland Geraerts ICT.OPEN 2011.
NUS CS5247 Motion Planning for Humanoid Robots Slides from Li Yunzhen and J. Kuffner.
IMPLEMENTATION ISSUES REGARDING A 3D ROBOT – BASED LASER SCANNING SYSTEM Theodor Borangiu, Anamaria Dogar, Alexandru Dumitrache University Politehnica.
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
Adapting Simulated Behaviors For New Characters Jessica K. Hodgins and Nancy S. Pollard presentation by Barış Aksan.
BIPEDAL LOCOMOTION Prima Parte Antonio D'Angelo.
Dynamic-Domain RRTs Anna Yershova, Steven M. LaValle 03/08/2006.
Rapidly Exploring Random Trees for Path Planning: RRT-Connect
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
Feedback controller Motion planner Parameterized control policy (PID, LQR, …) One (of many) Integrated Approaches: Gain-Scheduled RRT Core Idea: Basic.
Motion Planning in Games Mark Overmars Utrecht University.
Modeling & Planning Deniz Güven Needle Insertion.
Yoonsang Lee Sungeun Kim Jehee Lee Seoul National University Data-Driven Biped Control.
Introduction to Motion Planning
Administration Feedback on assignment Late Policy
NUS CS5247 Dynamically-stable Motion Planning for Humanoid Robots Presenter Shen zhong Guan Feng 07/11/2003.
Laboratory of mechatronics and robotics Institute of solid mechanics, mechatronics and biomechanics, BUT & Institute of Thermomechanics, CAS Mechatronics,
Priama syntéza pohybu s použitím sekvenčného Monte Carlo Prezentácia vedeckej práce Rastislav Hekel, Martin Slavkovský
Tree-Growing Sample-Based Motion Planning
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Rapidly-exploring.
Randomized Kinodynamics Planning Steven M. LaVelle and James J
RRT-Blossom RRT with local flood-fill behavior Maciej Kalisiak DGP Laboratory University of Toronto Michiel van de Panne Imager Laboratory.
Constrained Synthesis of Textural Motion for Animation Shmuel Moradoff Dani Lischinski The Hebrew University of Jerusalem.
Project by: Qi-Xing & Samir Menon. Motion Planning for the Human Hand Generate Hand Skeleton Define Configuration Space Sample Configuration Space for.
Department of Computer Science Columbia University rax Dynamically-Stable Motion Planning for Humanoid Robots Paper Presentation James J. Kuffner,
Randomized KinoDynamic Planning Steven LaValle James Kuffner.
9/30/20161 Path Planning Cognitive Robotics David S. Touretzky & Ethan Tira-Thompson Carnegie Mellon Spring 2012.
CSE Advanced Computer Animation Short Presentation Topic: Locomotion Kang-che Lee 2009 Fall 1.
WELCOME.
Synthesis of Motion from Simple Animations
Dimitris Valeris Thijs Ratsma
Humanoid Motion Planning for Dual-Arm Manipulation and Re-Grasping Tasks Nikolaus Vahrenkamp, Dmitry Berenson, Tamim Asfour, James Kuffner, Rudiger Dillmann.
Chapter 4 . Trajectory planning and Inverse kinematics
Stefan Oßwald, Philipp Karkowski, Maren Bennewitz
Presentation transcript:

Rising from Various Lying Postures Wen-Chieh Lin and Yi-Jheng Huang Department of Computer Science National Chiao Tung University, Taiwan

Lin & Huang, Rising from Various Lying Postures 2 Motivation Rising up is a very common and important motion – Human / robot / avatar could fall and need stand up – reflects physical capability and style variation Rarely addressed in computer animation – focus on motion control of general types of motions – Not address motion varieties

Lin & Huang, Rising from Various Lying Postures 3 Why is rising up hard? Rich variations – various lying postures – various environments – different characters (style, physical capability) Complex motor skills – collision avoidance – balance maintenance – adaptation

Lin & Huang, Rising from Various Lying Postures 4 Basic Idea Small database for typical rising motions Motion planning for large variations Dynamics filtering for small variations

Lin & Huang, Rising from Various Lying Postures 5 Small database for typical rising motions Most varieties appear at lying-to-squatting 14 rising motions from prone, supine, and lateral positions on flat ground rising motion database

Lin & Huang, Rising from Various Lying Postures 6 Motion planning for large variations Connects an arbitrary lying pose to database – avoids collisions – satisfies constraints rising motion databasevarious lying postures...

Lin & Huang, Rising from Various Lying Postures 7 Dynamics filtering for small variations Ensures physical plausibility Adapts to environments and characters DynamicsController torques output motion planned motion external forces

Lin & Huang, Rising from Various Lying Postures 8 Related Work: Computer Animation Composable controllers – Faloutsos et al., SIGGRAPH 2001 Contact-rich motion control – Liu et al., SIGGRAPH 2010 Both focus on motion control of various types of motions Not address the motion varieties – crucial for rising up motions

Lin & Huang, Rising from Various Lying Postures 9 Related Work: Robotics Hot topic in humanoid research – Morimoto and Doya, IROS’98 – Fujiewara et al. IROS’03 – Hirukawa et al., IJRR’05 – Kanehiro et al., ICRA’07 Focus on robustness instead of varieties and flexibilities Hirukawa et al.

Lin & Huang, Rising from Various Lying Postures 10 Related Work: Biomechanics Address analysis rather than generation of rising motions – McCoy and VanSant, Physical Therapy, 1993 – Ford-Smith and VanSant, Physical Therapy, 1993

Lin & Huang, Rising from Various Lying Postures 11 Motion Planning Problem Goal Initial

Lin & Huang, Rising from Various Lying Postures 12 Rapidly-exploring random tree (RRT) Steve LaValleSteve LaValle

Lin & Huang, Rising from Various Lying Postures 13 RRT-connect [Kuffner et al. 2000]

Lin & Huang, Rising from Various Lying Postures 14 RRT-connect [Kuffner et al. 2000] 1. T a executes EXTEND function

Lin & Huang, Rising from Various Lying Postures 15 RRT-connect [Kuffner et al. 2000] 2. Generate a random node x rand as a reference node

Lin & Huang, Rising from Various Lying Postures 16 RRT-connect [Kuffner et al. 2000] 3. Find x near on T a (nearest to x rand )

Lin & Huang, Rising from Various Lying Postures 17 RRT-connect [Kuffner et al. 2000] 4. Grow x new toward x rand (within distance ε)

Lin & Huang, Rising from Various Lying Postures 18 RRT-connect [Kuffner et al. 2000] 5. T b executes EXTEND function

Lin & Huang, Rising from Various Lying Postures 19 RRT-blossom [Kalisiak & van de Panne, 2006] Blossom – add multiple samples – explore space more quickly Sub-goal RRT-Blossom RRT

Lin & Huang, Rising from Various Lying Postures 20 RRT-blossom Regression – avoids searching spanning nodes – merge nearby nodes Regression! Regression

Lin & Huang, Rising from Various Lying Postures 21 Initial posture Full-body RRT-blossom Ground collision Cut illegal motion Adjust constraint Cut illegal motion Adjust constraint Obstacle & Self collision Smoothing and dynamics filtering MotionMotion Cut illegal motion Adjust constraint Partial-body RRT-blossom Yes Yes No No Connecting posture selection EnvironmentEnvironment Stage I Stage II Stage III Key posture

Lin & Huang, Rising from Various Lying Postures 22 Connecting Posture Selection Posture Posture difference Accelerating search by clustering the motion database

Lin & Huang, Rising from Various Lying Postures 23 Motion Planning Strategies Loose-to-strict iterative refinement Spatiotemporally local refinement Full-body RRT-blossom Ground collision Cut illegal motion Adjust constraint Cut illegal motion Adjust constraint Obstacle & Self collision Cut illegal motion Adjust constraint Partial-body RRT-blossom Yes Yes No No Stage II EnvironmentEnvironment

Lin & Huang, Rising from Various Lying Postures 24 RRT-blossom Modifications RRT-blossom is originally proposed for lower-dimensional configuration space To handle motion planning in high- dimensional posture space – plan global orientation and joint angle separately Impose joint limit constraint and avoid collision in the blossom operation

Lin & Huang, Rising from Various Lying Postures 25 Dynamics Filtering Track a planned motion using velocity-driven control [Tsai et al., TVCG 2010] Balance by virtual actuator control [Pratt et al.] DynamicsController torques output motion planned motion external forces

Lin & Huang, Rising from Various Lying Postures 26 Dynamics Filtering (cont.) In some cases, our controller may not be able to track from squatting to standing – connect to a nearest rising motion in the database – fine since less variations from squatting to standing

Lin & Huang, Rising from Various Lying Postures 27 Results Our database only has14 motions of rising up on flat ground (CMU MOCAP database) Rising up from random initial postures Rising up with an initial and a key posture Rising up in various environments Motion retargeting of rising up

Lin & Huang, Rising from Various Lying Postures 28 R ising from random initial poses 20 prone positions20 lateral positions20 supine positions

Lin & Huang, Rising from Various Lying Postures 29 Rising from a sitting pose

Lin & Huang, Rising from Various Lying Postures 30 Rising with given initial and key poses

Lin & Huang, Rising from Various Lying Postures 31 Rising from prone with a key pose

Lin & Huang, Rising from Various Lying Postures 32 Rising from lateral with a key pose

Lin & Huang, Rising from Various Lying Postures 33 Rising from sitting with a key pose

Lin & Huang, Rising from Various Lying Postures 34 Rising from different environments

Lin & Huang, Rising from Various Lying Postures 35 Arm motion adapts to environments

Lin & Huang, Rising from Various Lying Postures 36 Rising up under a table

Lin & Huang, Rising from Various Lying Postures 37 Rising up on different ground

Lin & Huang, Rising from Various Lying Postures 38 Motion Retargeting

Lin & Huang, Rising from Various Lying Postures 39 Quality evaluation by human subjects score range from 10 (best) to 1 (worst) 27 males and 13 females aged 19 to 60

Lin & Huang, Rising from Various Lying Postures 40 Conclusion Simple and effective approach – Small database + motion planning + dynamics filtering Generate rising up motions with varieties – various lying postures and environments – physically plausible Efficient motion planning strategy – Loose-to-strict spatiotemporally local refinement strategy

Lin & Huang, Rising from Various Lying Postures 41

Lin & Huang, Rising from Various Lying Postures 42 Basic Idea Limited database + dynamics simulation – 14 rising motions Motion planning – increases motion varieties – avoids collisions Dynamics filtering – increases physical plausibility – reflects influences of environments

Lin & Huang, Rising from Various Lying Postures 43 Rapidly-exploring random tree (RRT) Steve LaValleSteve LaValle

Lin & Huang, Rising from Various Lying Postures 44 RRT-connect [Kuffner et al. 2000] 1. T a executes EXTEND function 2. Generate a random vertex x rand as a reference vertex 3. Find x near on T a (nearest to x rand ) 4. Grow x new toward x rand (within distance ε) 5. T b executes EXTEND function

Lin & Huang, Rising from Various Lying Postures 45 Approach Overview Stage I: connecting posture selection – Given P init, find a closest P con Stage II: motion planning – Find a collision-free sequence between P init and P con Stage III: dynamics filtering – Tracking the planned motion

Lin & Huang, Rising from Various Lying Postures 46 Rising from a sitting pose