The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
The Transferability Approach: Crossing the Reality Gap in Evolutionary Robotics
Abstract
The reality gap, which often makes controllers evolved in simulation inefficient once transferred onto the physical robot, remains a critical issue in evolutionary robotics (ER). We hypothesize that this gap highlights a conflict between the efficiency of the solutions in simulation and their transferability from simulation to reality: the most efficient solutions in simulation often exploit badly modeled phenomena to achieve high fitness values with unrealistic behaviors. This hypothesis leads to the transferability approach, a multiobjective formulation of ER in which two main objectives are optimized via a Pareto-based multiobjective evolutionary algorithm: 1) the fitness; and 2) the transferability, estimated by a simulation-to-reality (STR) disparity measure. To evaluate this second objective, a surrogate model of the exact STR disparity is built during the optimization. This transferability approach has been compared to two reality-based optimization methods, a noise-based approach inspired from Jakobi's minimal simulation methodology and a local search approach. It has been validated on two robotic applications: 1) a navigation task with an e-puck robot; and 2) a walking task with a 8-DOF quadrupedal robot. For both experimental setups, our approach successfully finds efficient and well-transferable controllers only with about ten experiments on the physical robot.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,328
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070
A two-dimensional interpolation function for irregularly-spaced data
Shepard, D. (1968) · Proceedings of the 1968 23rd ACM national conference on - · doi:10.1145/800186.810616 · Cited by 5,079
Evolutionary Robotics: The Biology, Intelligence, and Technology of Self-Organizing Machines
Nolfi, S., & Floreano, D. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/2889.001.0001 · Cited by 1,513
A comprehensive survey of fitness approximation in evolutionary computation
Jin, Y. (2005) · Soft Computing · doi:10.1007/s00500-003-0328-5 · Cited by 1,229
The e-puck, a Robot Designed for Education in Engineering
Francesco Mondada, C., Michael Bonani, C., Raemy, X., Pugh, J., Cianci, C. M., Klaptocz, A., Magnenat, S., Zufferey, J., Floreano, D., & Martinoli, A. (2009) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 785
Inertial navigation systems for mobile robots
Barshan, B., & Durrant-Whyte, H. F. (1995) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.388775 · Cited by 723
Resilient Machines Through Continuous Self-Modeling
Bongard, J., Zykov, V., & Lipson, H. (2006) · Science · doi:10.1126/science.1133687 · Cited by 709
Visual odometry for ground vehicle applications
Nistér, D., Naroditsky, O., & Bergen, J. (2006) · Journal of Field Robotics · doi:10.1002/rob.20103 · Cited by 634
Cited by
Domain randomization for transferring deep neural networks from simulation to the real world
Tobin, J., Fong, R., Ray, A., Schneider, J., Zaremba, W., & Abbeel, P. (2017) · 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2017.8202133 · Cited by 3,124
“[22].”
A Systematic Review of Perception System and Simulators for Autonomous Vehicles Research
Rosique, F., Navarro, P. J., Fernández, C., & Padilla, A. (2019) · Sensors · doi:10.3390/s19030648 · Cited by 469
A scalable pipeline for designing reconfigurable organisms
Kriegman, S., Blackiston, D., Levin, M., & Bongard, J. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1910837117 · Cited by 461
Evolutionary Robotics: What, Why, and Where to
Doncieux, S., Bredeche, N., Mouret, J.-B., & Eiben, A. E. (. (2015) · Frontiers in Robotics and AI · doi:10.3389/frobt.2015.00004 · Cited by 275
Self-citationBongard, J. C. (2013) · Communications of the ACM · doi:10.1145/2492007.2493883 · Cited by 260
Quality and Diversity Optimization: A Unifying Modular Framework
Cully, A., & Demiris, Y. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2704781 · Cited by 258
Go-Explore: a New Approach for Hard-Exploration Problems
Ecoffet, A., Huizinga, J., Lehman, J., Stanley, K. O., & Clune, J. (2019) · arXiv · doi:10.48550/arxiv.1901.10995 · Cited by 205
Salvato, E., Fenu, G., Medvet, E., & Pellegrino, F. A. (2021) · IEEE Access · doi:10.1109/access.2021.3126658 · Cited by 200
“Indeed, several works faced the RG problem in other frameworks, such as Evolutionary Computation [9, 11, 12, 13, 14, 15, 16, 17] or Model Predictive Control [18, 19, 20, 21].”
BackgroundAutoMoDe: A novel approach to the automatic design of control software for robot swarms
Francesca, G., Brambilla, M., Brutschy, A., Trianni, V., & Birattari, M. (2014) · Swarm Intelligence · doi:10.1007/s11721-014-0092-4 · Cited by 171
A Survey on Policy Search Algorithms for Learning Robot Controllers in a Handful of Trials
Chatzilygeroudis, K., Vassiliades, V., Stulp, F., Calinon, S., & Mouret, J.-B. (2020) · IEEE Transactions on Robotics · doi:10.1109/tro.2019.2958211 · Cited by 160
Self-citationAutomatic Design of Robot Swarms: Achievements and Challenges
Francesca, G., & Birattari, M. (2016) · Frontiers in Robotics and AI · doi:10.3389/frobt.2016.00029 · Cited by 144
Evolution of Collective Behaviors for a Real Swarm of Aquatic Surface Robots
Duarte, M., Costa, V., Gomes, J., Rodrigues, T., Silva, F., Oliveira, S. M., & Christensen, A. L. (2016) · PLOS ONE · doi:10.1371/journal.pone.0151834 · Cited by 134
Robot Learning From Randomized Simulations: A Review
Muratore, F., Ramos, F., Turk, G., Yu, W., Gienger, M., & Peters, J. (2022) · Frontiers in Robotics and AI · doi:10.3389/frobt.2022.799893 · Cited by 128
AutoMoDe-Chocolate: automatic design of control software for robot swarms
Francesca, G., Brambilla, M., Brutschy, A., Garattoni, L., Miletitch, R., Podevijn, G., Reina, A., Soleymani, T., Salvaro, M., Pinciroli, C., et al. (2015) · Swarm Intelligence · doi:10.1007/s11721-015-0107-9 · Cited by 99
Ligot, A., & Birattari, M. (2020) · Swarm Intelligence · doi:10.1007/s11721-019-00175-w · Cited by 55
Hasselmann, K., Ligot, A., Ruddick, J., & Birattari, M. (2021) · Nature Communications · doi:10.1038/s41467-021-24642-3 · Cited by 53
Birattari, M., Ligot, A., & Francesca, G. (2021) · Natural Computing Series · doi:10.1007/978-3-030-72069-8_5 · Cited by 22
Robust Domain Randomised Reinforcement Learning through Peer-to-Peer Distillation
Zhao, C., & Hospedales, T. (2020) · arXiv · doi:10.48550/arxiv.2012.04839 · Cited by 11
“This problem has longer been appreciated, and is particularly salient, in the field of robotics, where there is an inevitable reality gap [25, 11] between the simulated environments used for training and deployment in the real-world.”
Lehman, J. (2019) · arXiv · doi:10.48550/arxiv.1906.10189 · Cited by 3
Metadata
- Authors
- Koos, S., Mouret, J.-B., & Doncieux, S.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2013-02
- Volume
- 17
- Issue
- 1
- Pages
- 122-145
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W1978161072
- Cited by
- 272
- References
- 43
- FWCI
- 15.20
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.