Disordered and Multiple Destinations Path Planning Methods for Mobile Robot in Dynamic Environment. (1st June 2016)

• Record Type: Journal Article
• Authors: Dong, Yong-feng; Xia, Hong-mei; Zhou, Yan-cong
• Other Names: Yoon Sook Academic Editor.
• Is Part Of: Journal of electrical and computer engineering. Volume 2016(2016)
• Publication Date: 2016-06-01
• Subjects: Computer engineering -- Periodicals; Electrical engineering -- Periodicals; 621.3905
• DOI: 10.1155/2016/3620895
• Languages: English
• ISSNs: 2090-0147

Abstract

Abstract : In the smart home environment, aiming at the disordered and multiple destinations path planning, the sequencing rule is proposed to determine the order of destinations. Within each branching process, the initial feasible path set is generated according to the law of attractive destination. A sinusoidal adaptive genetic algorithm is adopted. It can calculate the crossover probability and mutation probability adaptively changing with environment at any time. According to the cultural-genetic algorithm, it introduces the concept of reducing turns by parallelogram and reducing length by triangle in the belief space, which can improve the quality of population. And the fallback strategy can help to jump out of the "U" trap effectively. The algorithm analyses the virtual collision in dynamic environment with obstacles. According to the different collision types, different strategies are executed to avoid obstacles. The experimental results show that cultural-genetic algorithm can overcome the problems of premature and convergence of original algorithm effectively. It can avoid getting into the local optimum. And it is more effective for mobile robot path planning. Even in complex environment with static and dynamic obstacles, it can avoid collision safely and plan an optimal path rapidly at the same time.