A Grasp-based Motion Planning Algorithm for Intelligent Character Animation Maciej Kalisiak

Slides:



Advertisements
Similar presentations
Primal-dual Algorithm for Convex Markov Random Fields Vladimir Kolmogorov University College London GDR (Optimisation Discrète, Graph Cuts et Analyse d'Images)
Advertisements

Heuristic Search techniques
Reactive and Potential Field Planners
Constraint Satisfaction Problems Russell and Norvig: Chapter
1 Constraint Satisfaction Problems A Quick Overview (based on AIMA book slides)
Manipulation Planning. In 1995 Alami, Laumond and T. Simeon proposed to solve the problem by building and searching a ‘manipulation graph’.
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
Lecture 13 Last time: Games, minimax, alpha-beta Today: Finish off games, summary.
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
Planning under Uncertainty
Motion Editing and Retargetting Jinxiang Chai. Outline Motion editing [video, click here]here Motion retargeting [video, click here]here.
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
Trajectory Generation How do I get there? This way!
Motion Planning for Camera Movements in Virtual Environments Authors: D. Nieuwenhuisen, M. Overmars Presenter: David Camarillo.
MAE 552 – Heuristic Optimization Lecture 27 April 3, 2002
Optimization via Search CPSC 315 – Programming Studio Spring 2009 Project 2, Lecture 4 Adapted from slides of Yoonsuck Choe.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Probabilistic Roadmaps: Basic Techniques.
Constraint Satisfaction Problems
Trading optimality for speed…
CSSE463: Image Recognition Day 30 Due Friday – Project plan Due Friday – Project plan Evidence that you’ve tried something and what specifically you hope.
MAE 552 – Heuristic Optimization
Continuum Crowds Adrien Treuille, Siggraph 王上文.
Robot Motion Planning Bug 2 Probabilistic Roadmaps Bug 2 Probabilistic Roadmaps.
A Grasp-based Motion Planning Algorithm for Character Animation Maciej Kalisiak and Michiel van de Panne Department of Computer Science, University of.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Chapter 5 Outline Formal definition of CSP CSP Examples
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.
Generalized Standard Foot Trajectory for a Quadruped Walking Vehicle (Shigeo Hirose, Osamu Kunieda ) Presentation: Guillaume Poncin.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Lydia E. Kavraki Petr Švetka Jean-Claude Latombe Mark H. Overmars Presented.
Optimization via Search CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 4 Adapted from slides of Yoonsuck Choe.
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Constraint Satisfaction Problems
Protein Structure Alignment by Incremental Combinatorial Extension (CE) of the Optimal Path Ilya N. Shindyalov, Philip E. Bourne.
Deformable Models Segmentation methods until now (no knowledge of shape: Thresholding Edge based Region based Deformable models Knowledge of the shape.
CSSE463: Image Recognition Day 30 This week This week Today: motion vectors and tracking Today: motion vectors and tracking Friday: Project workday. First.
Stochastic Algorithms Some of the fastest known algorithms for certain tasks rely on chance Stochastic/Randomized Algorithms Two common variations – Monte.
Robotics Chapter 5 – Path and Trajectory Planning
Automated human motion in constrained environments Maciej Kalisiak
EECS 274 Computer Vision Segmentation by Clustering II.
Artificial Intelligence CS482, CS682, MW 1 – 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis,
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Fall 2006 Jim Martin.
Thursday, May 9 Heuristic Search: methods for solving difficult optimization problems Handouts: Lecture Notes See the introduction to the paper.
Towards Practical Automated Motion Synthesis Auslander, Fukunaga, Partovi, Christensen, Hsu, Reiss, Shuman, Marks, Ngo.
Introduction to Motion Planning
Chapter 5 Constraint Satisfaction Problems
ELEC692 VLSI Signal Processing Architecture Lecture 3
Announcement "A note taker is being recruited for this class. No extra time outside of class is required. If you take clear, well-organized notes, this.
Introduction to Artificial Intelligence (G51IAI) Dr Rong Qu Blind Searches - Introduction.
A Grasp-Based Motion Planning Algorithm for Character Animation M. Kalisiak, M. van de Panne Eurographics Workshop on Computer Animation & Simulation 2000.
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
CS 2750: Machine Learning Linear Regression Prof. Adriana Kovashka University of Pittsburgh February 10, 2016.
Optimization via Search
School of Computer Science & Engineering
Heuristic Optimization Methods
Local Search Algorithms
Introduction to Artificial Intelligence
Abstraction Transformation & Heuristics
Artificial Intelligence (CS 370D)
Motion Planning for a Point Robot (2/2)
Finding Heuristics Using Abstraction
Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Nov. 7, 2000
Constraint Satisfaction Problems
More on Search: A* and Optimization
WELCOME.
Sept, 19, 2007 NSH 3211 Hyun Soo Park, Iacopo Gentilini
Sept, 19, 2007 NSH 3211 Hyun Soo Park, Iacopo Gentilini
Local Search Algorithms
Presentation transcript:

A Grasp-based Motion Planning Algorithm for Intelligent Character Animation Maciej Kalisiak

Introduction human character animation constrained environments example problem related research areas

Animation Techniques many methods: –motion capture –specific gait models –handcrafted controllers –spacetime constraints –etc. cannot solve our problem

Randomized Path Planning (RPP) freespace motion planning piano mover’s problem example RPP solution

Combined Approach borrow ideas from animation and RPP starting point: RPP need to add: –knowledge of human gaits –notion of comfort –moving while in contact with environment

Simplest “Planner” character’s state repeated perturbations, i.e., Brownian motion perturbations move COM inefficient

Potential-guided Planner P(q) = COM’s shortest distance to goal solve using gradient descent analytic gradient computation not feasible repeatedly sample q’s neighbourhood and choose perturbations that result in largest drop in P(q)

Local Minima gradient descent stops at any minimum use “random walks” to escape –Brownian motion of predetermined duration use “backtracking” if minimum too deep –revert to a previous point in solution, followed by a random walk

Deep Minimum Example

Smoothing solution embodies complete history of search process also, very noisy a trajectory filter post-process is applied –removes extraneous motion segments –makes remaining motion fluid

Our Extensions grasp points grasp constraint comfort heuristic system gait finite state machine adapted gradient descent, random walk, smoothing filters

Grasp Points represent potential points of contact reduces the grasp search space “grasp”: attachment of limb to grasp point three types

Grasp Constraint some number and type of grasps must always be in effect the number and type of grasps dictated by GFSM rest of planner must preserve existing grasps (gradient descents, random walks, smoothing)

The Gait FSM provides distinct behaviours states represent gaits edges represent transitions each edge has associated preconditions and effects GFSM consulted after every step of the gradient descent

Heuristic System each heuristic measures some quality of q D(q): overall discomfort, a potential field assuming a comfortable position consists of using gradient descent through D(q)

Complete System

Results

Future Work 3D grasp surfaces arbitrary, non-human skeletons complex grasping motion speed control learning

Contributions human character animation algorithm for constrained environments –grasp point discretization of environment –grasp constraint –comfort modeling using heuristics –gait FSM –adapted RPP algorithms to grasp constraint

~FIN~ MPEG movies of results available at:

Appendix (extra slides that might prove useful in answering questions)

Character Structure

bitmap and distance map

Alternate gradient descent view

Motion without Heuristics

Smoothing Algorithm

Need for Limb Smoothing

Limb Smoothing Solution

Implemented GFSM

Implemented Heuristics