Akses terbuka Jurnal SINTA 1
Accelerating Informed-RRT* through Goal-Projected Sampling and Adaptive Informed-Region Refinement
Journal of Robotics and Control (JRC) · Vol. 7 No. 3 (2026) · hlm. 3735–3747
- ISSN
- 2715-5072, 2715-5056
- Terbit
- 2026-05-01
- Penerbit
- Universitas Muhammadiyah Yogyakarta
- Bahasa
- eng
Abstrak
Efficient global path planning in complex environments remains a major challenge for sampling-based planners, particularly during the initialization phase. Although Informed-RRT* guarantees asymptotic optimality once a feasible path is found, its performance is often limited by the slow discovery of initial solutions caused by undirected random sampling. To address this limitation, this paper proposes Adaptive goal-projected informed-RRT*, designed to accelerate the initialization phase without sacrificing probabilistic completeness or asymptotic optimality. The main contribution of this work is a hybrid adaptive sampling strategy that integrates directed projection toward the goal with adaptive informed-region refinement. Before an initial solution is obtained, random samples are adaptively projected toward the goal under line-of-sight constraints to prevent exploration from becoming trapped in dead-end corridors. After a feasible path is found, sampling is restricted to an informed elliptical region defined by the current best path cost, allowing the search to focus on states that can potentially improve the solution. Within this region, adaptive objective projection and LOS-based filtering further guide the sampling process while maintaining sampling diversity. Experiments conducted in six environments with varying obstacle densities show that the proposed method reduces planning time by 7.7%, 59.5%, and 56.0% compared with Fast-RRT, Smart-RRT, and Informed-RRT*, respectively. In addition, the proposed approach generates shorter trajectories while maintaining a 100% success rate, resulting in an average overall efficiency improvement of 9.1 % relative to all baseline methods. These results indicate that accelerating the initialization phase significantly improves computational efficiency and enhances the practical applicability of Informed-RRT* for real-world robotic navigation
Kata kunci
Jaringan kolaborasi para penulis
22 penulis · 56 tautan kepenulisan bersama · 25 lintas organisasi
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
- Mercu Buana University
- Shanghai University
- Tun Hussein Onn University of Malaysia
- Beijing Institute of Technology
- Shenzhen Polytechnic University
- Universitas Muhammadiyah Prof Dr Hamka
- Yuan Ze University
- Organisasi lain
- Afiliasi tidak diketahui
- Organisasi berbeda
- Organisasi sama
- Afiliasi tidak diketahui
- Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
| Rekan penulis | Organisasi | Artikel bersama |
|---|---|---|
| Yingzhong Tian | Shanghai University | 10 |
| Andi Adriansyah | Mercu Buana University | 5 |
| Achmad Burhanudin | Mercu Buana University | 3 |
| January Dwidasa Winiyoga | Mercu Buana University | 2 |
| Abu Ubaidah Shamsudin | Tun Hussein Onn University of Malaysia | 2 |
| Prastika Indriyanti | Mercu Buana University | 2 |
| Arafat Febriandirza | Universitas Muhammadiyah Prof Dr Hamka | 2 |
| Yudi Hastomi | Mercu Buana University | 2 |
| Qingsheng Luo | Beijing Institute of Technology | 1 |
| Akhmad Wahyu Dani | Mercu Buana University | 1 |
| Satriyo Miharno | Mercu Buana University | 1 |
| Wenbin Wang | Shenzhen Polytechnic University | 1 |
| Md Musabbir Hossain | Afiliasi tidak diketahui | 1 |
| Long Li | Afiliasi tidak diketahui | 1 |
| Nur Aziz Taufikurohman | Mercu Buana University | 1 |
| Ahmad Athif Mohd Faudzi | University of Technology Malaysia | 1 |
| Yudhi Gunardi | Mercu Buana University | 1 |
| Fina Supegina | Mercu Buana University | 1 |
| Isack Farady | Yuan Ze University | 1 |
Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.