Path planning and Obstacle avoidance approaches for Mobile robot
Hoc Thai Nguyen, Hai Xuan Le

TL;DR
This paper introduces a combined path planning and obstacle avoidance method for mobile robots that efficiently reaches targets in static and dynamic environments, reducing loops and optimizing paths.
Contribution
The paper presents a novel integrated approach that enhances mobile robot navigation by combining shortest path planning with intelligent obstacle avoidance.
Findings
Effective in static and dynamic environments
Reduces infinite loop traps during navigation
Demonstrated through extensive simulations
Abstract
A new path planning method for Mobile Robots (MR) has been developed and implemented. On the one hand, based on the shortest path from the start point to the goal point, this path planner can choose the best moving directions of the MR, which helps to reach the target point as soon as possible. On the other hand, with an intelligent obstacle avoidance, our method can find the target point with the near-shortest path length while avoiding some infinite loop traps of several obstacles in unknown environments. The combination of two approaches helps the MR to reach the target point with a very reliable algorithm. Moreover, by continuous updates of the on-board sensors information, this approach can generate the MRs trajectory both in static and dynamic environments. A large number of simulations in some similar studies environments demonstrate the power of the proposed path planning…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Control and Dynamics of Mobile Robots · Robotic Locomotion and Control
