1 MARS PI Meeting JSC 8/2004 Interaction Lab USC – Interaction Lab Skill Learning by Primitives-Based Demonstration & Imitation Maja Matarić - PI Marcelo.

Slides:



Advertisements
Similar presentations
Motion Planning for Point Robots CS 659 Kris Hauser.
Advertisements

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
Animation Following “Advanced Animation and Rendering Techniques” (chapter 15+16) By Agata Przybyszewska.
Presented By: Aninoy Mahapatra
4/15/2017 Using Gaussian Process Regression for Efficient Motion Planning in Environments with Deformable Objects Barbara Frank, Cyrill Stachniss, Nichola.
Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
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.
SA-1 Body Scheme Learning Through Self-Perception Jürgen Sturm, Christian Plagemann, Wolfram Burgard.
Path Planning with the humanoid robot iCub Semester Project 2008 Pantelis Zotos Supervisor: Sarah Degallier Biologically Inspired Robotics Group (BIRG)
Presented by David Stavens. Manipulation Planning Before: Want to move the robot from one configuration to another, around obstacles. Now: Want to robot.
Multi-Arm Manipulation Planning (1994) Yoshihito Koga Jean-Claude Latombe.
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
Planning Motions with Intentions By Chris Montgomery A presentation on the paper Planning Motions with Intentions written by Yoshihito Koga, Koichi Kondo,
Experiences with an Architecture for Intelligent Reactive Agents By R. Peter Bonasso, R. James Firby, Erann Gat, David Kortenkamp, David P Miller, Marc.
Robotics R&N: ch 25 based on material from Jean- Claude Latombe, Daphne Koller, Stuart Russell.
1/33 MARS PI Meeting 9/2003 Robot Learning From Human Demonstration Maja J Matarić Chad Jenkins, Marcelo Kallmann, Evan Drumwright, Nathan Miller, and.
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.
Adaptive Dynamic Collision Checking for Single and Multiple Articulated Robots in Complex Environments Schwarzer, Saha, and Latombe CS326A Winter 2004,
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 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.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Constraint-Based Motion Planning using Voronoi Diagrams Maxim Garber and Ming C. Lin Department of Computer.
CS326 1 An Intelligent User Interface with Motion Planning for 3D Navigation Tsai-Yen Li and Hung-Kai Ting Computer Science Department, National Chengchi.
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.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Chris Allocco.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
NUS CS5247 Motion Planning for Humanoid Robots Presented by: Li Yunzhen.
Definition of an Industrial Robot
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.
Advanced Programming for 3D Applications CE Bob Hobbs Staffordshire university Human Motion Lecture 3.
© Manfred Huber Autonomous Robots Robot Path Planning.
Robotics Chapter 5 – Path and Trajectory Planning
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.
CS-378: Game Technology Lecture #13: Animation Prof. Okan Arikan University of Texas, Austin Thanks to James O’Brien, Steve Chenney, Zoran Popovic, Jessica.
DARPA ITO/MARS Project Update Vanderbilt University A Software Architecture and Tools for Autonomous Robots that Learn on Mission K. Kawamura, M. Wilkes,
Deterministic Sampling Methods for Spheres and SO(3) Anna Yershova Steven M. LaValle Dept. of Computer Science University of Illinois Urbana, IL, USA.
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.
Real-time motion planning for Manipulator based on Configuration Space Chen Keming Cis Peking University.
Outline: Introduction Solvability Manipulator subspace when n<6
Behavior-based Multirobot Architectures. Why Behavior Based Control for Multi-Robot Teams? Multi-Robot control naturally grew out of single robot control.
NUS CS5247 Dynamically-stable Motion Planning for Humanoid Robots Presenter Shen zhong Guan Feng 07/11/2003.
Sampling-Based Planners. The complexity of the robot’s free space is overwhelming.
Trajectory Generation
Robotics Chapter 5 – Path and Trajectory Planning
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
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
NUS CS5247 Using a PRM Planner to Compare Centralized and Decoupled Planning for Multi-Robot Systems By Gildardo Sánchez and Jean-Claude Latombe In Proc.
Planning Tracking Motions for an Intelligent Virtual Camera Tsai-Yen Li & Tzong-Hann Yu Presented by Chris Varma May 22, 2002.
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.
Motion Planning CS121 – Winter Basic Problem Are two given points connected by a path?
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,
Bowei Tang, Tianyu Chen, and Christopher Atkeson
Presented By: Aninoy Mahapatra
Motion Planning CS121 – Winter 2003 Motion Planning.
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
Classic Motion Planning Methods
Presentation transcript:

