Abstract
Path planning algorithms is the most significant area in the robotics field. Path Planning (PP) can be defined as the process of determining the most appropriate navigation path before a mobile robot moves. Optimization of path planning refers to finding the optimal or near-optimal path. Multi-objective optimization (MOO) is concerned with finding the best solution values that satisfy multiple objectives, such as shortness, smoothness, and safety. MOOs present the challenge of making decisions while balancing these contradictory issues through compromise (tradeoff). As a result, there is no single solution appropriate for all purposes in MOO, but rather a range of solutions. The purpose of this paper is to present an overview of mobile robot navigation strategies employed to find the path that has the minimum number of criteria (shortest, smoothness, and safest) so far. Here, multi objective approaches are discussed in detail in order to identify research gaps. In addition, it is important to understand how path planning strategies are developed under various environmental circumstances.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Online and Biomedical Engineering (iJOE)
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.
