Abstract

This paper illustrates a method to finding a global optimal path in a dynamic environment of known obstacles for an Mobile Robot (MR) to following a moving target. Firstly, the environment is defined by using a practical and standard graph theory. Then, a suboptimal path is obtained by using Dijkstra Algorithm (DA) that is a standard graph searching method. The advantages of using DA are; elimination the uncertainness of heuristic algorithms and increasing the speed, precision and performance of them. Finally, Continuous Clonal Selection Algorithm (CCSA) that is combined with Negative Selection Algorithm (NSA) is used to improve the suboptimal path and derive global optimal path. To show the effectiveness of the method it is compared with some other methods in this area.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.