1 MARS PI Meeting JSC 8/2004 Interaction Lab USC – Interaction Lab Skill Learning by Primitives-Based Demonstration & Imitation Maja Matarić - PI Marcelo Kallmann, Chad Jenkins - postdocs Amit Ramesh - PhD student Nathan Miller - subcontracted engineer

2 MARS PI Meeting JSC 8/2004 Interaction Lab Overall Goals Goal: –xx

3 MARS PI Meeting JSC 8/2004 Interaction Lab Major Contributions Contributions: –Development of the USC motion suit for low cost, lightweight, wireless, real-time motion collection –Cross-kinematics metrics for imitation learning, allowing for comparison and mapping of motion data across various kinematic structures –Prediction of expected sensory information for a successful grasping, from the analysis and interpolation of collected Robonaut sensory data –The use of randomized motion planning for reaching and for motion sequencing

4 MARS PI Meeting JSC 8/2004 Interaction Lab Major Contributions Demonstrations/Applications: –Teleoperation of Robonaut –The implementation of human-robot cooperation applications for a variety of tasks. An application example was demonstrated using Robosim (NASA’s Robonaut simulator)

5 MARS PI Meeting JSC 8/2004 Interaction Lab Architecture Overview USC Motion Suit Cross-kinematics metrics for imitation learning are used for collecting motion from various types of kinematics Other sources of motion collection Robot-Ready Motion Database Derivation of motion controllers based on collected motion and sensory data Robonaut Control Learned skills are represented as parameterized motion controllers Derivation of motion controllers based on collected motion and randomized roadmaps

6 MARS PI Meeting JSC 8/2004 Interaction Lab USC Motion Suit Applications:

7 MARS PI Meeting JSC 8/2004 Interaction Lab Cross-Kinematics Metric Applications:

8 MARS PI Meeting JSC 8/2004 Interaction Lab Learning Sensory Structures Applications:

9 MARS PI Meeting JSC 8/2004 Interaction Lab Collision-Free Reaching Goal: Efficient collision-free motion planning for humanoid arms Applications: –manipulation tasks in environments with obstacles –relocating grasped objects in the workspace –maintenance tasks when the tools, controls, handles, etc, to be reached are situated in difficult locations

10 MARS PI Meeting JSC 8/2004 Interaction Lab Potential Application Example Truss Assembling –Collision-free reaching for tools and for grasping bars

11 MARS PI Meeting JSC 8/2004 Interaction Lab Approach Our tests indicate that sampling-based motion planners are more efficient than other methods, e.g. such as IK with collision avoidance (Drumwright, Kallmann, Mataric, “Towards Single-Arm Reaching for Humanoids in Dynamic Environments”, submitted to Humanoids’04 ) On-Line Arms Motion Planning –We have applied the on-line Rapidly-exploring Random Trees (RRT) on the composite configuration space of the two arms –Motions can be achieved in 1 or 2 secs in simple scenarios Dynamic Roadmaps –When the workspace has few changes, dynamic roadmaps can be very efficient. Joins the advantages of multi-query methods (PRMs, PRTs, VGs) and single-query methods (RRTs, Exp. Spaces, SBLs).

12 MARS PI Meeting JSC 8/2004 Interaction Lab On-line Arms Motion Planning Example collision-free motions to pre-grasping targets –Visualization geometry: triangles –Collision geometry: 1016 triangles –Computation time: 1 to 2s, including optimization (smoothing) –Optimization takes about 0.3s (Pentium III 2.8 GHz)

13 MARS PI Meeting JSC 8/2004 Interaction Lab Path Optimization (1/2) Incremental path linearization –Simple and efficient in most cases –May be time-consuming as collision detection must be invoked before each local linearization.

