Pedro H. M. Braga
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Pedro H. M. Braga has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Hansenclever F. Bassani
Universidade Federal de Pernambuco
3 shared publications - Edna Barros
Centro de Informática, Universidade Federal de Pernambuco
2 shared publications - Matheus G. Machado
Universidade Federal de Pernambuco
2 shared publications - Alain Tapp
DIRO, Université de Montréal, Montreal, QC H3T 1J4, Canada
1 shared publication - Cleber Zanchettin
Universidade Federal de Pernambuco
1 shared publication - Felipe B. Martins
Centro de Informática - Universidade Federal de Pernambuco
1 shared publication
Latest Publications
- 21 April 2025
- Published by Springer Nature
- p. 68-79
Planning the Path with Reinforcement Learning: Optimal Robot Motion Planning in RoboCup Small Size League Environments
- 21 April 2025
- Published by Springer Nature
- p. 68-79
Planning the Path with Reinforcement Learning: Optimal Robot Motion Planning in RoboCup Small Size League Environments
- Open Access
Bridging the Gap Between Offline and Online Reinforcement Learning Evaluation Methodologies
Reinforcement learning (RL) has shown great promise with algorithms learning in environments with large state and action spaces purely from scalar reward signals. A crucial challenge for current deep RL algorithms is that they require a tremendous amount of environment interactions for learning. This can be infeasible in situations where such interactions are expensive; such as in robotics. Offline RL algorithms try to address this issue by bootstrapping the learning process from existing logged data without needing to interact with the environment from the very beginning. While online RL algorithms are typically evaluated as a function of the number of environment interactions, there exists no single established protocol for evaluating offline RL methods.In this paper, we propose a sequential approach to evaluate offline RL algorithms as a function of the training set size and thus by their data efficiency. Sequential evaluation provides valuable insights into the data efficiency of the learning process and the robustness of algorithms to distribution changes in the dataset while also harmonizing the visualization of the offline and online learning phases. Our approach is generally applicable and easy to implement. We compare several existing offline RL algorithms using this approach and present insights from a variety of tasks and offline datasets.
Open AccessBridging the Gap Between Offline and Online Reinforcement Learning Evaluation Methodologies
Reinforcement learning (RL) has shown great promise with algorithms learning in environments with large state and action spaces purely from scalar reward signals. A crucial challenge for current deep RL algorithms is that they require a tremendous amount of environment interactions for learning. This can be infeasible in situations where such interactions are expensive; such as in robotics. Offline RL algorithms try to address this issue by bootstrapping the learning process from existing logged data without needing to interact with the environment from the very beginning. While online RL algorithms are typically evaluated as a function of the number of environment interactions, there exists no single established protocol for evaluating offline RL methods.In this paper, we propose a sequential approach to evaluate offline RL algorithms as a function of the training set size and thus by their data efficiency. Sequential evaluation provides valuable insights into the data efficiency of the learning process and the robustness of algorithms to distribution changes in the dataset while also harmonizing the visualization of the offline and online learning phases. Our approach is generally applicable and easy to implement. We compare several existing offline RL algorithms using this approach and present insights from a variety of tasks and offline datasets.
- 22 March 2022
- Published by Springer Nature
- p. 165-176
rSoccer: A Framework for Studying Reinforcement Learning in Small and Very Small Size Robot Soccer
- 22 March 2022
- Published by Springer Nature
- p. 165-176
rSoccer: A Framework for Studying Reinforcement Learning in Small and Very Small Size Robot Soccer
- Open Access
Learning to Play Soccer by Reinforcement and Applying Sim-to-Real to Compete in the Real World
This work presents an application of Reinforcement Learning (RL) for the complete control of real soccer robots of the IEEE Very Small Size Soccer (VSSS), a traditional league in the Latin American Robotics Competition (LARC). In the VSSS league, two teams of three small robots play against each other. We propose a simulated environment in which continuous or discrete control policies can be trained, and a Sim-to-Real method to allow using the obtained policies to control a robot in the real world. The results show that the learned policies display a broad repertoire of behaviors that are difficult to specify by hand. This approach, called VSSS-RL, was able to beat the human-designed policy for the striker of the team ranked 3rd place in the 2018 LARC, in 1-vs-1 matches.
Open AccessLearning to Play Soccer by Reinforcement and Applying Sim-to-Real to Compete in the Real World
This work presents an application of Reinforcement Learning (RL) for the complete control of real soccer robots of the IEEE Very Small Size Soccer (VSSS), a traditional league in the Latin American Robotics Competition (LARC). In the VSSS league, two teams of three small robots play against each other. We propose a simulated environment in which continuous or discrete control policies can be trained, and a Sim-to-Real method to allow using the obtained policies to control a robot in the real world. The results show that the learned policies display a broad repertoire of behaviors that are difficult to specify by hand. This approach, called VSSS-RL, was able to beat the human-designed policy for the striker of the team ranked 3rd place in the 2018 LARC, in 1-vs-1 matches.