Locomotion in modular robots using the Roombots Modules Semester Project Sandra Wieser, Alexander Spröwitz, Auke Jan Ijspeert.

Slides:



Advertisements
Similar presentations
Optimized Sensory-motor Couplings plus Strategy Extensions for the TORCS Car Racing Challenge COBOSTAR Cognitive BodySpaces for Torcs based Adaptive Racing.
Advertisements

Reactive and Potential Field Planners
Local Search Algorithms
Kinematic Synthesis of Robotic Manipulators from Task Descriptions June 2003 By: Tarek Sobh, Daniel Toundykov.
Motion Planning for Point Robots CS 659 Kris Hauser.
The Greedy Method1. 2 Outline and Reading The Greedy Method Technique (§5.1) Fractional Knapsack Problem (§5.1.1) Task Scheduling (§5.1.2) Minimum Spanning.
Robotics applications of vision-based action selection Master Project Matteo de Giacomi.
Effective Reinforcement Learning for Mobile Robots Smart, D.L and Kaelbing, L.P.
Save the Gulf (stream) Functional Goal: Minimize oil leaks Sub-goals – Performance: Maximize area covered. – Fault-tolerance How: Search, recruit, and.
SA-1 Probabilistic Robotics Probabilistic Sensor Models Beam-based Scan-based Landmarks.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
‘Initial state’ coordinations reproduce the instant flexibility for human walking By: Esmaeil Davoodi Dr. Fariba Bahrami In the name of GOD May, 2007 Reference:
Control Design to Achieve Dynamic Walking on a Bipedal Robot with Compliance Young-Pil Jeon.
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles (1991) Jerome Barraquand Jean-Claude Latombe.
Using OpenRDK to learn walk parameters for the Humanoid Robot NAO A. Cherubini L. Iocchi it’s me F. Giannone M. Lombardo G. Oriolo.
Local search algorithms
Local search algorithms
Two types of search problems
Sandra Wieser Alexander Spröwitz Auke Jan Ijspeert.
Optimization via Search CPSC 315 – Programming Studio Spring 2009 Project 2, Lecture 4 Adapted from slides of Yoonsuck Choe.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Kinodynamic Planning Using Probabalistic Road Maps Steven M. LaValle James J. Kuffner, Jr. Presented by Petter Frykman.
Synchronization of movements of a real humanoid robot with music Amstutz Patrick BIRG, EPFL.
1 Design of a controller for sitting of infants Semester Project July 5, 2007 Supervised by: Ludovic Righetti Prof. Auke J. Ijspeert Presented by: Neha.
Coordinating Central Pattern Generators for Locomotion For repetitive movements such as seen in locomotion, oscillators have been proposed to control the.
Semester Project Defense: Locomotion in Modular Robots: YaMoR Host 3 and Roombots. Simon Lépine Supervisors: Auke Ijspeert Alexander Spröwitz.
Locomotion Exploiting Body Dynamics - Semester Project - Student: Matteo de Giacomi Supervisor: Jonas Buchli.
Optimization via Search CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 4 Adapted from slides of Yoonsuck Choe.
Biped Robots. Definitions Static Walking Static Walking The centre of gravity of the robot is always within the area bounded by the feet that are touching.
Offline Programming to Online using IPS
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Vilalta&Eick: Informed Search Informed Search and Exploration Search Strategies Heuristic Functions Local Search Algorithms Vilalta&Eick: Informed Search.
Introduction to Computer Vision and Robotics: Motion Generation
Chapter 7 Optimization. Content Introduction One dimensional unconstrained Multidimensional unconstrained Example.
Legged Robot Locomotion Control  Legged Robot Locomotion Control  CPG-and-reflex based Control of Locomotion.
Rhythmic Movements Questions: –How do they happen? –What do they mean? –Where do they come from? Reflex chain? Sequential pattern of activation? Reverberatory.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Path Planning for a Point Robot
Chapter 3 Dr. Bahaa Al-Sheikh & Eng. Mohammed Al-Sumady Intoduction to Engineering Introduction to Engineering Design 1.
Muhammad Al-Nasser Mohammad Shahab Stochastic Optimization of Bipedal Walking using Gyro Feedback and Phase Resetting King Fahd University of Petroleum.
Robotics Sharif In the name of Allah. Robotics Sharif Introduction to Robotics o Leila Sharif o o Lecture #2: The.
How Much Randomness Makes a Tool Randomized? Petr Fišer, Jan Schmidt Faculty of Information Technology Czech Technical University in Prague
2005MEE Software Engineering Lecture 11 – Optimisation Techniques.
University of Windsor School of Computer Science Topics in Artificial Intelligence Fall 2008 Sept 11, 2008.
Motor Control. Beyond babbling Three problems with motor babbling: –Random exploration is slow –Error-based learning algorithms are faster but error signals.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
CHAPTER 4, Part II Oliver Schulte Summer 2011 Local Search.
Tetris Agent Optimization Using Harmony Search Algorithm
FORS 8450 Advanced Forest Planning Lecture 6 Threshold Accepting.
Local search algorithms In many optimization problems, the state space is the space of all possible complete solutions We have an objective function that.
Optimization Problems
Monte-Carlo based Expertise A powerful Tool for System Evaluation & Optimization  Introduction  Features  System Performance.
A Grasp-Based Motion Planning Algorithm for Character Animation M. Kalisiak, M. van de Panne Eurographics Workshop on Computer Animation & Simulation 2000.
INTRO TO OPTIMIZATION MATH-415 Numerical Analysis 1.
Arms, Legs, Wheels, Tracks, and What Really Drives Them Effectors and Actuators.
Robot Intelligence Technology Lab. 10. Complex Hardware Morphologies: Walking Machines Presented by In-Won Park
K m b Damped SHM “Damping Constant” (kg/s) “Damping Parameter” (s -1 ) “Natural Frequency” (rad/s) EOM: damped oscillator.
Robot Intelligence Technology Lab. Evolutionary Robotics Chapter 3. How to Evolve Robots Chi-Ho Lee.
Autonomous Dynamically Simulated Creatures for Virtual Environments Paul Urban Supervisor: Prof. Shaun Bangay Honours Project 2001.
Constraints Satisfaction Edmondo Trentin, DIISM. Constraint Satisfaction Problems: Local Search In many optimization problems, the path to the goal is.
Local search algorithms In many optimization problems, the path to the goal is irrelevant; the goal state itself is the solution State space = set of "complete"
Generation and Testing of Gait Patterns for Walking Machines Using Multi-Objective Optimization and Learning Automata Jeeves Lopes dos Santos Cairo L.
From: Robogami: A Fully Integrated Low-Profile Robotic Origami
J. Gonzalez-Gomez, E. Boemo
Dr. Juan González-Gómez
Ayan Dutta1, Prithviraj Dasgupta1, Carl Nelson2
The use of Neural Networks to schedule flow-shop with dynamic job arrival ‘A Multi-Neural Network Learning for lot Sizing and Sequencing on a Flow-Shop’
First Exam 18/10/2010.
Beyond Classical Search
Presentation transcript:

