Abstract
A shape-shifting robot with changeable configurations can accomplish search and rescue tasks which could not be achieved by manpower sometimes. The accessibility of this robot to uneven environment was efficiently enlarged by changing its configuration. In this paper, a path planning method is presented that integrates the reconfigurable ability of the robot with the potential field law. An adaptive genetic algorithm is applied to solve effectively the local minimum problem. The experiments show that the robot's configurations can be changed to perform the path planning with the environmental variation. Moreover, the path has been shortened effectively. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Li, M., Zhang, Y., Liu, T., & Wu, C. (2010). A new path planning method for a shape-shifting robot. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6319 LNAI, pp. 470–478). https://doi.org/10.1007/978-3-642-16530-6_56
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