14 MARS PI Meeting JSC 8/2004 Interaction Lab Path Optimization (2/2) Decoupled, sub-configuration linearization can be applied: –In the example, the top arm in the left video makes an unnecessary motion –This can be only corrected when smoothing arms independently (right video)

15 MARS PI Meeting JSC 8/2004 Interaction Lab Dynamic Roadmaps: Overview Evaluation of dynamic roadmaps for finding collision-free arm motions in changing environments Comparison with on-line bi-directional RRT 4 DOFs 7 DOFs 17 DOFs

16 MARS PI Meeting JSC 8/2004 Interaction Lab Roadmap Computation A grid is defined over the workspace Desired number of configurations are sampled

17 MARS PI Meeting JSC 8/2004 Interaction Lab Roadmap Computation Sampled nodes are connected to the k neighbors if the connection is valid, until linking all valid connections

18 MARS PI Meeting JSC 8/2004 Interaction Lab Roadmap Computation Cell localization in respect to the roadmap nodes: –For each cell, test all edges and nodes which are invalid in respect to that cell, ie, which “collide” with that cell –Each cell keeps references to the invalidated edges/nodes –More efficient methods: Hierarchical tests of cells Exploiting cell adjacency coherence (Leven and Hutchinson 2000) [2] Using graphics hardware

19 MARS PI Meeting JSC 8/2004 Interaction Lab Roadmap Computation Cells are localized and roadmap nodes and edges intersecting with objects are invalidated

20 MARS PI Meeting JSC 8/2004 Interaction Lab Roadmap Maintenance Whenever obstacles in the workspace are detected to change position, the affected cells are either liberated or occupied Reference counting management: –All roadmap nodes/edges maintain reference counters –When cells are occupied/liberated, the associated nodes/edges have their counters incremented/decremented

21 MARS PI Meeting JSC 8/2004 Interaction Lab Roadmap Maintenance Examples: 24x nodes64x nodes48x nodes

22 MARS PI Meeting JSC 8/2004 Interaction Lab Roadmap Maintenance Examples: nodes nodes

23 MARS PI Meeting JSC 8/2004 Interaction Lab Roadmap Maintenance Examples: nodes nodes

24 MARS PI Meeting JSC 8/2004 Interaction Lab Roadmap Maintenance Examples: nodes nodes

25 MARS PI Meeting JSC 8/2004 Interaction Lab Roadmap Query Find motion from initial configuration q i to goal configuration q g Retrieve nearest nodes N(q i ), N(q g ) in the roadmap Retrieve a path from N(q i ) to N(q g ): A* search, however: –Path may not exist –q i to N(q i ) may not be valid –q g to N(q g ) may not be valid In case of failure, a Bi-RRT is used as on-line planner –to fix the path if one of the tests fails –Compute the full path

26 MARS PI Meeting JSC 8/2004 Interaction Lab Experiments 100 random problems for each scenario –Random obstacles, initial and goal configurations –Failure considered after 10 seconds 7 Dynamic scenarios with: One arm Two armsRobonaut

27 MARS PI Meeting JSC 8/2004 Interaction Lab Two arm planar manipulator, planar workspace, 7 DOFs Robonaut model, 17 DOFs: 7 in each arm + 3 at the base (Pentium III 2.8 GHz) Experiments: Example Motions

28 MARS PI Meeting JSC 8/2004 Interaction Lab Up to 8 times faster in the planar workspaces Roadmap/Grid size vs. maintenance cost tradeoff Modest speed gains in 3d workspaces Experiments ScenarioGridNodesLinksDRM Time(s)RRT Time(s)Comparison One arm24x One arm64x One arm48x Two arm Two arm Robonaut Robonaut

29 MARS PI Meeting JSC 8/2004 Interaction Lab Integration with Robonaut Motions generated on our Robonaut model can be easily transferred to Robonaut Same mapping mechanism as the one used for the teleoperation with the motion suit

30 MARS PI Meeting JSC 8/2004 Interaction Lab Sequencing Parameterized Motion Motion control for complex operations require mixed type of controllers Sequencing of primitive movement controllers is required Ex: coordination of bimanual manipulations, of multiple robots, or of biped locomotion

