logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A bidirectional rapidly-exploring random tree algorithm guided by key nodes on the obstacle bounding rectangles

delete2026-03-30
delete0
PRE
AI
H
Haiyang Jiang
Y
Yiming Fang *
D
Dongliang Zhao
L
Le Liu
S
Shenao Cen
DOI：10.1016/j.engappai.2026.114636delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• KNOBR-RRT-Connect algorithm is proposed to solve path planning problems. • A guidance strategy based on key nodes on the obstacle bounding rectangles is employed. • The performance of the proposed KNOBR-RRT-Connect is validated in many environments.
Keywords:
KNOBR-RRT-Connect
path planning
key nodes
obstacle bounding rectangles
bidirectional RRT

Journal

Engineering Applications of Artificial Intelligence cover
Engineering Applications of Artificial Intelligence
IF:
8
Papers:
5.4K
Citations:
3.5W

Organization

No organization information available