Bi-Directional Adaptive Probabilistic Method With a Triangular Segmented Interpolation for Robot Path Planning in Complex Dynamic-Environments
Path planning is a fundamental aspect of mobile robots and autonomous systems. Methods of path planning are used in robotics to create a path for a robot or autonomous system to follow from a starting position to a goal one while avoiding obstacles and satisfying any additional conditions. There are...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10168122/ |
| _version_ | 1797689555182157824 |
|---|---|
| author | Suhaib Al-Ansarry Salah Al-Darraji Asmaa Shareef Dhafer G. Honi Francesca Fallucchi |
| author_facet | Suhaib Al-Ansarry Salah Al-Darraji Asmaa Shareef Dhafer G. Honi Francesca Fallucchi |
| author_sort | Suhaib Al-Ansarry |
| collection | DOAJ |
| description | Path planning is a fundamental aspect of mobile robots and autonomous systems. Methods of path planning are used in robotics to create a path for a robot or autonomous system to follow from a starting position to a goal one while avoiding obstacles and satisfying any additional conditions. There are many different methods to plan the path, including probabilistic methods, heuristics-based approaches, and optimization-based methods. In this paper, we introduce a novel path planning method called Dynamic Adaptive RRT-connect with Triangular Segmented Interpolation. Our approach aims to enhance the conventional Rapidly-exploring Random Tree (RRT) algorithms by incorporating an Adaptive-RRT strategy. This strategy involves selecting a random node as a new node to augment the exploration of the tree, thereby improving its coverage of the search space. Furthermore, we employ a Bi-directional scheme to further enhance the convergence time and cost of our method. By exploring the search space from both the initial and goal configurations simultaneously, we exploit the advantages of a two-way search, potentially resulting in more efficient and optimized paths. To improve the quality of the generated paths, our method leverages the Triangular Segmented Interpolation (TSI) technique. TSI helps in reducing the path length and increasing its smoothness by interpolating between the configurations in a triangular segmented manner, resulting in more natural and feasible trajectories. Moreover, considering the dynamic nature of the environment, our method operates within the framework of the Dynamic Window Approach (DWA). By adapting to the changing environment, our approach effectively avoids dynamic obstacles and navigates the robot or system through complex and unpredictable scenarios. We have conducted extensive experiments in various environments to evaluate the performance of our proposed method. The results demonstrate that our approach outperforms the individual RRT and RRT-connect algorithms in terms of computation time (reduced by 90-80%), cost (reduced by 82-63%), and path length (shortened by 17-12%). Additionally, our method exhibits efficient obstacle avoidance capabilities, enabling successful navigation in dynamic environments. |
| first_indexed | 2024-03-12T01:47:14Z |
| format | Article |
| id | doaj.art-40f463dfb8d2451c9d2310c835c6b1c6 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-03-12T01:47:14Z |
| publishDate | 2023-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-40f463dfb8d2451c9d2310c835c6b1c62023-09-08T23:01:27ZengIEEEIEEE Access2169-35362023-01-0111877478775910.1109/ACCESS.2023.329089710168122Bi-Directional Adaptive Probabilistic Method With a Triangular Segmented Interpolation for Robot Path Planning in Complex Dynamic-EnvironmentsSuhaib Al-Ansarry0https://orcid.org/0000-0003-0201-3000Salah Al-Darraji1https://orcid.org/0000-0002-8707-1308Asmaa Shareef2https://orcid.org/0000-0001-5044-1419Dhafer G. Honi3https://orcid.org/0000-0002-2052-013XFrancesca Fallucchi4Department of Computer Science, College of Education for Pure Sciences, University of Basrah, Basrah, IraqDepartment of Computer Science, College of Computer Science and Information Technology, University of Basrah, Basrah, IraqDepartment of Computer Science, College of Education for Pure Sciences, University of Basrah, Basrah, IraqDepartment of Computer Science, College of Education for Pure Sciences, University of Basrah, Basrah, IraqDepartment of Engineering Science, Guglielmo Marconi University, Rome, ItalyPath planning is a fundamental aspect of mobile robots and autonomous systems. Methods of path planning are used in robotics to create a path for a robot or autonomous system to follow from a starting position to a goal one while avoiding obstacles and satisfying any additional conditions. There are many different methods to plan the path, including probabilistic methods, heuristics-based approaches, and optimization-based methods. In this paper, we introduce a novel path planning method called Dynamic Adaptive RRT-connect with Triangular Segmented Interpolation. Our approach aims to enhance the conventional Rapidly-exploring Random Tree (RRT) algorithms by incorporating an Adaptive-RRT strategy. This strategy involves selecting a random node as a new node to augment the exploration of the tree, thereby improving its coverage of the search space. Furthermore, we employ a Bi-directional scheme to further enhance the convergence time and cost of our method. By exploring the search space from both the initial and goal configurations simultaneously, we exploit the advantages of a two-way search, potentially resulting in more efficient and optimized paths. To improve the quality of the generated paths, our method leverages the Triangular Segmented Interpolation (TSI) technique. TSI helps in reducing the path length and increasing its smoothness by interpolating between the configurations in a triangular segmented manner, resulting in more natural and feasible trajectories. Moreover, considering the dynamic nature of the environment, our method operates within the framework of the Dynamic Window Approach (DWA). By adapting to the changing environment, our approach effectively avoids dynamic obstacles and navigates the robot or system through complex and unpredictable scenarios. We have conducted extensive experiments in various environments to evaluate the performance of our proposed method. The results demonstrate that our approach outperforms the individual RRT and RRT-connect algorithms in terms of computation time (reduced by 90-80%), cost (reduced by 82-63%), and path length (shortened by 17-12%). Additionally, our method exhibits efficient obstacle avoidance capabilities, enabling successful navigation in dynamic environments.https://ieeexplore.ieee.org/document/10168122/Autonomous systemdynamic obstaclesinterpolationprobabilistic methodsrobot path planning |
| spellingShingle | Suhaib Al-Ansarry Salah Al-Darraji Asmaa Shareef Dhafer G. Honi Francesca Fallucchi Bi-Directional Adaptive Probabilistic Method With a Triangular Segmented Interpolation for Robot Path Planning in Complex Dynamic-Environments IEEE Access Autonomous system dynamic obstacles interpolation probabilistic methods robot path planning |
| title | Bi-Directional Adaptive Probabilistic Method With a Triangular Segmented Interpolation for Robot Path Planning in Complex Dynamic-Environments |
| title_full | Bi-Directional Adaptive Probabilistic Method With a Triangular Segmented Interpolation for Robot Path Planning in Complex Dynamic-Environments |
| title_fullStr | Bi-Directional Adaptive Probabilistic Method With a Triangular Segmented Interpolation for Robot Path Planning in Complex Dynamic-Environments |
| title_full_unstemmed | Bi-Directional Adaptive Probabilistic Method With a Triangular Segmented Interpolation for Robot Path Planning in Complex Dynamic-Environments |
| title_short | Bi-Directional Adaptive Probabilistic Method With a Triangular Segmented Interpolation for Robot Path Planning in Complex Dynamic-Environments |
| title_sort | bi directional adaptive probabilistic method with a triangular segmented interpolation for robot path planning in complex dynamic environments |
| topic | Autonomous system dynamic obstacles interpolation probabilistic methods robot path planning |
| url | https://ieeexplore.ieee.org/document/10168122/ |
| work_keys_str_mv | AT suhaibalansarry bidirectionaladaptiveprobabilisticmethodwithatriangularsegmentedinterpolationforrobotpathplanningincomplexdynamicenvironments AT salahaldarraji bidirectionaladaptiveprobabilisticmethodwithatriangularsegmentedinterpolationforrobotpathplanningincomplexdynamicenvironments AT asmaashareef bidirectionaladaptiveprobabilisticmethodwithatriangularsegmentedinterpolationforrobotpathplanningincomplexdynamicenvironments AT dhaferghoni bidirectionaladaptiveprobabilisticmethodwithatriangularsegmentedinterpolationforrobotpathplanningincomplexdynamicenvironments AT francescafallucchi bidirectionaladaptiveprobabilisticmethodwithatriangularsegmentedinterpolationforrobotpathplanningincomplexdynamicenvironments |