default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRituraj Kaushik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Akhil S. Anand
, Rituraj Kaushik, Jan Tommy Gravdahl, Fares J. Abu-Dakka:
Data-Efficient Reinforcement Learning for Variable Impedance Control. IEEE Access 12: 15631-15641 (2024)- 2023
- [c4]Shibei Zhu, Rituraj Kaushik, Samuel Kaski, Ville Kyrki:
Imitation-Guided Multimodal Policy Generation from Behaviourally Diverse Demonstrations. IROS 2023: 1675-1682 - 2022
- [j4]Rituraj Kaushik, Karol Arndt, Ville Kyrki:
SafeAPT: Safe Simulation-to-Real Robot Learning Using Diverse Policies Learned in Simulation. IEEE Robotics Autom. Lett. 7(3): 6838-6845 (2022) - [i5]Rituraj Kaushik, Karol Arndt, Ville Kyrki:
SafeAPT: Safe Simulation-to-Real Robot Learning using Diverse Policies Learned in Simulation. CoRR abs/2201.13248 (2022) - 2020
- [b1]Rituraj Kaushik:
Data-Efficient Robot Learning using Priors from Simulators. (Apprentissage efficace en données pour la robotique à l'aide de simulateurs). University of Lorraine, Nancy, France, 2020 - [c3]Rituraj Kaushik, Timothée Anne, Jean-Baptiste Mouret:
Fast Online Adaptation in Robotics through Meta-Learning Embeddings of Simulated Priors. IROS 2020: 5269-5276 - [i4]Rituraj Kaushik, Timothée Anne, Jean-Baptiste Mouret:
Fast Online Adaptation in Robotics through Meta-Learning Embeddings of Simulated Priors. CoRR abs/2003.04663 (2020)
2010 – 2019
- 2019
- [j3]Rituraj Kaushik, Pierre Desreumaux, Jean-Baptiste Mouret:
Adaptive Prior Selection for Repertoire-Based Online Adaptation in Robotics. Frontiers Robotics AI 6: 151 (2019) - [i3]Rituraj Kaushik, Pierre Desreumaux, Jean-Baptiste Mouret:
Adaptive Prior Selection for Repertoire-based Online Learning in Robotics. CoRR abs/1907.07029 (2019) - 2018
- [c2]Rituraj Kaushik, Konstantinos I. Chatzilygeroudis, Jean-Baptiste Mouret:
Multi-objective Model-based Policy Search for Data-efficient Learning with Sparse Rewards. CoRL 2018: 839-855 - [i2]Rituraj Kaushik, Konstantinos I. Chatzilygeroudis, Jean-Baptiste Mouret:
Multi-objective Model-based Policy Search for Data-efficient Learning with Sparse Rewards. CoRR abs/1806.09351 (2018) - 2017
- [c1]Konstantinos I. Chatzilygeroudis, Roberto Rama, Rituraj Kaushik, Dorian Goepp, Vassilis Vassiliades, Jean-Baptiste Mouret:
Black-box data-efficient policy search for robotics. IROS 2017: 51-58 - [i1]Konstantinos I. Chatzilygeroudis, Roberto Rama, Rituraj Kaushik, Dorian Goepp, Vassilis Vassiliades, Jean-Baptiste Mouret:
Black-Box Data-efficient Policy Search for Robotics. CoRR abs/1703.07261 (2017) - 2016
- [j2]Shobhanjana Kalita, Rituraj Kaushik, M. Jajoo, P. P. Sahu:
Performance Enhancement of a Multichannel Uncoordinated Code Hopping DSSS Signaling Scheme Using Multipath Fading Compensator. J. Circuits Syst. Comput. 25(11): 1650145:1-1650145:22 (2016) - 2015
- [j1]Rituraj Kaushik, J. Singhai:
Enhanced node cooperation technique for outwitting selfish nodes in an ad hoc network. IET Networks 4(2): 148-157 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
