EUVIMEDEUVIMED entdecken
Crossref

An adaptive bidirectional optimal rapidly exploring random tree algorithm with dynamic adjustment and extended guidance strategy

Dan Chen, Kaiwen Luo, Zichen Wang, Lintao Fan, Changqing Wang

Robotics and Autonomous Systems · 2026-04 · 198 · 105314

DOI: 10.1016/j.robot.2025.105314 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Robotics and Autonomous Systems, 2026-04. Verfasst von Dan Chen und 4 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 23 Literaturangaben. Gefördert von: Xi'an Science and Technology Bureau.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Xi'an Science and Technology Bureau

Zitieren

APA

Chen, D., Luo, K., Wang, Z., Fan, L., & Wang, C. (2026). An adaptive bidirectional optimal rapidly exploring random tree algorithm with dynamic adjustment and extended guidance strategy. Robotics and Autonomous Systems, 198, 105314. https://doi.org/10.1016/j.robot.2025.105314

Vancouver

Chen D, Luo K, Wang Z, Fan L, Wang C. An adaptive bidirectional optimal rapidly exploring random tree algorithm with dynamic adjustment and extended guidance strategy. Robotics and Autonomous Systems. 2026;198:105314. doi:10.1016/j.robot.2025.105314

BibTeX
@article{Chen2026,
  author = {Chen, Dan and Luo, Kaiwen and Wang, Zichen and Fan, Lintao and Wang, Changqing},
  title = {An adaptive bidirectional optimal rapidly exploring random tree algorithm with dynamic adjustment and extended guidance strategy},
  journal = {Robotics and Autonomous Systems},
  year = {2026},
  volume = {198},
  pages = {105314},
  doi = {10.1016/j.robot.2025.105314}
}
Kostenlos starten →