Header logo is



Active Uncertainty Calibration in Bayesian ODE Solvers
Active Uncertainty Calibration in Bayesian ODE Solvers

Kersting, H., Hennig, P.

Proceedings of the 32nd Conference on Uncertainty in Artificial Intelligence (UAI), pages: 309-318, (Editors: Ihler, A. and Janzing, D.), AUAI Press, June 2016 (conference)

Abstract
There is resurging interest, in statistics and machine learning, in solvers for ordinary differential equations (ODEs) that return probability measures instead of point estimates. Recently, Conrad et al.~introduced a sampling-based class of methods that are `well-calibrated' in a specific sense. But the computational cost of these methods is significantly above that of classic methods. On the other hand, Schober et al.~pointed out a precise connection between classic Runge-Kutta ODE solvers and Gaussian filters, which gives only a rough probabilistic calibration, but at negligible cost overhead. By formulating the solution of ODEs as approximate inference in linear Gaussian SDEs, we investigate a range of probabilistic ODE solvers, that bridge the trade-off between computational cost and probabilistic calibration, and identify the inaccurate gradient measurement as the crucial source of uncertainty. We propose the novel filtering-based method Bayesian Quadrature filtering (BQF) which uses Bayesian quadrature to actively learn the imprecision in the gradient measurement by collecting multiple gradient evaluations.

ei pn

link (url) Project Page Project Page [BibTex]

link (url) Project Page Project Page [BibTex]


Automatic {LQR} Tuning Based on {G}aussian Process Global Optimization
Automatic LQR Tuning Based on Gaussian Process Global Optimization

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

In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pages: 270-277, IEEE, IEEE International Conference on Robotics and Automation, May 2016 (inproceedings)

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. Results of a two- and four- dimensional tuning problems highlight the method’s potential for automatic controller tuning on robotic platforms.

am ics pn

Video PDF DOI Project Page [BibTex]

Video PDF DOI Project Page [BibTex]


no image
Batch Bayesian Optimization via Local Penalization

González, J., Dai, Z., Hennig, P., Lawrence, N.

Proceedings of the 19th International Conference on Artificial Intelligence and Statistics (AISTATS), 51, pages: 648-657, JMLR Workshop and Conference Proceedings, (Editors: Gretton, A. and Robert, C. C.), May 2016 (conference)

ei pn

link (url) Project Page [BibTex]

link (url) Project Page [BibTex]


Probabilistic Approximate Least-Squares
Probabilistic Approximate Least-Squares

Bartels, S., Hennig, P.

Proceedings of the 19th International Conference on Artificial Intelligence and Statistics (AISTATS), 51, pages: 676-684, JMLR Workshop and Conference Proceedings, (Editors: Gretton, A. and Robert, C. C. ), May 2016 (conference)

Abstract
Least-squares and kernel-ridge / Gaussian process regression are among the foundational algorithms of statistics and machine learning. Famously, the worst-case cost of exact nonparametric regression grows cubically with the data-set size; but a growing number of approximations have been developed that estimate good solutions at lower cost. These algorithms typically return point estimators, without measures of uncertainty. Leveraging recent results casting elementary linear algebra operations as probabilistic inference, we propose a new approximate method for nonparametric least-squares that affords a probabilistic uncertainty estimate over the error between the approximate and exact least-squares solution (this is not the same as the posterior variance of the associated Gaussian process regressor). This allows estimating the error of the least-squares solution on a subset of the data relative to the full-data solution. The uncertainty can be used to control the computational effort invested in the approximation. Our algorithm has linear cost in the data-set size, and a simple formal form, so that it can be implemented with a few lines of code in programming languages with linear algebra functionality.

ei pn

link (url) Project Page Project Page [BibTex]

link (url) Project Page Project Page [BibTex]


no image
On designing an active tail for body-pitch control in legged robots via decoupling of control objectives

Heim, S. W., Ajallooeian, M., Eckert, P., Vespignani, M., Ijspeert, A.

In ASSISTIVE ROBOTICS: Proceedings of the 18th International Conference on CLAWAR 2015, pages: 256-264, 2016 (inproceedings)

dlg

[BibTex]

[BibTex]

2008


Passive compliant quadruped robot using central pattern generators for locomotion control
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]

2008


DOI [BibTex]


Graph signature for self-reconfiguration planning
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]


An active connection mechanism for modular self-reconfigurable robotic systems based on physical latching
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]

2006


Project course "Design of Mechatronic Systems"
Project course "Design of Mechatronic Systems"

Koch, C., Spröwitz, A., Radler, O., Strohla, T.

In IEEE International Conference on Mechatronics, pages: 69-72, IEEE, Budapest, 2006 (inproceedings)

Abstract
The course "Design of Mechatronic Systems" at Technische Universität Ilmenau imparts the systematic procedure of mechatronic design. This paper shows the main features of VDI Guideline 2206, which provides the structured background for students education in mechatronics. Furthermore practical teaching experiences and results from the course are described.

dlg

DOI [BibTex]

2006


DOI [BibTex]