default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan A. Carretero
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j6]Andrew C. Mathis
, Juan A. Carretero, Jonathon W. Sensinger:
Beyond Adaptive Control: A Control Method for Nonlinear Systems With Uncertainties, Applied to COVID-19. IEEE Access 13: 34667-34676 (2025)
2010 – 2019
- 2016
- [j5]Joshua K. Pickard, Juan A. Carretero, Virendrakumar C. Bhavsar:
On the convergence and origin bias of the Teaching-Learning-Based-Optimization algorithm. Appl. Soft Comput. 46: 115-127 (2016) - [c8]Joshua K. Pickard, Juan A. Carretero, Jean-Pierre Merlet:
Analysis Methods for the 3-RRR with Uncertainties in the Design Parameters. ARK 2016: 109-118 - 2014
- [c7]Joshua K. Pickard, Juan A. Carretero, Virendrakumar C. Bhavsar:
Task-optimized cable-actuated planar parallel manipulator architecture and its concurrent implementation. HPCS 2014: 178-185 - 2011
- [j4]Feras N. Al-Obeidat, Nabil Belacel, Juan A. Carretero, Prabhat Mahanti:
An evolutionary framework using particle swarm optimization for classification method PROAFTN. Appl. Soft Comput. 11(8): 4971-4980 (2011) - 2010
- [j3]Feras N. Al-Obeidat, Nabil Belacel, Juan A. Carretero, Prabhat Mahanti:
Differential Evolution for learning the classification method PROAFTN. Knowl. Based Syst. 23(5): 418-426 (2010) - [c6]Feras N. Al-Obeidat, Nabil Belacel, Juan A. Carretero, Prabhat Mahanti:
Automatic Parameter Settings for the PROAFTN Classifier Using Hybrid Particle Swarm Optimization. Canadian AI 2010: 184-195
2000 – 2009
- 2009
- [c5]Feras N. Al-Obeidat, Nabil Belacel, Prabhat Mahanti, Juan A. Carretero:
Discretization Techniques and Genetic Algorithm for Learning the Classification Method PROAFTN. ICMLA 2009: 685-688 - 2008
- [j2]Iman Ebrahimi, Juan A. Carretero, Roger Boudreau:
Kinematic analysis and path planning of a new kinematically redundant planar parallel manipulator. Robotica 26(3): 405-413 (2008) - 2007
- [c4]Philipp Last, Annika Raatz, Juan A. Carretero, Steven M. O'Brien:
A general approach to solve the singular kinematic problem. IROS 2007: 3943-3949 - 2006
- [c3]Juan A. Carretero, Geoffrey T. Pond:
Quantitative dexterous workspace comparisons. ARK 2006: 297-306 - 2005
- [j1]Juan A. Carretero, Meyer A. Nahon:
Solving minimum distance problems with convex or concave bodies using combinatorial global optimization algorithms. IEEE Trans. Syst. Man Cybern. Part B 35(6): 1144-1155 (2005) - 2001
- [c2]Juan A. Carretero, Meyer A. Nahon, Ou Ma:
Solving distance problems with concave bodies using simulated annealing. IROS 2001: 1507-1512
1990 – 1999
- 1998
- [c1]Juan A. Carretero, Meyer A. Nahon, Ron P. Podhorodeski:
Workspace analysis of a 3-DOF parallel mechanism. IROS 1998: 1021-1026
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 2025-03-10 20:42 CET 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:
