2012 IEEE Conference on Evolving and Adaptive Intelligent Systems 2012
DOI: 10.1109/eais.2012.6232809
|View full text |Cite
|
Sign up to set email alerts
|

A kinodynamic planning-learning algorithm for complex robot motor control

Abstract: Abstract-Robot motor control learning is currently one of the most active research areas in robotics. Many learning techniques have been developed for relatively simple problems. However, very few of them have direct applicability in complex robotic systems without assuming prior knowledge about the task, mainly due to three facts. Firstly, they scale badly to continues and high dimensional problems. Secondly, they need too many real robot-environment interactions. Finally, they are not capable of adapting to … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2014
2014

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…Nonetheless, the scalability of this class of algorithms to high dimensional state and action spaces is still a matter of study, more in the case of continues state-action spaces. To overcome this problem, the authors of this publication proposed in previous work a new model-based learning algorithm, called KiPLA [8], which handles much more efficiently the curse of dimensionality problem. This algorithm mixes kinodynamic planning and model learning for the purpose of finding suboptimal open-loop policies for achieving a certain task.…”
Section: Related Workmentioning
confidence: 97%
“…Nonetheless, the scalability of this class of algorithms to high dimensional state and action spaces is still a matter of study, more in the case of continues state-action spaces. To overcome this problem, the authors of this publication proposed in previous work a new model-based learning algorithm, called KiPLA [8], which handles much more efficiently the curse of dimensionality problem. This algorithm mixes kinodynamic planning and model learning for the purpose of finding suboptimal open-loop policies for achieving a certain task.…”
Section: Related Workmentioning
confidence: 97%