Header logo is


2015


Thumb xl posterior
Automatic LQR Tuning Based on Gaussian Process Optimization: Early Experimental Results

Marco, A., Hennig, P., Bohg, J., Schaal, S., Trimpe, S.

Machine Learning in Planning and Control of Robot Motion Workshop at the IEEE/RSJ International Conference on Intelligent Robots and Systems (iROS), pages: , , Machine Learning in Planning and Control of Robot Motion Workshop, October 2015 (conference)

Abstract
This paper proposes an automatic controller tuning framework based on linear optimal control combined with Bayesian optimization. With this framework, an initial set of controller gains is automatically improved according to a pre-defined performance objective evaluated from experimental data. The underlying Bayesian optimization algorithm is Entropy Search, which represents the latent objective as a Gaussian process and constructs an explicit belief over the location of the objective minimum. This is used to maximize the information gain from each experimental evaluation. Thus, this framework shall yield improved controllers with fewer evaluations compared to alternative approaches. A seven-degree-of-freedom robot arm balancing an inverted pole is used as the experimental demonstrator. Preliminary results of a low-dimensional tuning problem highlight the method’s potential for automatic controller tuning on robotic platforms.

am ei ics pn

PDF DOI Project Page [BibTex]

2015


PDF DOI Project Page [BibTex]


no image
Inference of Cause and Effect with Unsupervised Inverse Regression

Sgouritsa, E., Janzing, D., Hennig, P., Schölkopf, B.

In Proceedings of the 18th International Conference on Artificial Intelligence and Statistics, 38, pages: 847-855, JMLR Workshop and Conference Proceedings, (Editors: Lebanon, G. and Vishwanathan, S.V.N.), JMLR.org, AISTATS, 2015 (inproceedings)

ei pn

Web PDF [BibTex]

Web PDF [BibTex]


no image
Probabilistic Interpretation of Linear Solvers

Hennig, P.

SIAM Journal on Optimization, 25(1):234-260, 2015 (article)

ei pn

Web PDF link (url) DOI [BibTex]

Web PDF link (url) DOI [BibTex]


Thumb xl maren ls
Probabilistic Line Searches for Stochastic Optimization

Mahsereci, M., Hennig, P.

In Advances in Neural Information Processing Systems 28, pages: 181-189, (Editors: C. Cortes, N.D. Lawrence, D.D. Lee, M. Sugiyama and R. Garnett), Curran Associates, Inc., 29th Annual Conference on Neural Information Processing Systems (NIPS), 2015 (inproceedings)