Locomotion in modular robots using the Roombots Modules Semester Project Sandra Wieser, Alexander Spröwitz, Auke Jan Ijspeert

Goal of the Project  To explore the locomotion possibilities of a modular robot.  This robot is composed by passive elements and Roombots robots  The used CPG is the one developed by Ludovic Righetti at BIRG (Pattern generators with sensory feedback for the control of quadruped locomotion, Ludovic Righetti and Auke Jan Ijspeert)  The optimization method used is Powell’s algorithm  To discuss the pertinence of the initial decisions 2Sandra Wieser, Locomotion in modular robotics

Robot’s Structure  Table  4 legs, 2 modules per leg  Chair (stool)  3 legs, 2 modules per leg 3Sandra Wieser, Locomotion in modular robotics Roombot

CPG (Central Pattern Generator)  Principle  Distinction between swing and stand phase  Limit cycle behavior  Possibility of using sensor feedback and coupling  Possibility for the actuator to be in continuous rotation  Example of gait generation: (Pattern generators with sensory feedback for the control of quadruped locomotion, Ludovic Righetti and Auke Jan Ijspeert) 4Sandra Wieser, Locomotion in modular robotics

Free Parameters  Continuous / Discrete Parameters  Continuous parameter can be optimized with Powell’s method  Example: amplitude of oscillation  Discrete parameters have to be arbitrary set, or tried by hand.  Example: A servomotor can work as oscillator or wheel. So the “working mode” parameter is OSCILLATION or ROTATION.  The number of parameters to optimize has to be as small as possible, or the optimization process will take too much time. 5Sandra Wieser, Locomotion in modular robotics

Free Parameters  Connections between modules  CPG and servomotor phi=±offset +X  A total of 124 continuous parameters and 26 discrete parameters. Continuous parameters are reduced to 7. 6Sandra Wieser, Locomotion in modular robotics

Optimization  Powell algorithm (N dimensions)  Direction set algorithm  Gradient descendant  Golden Search (1 dimension)  Also gradient descendant  Minimum between brackets, brackets closer at each iteration.  Fitness function:  To maximize: radial distance covered in 20 seconds  To minimize:, where D is the distance (P final -P 0 ) 7Sandra Wieser, Locomotion in modular robotics

First Results (1)  We tried an optimization of the parameters for the chair (3 legs, 2 modules per leg).  The modules have 3 motors: s1, m1, s2.  There’s a common value for all s1 motors, another for all s2 motors, and so on  Each configuration of rotation and oscillation was tested. (3 motors, 2 possible configuration per motor, 2 3 optimizations)  An optimization process takes around 2 hours 8Sandra Wieser, Locomotion in modular robotics

First Results (2) Distance Covered [m] (P 0 =A)Distance Covered [m] (P 0 =B) RRR-4.32 ORO RRO ROR ROO1.75- ORR OOR OOO The fitness function has various local minima/maxima Powell’s can’t find the global minimum/maximum of the function Run Powell many times with different random starting points, then taking the maximum of the maxima 9Sandra Wieser, Locomotion in modular robotics

First Discussion (2)  Optimization  Fitness landscape for critical solutions Two factors make the function to optimize irregular (noisy): Constraints due to passive elements (legs torn and stuck) Maximum torque values makes sometimes the robot fall 10Sandra Wieser, Locomotion in modular robotics

Schedule  Initial plan  Actually done Week Tasks Documentation reading Introducing Webots Robots D+I CPG (D) Optimization (I) Experiments setup (I) Simulations running plotting/gather results Week Tasks Documentation reading Introducing Webots Robots D+I CPG D+I Optimization Experimental setup(chair) Debugging Running simulation (chair) 11Sandra Wieser, Locomotion in modular robotics

Schedule  Still to be done  Exploration of motion’s possibilities of the table robot  Implementation of different gaits matrix  Test of different robot/parameters configuration Week Tasks Gait Matrix (table) structure (table) Running simulation (table) Gather/plotting results Final report 12Sandra Wieser, Locomotion in modular robotics

Results(3)  Bad results are not only due to torque values… Sandra Wieser, Locomotion in modular robotics13