Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Guilherme Maeda

dblp:158/9172 · DBLP profile ↗
← Back
16ranked-venue papers
4as first author
4since 2021 · last 2023
0000-0001-9413-4787ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 15 · 4 first-author · 4 since 2021Systems, architecture and hardware · 11 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
6 papers
Motion planning and robot control · 82% Probabilistic and Bayesian machine learning · 10% Robot manipulation · 8%
Human-computer interaction and pervasive computing
1 paper
Human-robot interaction · 100%

Topics — the 11 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › robot learning
movement primitives
1.442022
Blending Primitive Policies in Shared Control for Assisted Teleoperation · ICRA 2022
Inducing Probabilistic Context-Free Grammars for the Sequencing of Movement Primitives · ICRA 2018
Movement primitives with multiple phase parameters · ICRA 2016
Robotics › Motion planning and robot control › robot learning › movement primitives
dynamic movement primitives
0.612022
Blending Primitive Policies in Shared Control for Assisted Teleoperation · ICRA 2022
Robotics › Motion planning and robot control › robot control › learning control
iterative learning control
0.412019
Optimizing the Execution of Dynamic Robot Movements With Learning Control · IEEE Trans. Robotics 2019
Robotics › Motion planning and robot control
robot control
0.412019
Optimizing the Execution of Dynamic Robot Movements With Learning Control · IEEE Trans. Robotics 2019
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › structure learning
probabilistic context-free grammar induction
0.312018
Inducing Probabilistic Context-Free Grammars for the Sequencing of Movement Primitives · ICRA 2018
Robotics › Motion planning and robot control
robot learning
0.312018
Learning Coupled Forward-Inverse Models with Combined Prediction Errors · ICRA 2018
Robotics › Motion planning and robot control › robot control › motion control
speed control
0.212016
Movement primitives with multiple phase parameters · ICRA 2016
Robotics › Motion planning and robot control › trajectory planning
trajectory adaptation
0.212016
Movement primitives with multiple phase parameters · ICRA 2016
Robotics › Robot manipulation › physical human-robot interaction
interaction primitives
0.212015
Learning multiple collaborative tasks with a mixture of Interaction Primitives · ICRA 2015
Robotics › Robot manipulation › nonprehensile manipulation › dynamic manipulation
table tennis robot
0.112019
Optimizing the Execution of Dynamic Robot Movements With Learning Control · IEEE Trans. Robotics 2019
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
expectation-maximization
0.112018
Learning Coupled Forward-Inverse Models with Combined Prediction Errors · ICRA 2018

Methods — techniques the papers use, named apart from their topics

