Bi-directional virtual search algorithm for efficient and collision-free path planning in autonomous robots navigating static and dynamic environments
This study proposes an efficient and adaptable path-planning model for autonomous mobile robots operating in both static and dynamic grid-based environments. Initially, a collision-free grid map is constructed to represent the configuration space, ensuring accurate placement of obstacles and target...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2025-09-01
|
| Series: | Ain Shams Engineering Journal |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2090447925002679 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849316440108171264 |
|---|---|
| author | M.D. Yeshwanth Kumar K. Rajchandar |
| author_facet | M.D. Yeshwanth Kumar K. Rajchandar |
| author_sort | M.D. Yeshwanth Kumar |
| collection | DOAJ |
| description | This study proposes an efficient and adaptable path-planning model for autonomous mobile robots operating in both static and dynamic grid-based environments. Initially, a collision-free grid map is constructed to represent the configuration space, ensuring accurate placement of obstacles and target coordinates. The robot navigates toward its goal through a dynamic decision-making algorithm that updates its movements based on real-time coordinate comparisons and environmental changes. Extensive experiments were conducted across multiple static and dynamic scenarios. The proposed model achieved a path efficiency improvement of 17.9 % and a computational time reduction of 23.4 % compared to traditional A* and Dijkstra’s algorithms. The success rate remained consistently above 96.5 % even in environments with moving obstacles. Key evaluation metrics, including path optimality, success rate, average computation time, and adaptability score, demonstrate the model’s superiority over benchmark methods. Overall, the proposed framework ensures robust, real-time path planning with minimal computational overhead, making it highly suitable for complex autonomous navigation tasks in uncertain environments. |
| format | Article |
| id | doaj-art-dcd8ef7db5d04cb692308690e2e669e4 |
| institution | Kabale University |
| issn | 2090-4479 |
| language | English |
| publishDate | 2025-09-01 |
| publisher | Elsevier |
| record_format | Article |
| series | Ain Shams Engineering Journal |
| spelling | doaj-art-dcd8ef7db5d04cb692308690e2e669e42025-08-20T03:51:44ZengElsevierAin Shams Engineering Journal2090-44792025-09-0116910352610.1016/j.asej.2025.103526Bi-directional virtual search algorithm for efficient and collision-free path planning in autonomous robots navigating static and dynamic environmentsM.D. Yeshwanth Kumar0K. Rajchandar1School of CS & AI, SR University, Warangal 506 371, IndiaCorresponding author.; School of CS & AI, SR University, Warangal 506 371, IndiaThis study proposes an efficient and adaptable path-planning model for autonomous mobile robots operating in both static and dynamic grid-based environments. Initially, a collision-free grid map is constructed to represent the configuration space, ensuring accurate placement of obstacles and target coordinates. The robot navigates toward its goal through a dynamic decision-making algorithm that updates its movements based on real-time coordinate comparisons and environmental changes. Extensive experiments were conducted across multiple static and dynamic scenarios. The proposed model achieved a path efficiency improvement of 17.9 % and a computational time reduction of 23.4 % compared to traditional A* and Dijkstra’s algorithms. The success rate remained consistently above 96.5 % even in environments with moving obstacles. Key evaluation metrics, including path optimality, success rate, average computation time, and adaptability score, demonstrate the model’s superiority over benchmark methods. Overall, the proposed framework ensures robust, real-time path planning with minimal computational overhead, making it highly suitable for complex autonomous navigation tasks in uncertain environments.http://www.sciencedirect.com/science/article/pii/S2090447925002679Autonomous mobile robotsPath planningBi-directional virtual searching algorithmGrid cell selection methodStatic and dynamic environmentsCollision avoidance |
| spellingShingle | M.D. Yeshwanth Kumar K. Rajchandar Bi-directional virtual search algorithm for efficient and collision-free path planning in autonomous robots navigating static and dynamic environments Ain Shams Engineering Journal Autonomous mobile robots Path planning Bi-directional virtual searching algorithm Grid cell selection method Static and dynamic environments Collision avoidance |
| title | Bi-directional virtual search algorithm for efficient and collision-free path planning in autonomous robots navigating static and dynamic environments |
| title_full | Bi-directional virtual search algorithm for efficient and collision-free path planning in autonomous robots navigating static and dynamic environments |
| title_fullStr | Bi-directional virtual search algorithm for efficient and collision-free path planning in autonomous robots navigating static and dynamic environments |
| title_full_unstemmed | Bi-directional virtual search algorithm for efficient and collision-free path planning in autonomous robots navigating static and dynamic environments |
| title_short | Bi-directional virtual search algorithm for efficient and collision-free path planning in autonomous robots navigating static and dynamic environments |
| title_sort | bi directional virtual search algorithm for efficient and collision free path planning in autonomous robots navigating static and dynamic environments |
| topic | Autonomous mobile robots Path planning Bi-directional virtual searching algorithm Grid cell selection method Static and dynamic environments Collision avoidance |
| url | http://www.sciencedirect.com/science/article/pii/S2090447925002679 |
| work_keys_str_mv | AT mdyeshwanthkumar bidirectionalvirtualsearchalgorithmforefficientandcollisionfreepathplanninginautonomousrobotsnavigatingstaticanddynamicenvironments AT krajchandar bidirectionalvirtualsearchalgorithmforefficientandcollisionfreepathplanninginautonomousrobotsnavigatingstaticanddynamicenvironments |