SMART: Self-Morphing Adaptive Replanning Tree
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 May 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2025SMART-OC: A Real-time Time-risk Optimal Replanning Algorithm for Dynamic Obstacles and Spatio-temporally Varying Currentscited by 1
- 2025SMART-3D: Three-Dimensional Self-Morphing Adaptive Replanning Treecited by 0
- 2026Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directionscited by 0
- 2026Learning-Based Motion Planning for Dynamic Environments: From Foundational Algorithms to Emerging Paradigmscited by 0
- 2026Learning-Based Motion Planning for Dynamic Environments: From Foundational Algorithms to Emerging Paradigms1 Aug 2026
- 2026Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions12 Jul 2026
- 2025SMART-3D: Three-Dimensional Self-Morphing Adaptive Replanning Tree20 Sep 2025
- 2025SMART-OC: A Real-time Time-risk Optimal Replanning Algorithm for Dynamic Obstacles and Spatio-temporally Varying Currents13 Aug 2025