Automated human motion in constrained environments Maciej Kalisiak

Slides:



Advertisements
Similar presentations
Reactive and Potential Field Planners
Advertisements

Probabilistic Roadmaps. The complexity of the robot’s free space is overwhelming.
Motion Planning for Point Robots CS 659 Kris Hauser.
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
Iterative Relaxation of Constraints (IRC) Can’t solve originalCan solve relaxed PRMs sample randomly but… start goal C-obst difficult to sample points.
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
CSC344: AI for Games Lecture 5 Advanced heuristic search Patrick Olivier
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!
Methods For Nonlinear Least-Square Problems
MAE 552 – Heuristic Optimization Lecture 27 April 3, 2002
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.
Constraint Satisfaction Problems
Motion Planning for Legged Robots on Varied Terrain Kris Hauser, Timothy Bretl, Jean-Claude Latombe Kensuke Harada, Brian Wilcox Presented By Derek Chan.
Trading optimality for speed…
Presented By: Huy Nguyen Kevin Hufford
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.
Extended Potential Field Method Adam A. Gonthier MEAM 620 Final Project 3/19/2006.
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.
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.
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.
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
Vilalta&Eick: Informed Search Informed Search and Exploration Search Strategies Heuristic Functions Local Search Algorithms Vilalta&Eick: Informed Search.
World space = physical space, contains robots and obstacles Configuration = set of independent parameters that characterizes the position of every point.
Deformable Models Segmentation methods until now (no knowledge of shape: Thresholding Edge based Region based Deformable models Knowledge of the shape.
© 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.
Robust Space-Time Footsteps for Agent-Based Steering By Glen Berseth 1, Mubbasir Kapadia 2, Petros Faloutsos 3 University of British Columbia 1, Rutgers.
Heuristic Optimization Methods Tabu Search: Advanced Topics.
Towards Practical Automated Motion Synthesis Auslander, Fukunaga, Partovi, Christensen, Hsu, Reiss, Shuman, Marks, Ngo.
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.
Administration Feedback on assignment Late Policy
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.
Advanced Computer Graphics Optimization Part 2 Spring 2002 Professor Brogan.
A Grasp-based Motion Planning Algorithm for Intelligent Character Animation Maciej Kalisiak
CSCE 441: Computer Graphics Forward/Inverse kinematics Jinxiang Chai.
Ion I. Mandoiu, Vijay V. Vazirani Georgia Tech Joseph L. Ganley Simplex Solutions A New Heuristic for Rectilinear Steiner Trees.
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.
CSCE 441: Computer Graphics Forward/Inverse kinematics
Character Animation Forward and Inverse Kinematics
Heuristic Optimization Methods
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
Mathematics & Path Planning for Autonomous Mobile Robots
The Functional Space of an Activity Ashok Veeraraghavan , Rama Chellappa, Amit Roy-Chowdhury Avinash Ravichandran.
Motion Planning for a Point Robot (2/2)
More on Search: A* and Optimization
Sept, 19, 2007 NSH 3211 Hyun Soo Park, Iacopo Gentilini
Path Planning in Discrete Sampled Space
Dimitris Valeris Thijs Ratsma
Efficiently Estimating Travel Time
Humanoid Motion Planning for Dual-Arm Manipulation and Re-Grasping Tasks Nikolaus Vahrenkamp, Dmitry Berenson, Tamim Asfour, James Kuffner, Rudiger Dillmann.
Sept, 19, 2007 NSH 3211 Hyun Soo Park, Iacopo Gentilini
Chapter 4 . Trajectory planning and Inverse kinematics
Classic Motion Planning Methods
Presentation transcript:

Automated human motion in constrained environments Maciej Kalisiak

Introduction human character animation constrained environments kinematic method currently 2D, extendible sample solution

Path Planning piano mover’s problem given: start and goal configurations find connecting path

Application to Human Motion

Approach starting point: RPP additions: –moving while in contact with environment –notion of comfort –knowledge of human gaits

Understanding RPP Randomized Path Planning a path planning algorithm

Simplest “Planner” character’s state: q repeated perturbations, i.e., Brownian motion repeat until goal reached

discretize into grid potential = Manhattan distance to goal flood-fill Building a Potential Field

Gradient Descent character  point mass sample q’s neighbourhood pick sample with largest drop in potential iterate until goal reached not feasible analytically

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 more fluid

Modifications grasps and grasp invariants comfort heuristic system gait finite state machine grasp-aware gradient descent, random walk, smoothing filters

Character Structure 10 links 9 joints 12 DOFs frequent re-rooting

Grasp Points represent potential points of contact three types reduce the grasp search space summarize surface characteristics

Grasp Invariants each gait dictates: –the number of grasps –the types of grasps enforced by the GFSM rest of planner must not alter existing grasps

Motion without Heuristics

Heuristic System each heuristic measures some quality of q D(q): overall discomfort, a potential field getting comfy: gradient descent through D(q)

Implemented Heuristics

The Gait FSM states represent gaits each edge has: –geometric preconditions –motion recipe –priority self-loops: gait-preserving motion that changes grasps

Complete System

More Results

Future Work 3D quadrupeds, other characters “grasp surfaces” non-limb grasping add concept of time, speed use machine learning

~FIN~

Appendix (extra slides)

Alternate gradient descent view

Smoothing Algorithm

Need for Limb Smoothing

Limb Smoothing Solution

Implemented GFSM

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