default search action
Francisco Valero 0001
Person information
- affiliation: Polytechnic University of Valencia, Spain
Other persons with the same name
- Francisco Valero 0002
— Autonomous University of Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i1]Francisco Valero, Miguel Díaz-Rodríguez, Marina Vallés, Antonio José Besa, Enrique J. Bernabeu, Angel Valera:
Reconfiguration of a parallel kinematic manipulator with 2T2R motions for avoiding singularities through minimizing actuator forces. CoRR abs/2401.08191 (2024)
2010 – 2019
- 2019
- [j15]Francisco Valero, Francisco Rubio
Efficient trajectory of a car-like mobile robot. Ind. Robot 46(2): 211-222 (2019) - [j14]Francisco Valero, Francisco Rubio
Assessment of the Effect of Energy Consumption on Trajectory Improvement for a Car-like Robot. Robotica 37(11): 1998-2009 (2019) - 2016
- [j13]Francisco Rubio
Industrial robot efficient trajectory generation without collision through the evolution of the optimal trajectory. Robotics Auton. Syst. 86: 106-112 (2016) - 2015
- [j12]Fares J. Abu-Dakka
A direct approach to solving trajectory planning problems using genetic algorithms with dynamics considerations in complex environments. Robotica 33(3): 669-683 (2015) - 2012
- [j11]Fares J. Abu-Dakka
Evolutionary Path Planning Algorithm for Industrial Robots. Adv. Robotics 26(11-12): 1369-1392 (2012) - [j10]Francisco Rubio
Optimal time trajectories for industrial robots with torque, power, jerk and energy consumed constraints. Ind. Robot 39(1): 92-100 (2012) - [j9]Francisco Rubio
Comparing the efficiency of five algorithms applied to path planning for industrial robots. Ind. Robot 39(6): 580-591 (2012) - 2011
- [j8]Nuria Rosillo, Angel Valera
Real-time solving of dynamic problem in industrial robots. Ind. Robot 38(2): 119-129 (2011) - [c1]Fares J. Abu-Dakka
Parallel-Populations Genetic Algorithm for the Optimization of Cubic Polynomial Joint Trajectories for Industrial Robots. ICIRA (1) 2011: 83-92 - 2010
- [j7]Francisco Rubio
The simultaneous algorithm and the best interpolation function for trajectory planning. Ind. Robot 37(5): 441-451 (2010)
2000 – 2009
- 2009
- [j6]Francisco Rubio
Direct step-by-step method for industrial robot path planning. Ind. Robot 36(6): 594-607 (2009) - 2006
- [j5]Francesc Benimeli
A comparison between direct and indirect dynamic parameter identification methods in industrial robots. Robotica 24(5): 579-590 (2006) - 2003
- [j4]Angel Valera
Solving the inverse dynamic control for low cost real-time industrial robot control applications. Robotica 21(3): 261-269 (2003) - 2002
- [j3]Vicente Mata, S. Provenzano, J. L. Cuadrado, Francisco Valero:
Inverse dynamic problem in robots using Gibbs-Appell equations. Robotica 20(1): 59-67 (2002)
1990 – 1999
- 1996
- [j2]Francisco Valero, Vicente Mata, Juan I. Cuadrado, Marco Ceccarelli
A formulation for path planning of manipulators in complex environments by using adjacent configurations. Adv. Robotics 11(1): 33-56 (1996) - [j1]Marco Ceccarelli, Francisco Valero, Vicente Mata, Ignacio Cuadrado:
Generation of adjacent configurations for a collision-free path planning of manipulators. Robotica 14(4): 391-396 (1996)
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-06-19 21:49 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: