变形
计算机科学
树(集合论)
路径(计算)
修剪
不相交集
交叉口(航空)
障碍物
利用
实时计算
人工智能
数学
计算机网络
工程类
计算机安全
政治学
法学
航空航天工程
数学分析
组合数学
农学
生物
作者
Zongyuan Shen,James P. Wilson,Shalabh Gupta,Ryan Harvey
标识
DOI:10.1109/lra.2023.3315210
摘要
The paper presents an algorithm, called Self-Morphing Adaptive Replanning Tree (SMART), that facilitates fast replanning in dynamic environments. SMART performs risk-based tree-pruning if the current path is obstructed by nearby moving obstacle(s), resulting in multiple disjoint subtrees. Then, for speedy recovery, it exploits these subtrees and performs informed tree-repair at hot-spots that lie at the intersection of subtrees to find a new path. The performance of SMART is comparatively evaluated with eight existing algorithms through extensive simulations. Two scenarios are considered with: 1) dynamic obstacles and 2) both static and dynamic obstacles. The results show that SMART yields significant improvements in replanning time, success rate and travel time. Finally, the performance of SMART is validated by a real laboratory experiment.
科研通智能强力驱动
Strongly Powered by AbleSci AI