Matrix-Binary Codes based Genetic Algorithm for path planning of mobile robot

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 sim...

Full description

Saved in:
Bibliographic Details
Published in:Computers & electrical engineering 2018-04, Vol.67, p.708-728
Main Authors: Patle, B.K., Parhi, D.R.K., Jagadeesh, A., Kashyap, Sunil Kumar
Format: Article
Language:English
Subjects:
Binary codes
Binary system
Computer simulation
Genetic algorithm
Genetic algorithms
Matrix
Matrix-Binary Code
Mobile robot navigation
Obstacle avoidance
Optimization
Path planning
Position tracking
Robotics
Robots
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0045-7906
1879-0755
DOI:10.1016/j.compeleceng.2017.12.011