Planning for Modular Robots
The Problem of Optimal Reconguration Planning for Modular Recongurable Robots
Versandkostenfrei!
Versandfertig in 6-10 Tagen
51,99 €
inkl. MwSt.
PAYBACK Punkte
26 °P sammeln!
Modular reconfigurable robots were intensively studied. In particular, problems of planning of self-reconfiguration received considerable attention. Problems of reconfiguration planning play a central role for modular reconfigurable robots. Solutions for such problems lies at the heart of any control system of modular reconfigurable robots. Performance of such solutions is the base factor for the performance of the whole control system of modular reconfigurable robot. Recently, the optimal reconfiguration planning problem of finding the least number of reconfiguration steps to transform betwee...
Modular reconfigurable robots were intensively studied. In particular, problems of planning of self-reconfiguration received considerable attention. Problems of reconfiguration planning play a central role for modular reconfigurable robots. Solutions for such problems lies at the heart of any control system of modular reconfigurable robots. Performance of such solutions is the base factor for the performance of the whole control system of modular reconfigurable robot. Recently, the optimal reconfiguration planning problem of finding the least number of reconfiguration steps to transform between two configurations for chain-type modular robots was introduced. It is preferred that the robot keeps connected throughout the reconfiguration process. Respectively, in this book we suppose that the robot keeps connected throughout the reconfiguration process. We describe an approach to solve the problem. Our approach is based on constructing logical models for considered problem. Also we consider genetic and local search algorithms for the problem. The book should be especially useful to professionals in modular robotics.
Andere Kunden interessierten sich für
