Scollr summary
What this paper is about
Stitching Informed Trees is proposed, an almost-surely asymptotically optimal informed bidirectional planner that augments the underlying informed bidirectional search framework with two local stitching mechanisms that improves finite-time success rate, initial-solution convergence, and final solution cost compared with competitive informed-planning baselines.
Full abstract
Read the full abstract
Abstract Sampling-based motion planners often suffer from slow finite-time convergence in narrow passages and cluttered high-dimensional environments, where useful valid samples near critical bottlenecks are sparse and bidirectional search can become locally stagnant. Existing informed planners improve efficiency by restricting sampling to cost-relevant regions or by refining global graph approximations, but local collision-failure information and the structure of the current path are often underused when search progress stalls. This paper proposes Stitching Informed Trees (SIT*), an almost-surely asymptotically optimal informed bidirectional planner that augments the underlying informed bidirectional search framework with two local stitching mechanisms. Before an initial feasible solution is found, SIT* detects exhaustion of the current bidirectional search over the graph approximation, identifies a promising forward–reverse frontier pair, and constructs a local bridge-repair ellipsoid around the current search interface. After an initial feasible solution has been found, SIT* applies long-short edge coupling to partition the current path and construct chained local ellipsoids for path-aware refinement. These local regions concentrate sampling on crowded or detour-prone path segments where cost improvement is more likely, while the global informed bidirectional search process is preserved. Benchmark results on Narrow Passage and Random Rectangles problems from $$\mathbb {R}^{2}$$ R 2 to $$\mathbb {R}^{8}$$ R 8 show that SIT* improves finite-time success rate, initial-solution convergence, and final solution cost compared with competitive informed-planning baselines.
Direct answer
What can I do from this paper page?
Use this page to scan "Efficient Motion Planning in Narrow Passages via Long-Short Edge Coupling and Stitching Sampling" quickly: start with the summary and abstract, then check the authors, source, topics, and related papers. From here, open Scollr to follow Robotic Path Planning Algorithms research, save the paper, or map adjacent work.
Research areas
Follow related topics
Citation
BibTeX
@article{Zhang2026Efficient,
title = {Efficient Motion Planning in Narrow Passages via Long-Short Edge Coupling and Stitching Sampling},
author = {Liding Zhang and Xucheng Guo and Kuanqi Cai and Fan Wu and Zhonghua Miao and Zhenshan Bing and Alois Knoll},
journal = {Journal of Intelligent & Robotic Systems},
year = {2026},
doi = {10.1007/s10846-026-02484-9},
url = {https://doi.org/10.1007/s10846-026-02484-9}
}
FAQ
Using this paper in a discovery workflow
How do I find related work for this paper?
Use the related papers and topic links on this page as starting points. In Scollr, you can also open the paper and build a literature map around its references, citing papers, and related work.
How can I keep up with new Robotic Path Planning Algorithms research papers?
Follow Robotic Path Planning Algorithms research in Scollr. New papers from the topic flow into a personalized feed, and you can save useful studies to revisit later.
Can I cite this paper from this page?
This page includes a static BibTeX block for Efficient Motion Planning in Narrow Passages via Long-Short Edge Coupling and Stitching Sampling. Always verify the DOI, source, and publication details against the publisher record before submitting a manuscript.
Follow this research in Scollr
Follow the topics and authors behind this paper, save useful studies, and build a literature map when you are ready to go deeper.
Get the app