activity
20232026
most citedFlexible Informed Trees (FIT*): Adaptive Batch-Size Approach in Informed Sampling-Based Path Planning

13 citations · 44 across the 15 of their papers we have counts for

collaborators
Showing 2025Show all

7 papers · 1 filter

cs.RO2025

Video-to-BT: Generating Reactive Behavior Trees from Human Demonstration Videos for Robotic Assembly

Xiwei Zhao, Yiwei Wang, Yansong Wu +5

Modern manufacturing demands robotic assembly systems with enhanced flexibility and reliability. However, traditional approaches often rely on programming tailored to each product…

cs.RO2025★ 9 cited

Estimated Informed Anytime Search for Sampling-Based Planning via Adaptive Sampler

Liding Zhang, Kuanqi Cai, Yu Zhang +5

Path planning in robotics often involves solving continuously valued, high-dimensional problems. Popular informed approaches include graph-based searches, such as A*, and sampling-…

cs.RO2025★ 2 cited

APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors

Liding Zhang, Sicheng Wang, Kuanqi Cai +5

Optimal path planning aims to determine a sequence of states from a start to a goal while accounting for planning objectives. Popular methods often integrate fixed batch sizes and…

cs.RO2025★ 7 cited

Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization

Liding Zhang, Yao Ling, Zhenshan Bing +3

Bidirectional motion planning often reduces planning time compared to its unidirectional counterparts. It requires connecting the forward and reverse search trees to form a continu…

cs.RO2025★ 10 cited

Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles

Liding Zhang, Zhenshan Bing, Yu Zhang +5

Path planning has long been an important and active research area in robotics. To address challenges in high-dimensional motion planning, this study introduces the Force Direction…

cs.RO2025

Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic

Liding Zhang, Kejia Chen, Kuanqi Cai +7

Optimal path planning requires finding a series of feasible states from the starting point to the goal to optimize objectives. Popular path planning algorithms, such as Effort Info…

cs.RO2025

SharedAssembly: A Data Collection Approach via Shared Tele-Assembly

Yansong Wu, Xiao Chen, Yu Chen +4

High-precision, tight-clearance assembly demonstrations are indispensable for training tactile-aware robotic foundation models, yet their acquisition is heavily bottlenecked by the…