31 MARS PI Meeting JSC 8/2004 Interaction Lab Example with Biped Locomotion We propose a search method for sequencing movement primitives The method is based on randomized roadmaps and discrete search methods The method was applied to obtain statically stable biped locomotion among obstacles

32 MARS PI Meeting JSC 8/2004 Interaction Lab Movement Primitive: Definition Any controller with a simpler parameterization over the configuration space: P i s : S i s  C where: s is the start configuration of primitive P i s S i s is the parameter space of primitive P i s C is the configuration space Primitives generate postures, not motions

33 MARS PI Meeting JSC 8/2004 Interaction Lab Total of 9 DOFs Movement control only allowed trough motion primitives parameterization, ensuring: correct support, balance, limits, collision-free Primitives: Description PRPR PLPL PBPB

34 MARS PI Meeting JSC 8/2004 Interaction Lab Primitives: Description Movement Primitive Instantiation Condition Primitive MotionParametric Space Dim. PLPL support in left foot moves right leg articulations and body rotation 4 PBPB support in both feet moves body, feet fixed with IK 3 PRPR support in right foot moves left leg articulations and body rotation 4 (Robot has 9 DOFs)

35 MARS PI Meeting JSC 8/2004 Interaction Lab Primitives: Description Movement Primitive Instantiation Condition Primitive MotionParametric Space Dim. PLPL support in left foot moves right leg articulations and body rotation 4 PBPB support in both feet moves body, feet fixed with IK 3 PRPR support in right foot moves left leg articulations and body rotation 4 (Robot has 9 DOFs)

36 MARS PI Meeting JSC 8/2004 Interaction Lab Primitives: Description Movement Primitive Instantiation Condition Primitive MotionParametric Space Dim. PLPL support in left foot moves right leg articulations and body rotation 4 PBPB support in both feet moves body, feet fixed with IK 3 PRPR support in right foot moves left leg articulations and body rotation 4 (Robot has 9 DOFs)

37 MARS PI Meeting JSC 8/2004 Interaction Lab Primitives: Description Movement Primitive Instantiation Condition Primitive MotionParametric Space Dim. PLPL support in left foot moves right leg articulations and body rotation 4 PBPB support in both feet moves body, feet fixed with IK 3 PRPR support in right foot moves left leg articulations and body rotation 4 (Robot has 9 DOFs)

38 MARS PI Meeting JSC 8/2004 Interaction Lab Sequencing: Problem Definition Given: –Primitives P i –Task completion test function t(q) : C  {0,1} Determine a sequence of concatenated valid paths in configuration space, such that: –Each path is generated by a single primitive –The first point is the current position –The last point satisfies completion test

39 MARS PI Meeting JSC 8/2004 Interaction Lab Sequencing: Search Tree Expand a roadmap in the parametric space of the motion primitive associated with c search tree

40 MARS PI Meeting JSC 8/2004 Interaction Lab Sequencing: Search Tree Determine paths leading to configurations in a different support mode search tree

41 MARS PI Meeting JSC 8/2004 Interaction Lab Sequencing: Search Tree Select lowest cost leaf c cost(c) = length(root,c) + dist(c,goal) search tree …

42 MARS PI Meeting JSC 8/2004 Interaction Lab Sequencing: Search Tree Expand a roadmap in the parametric space of the new motion primitive Continue the process until close to goal point search tree … …

43 MARS PI Meeting JSC 8/2004 Interaction Lab Obtained Examples

44 MARS PI Meeting JSC 8/2004 Interaction Lab Integrated demo with Robosim Cooperative human-robot example application Demonstration of example motions using the USC motion suit Segmentation into meaningful example Derivation of a primitive controller, which is able to interpolate the examples in order to obtain a scooping motion in any position inside the tray New tools can be reached using our motion planner

45 MARS PI Meeting JSC 8/2004 Interaction Lab Integrated demo with Robosim Example of scooping motions to different instructed locations

46 MARS PI Meeting JSC 8/2004 Interaction Lab Integrated demo with Robosim Example of sending scooping motions to Robosim

47 MARS PI Meeting JSC 8/2004 Interaction Lab Summary a b

48 MARS PI Meeting JSC 8/2004 Interaction Lab Thanks Doug JSC Robonaut Team