SE(2) NavMesh adds yaw-dependent traversability layers to polygonal navigation meshes, paired with ASA hierarchical pathfinding and incremental point-cloud updates, claiming over 50% more traversable area than standard navmeshes.
Sampling-based algorithms for optimal motion planning
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 1
baseline 1
citation-polarity summary
years
2026 8representative citing papers
The STL motion-planning problem is reformulated as a shortest-path problem over a graph of convex sets to generate smooth Bézier-spline trajectories satisfying logical, timing, smoothness, and velocity constraints.
A new alignment heuristic and star-shaped simplex chain construction for feedback motion planning reduces average path bending by 91.4% and LQR effort by 45.5% while remaining computationally efficient.
A vision-guided hybrid rigid-soft manipulator achieves consistent sub-2cm reaching in unseen cluttered environments via shape-aware planning and learning control without environment-specific retraining.
A hybrid navigation system uses offline HJ reachability computations as heuristics and safety constraints within graph search to achieve faster and safer robot movement in complex indoor environments.
A hybrid search-plus-optimal-control framework that produces optimized, kinematically feasible trajectories for multiple agents by warm-starting an OCP from an initial feasible solution.
A literature review of intelligent automation approaches using robotics, AI, and control for disassembly, inspection, sorting, and reprocessing of end-of-life electronics.
citing papers explorer
-
SE(2) Navigation Mesh
SE(2) NavMesh adds yaw-dependent traversability layers to polygonal navigation meshes, paired with ASA hierarchical pathfinding and incremental point-cloud updates, claiming over 50% more traversable area than standard navmeshes.
-
Signal Temporal Logic Motion Planning via Graphs of Convex Sets
The STL motion-planning problem is reformulated as a shortest-path problem over a graph of convex sets to generate smooth Bézier-spline trajectories satisfying logical, timing, smoothness, and velocity constraints.
-
Smooth Feedback Motion Planning with Reduced Curvature
A new alignment heuristic and star-shaped simplex chain construction for feedback motion planning reduces average path bending by 91.4% and LQR effort by 45.5% while remaining computationally efficient.
-
HyReach: Vision-Guided Hybrid Manipulator Reaching in Unseen Cluttered Environments
A vision-guided hybrid rigid-soft manipulator achieves consistent sub-2cm reaching in unseen cluttered environments via shape-aware planning and learning control without environment-specific retraining.
-
A Hamilton-Jacobi Reachability-Guided Search Framework for Efficient and Safe Indoor Planar Robot Navigation
A hybrid navigation system uses offline HJ reachability computations as heuristics and safety constraints within graph search to achieve faster and safer robot movement in complex indoor environments.
-
Optimized and kinematically feasible multi-agent motion planning
A hybrid search-plus-optimal-control framework that produces optimized, kinematically feasible trajectories for multiple agents by warm-starting an OCP from an initial feasible solution.
-
Redefining End-of-Life: Intelligent Automation for Electronics Remanufacturing Systems
A literature review of intelligent automation approaches using robotics, AI, and control for disassembly, inspection, sorting, and reprocessing of end-of-life electronics.
- Flow Motion Policy: Manipulator Motion Planning with Flow Matching Models