On the public citation graph

On Feasible Search Space Reduction for Efficient Path Planning in Obstacle-Rich Configuration Space

https://doi.org/10.2139/ssrn.7439433
0 signed · 30 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-319-16595-0_7openalex-snapshot
Computing Large Convex Regions of Obstacle-Free Space Through Semidefinite Programming
inferredcites →https://doi.org/10.1007/978-3-540-68405-3_17openalex-snapshot
A Simple Path Non-existence Algorithm Using C-Obstacle Query
inferredcites →https://doi.org/10.1007/s10846-019-01112-zopenalex-snapshot
Hybrid Path Planning Based on Safe A* Algorithm and Adaptive Window Approach for Mobile Robot in Large-Scale Dynamic Environment
inferredcites →https://doi.org/10.1007/s11370-017-0236-7openalex-snapshot
Optimal path planning in cluttered environment using RRT*-AB
inferredcites →https://doi.org/10.1007/s43154-021-00057-2openalex-snapshot
Autonomy for Space Robots: Past, Present, and Future
inferredcites →https://doi.org/10.1016/j.comcom.2019.10.014openalex-snapshot
Path planning techniques for unmanned aerial vehicles: A review, solutions, and challenges
inferredcites →https://doi.org/10.1016/j.oceaneng.2021.108709openalex-snapshot
The hybrid path planning algorithm based on improved A* and artificial potential field for unmanned surface vehicle formations
inferredcites →https://doi.org/10.1016/j.robot.2018.06.013openalex-snapshot
Potentially guided bidirectionalized RRT* for fast optimal path planning in cluttered environments
inferredcites →https://doi.org/10.1016/j.robot.2025.105001openalex-snapshot
Angle-based multi-goal ordering and path-planning using an improved A-star algorithm
inferredcites →https://doi.org/10.1109/icar53236.2021.9659459openalex-snapshot
When to Terminate: Path Non-existence Verification Improves Sampling-based Motion Planning
inferredcites →https://doi.org/10.1109/icra.2012.6225300openalex-snapshot
Proving path non-existence using sampling and alpha shapes
inferredcites →https://doi.org/10.1109/icra.2015.7139620openalex-snapshot
Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs
inferredcites →https://doi.org/10.1109/icra40945.2020.9196580openalex-snapshot
Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced Graph-Search Techniques
inferredcites →https://doi.org/10.1109/icra55743.2025.11127725openalex-snapshot
Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic
inferredcites →https://doi.org/10.1109/lra.2024.3463332openalex-snapshot
Online Time-Informed Kinodynamic Motion Planning of Nonlinear Systems
inferredcites →https://doi.org/10.1109/lra.2025.3643271openalex-snapshot
Incremental Generalized Hybrid A*
inferredcites →https://doi.org/10.1109/robio.2018.8665162openalex-snapshot
UAV Path Planning System Based on 3D Informed RRT* for Dynamic Obstacle Avoidance
inferredcites →https://doi.org/10.1109/robot.2001.932817openalex-snapshot
Decomposition-based motion planning: a framework for real-time motion planning in high-dimensional configuration spaces
inferredcites →https://doi.org/10.1109/tase.2020.2987397openalex-snapshot
EB-RRT: Optimal Motion Planning for Mobile Robots
inferredcites →https://doi.org/10.1109/tase.2021.3130372openalex-snapshot
Efficient Robot Motion Planning Using Bidirectional-Unidirectional RRT Extend Function
inferredcites →https://doi.org/10.1109/tase.2024.3398996openalex-snapshot
G²VD Planner: Efficient Motion Planning With Grid-Based Generalized Voronoi Diagrams
inferredcites →https://doi.org/10.1109/tie.2019.2962425openalex-snapshot
Optimal Path Planning Using Generalized Voronoi Graph and Multiple Potential Functions
inferredcites →https://doi.org/10.1109/tie.2023.3250847openalex-snapshot
Design and Practical Implementation of a High Efficiency Two-Layer Trajectory Planning Method for AGV
inferredcites →https://doi.org/10.1109/tro.2018.2830331openalex-snapshot
Informed Sampling for Asymptotically Optimal Path Planning
inferredcites →https://doi.org/10.1145/359156.359164openalex-snapshot
An algorithm for planning collision-free paths among polyhedral obstacles
inferredcites →https://doi.org/10.1145/3737280openalex-snapshot
Comprehensive Review of Path Planning Techniques for Unmanned Aerial Vehicles (UAVs)
inferredcites →https://doi.org/10.1177/0278364913507795openalex-snapshot
The minimum constraint removal problem with three robotics applications
inferredcites →https://doi.org/10.1177/0278364915619022openalex-snapshot
Combining task and motion planning: A culprit detection problem
inferredcites →https://doi.org/10.2514/6.2025-1004openalex-snapshot
Quadtree-Based Free-Space Cell-Decomposition for Pathplanning With RRT* Implementation
inferredcites →https://doi.org/10.5772/56718openalex-snapshot
RRT*-SMART: A Rapid Convergence Implementation of RRT*
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.