de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Towards Learning Path Planning for Solving Complex Robot Tasks

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons84035

Lal,  TN
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Frontzek, T., Lal, T., & Eckmiller, R. (2001). Towards Learning Path Planning for Solving Complex Robot Tasks. In Proceedings of the International Conference on Artificial Neural Networks (ICANN'2001) Vienna (pp. 943-950).


Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-E37E-4
Abstract
For solving complex robot tasks it is necessary to incorporate path planning methods that are able to operate within different high-dimensional configuration spaces containing an unknown number of obstacles. Based on Advanced A*-algorithm (AA*) using expansion matrices instead of a simple expansion logic we propose a further improvement of AA* enabling the capability to learn directly from sample planning tasks. This is done by inserting weights into the expansion matrix which are modified according to a special learning rule. For an examplary planning task we show that Adaptive AA* learns movement vectors which allow larger movements than the initial ones into well-defined directions of the configuration space. Compared to standard approaches planning times are clearly reduced.