Luiz Antonio Celiberto
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
Luiz Antonio Celiberto has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Reinaldo Augusto da Costa Bianchi
Centro Universitário FEI
5 shared publications Jackson P. Matsuura
4 shared publicationsRamon Lopez de Mantaras
3 shared publications- Anna Helena Reali Costa
Universidade de São Paulo
1 shared publication Carlos H. C. Ribeiro
Instituto Tecnológico de Aeronáutica
1 shared publication- Claudio de Oliveira Vilao
Centro Universitário FEI
1 shared publication
Latest Publications
- 17 February 2020
- Published by Wiley in Optimal Control Applications and Methods
- Vol. 41 (3) , 729-747
Nonlinear predictive control applied to a biped walker with adjustable step length using a passive walking‐based reference generator
Summary: This paper presents the use of passive dynamics to generate the sagittal plane references for a biped walker. In order to achieve an adjustable gait width, a neural network reference generator, trained with passive walking data on different slopes, was applied. The control algorithm was implemented with an Nonlinear Model Predictive Control (NMPC) strategy, in order to perform multiple‐input multiple‐output reference tracking while maintaining balance. The main contributions of the present work are using a kneed passive walker model for reference generation, which creates gait profiles that are more natural than the compass gait model, presenting a low computational cost, since only the forward kinematic model is used, and enabling adjustable gait width, due to the use of a neural network trained with data from the passive walker. Simulation results using V‐REP (Virtual Robot Experimentation Platform) are presented, using a sagittal kneed walker with a torso and arms, demonstrating the effectiveness of the proposed method.
- 17 February 2020
- Published by Wiley in Optimal Control Applications and Methods
- Vol. 41 (3) , 729-747
Nonlinear predictive control applied to a biped walker with adjustable step length using a passive walking‐based reference generator
Summary: This paper presents the use of passive dynamics to generate the sagittal plane references for a biped walker. In order to achieve an adjustable gait width, a neural network reference generator, trained with passive walking data on different slopes, was applied. The control algorithm was implemented with an Nonlinear Model Predictive Control (NMPC) strategy, in order to perform multiple‐input multiple‐output reference tracking while maintaining balance. The main contributions of the present work are using a kneed passive walker model for reference generation, which creates gait profiles that are more natural than the compass gait model, presenting a low computational cost, since only the forward kinematic model is used, and enabling adjustable gait width, due to the use of a neural network trained with data from the passive walker. Simulation results using V‐REP (Virtual Robot Experimentation Platform) are presented, using a sagittal kneed walker with a torso and arms, demonstrating the effectiveness of the proposed method.
- 1 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 283-288
Evaluating the Performance of Two Visual Descriptors Techniques for a Humanoid Robot
A humanoid robot capable of playing soccer needs to know where opponents and team mates are in the soccer field. The robot has to be able to recognize team mates and opponents, inferring information such as distance and estimated location of the other robots. In order to achieve this key requisite, this paper analyze two descriptor algorithms, HAAR and HOG, so that one of them can be used for recognizing humanoid robots with less false positives alarms and with best frame per second rate. They were used with their respective classical classifiers, AdaBoost and SVM. As many different robots are available in RoboCup domain, the descriptor needs to describe features in a way that they can be distinguished from the background at the same time the classification has to have a good generalization capability. Although some limitations appeared in tests, the results were beyond expectations.
- 1 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 283-288
Evaluating the Performance of Two Visual Descriptors Techniques for a Humanoid Robot
A humanoid robot capable of playing soccer needs to know where opponents and team mates are in the soccer field. The robot has to be able to recognize team mates and opponents, inferring information such as distance and estimated location of the other robots. In order to achieve this key requisite, this paper analyze two descriptor algorithms, HAAR and HOG, so that one of them can be used for recognizing humanoid robots with less false positives alarms and with best frame per second rate. They were used with their respective classical classifiers, AdaBoost and SVM. As many different robots are available in RoboCup domain, the descriptor needs to describe features in a way that they can be distinguished from the background at the same time the classification has to have a good generalization capability. Although some limitations appeared in tests, the results were beyond expectations.
- 1 September 2015
- Published by Elsevier in Artificial Intelligence
- Vol. 226, 102-121
Transferring knowledge as heuristics in reinforcement learning: A case-based approach
- 1 September 2015
- Published by Elsevier in Artificial Intelligence
- Vol. 226, 102-121
Transferring knowledge as heuristics in reinforcement learning: A case-based approach
- 1 October 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7-13
Reinforcement Learning with Case-Based Heuristics for RoboCup Soccer Keepaway
In this paper we propose to combine Case-based Reasoning and Heuristically Accelerated Reinforcement Learning to speed up a Reinforcement Learning algorithm in a Transfer Learning problem. To do so, we propose a new algorithm called SARSA Accelerated by Transfer Learning - SATL, which uses Reinforcement Learning to learn how to perform one task, stores the policy for this problem as a case-base and then uses the learned case-base as heuristics to speed up the learning performance in a related, but different, task. A set of empirical evaluations were conducted in transferring the learning between two domains with multiple agents: an expanded version of Littman's simulated robot soccer and the RoboCup Soccer Keep away. A policy learned by one agent in the Littman's soccer is used to speed up the agent learning in the Keep away soccer. The results show that the use of this new algorithm can lead to a significant improvement in the performance of the learning agents.
- 1 October 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7-13
Reinforcement Learning with Case-Based Heuristics for RoboCup Soccer Keepaway
In this paper we propose to combine Case-based Reasoning and Heuristically Accelerated Reinforcement Learning to speed up a Reinforcement Learning algorithm in a Transfer Learning problem. To do so, we propose a new algorithm called SARSA Accelerated by Transfer Learning - SATL, which uses Reinforcement Learning to learn how to perform one task, stores the policy for this problem as a case-base and then uses the learned case-base as heuristics to speed up the learning performance in a related, but different, task. A set of empirical evaluations were conducted in transferring the learning between two domains with multiple agents: an expanded version of Littman's simulated robot soccer and the RoboCup Soccer Keep away. A policy learned by one agent in the Littman's soccer is used to speed up the agent learning in the Keep away soccer. The results show that the use of this new algorithm can lead to a significant improvement in the performance of the learning agents.
- 1 January 2011
- Published by Springer Nature
- p. 210-223
Investigation in Transfer Learning: Better Way to Apply Transfer Learning between Agents
- 1 January 2011
- Published by Springer Nature
- p. 210-223
Investigation in Transfer Learning: Better Way to Apply Transfer Learning between Agents
- 1 October 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 55-60
Using Transfer Learning to Speed-Up Reinforcement Learning: A Cased-Based Approach
Reinforcement Learning (RL) is a well-known technique for the solution of problems where agents need to act with success in an unknown environment, learning through trial and error. However, this technique is not efficient enough to be used in applications with real world demands due to the time that the agent needs to learn. This paper investigates the use of Transfer Learning (TL) between agents to speed up the well-known Q-learning Reinforcement Learning algorithm. The new approach presented here allows the use of cases in a case base as heuristics to speed up the Q-learning algorithm, combining Case-Based Reasoning (CBR) and Heuristically Accelerated Reinforcement Learning (HARL) techniques. A set of empirical evaluations were conducted in the Mountain Car Problem Domain, where the actions learned during the solution of the 2D version of the problem can be used to speed up the learning of the policies for its 3D version. The experiments were made comparing the Q-learning Reinforcement Learning algorithm, the HAQL Heuristic Accelerated Reinforcement Learning (HARL) algorithm and the TL-HAQL algorithm, proposed here. The results show that the use of a case-base for transfer learning can lead to a significant improvement in the performance of the agent, making it learn faster than using either RL or HARL methods alone.
- 1 October 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 55-60
Using Transfer Learning to Speed-Up Reinforcement Learning: A Cased-Based Approach
Reinforcement Learning (RL) is a well-known technique for the solution of problems where agents need to act with success in an unknown environment, learning through trial and error. However, this technique is not efficient enough to be used in applications with real world demands due to the time that the agent needs to learn. This paper investigates the use of Transfer Learning (TL) between agents to speed up the well-known Q-learning Reinforcement Learning algorithm. The new approach presented here allows the use of cases in a case base as heuristics to speed up the Q-learning algorithm, combining Case-Based Reasoning (CBR) and Heuristically Accelerated Reinforcement Learning (HARL) techniques. A set of empirical evaluations were conducted in the Mountain Car Problem Domain, where the actions learned during the solution of the 2D version of the problem can be used to speed up the learning of the policies for its 3D version. The experiments were made comparing the Q-learning Reinforcement Learning algorithm, the HAQL Heuristic Accelerated Reinforcement Learning (HARL) algorithm and the TL-HAQL algorithm, proposed here. The results show that the use of a case-base for transfer learning can lead to a significant improvement in the performance of the agent, making it learn faster than using either RL or HARL methods alone.
- 1 January 2008
- Published by Springer Nature
- p. 220-227
Heuristic Reinforcement Learning Applied to RoboCup Simulation Agents
- 1 January 2008
- Published by Springer Nature
- p. 220-227
Heuristic Reinforcement Learning Applied to RoboCup Simulation Agents