Matrix-Binary Codes based Genetic Algorithm for path planning of mobile robot. (April 2018)

• Record Type: Journal Article
• Authors: Patle, B.K.; Parhi, D.R.K.; Jagadeesh, A.; Kashyap, Sunil Kumar
• Is Part Of: Computers & electrical engineering. Volume 67(2018)
• Page Start: 708
• Page End: 728
• Publication Date: 2018-04
• Subjects: Genetic algorithm -- Mobile robot navigation -- Path planning -- Obstacle avoidance -- Matrix-Binary Code; Computer engineering -- Periodicals; Electrical engineering -- Periodicals; Electrical engineering -- Data processing -- Periodicals; Ordinateurs -- Conception et construction -- Périodiques; Électrotechnique -- Périodiques; Électrotechnique -- Informatique -- Périodiques; Computer engineering; Electrical engineering; Electrical engineering -- Data processing; Periodicals; Electronic journals; 621.302854
• DOI: 10.1016/j.compeleceng.2017.12.011
• Languages: English
• ISSNs: 0045-7906

Abstract

Abstract: The paper presents the new variant of genetic algorithm using the binary codes through matrix for mobile robot navigation (MRN) in static and dynamic environment. The path planning strategy is established using the trace theory as the optimum controller, Sylvester Law of Inertia (SLI) and matrix simulation. The Matrix-Binary Codes based Genetic Algorithm (MGA) transforms the environment from chaos to array. Importantly, the paper proves the SLI by the real and experimental results for the statement "any robotics randomized environment transforms into the array." Hence the model is presented as pre-optimized robotics by SLI and post-optimized robotics by trace. The simulation result is presented by using MATLAB software and the result obtained by proposed controller is optimal with respect to path and time when compared to other intelligent navigational controller.