Trajectory planning of mobile robots using DNA computing

Recently, DNA computers attract attention as computers of next generation taking over the present electronic computers. Computation can be realized by chemical reaction of DNA. This paper presents an optimal trajectory planning method of mobile robots using DNA computing. In this method, a working area of a mobile robot is divided into many sections. Then the shortest trajectory avoiding obstacles in the work area is calculated with DNA computing. The location of the obstacles is supposed to be known in advance. In the process of DNA computing, Watson-Crick pairing is performed to find the shortest trajectory in the working area. The DNA sequences representing the locations of the obstacles are removed in this process. The obtained shortest DNA molecule that begins with the start section and terminates with the goal section represents the shortest trajectory avoiding the obstacles in the work area of the mobile robot. The proposed algorithm is especially effective on a DNA molecular computer.