A Grasp-based Motion Planning Algorithm for Character Animation Maciej Kalisiak and Michiel van de Panne Department of Computer Science, University of.

Slides:



Advertisements
Similar presentations
Reactive and Potential Field Planners
Advertisements

Motion Planning for Point Robots CS 659 Kris Hauser.
NUS CS5247 Planning Motions with Intention Presented by: Yan Ke.
NUS CS5247 Motion Planning for Camera Movements in Virtual Environments By Dennis Nieuwenhuisen and Mark H. Overmars In Proc. IEEE Int. Conf. on Robotics.
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
Motion planning, control and obstacle avoidance D. Calisi.
1 Last lecture  Configuration Space Free-Space and C-Space Obstacles Minkowski Sums.
CS 326 A: Motion Planning Coordination of Multiple Robots.
“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.
Trajectory Week 8. Learning Outcomes By the end of week 8 session, students will trajectory of industrial robots.
Planning Paths for Elastic Objects Under Manipulation Constraints Florent Lamiraux Lydia E. Kavraki Rice University Presented by: Michael Adams.
CS 326A: Motion Planning Configuration Space. Motion Planning Framework Continuous representation (configuration space and related spaces + constraints)
1 Dijkstra's Shortest Path Algorithm Find shortest path from s to t. s 3 t
1 Dijkstra's Shortest Path Algorithm Find shortest path from s to t. s 3 t
Panos Trahanias: Autonomous Robot Navigation
Planning for Humanoid Robots Presented by Irena Pashchenko CS326a, Winter 2004.
Presented By: Huy Nguyen Kevin Hufford
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,
Behavior Planning for Character Animation Manfred Lau and James Kuffner Carnegie Mellon University.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Panos Trahanias: Autonomous Robot Navigation PATH PLANNING.
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 Coordination of Multiple Robots.
“ Walk to here ” : A Voice Driven Animation System SCA 2006 Zhijin Wang and Michiel van de Panne.
NUS CS5247 Motion Planning for Humanoid Robots Presented by: Li Yunzhen.
Ioannis Karamouzas, Roland Geraerts, Mark Overmars Indicative Routes for Path Planning and Crowd Simulation.
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
World space = physical space, contains robots and obstacles Configuration = set of independent parameters that characterizes the position of every point.
9/14/2015CS225B Kurt Konolige Locomotion of Wheeled Robots 3 wheels are sufficient and guarantee stability Differential drive (TurtleBot) Car drive (Ackerman.
© Manfred Huber Autonomous Robots Robot Path Planning.
Spacetime Constraints Revisited Joe Marks J. Thomas Ngo Using genetic algorithms to find solutions to spacetime constraint problems in 2D.
Robotics Chapter 5 – Path and Trajectory Planning
An Introduction to Artificial Life Lecture 4b: Informed Search and Exploration Ramin Halavati In which we see how information.
Automated human motion in constrained environments Maciej Kalisiak
DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Third Quarterly IPR Meeting May 11, 1999 P. I.s: Leonidas J. Guibas and Jean-Claude.
Ron Alterovitz, Dinesh Manocha, Jennifer Womack Christopher Bowen, Jeff Ichnowski, Jia Pan Departments of Computer Science and Occupational Science and.
Path Planning for a Point Robot
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
Administration Feedback on assignment Late Policy
Chapter 10 Minimization or Maximization of Functions.
NUS CS5247 Dynamically-stable Motion Planning for Humanoid Robots Presenter Shen zhong Guan Feng 07/11/2003.
Robotics Chapter 5 – Path and Trajectory Planning
Data Mining Course 2007 Eric Postma Clustering. Overview Three approaches to clustering 1.Minimization of reconstruction error PCA, nlPCA, k-means clustering.
A Grasp-Based Motion Planning Algorithm for Character Animation M. Kalisiak, M. van de Panne Eurographics Workshop on Computer Animation & Simulation 2000.
Introduction to Robotics Tutorial 10 Technion, cs department, Introduction to Robotics Winter
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
RRT-Blossom RRT with local flood-fill behavior Maciej Kalisiak DGP Laboratory University of Toronto Michiel van de Panne Imager Laboratory.
Management Science 461 Lecture 3 – Covering Models September 23, 2008.
A Grasp-based Motion Planning Algorithm for Intelligent Character Animation Maciej Kalisiak
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.
Cognitive Robotics 03/30/09 1 Manipulation and Path Planning Cognitive Robotics David S. Touretzky & Ethan Tira-Thompson Carnegie Mellon.
9/30/20161 Path Planning Cognitive Robotics David S. Touretzky & Ethan Tira-Thompson Carnegie Mellon Spring 2012.
Vision-Guided Humanoid Footstep Planning for Dynamic Environments
Local Search Algorithms
Mathematics & Path Planning for Autonomous Mobile Robots
Machine Learning – Regression David Fenyő
Crowd Simulation (INFOMCRWS) - Introduction to Crowd Simulation
Bowei Tang, Tianyu Chen, and Christopher Atkeson
Random WALK, BROWNIAN MOTION and SDEs
Emir Zeylan Stylianos Filippou
Humanoid Motion Planning for Dual-Arm Manipulation and Re-Grasping Tasks Nikolaus Vahrenkamp, Dmitry Berenson, Tamim Asfour, James Kuffner, Rudiger Dillmann.
Phase-Functioned Neural Networks for Character Control
Presentation transcript:

A Grasp-based Motion Planning Algorithm for Character Animation Maciej Kalisiak and Michiel van de Panne Department of Computer Science, University of Toronto Presented By: Kevin Hufford

Movie [Insert Movie] [Insert Movie] [character climbing through tight passage] [character climbing through tight passage]

Unstructured Env. Navigation Multiple Constraints Multiple Constraints  Environment, kinematic, balance, posture Need For Two Decision Types Need For Two Decision Types  Discrete Contact: what handholds to use; step on or over obstacles Contact: what handholds to use; step on or over obstacles  Continuous Other decisions once contact points are chosen Other decisions once contact points are chosen

Motion Planner Overview

Grasp Point Types Only hands and feet can grasp Only hands and feet can grasp  Load-bearing (footholds)  Pendent (handholds)  Hybrid (either)

Randomized Path Planning (RPP)/Gradient-Descent Gradient Descent Step Gradient Descent Step  Configuration change to bring character closer to goal configuration (q target ). Distance-to-goal Metric (C-space potential) Distance-to-goal Metric (C-space potential)  P(q) is shortest free-space path  (This paper: one control point at COM)  Occupancy map of environment  distance map  Evaluate P(q+  q) for stochastic choices of  q  Choose q that provides largest collision-free decrease in P

Avoiding Local Minima: Random Walk Random Walk (Brownian Motion) Random Walk (Brownian Motion)  At each coordinate j: 1/3

Backtracking (Deep Local Minima) Backtracking (Deep Local Minima)  Randomly pick new configuration with whole solution as domain Avoiding Local Minima: Backtracking

Additional Features Locomotion Preferences Locomotion Preferences Smoothing Smoothing  Linear interpolation for parts of trajectory with same grasp

Limitations/Future Work Only 2-D so far Only 2-D so far Occasional unstable or gravity-defying postures Occasional unstable or gravity-defying postures Machine learning methods could be applied Machine learning methods could be applied