Wouter Wolfslag
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wouter Wolfslag has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Martijn Wisse
Department of Cognitive Robotics, Delft University of Technology, Delft, Netherlands
3 shared publications Martijn Wisse
Department of 3ME Delft University of Technology
2 shared publicationsMukunda Bharatheesha
Faculty of Mechanical, Maritime and Materials Engineering (3ME), Delft University of Technology, Delft, CD, The Netherlands
2 shared publications- Andy Ruina
Cornell University
1 shared publication - Christopher McGreavy
School of Informatics, The University of Edinburgh, Edinburgh, U.K.
1 shared publication - Chuanyu Yang
School of Informatics, University of Edinburgh, Edinburgh, UK
1 shared publication
Latest Publications
- 16 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 4 (2) , 854-861
Unparameterized Optimization of the Spring Characteristic of Parallel Elastic Actuators
In electrically actuated robots most energy losses are due to the heating of the actuators. This energy loss can be greatly reduced with parallel elastic actuators, by optimizing the elastic element such that it delivers most of the required torques. Previously used optimization methods relied on parameterizing the spring characteristic, thereby limiting the set of spring characteristics optimized over and with that the loss reduction that can be obtained. This paper shows that such parametrization is not necessary; a method is presented to compute the optimal characteristic as an analytic function of the trajectory. The efficacy of this method is demonstrated using two examples. The first example considers the optimal spring characteristic for a parallel elastic actuator supporting the human ankle during walking. The second example applies the method in combination with trajectory optimization on a single degree of freedom robot performing a specific pick-and-place task. The task at hand has a height difference between the pick and the place location. With the analytical optimal spring, it is shown that the robot can recover enough of the energy released by the package to function without external electric energy supply.
- 16 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 4 (2) , 854-861
Unparameterized Optimization of the Spring Characteristic of Parallel Elastic Actuators
In electrically actuated robots most energy losses are due to the heating of the actuators. This energy loss can be greatly reduced with parallel elastic actuators, by optimizing the elastic element such that it delivers most of the required torques. Previously used optimization methods relied on parameterizing the spring characteristic, thereby limiting the set of spring characteristics optimized over and with that the loss reduction that can be obtained. This paper shows that such parametrization is not necessary; a method is presented to compute the optimal characteristic as an analytic function of the trajectory. The efficacy of this method is demonstrated using two examples. The first example considers the optimal spring characteristic for a parallel elastic actuator supporting the human ankle during walking. The second example applies the method in combination with trajectory optimization on a single degree of freedom robot performing a specific pick-and-place task. The task at hand has a height difference between the pick and the place location. With the analytical optimal spring, it is shown that the robot can recover enough of the energy released by the package to function without external electric energy supply.
- 12 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 34 (2) , 336-352
The Boundaries of Walking Stability: Viability and Controllability of Simple Models
From which states and with what controls can a biped avoid falling or reach a given target state? What is the most robust way to do these? So as to help with the design of walking robot controllers, and perhaps give insights into human walking, we address these questions using two simple 2-D models: the inverted pendulum (IP) and linear inverted pendulum (LIP). Each has one state variable at mid-stance, i.e., hip velocity, and two state-dependent controls at each step, i.e., push-off magnitude and step length (IP) and step time and length (LIP). Using practical targets and constraints, we compute all combinations of initial states and control actions for the next step, such that the robot can, with the best possible future controls, avoid falling for $n$ steps or reach a target within $n$ steps. All such combinations constitute regions in the combined space of states and controls. Farther from the boundaries of these regions, the robot tolerates larger errors and disturbances. Furthermore, for these models, and thus possibly real bipeds, usually if it is possible to avoid falling, it is possible to reach the target, and if it is possible to reach the target, it is possible to do so in two steps.- 12 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 34 (2) , 336-352
The Boundaries of Walking Stability: Viability and Controllability of Simple Models
From which states and with what controls can a biped avoid falling or reach a given target state? What is the most robust way to do these? So as to help with the design of walking robot controllers, and perhaps give insights into human walking, we address these questions using two simple 2-D models: the inverted pendulum (IP) and linear inverted pendulum (LIP). Each has one state variable at mid-stance, i.e., hip velocity, and two state-dependent controls at each step, i.e., push-off magnitude and step length (IP) and step time and length (LIP). Using practical targets and constraints, we compute all combinations of initial states and control actions for the next step, such that the robot can, with the best possible future controls, avoid falling for $n$ steps or reach a target within $n$ steps. All such combinations constitute regions in the combined space of states and controls. Farther from the boundaries of these regions, the robot tolerates larger errors and disturbances. Furthermore, for these models, and thus possibly real bipeds, usually if it is possible to avoid falling, it is possible to reach the target, and if it is possible to reach the target, it is possible to do so in two steps.- 2 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 3 (3) , 1655-1662
RRT-CoLearn: Towards Kinodynamic Planning Without Numerical Trajectory Optimization
Sampling-based kinodynamic planners, such as rapidly-exploring random trees (RRTs), pose two fundamental challenges: computing a reliable (pseudo-)metric for the distance between two random nodes, and computing a steering input to connect the nodes. The core of these challenges is a two point boundary value problem, known to be NP-hard. Recently, the distance metric has been approximated using supervised learning, reducing computation time drastically. Previous work on such learning RRTs use direct optimal control to generate the data for supervised learning. This letter proposes to use indirect optimal control instead, because it provides two benefits: it reduces the computational effort to generate the data, and it provides a low-dimensional parametrization of the action space. The latter allows us to learn both the distance metric and the steering input. This eliminates the need for a local planner in learning RRTs. Experimental results on a pendulum swing up show tenfold speed-up in both the offline data generation and the online planning time.
- 2 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 3 (3) , 1655-1662
RRT-CoLearn: Towards Kinodynamic Planning Without Numerical Trajectory Optimization
Sampling-based kinodynamic planners, such as rapidly-exploring random trees (RRTs), pose two fundamental challenges: computing a reliable (pseudo-)metric for the distance between two random nodes, and computing a steering input to connect the nodes. The core of these challenges is a two point boundary value problem, known to be NP-hard. Recently, the distance metric has been approximated using supervised learning, reducing computation time drastically. Previous work on such learning RRTs use direct optimal control to generate the data for supervised learning. This letter proposes to use indirect optimal control instead, because it provides two benefits: it reduces the computational effort to generate the data, and it provides a low-dimensional parametrization of the action space. The latter allows us to learn both the distance metric and the steering input. This eliminates the need for a local planner in learning RRTs. Experimental results on a pendulum swing up show tenfold speed-up in both the offline data generation and the online planning time.
- 31 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 3 (3) , 1600-1607
A String-Based Representation and Crossover Operator for Evolutionary Design of Dynamical Mechanisms
Robots would perform better when their mechanical structure is specifically designed for their designated task, for instance by adding spring mechanisms. However, designing such mechanisms, which match the dynamics of the robot with the task, is hard and time consuming. To assist designers, a platform that automatically designs dynamical mechanisms is needed. This letter introduces a novel string-based representation for mechanisms, including evolutionary operators, that allows an evolutionary algorithm to automatically design dynamical mechanisms for a designated task. The mechanism representation allows simultaneous optimization of topology and parameters. Simulation experiments investigate various algorithms to obtain best optimization performance. We show the efficacy of the representation, operators, and evolutionary algorithm by designing mechanisms that track straight lines and ellipses by virtue of both their kinematic and dynamic properties.
- 31 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 3 (3) , 1600-1607
A String-Based Representation and Crossover Operator for Evolutionary Design of Dynamical Mechanisms
Robots would perform better when their mechanical structure is specifically designed for their designated task, for instance by adding spring mechanisms. However, designing such mechanisms, which match the dynamics of the robot with the task, is hard and time consuming. To assist designers, a platform that automatically designs dynamical mechanisms is needed. This letter introduces a novel string-based representation for mechanisms, including evolutionary operators, that allows an evolutionary algorithm to automatically design dynamical mechanisms for a designated task. The mechanism representation allows simultaneous optimization of topology and parameters. Simulation experiments investigate various algorithms to obtain best optimization performance. We show the efficacy of the representation, operators, and evolutionary algorithm by designing mechanisms that track straight lines and ellipses by virtue of both their kinematic and dynamic properties.
- Open Access
RRT-CoLearn: towards kinodynamic planning without numerical trajectory optimization
Sampling-based kinodynamic planners, such as Rapidly-exploring Random Trees (RRTs), pose two fundamental challenges: computing a reliable (pseudo-)metric for the distance between two randomly sampled nodes, and computing a steering input to connect the nodes. The core of these challenges is a Two Point Boundary Value Problem, which is known to be NP-hard. Recently, the distance metric has been approximated using supervised learning, reducing computation time drastically. The previous work on such learning RRTs use direct optimal control to generate the data for supervised learning. This paper proposes to use indirect optimal control instead, because it provides two benefits: it reduces the computational effort to generate the data, and it provides a low dimensional parametrization of the action space. The latter allows us to learn both the distance metric and the steering input to connect two nodes. This eliminates the need for a local planner in learning RRTs. Experimental results on a pendulum swing up show 10-fold speed-up in both the offline data generation and the online planning time, leading to at least a 10-fold speed-up in the overall planning time.
Open AccessRRT-CoLearn: towards kinodynamic planning without numerical trajectory optimization
Sampling-based kinodynamic planners, such as Rapidly-exploring Random Trees (RRTs), pose two fundamental challenges: computing a reliable (pseudo-)metric for the distance between two randomly sampled nodes, and computing a steering input to connect the nodes. The core of these challenges is a Two Point Boundary Value Problem, which is known to be NP-hard. Recently, the distance metric has been approximated using supervised learning, reducing computation time drastically. The previous work on such learning RRTs use direct optimal control to generate the data for supervised learning. This paper proposes to use indirect optimal control instead, because it provides two benefits: it reduces the computational effort to generate the data, and it provides a low dimensional parametrization of the action space. The latter allows us to learn both the distance metric and the steering input to connect two nodes. This eliminates the need for a local planner in learning RRTs. Experimental results on a pendulum swing up show 10-fold speed-up in both the offline data generation and the online planning time, leading to at least a 10-fold speed-up in the overall planning time.
- 1 August 2015
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 70, 83-91
Robust feedforward control of robotic arms with friction model uncertainty
- 1 August 2015
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 70, 83-91
Robust feedforward control of robotic arms with friction model uncertainty
- 1 April 2015
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 66, 27-34
Learning robustly stable open-loop motions for robotic manipulation
- 1 April 2015
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 66, 27-34
Learning robustly stable open-loop motions for robotic manipulation
- 1 January 2015
- Published by Elsevier in Control Engineering Practice
- Vol. 34, 68-76
Dissipatively actuated manipulation
- 1 January 2015
- Published by Elsevier in Control Engineering Practice
- Vol. 34, 68-76
Dissipatively actuated manipulation