dynamical movement primitives · 0.6recursive least squares · 0.4probabilistic stability analysis · 0.4local linear model estimation · 0.4probabilistic context-free grammar · 0.3markov chain monte carlo · 0.3expectation-maximization · 0.3coupled forward-inverse models · 0.3movement primitive learning · 0.2constraint satisfaction · 0.2imitation learning · 0.2gaussian mixture model · 0.2
YearPublicationVenuePosition
2023 Two-Fingered Hand with Gear-Type Synchronization Mechanism with Magnet for Improved Small and Offset Objects Grasping: F2 Hand
abstract
A problem that plagues robotic grasping is the misalignment of the object and gripper due to difficulties in precise localization, actuation, etc. Under-actuated robotic hands with compliant mechanisms are used to adapt and compensate for these inaccuracies. However, these mechanisms come at the cost of controllability and coordination. For instance, adaptive functions that let the fingers of a two-fingered gripper adapt independently may affect the coordination necessary for grasping small objects. In this work, we develop a two-fingered robotic hand capable of grasping objects that are offset from the gripper's center, while still having the requisite coordination for grasping small objects via a novel gear-type synchronization mechanism with a magnet. This gear synchronization mechanism allows the adaptive finger's tips to be aligned enabling it to grasp objects as small as toothpicks and washers. The magnetic component allows this coordination to automatically turn off when needed, allowing for the grasping of objects that are offset/misaligned from the gripper. This equips the hand with the capability of grasping light, fragile objects (strawberries, creampuffs, etc.) to heavy frying pan lids, all while maintaining their position and posture which is vital in numerous applications that require precise positioning or careful manipulation.
Naoki Fukaya, Avinash Ummadisingu, Kuniyuki Takahashi, Guilherme Maeda, Shin-ichi Maeda
IROS4
2022 Blending Primitive Policies in Shared Control for Assisted Teleoperation
abstract
Movement primitives have the property to accom-modate changes in the robot state while maintaining attraction to the original policy. As such, we investigate the use of primitives as a blending mechanism by considering that state deviations from the original policy are caused by user inputs. As the primitive recovers from the user input, it implicitly blends human and robot policies without requiring their weightings-referred to as arbitration. In this paper, we adopt Dynamical Movement Primitives (DMPs), which allow us to avoid the need for multiple demonstrations, and are fast enough to enable numerous instantiations, one for each hypothesis of the human intent. User studies are presented on assisted teleoperation tasks of reaching multiple goals and dynamic obstacle avoidance. Comparable performance to conventional teleoperation was achieved while significantly decreasing human intervention, often by more than 60%.
Guilherme Maeda
ICRA1
2022 F3 Hand: A Versatile Robot Hand Inspired by Human Thumb and Index Fingers
abstract
It is challenging to grasp numerous objects with varying sizes and shapes with a single robot hand. To address this, we propose a new robot hand called the "F3 hand" inspired by the complex movements of human index finger and thumb. The F3 hand attempts to realize complex human-like grasping movements by combining a parallel motion finger and a rotational motion finger with an adaptive function. In order to confirm the performance of our hand, we attached it to a mobile manipulator - the Toyota Human Support Robot (HSR) and conducted grasping experiments. In our results, we show that it is able to grasp all YCB objects (82 in total), including washers with outer diameters as small as 6.4 mm. We also built a system for intuitive operation with a 3D mouse and grasp an additional 24 objects, including small toothpicks and paper clips and large pitchers and cracker boxes. The F3 hand is able to achieve a 98% success rate in grasping even under imprecise control and positional offsets. Furthermore, owing to the finger’s adaptive function, we demonstrate characteristics of the F3 hand that facilitate the grasping of soft objects such as strawberries in a desirable posture.
Naoki Fukaya, Avinash Ummadisingu, Guilherme Maeda, Shin-ichi Maeda
RO-MAN3
2021 Periodic Intra-ensemble Knowledge Distillation for Reinforcement Learning
Zhang-Wei Hong, Prabhat Nagarajan, Guilherme Maeda
ECML/PKDD (1)3
2020 Visual Task Progress Estimation with Appearance Invariant Embeddings for Robot Control and Planning
abstract
One of the challenges of full autonomy is to have robots capable of manipulating its current environment to achieve another environment configuration. This paper is a step towards this challenge, focusing on the visual understanding of the task. Our approach trains a deep neural network to represent images as measurable features that are useful to estimate the progress (or phase) of a task. The training uses numerous variations of images of identical tasks when taken under the same phase index. The goal is to make the network sensitive to differences in task progress but insensitive to the appearance of the images. To this end, our method builds upon Time-Contrastive Networks (TCNs) to train a network using only discrete snapshots taken at different stages of a task. A robot can then solve long-horizon tasks by using the trained network to identify the progress of the current task and by iteratively calling a motion planner until the task is solved. We quantify the granularity achieved by the network in two simulated environments. In the first, to detect the number of objects in a scene and in the second to measure the volume of particles in a cup. Our experiments leverage this granularity to make a mobile robot move a desired number of objects into a storage area and to control the amount of pouring in a cup.
Guilherme Maeda, Joni Väätäinen, Hironori Yoshida
IROS1
2020 Phase portraits as movement primitives for fast humanoid robot control
Guilherme Maeda, Okan Koc, Jun Morimoto
Neural Networks1
2019 Reinforcement Learning of Trajectory Distributions: Applications in Assisted Teleoperation and Motion Planning
abstract
The majority of learning from demonstration approaches do not address suboptimal demonstrations or cases when drastic changes in the environment occur after the demonstrations were made. For example, in real teleoperation tasks, the demonstrations provided by the user are often suboptimal due to interface and hardware limitations. In tasks involving co-manipulation and manipulation planning, the environment often changes due to unexpected obstacles rendering previous demonstrations invalid. This paper presents a reinforcement learning algorithm that exploits the use of relevance functions to tackle such problems. This paper introduces the Pearson correlation as a measure of the relevance of policy parameters in regards to each of the components of the cost function to be optimized. The method is demonstrated in a static environment where the quality of the teleoperation is compromised by the visual interface (operating a robot in a three-dimensional task by using a simple 2D monitor). Afterward, we tested the method on a dynamic environment using a real 7-DoF robot arm where distributions are computed online via Gaussian Process regression.
Marco Ewerton, Guilherme Maeda, Dorothea Koert, Zlatko Kolev, Masaki Takahashi 0001, Jan Peters 0001
IROS2
2019 Optimizing the Execution of Dynamic Robot Movements With Learning Control
abstract
High-speed robotics typically involves fast dynamic trajectories with large accelerations. Kinematic optimization using compact representations can lead to an efficient online computation of these dynamic movements, however successful execution requires accurate models or aggressive tracking with high-gain feedback. Learning to track such references in a safe and reliable way, whenever accurate models are not available, is an open problem. Stability issues surrounding the learning performance, in the iteration domain, can prevent the successful implementation of model-based learning approaches. To this end, in this paper we propose a new adaptive and cautious iterative learning control (ILC) algorithm where the stability of the control updates is analyzed probabilistically: the covariance estimates of the adapted local linear models are used to increase the probability of update monotonicity, exercising caution during learning. The resulting learning controller can be implemented efficiently using a recursive approach. We evaluate it extensively in simulations as well as in our robot table tennis setup for tracking dynamic hitting movements. Testing with two seven degree of freedom anthropomorphic robot arms, we show improved and more stable tracking performance over high-gain proportional and derivative (PD) control, model-free ILC (simple PD feedback type) and model-based ILC without cautious adaptation.
Okan Koc, Guilherme Maeda, Jan Peters 0001
IEEE Trans. Robotics2
2018 Learning Coupled Forward-Inverse Models with Combined Prediction Errors
abstract
Challenging tasks in unstructured environments require robots to learn complex models. Given a large amount of information, learning multiple simple models can offer an efficient alternative to a monolithic complex network. Training multiple models-that is, learning their parameters and their responsibilities-has been shown to be prohibitively hard as optimization is prone to local minima. To efficiently learn multiple models for different contexts, we thus develop a new algorithm based on expectation maximization (EM). In contrast to comparable concepts, this algorithm trains multiple modules of paired forward-inverse models by using the prediction errors of both forward and inverse models simultaneously. In particular, we show that our method yields a substantial improvement over only considering the errors of the forward models on tasks where the inverse space contains multiple solutions.
Dorothea Koert, Guilherme Maeda, Gerhard Neumann, Jan Peters 0001
ICRA2
2018 Inducing Probabilistic Context-Free Grammars for the Sequencing of Movement Primitives
abstract
Movement Primitives are a well studied and widely applied concept in modern robotics. Composing primitives out of an existing library, however, has shown to be a challenging problem. We propose the use of probabilistic context-free grammars to sequence a series of primitives to generate complex robot policies from a given library of primitives. The rule-based nature of formal grammars allows an intuitive encoding of hierarchically and recursively structured tasks. This hierarchical concept strongly connects with the way robot policies can be learned, organized, and re-used. However, the induction of context-free grammars has proven to be a complicated and yet unsolved challenge. In this work, we exploit the physical nature of robot movement primitives to restrict and efficiently search the grammar space. The grammar is learned applying a Markov Chain Monte Carlo optimization over the posteriors of the grammars given the observations. The proposal distribution is defined as a mixture over the probabilities of the operators connecting the search space. Restrictions to these operators guarantee continuous sequences while reducing the grammar space. We validate our method on a redundant 7 degree-of-freedom lightweight robotic arm on tasks that require the generation of complex sequences consisting of simple movement primitives.
Rudolf Lioutikov, Guilherme Maeda, Filipe Veiga, Kristian Kersting, Jan Peters 0001
ICRA2
2017 Postural optimization for an ergonomic human-robot interaction
abstract
In human-robot collaboration the robot's behavior impacts the worker's safety, comfort and acceptance of the robotic system. In this paper we address the problem of how to improve the worker's posture during human-robot collaboration. Using postural assessment techniques, and a personalized human kinematic model, we optimize the model body posture to fulfill a task while avoiding uncomfortable or unsafe postures. We then derive a robotic behavior that leads the worker towards that improved posture. We validate our approach in an experiment involving a joint task with 39 human subjects and a Baxter torso-humanoid robot.
Baptiste Busch, Guilherme Maeda, Yoan Mollard, Marie Demangeat, Manuel Lopes 0001
IROS2
2016 Movement primitives with multiple phase parameters
abstract
Movement primitives are concise movement representations that can be learned from human demonstrations, support generalization to novel situations and modulate the speed of execution of movements. The speed modulation mechanisms proposed so far are limited though, allowing only for uniform speed modulation or coupling changes in speed to local measurements of forces, torques or other quantities. Those approaches are not enough when dealing with general velocity constraints. We present a movement primitive formulation that can be used to non-uniformly adapt the speed of execution of a movement in order to satisfy a given constraint, while maintaining similarity in shape to the original trajectory. We present results using a 4-DoF robot arm in a minigolf setup.
Marco Ewerton, Guilherme Maeda, Gerhard Neumann, Viktor Kisner, Gerrit Kollegger, Josef Wiemeyer, Jan Peters 0001
ICRA2
2016 A new trajectory generation framework in robotic table tennis
abstract
In highly dynamic tasks that involve moving targets, planning is necessary to figure out when, where and how to intercept the target. In robotic table tennis in particular, motion planning can be very challenging due to time constraints, dimension of the search space and modelling uncertainties. To simplify the problem, conventional planning algorithms often rely on a fixed virtual hitting plane to construct robot striking trajectories. These algorithms however generate restrictive strokes and can result in unnatural strategies when compared with human playing. In this paper, we introduce a new trajectory generation framework for robotic table tennis. We use a free-time optimal control approach to construct a novel planning algorithm that does not involve a fixed hitting plane. Furthermore, we estimate the parameters of our prediction models using human demonstrations. The resulting trajectories have lower accelerations while the joint constraints are enforced at all times. Our algorithm returns the balls with a higher probability to the opponent's court in our realistic simulation environment when compared with a virtual hitting plane based method.
Okan Koc, Guilherme Maeda, Jan Peters 0001
IROS2
2015 Learning multiple collaborative tasks with a mixture of Interaction Primitives
abstract
Robots that interact with humans must learn to not only adapt to different human partners but also to new interactions. Such a form of learning can be achieved by demonstrations and imitation. A recently introduced method to learn interactions from demonstrations is the framework of Interaction Primitives. While this framework is limited to represent and generalize a single interaction pattern, in practice, interactions between a human and a robot can consist of many different patterns. To overcome this limitation this paper proposes a Mixture of Interaction Primitives to learn multiple interaction patterns from unlabeled demonstrations. Specifically the proposed method uses Gaussian Mixture Models of Interaction Primitives to model nonlinear correlations between the movements of the different agents. We validate our algorithm with two experiments involving interactive tasks between a human and a lightweight robotic arm. In the first, we compare our proposed method with conventional Interaction Primitives in a toy problem scenario where the robot and the human are not linearly correlated. In the second, we present a proof-of-concept experiment where the robot assists a human in assembling a box.
Marco Ewerton, Gerhard Neumann, Rudolf Lioutikov, Heni Ben Amor, Jan Peters 0001, Guilherme Maeda
ICRA6
2015 Learning motor skills from partially observed movements executed at different speeds
abstract
Learning motor skills from multiple demonstrations presents a number of challenges. One of those challenges is the occurrence of occlusions and lack of sensor coverage, which may corrupt part of the recorded data. Another issue is the variability in speed of execution of the demonstrations, which may require a way of finding the correspondence between the time steps of the different demonstrations. In this paper, an approach to learn motor skills is proposed that accounts both for spatial and temporal variability of movements. This approach, based on an Expectation-Maximization algorithm to learn Probabilistic Movement Primitives, also allows for learning motor skills from partially observed demonstrations, which may result from occlusion or lack of sensor coverage. An application of the algorithm proposed in this work lies in the field of Human-Robot Interaction when the robot has to react to human movements executed at different speeds. Experiments in which a robotic arm receives a cup handed over by a human illustrate this application. The capabilities of the algorithm in learning and predicting movements are also evaluated in experiments using a data set of letters and a data set of golf putting movements.
Marco Ewerton, Guilherme Maeda, Jan Peters 0001, Gerhard Neumann
IROS2
2015 A Probabilistic Framework for Semi-autonomous Robots Based on Interaction Primitives with Phase Estimation
Guilherme Maeda, Gerhard Neumann, Marco Ewerton, Rudolf Lioutikov, Jan Peters 0001
ISRR (2)1