Abstract
In deterministic optimization, line searches are a standard tool ensuring stability and efficiency. Where only stochastic gradients are available, no direct equivalent has so far been formulated, because uncertain gradients do not allow for a strict sequence of decisions collapsing the search space. We construct a probabilistic line search by combining the structure of existing deterministic methods with notions from Bayesian optimization. Our method retains a Gaussian process surrogate of the univariate optimization objective, and uses a probabilistic belief over the Wolfe conditions to monitor the descent. The algorithm has very low computational cost, and no user-controlled parameters. Experiments show that it effectively removes the need to define a learning rate for stochastic gradient descent. [You can find the matlab research code under `attachments' below. The zip-file contains a minimal working example. The docstring in probLineSearch.m contains additional information. A more polished implementation in C++ will be published here at a later point. For comments and questions about the code please write to mmahsereci@tue.mpg.de.]

ei pn

Matlab research code link (url) [BibTex]

Matlab research code link (url) [BibTex]


no image
A Random Riemannian Metric for Probabilistic Shortest-Path Tractography

Hauberg, S., Schober, M., Liptrot, M., Hennig, P., Feragen, A.

In 18th International Conference on Medical Image Computing and Computer Assisted Intervention, 9349, pages: 597-604, Lecture Notes in Computer Science, MICCAI, 2015 (inproceedings)

ei pn

PDF DOI [BibTex]

PDF DOI [BibTex]


Thumb xl screen shot 2017 06 14 at 3.05.52 pm
Exciting Engineered Passive Dynamics in a Bipedal Robot

Renjewski, D., Spröwitz, A., Peekema, A., Jones, M., Hurst, J.

{IEEE Transactions on Robotics and Automation}, 31(5):1244-1251, IEEE, New York, NY, 2015 (article)

Abstract
A common approach in designing legged robots is to build fully actuated machines and control the machine dynamics entirely in soft- ware, carefully avoiding impacts and expending a lot of energy. However, these machines are outperformed by their human and animal counterparts. Animals achieve their impressive agility, efficiency, and robustness through a close integration of passive dynamics, implemented through mechanical components, and neural control. Robots can benefit from this same integrated approach, but a strong theoretical framework is required to design the passive dynamics of a machine and exploit them for control. For this framework, we use a bipedal spring–mass model, which has been shown to approximate the dynamics of human locomotion. This paper reports the first implementation of spring–mass walking on a bipedal robot. We present the use of template dynamics as a control objective exploiting the engineered passive spring–mass dynamics of the ATRIAS robot. The results highlight the benefits of combining passive dynamics with dynamics-based control and open up a library of spring–mass model-based control strategies for dynamic gait control of robots.

dlg

link (url) DOI Project Page [BibTex]

link (url) DOI Project Page [BibTex]


Thumb xl screen shot 2018 02 03 at 7.49.07 pm
Comparing the effect of different spine and leg designs for a small bounding quadruped robot

Eckert, P., Spröwitz, A., Witte, H., Ijspeert, A. J.

In Proceedings of ICRA, pages: 3128-3133, Seattle, Washington, USA, 2015 (inproceedings)

Abstract
We present Lynx-robot, a quadruped, modular, compliant machine. It alternately features a directly actuated, single-joint spine design, or an actively supported, passive compliant, multi-joint spine configuration. Both spine con- figurations bend in the sagittal plane. This study aims at characterizing these two, largely different spine concepts, for a bounding gait of a robot with a three segmented, pantograph leg design. An earlier, similar-sized, bounding, quadruped robot named Bobcat with a two-segment leg design and a directly actuated, single-joint spine design serves as a comparison robot, to study and compare the effect of the leg design on speed, while keeping the spine design fixed. Both proposed spine designs (single rotatory and active and multi-joint compliant) reach moderate, self-stable speeds.

dlg

link (url) DOI Project Page [BibTex]

link (url) DOI Project Page [BibTex]


no image
Probabilistic numerics and uncertainty in computations

Hennig, P., Osborne, M. A., Girolami, M.

Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, 471(2179), 2015 (article)

Abstract
We deliver a call to arms for probabilistic numerical methods: algorithms for numerical tasks, including linear algebra, integration, optimization and solving differential equations, that return uncertainties in their calculations. Such uncertainties, arising from the loss of precision induced by numerical calculation with limited time or hardware, are important for much contemporary science and industry. Within applications such as climate science and astrophysics, the need to make decisions on the basis of computations with large and complex data have led to a renewed focus on the management of numerical uncertainty. We describe how several seminal classic numerical methods can be interpreted naturally as probabilistic inference. We then show that the probabilistic view suggests new algorithms that can flexibly be adapted to suit application specifics, while delivering improved empirical performance. We provide concrete illustrations of the benefits of probabilistic numeric algorithms on real scientific problems from astrometry and astronomical imaging, while highlighting open problems with these new algorithms. Finally, we describe how probabilistic numerical methods provide a coherent framework for identifying the uncertainty in calculations performed with a combination of numerical algorithms (e.g. both numerical optimizers and differential equation solvers), potentially allowing the diagnosis (and control) of error sources in computations.

ei pn

PDF DOI [BibTex]

PDF DOI [BibTex]

2008


Thumb xl screen shot 2018 02 03 at 7.04.27 pm
Learning to Move in Modular Robots using Central Pattern Generators and Online Optimization

Spröwitz, A., Moeckel, R., Maye, J., Ijspeert, A. J.

The International Journal of Robotics Research, 27(3-4):423-443, 2008 (article)

Abstract
This article addresses the problem of how modular robotics systems, i.e. systems composed of multiple modules that can be configured into different robotic structures, can learn to locomote. In particular, we tackle the problems of online learning, that is, learning while moving, and the problem of dealing with unknown arbitrary robotic structures. We propose a framework for learning locomotion controllers based on two components: a central pattern generator (CPG) and a gradient-free optimization algorithm referred to as Powell's method. The CPG is implemented as a system of coupled nonlinear oscillators in our YaMoR modular robotic system, with one oscillator per module. The nonlinear oscillators are coupled together across modules using Bluetooth communication to obtain specific gaits, i.e. synchronized patterns of oscillations among modules. Online learning involves running the Powell optimization algorithm in parallel with the CPG model, with the speed of locomotion being the criterion to be optimized. Interesting aspects of the optimization include the fact that it is carried out online, the robots do not require stopping or resetting and it is fast. We present results showing the interesting properties of this framework for a modular robotic system. In particular, our CPG model can readily be implemented in a distributed system, it is computationally cheap, it exhibits limit cycle behavior (temporary perturbations are rapidly forgotten), it produces smooth trajectories even when control parameters are abruptly changed and it is robust against imperfect communication among modules. We also present results of learning to move with three different robot structures. Interesting locomotion modes are obtained after running the optimization for less than 60 minutes.

dlg

link (url) DOI [BibTex]

2008


link (url) DOI [BibTex]


Thumb xl screen shot 2018 02 03 at 5.40.07 pm
Passive compliant quadruped robot using central pattern generators for locomotion control

Rutishauser, S., Spröwitz, A., Righetti, L., Ijspeert, A. J.

In Proceedings of the 2008 2nd Biennial IEEE/RAS-EMBS International Conference on Biomedical Robotics and Biomechatronics, pages: 710-715, IEEE, Scottsdale, AZ, 2008 (inproceedings)

Abstract
We present a new quadruped robot, “Cheetah”, featuring three-segment pantographic legs with passive compliant knee joints. Each leg has two degrees of freedom - knee and hip joint can be actuated using proximal mounted RC servo motors, force transmission to the knee is achieved by means of a Bowden cable mechanism. Simple electronics to command the actuators from a desktop computer have been designed in order to test the robot. A Central Pattern Generator (CPG) network has been implemented to generate different gaits. A parameter space search was performed and tested on the robot to optimize forward velocity.

dlg

DOI [BibTex]

DOI [BibTex]


Thumb xl screen shot 2018 02 03 at 6.34.37 pm
Graph signature for self-reconfiguration planning

Asadpour, M., Spröwitz, A., Billard, A., Dillenbourg, P., Ijspeert, A. J.

In Proceedings of the 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, pages: 863-869, IEEE, Nice, 2008 (inproceedings)

Abstract
This project incorporates modular robots as build- ing blocks for furniture that moves and self-reconfigures. The reconfiguration is done using dynamic connection / disconnection of modules and rotations of the degrees of freedom. This paper introduces a new approach to self-reconfiguration planning for modular robots based on the graph signature and the graph edit-distance. The method has been tested in simulation on two type of modules: YaMoR and M-TRAN. The simulation results shows interesting features of the approach, namely rapidly finding a near-optimal solution.

dlg

DOI [BibTex]

DOI [BibTex]


Thumb xl screen shot 2018 02 03 at 6.36.13 pm
An active connection mechanism for modular self-reconfigurable robotic systems based on physical latching

Spröwitz, A., Asadpour, M., Bourquin, Y., Ijspeert, A. J.

In Proceedings on the 2008 IEEE International Conference on Robotics and Automation (ICRA), 2008, pages: 3508-3513, IEEE, Pasadena, CA, 2008 (inproceedings)

Abstract
This article presents a robust and heavy duty physical latching connection mechanism, which can be actuated with DC motors to actively connect and disconnect modular robot units. The special requirements include a lightweight and simple construction providing an active, strong, hermaphrodite, completely retractable connection mechanism with a 90 degree symmetry and a no-energy consumption in the locked state. The mechanism volume is kept small to fit multiple copies into a single modular robot unit and to be used on as many faces of the robot unit as possible. This way several different lattice like modular robot structures are possible. The large selection for dock-able connection positions will likely simplify self-reconfiguration strategies. Tests with the implemented mechanism demonstrate its applicative potential for self-reconfiguring modular robots.

dlg

DOI [BibTex]

DOI [BibTex]

2007


no image
Point-spread functions for backscattered imaging in the scanning electron microscope

Hennig, P., Denk, W.

Journal of Applied Physics , 102(12):1-8, December 2007 (article)

Abstract
One knows the imaging system's properties are central to the correct interpretation of any image. In a scanning electron microscope regions of different composition generally interact in a highly nonlinear way during signal generation. Using Monte Carlo simulations we found that in resin-embedded, heavy metal-stained biological specimens staining is sufficiently dilute to allow an approximately linear treatment. We then mapped point-spread functions for backscattered-electron contrast, for primary energies of 3 and 7 keV and for different detector specifications. The point-spread functions are surprisingly well confined (both laterally and in depth) compared even to the distribution of only those scattered electrons that leave the sample again.

ei pn

Web DOI [BibTex]

2007


Web DOI [BibTex]


Thumb xl screen shot 2018 02 03 at 6.38.18 pm
An easy to use bluetooth scatternet protocol for fast data exchange in wireless sensor networks and autonomous robots

Mockel, R., Spröwitz, A., Maye, J., Ijspeert, A. J.

In Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, pages: 2801-2806, IEEE, San Diego, CA, 2007 (inproceedings)

Abstract
We present a Bluetooth scatternet protocol (SNP) that provides the user with a serial link to all connected members in a transparent wireless Bluetooth network. By using only local decision making we can reduce the overhead of our scatternet protocol dramatically. We show how our SNP software layer simplifies a variety of tasks like the synchronization of central pattern generator controllers for actuators, collecting sensory data and building modular robot structures. The whole Bluetooth software stack including our new scatternet layer is implemented on a single Bluetooth and memory chip. To verify and characterize the SNP we provide data from experiments using real hardware instead of software simulation. This gives a realistic overview of the scatternet performance showing higher order effects that are difficult to be simulated correctly and guaranties the correct function of the SNP in real world applications.

dlg

DOI [BibTex]

DOI [BibTex]