On the public citation graph
Star-shaped Roadmaps - A Deterministic Sampling Approach for Complete Motion Planning
0 signed · 55 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0196-8858(83)90014-3openalex-snapshot
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.055openalex-snapshot
Using interval arithmetic to prove that a set is path-connected
inferredcites →https://doi.org/10.1109/70.508439openalex-snapshot
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
inferredcites →https://doi.org/10.1109/robot.1999.772448openalex-snapshot
MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space
inferredcites →https://doi.org/10.1109/robot.2001.932865openalex-snapshot
Disconnection proofs for motion planning
inferredcites →https://doi.org/10.1145/1057432.1057464openalex-snapshot
Topology preserving surface extraction using adaptive subdivision
inferredcites →https://doi.org/10.1145/133994.134024openalex-snapshot
Interval analysis for computer graphics
inferredcites →https://doi.org/10.1145/142920.134024openalex-snapshot
Interval analysis for computer graphics
inferredcites →https://doi.org/10.1145/359156.359164openalex-snapshot
An algorithm for planning collision-free paths among polyhedral obstacles
inferredcites →https://doi.org/10.1163/156855300741960openalex-snapshot
Visibility-based probabilistic roadmaps for motion planning
inferredcites →https://doi.org/10.1177/0278364905059061openalex-snapshot
A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots
inferredcites →https://doi.org/10.1177/0278364906071199openalex-snapshot
A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots
inferredcites →https://doi.org/10.1177/02783649922067753openalex-snapshot
Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts
inferredcites →https://doi.org/10.1201/9781439863886-19openalex-snapshot
OBPRM: An Obstacle-Based PRM for 3D Workspaces
inferredcites →https://doi.org/10.15607/rss.2005.i.004openalex-snapshot
Star-shaped Roadmaps - A Deterministic Sampling Approach for Complete Motion Planning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-44051-0_1openalex-snapshot
Path Planning for Ellipsoidal Robots and General Obstacles via Closed-Form Characterization of Minkowski Operations
inferred← citeshttps://doi.org/10.1007/978-3-540-68405-3_17openalex-snapshot
A Simple Path Non-existence Algorithm Using C-Obstacle Query
inferred← citeshttps://doi.org/10.1007/978-3-540-68405-3_18openalex-snapshot
RESAMPL: A Region-Sensitive Adaptive Motion Planner
inferred← citeshttps://doi.org/10.1007/978-3-540-79126-3_1openalex-snapshot
Digital Geometry Processing with Topological Guarantees
inferred← citeshttps://doi.org/10.1016/j.cad.2007.05.012openalex-snapshot
Generalized penetration depth computation
inferred← citeshttps://doi.org/10.1016/j.cagd.2008.06.006openalex-snapshot
Covering Minkowski sum boundary using points with applications
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.04.002openalex-snapshot
On soft predicates in subdivision motion planning
inferred← citeshttps://doi.org/10.1109/icra.2011.5980572openalex-snapshot
A practical algorithm for robot path planning with imprecise environmental dimensions
inferred← citeshttps://doi.org/10.1109/icra.2012.6225300openalex-snapshot
Proving path non-existence using sampling and alpha shapes
inferred← citeshttps://doi.org/10.1109/icra.2013.6631156openalex-snapshot
Improving sparse roadmap spanners
inferred← citeshttps://doi.org/10.1109/icra.2014.6907712openalex-snapshot
Cache-aware asymptotically-optimal sampling-based motion planning
inferred← citeshttps://doi.org/10.1109/icra55743.2025.11128318openalex-snapshot
Robot Navigation in Unknown and Cluttered Workspace with Dynamical System Modulation in Starshaped Roadmap
inferred← citeshttps://doi.org/10.1109/iros.2006.281735openalex-snapshot
Toward Interactive Reaching in Static Environments for Humanoid Robots
inferred← citeshttps://doi.org/10.1109/iros.2007.4399064openalex-snapshot
A hybrid approach for complete motion planning
inferred← citeshttps://doi.org/10.1109/iros.2009.5354685openalex-snapshot
Planning motion in point-represented contact spaces using approximate star-shaped decomposition
inferred← citeshttps://doi.org/10.1109/iros.2013.6696508openalex-snapshot
A study on the finite-time near-optimality properties of sampling-based motion planners
inferred← citeshttps://doi.org/10.1109/iros45743.2020.9340804openalex-snapshot
Towards General Infeasibility Proofs in Motion Planning
inferred← citeshttps://doi.org/10.1109/pg.2007.47openalex-snapshot
Radiometric Compensation through Inverse Light Transport
inferred← citeshttps://doi.org/10.1109/pg.2007.49openalex-snapshot
Point-Based Minkowski Sum Boundary
inferred← citeshttps://doi.org/10.1109/robot.2006.1642163openalex-snapshot
Fast C-obstacle query computation for motion planning
inferred← citeshttps://doi.org/10.1109/robot.2006.1642164openalex-snapshot
Topology preserving approximation of free configuration space
inferred← citeshttps://doi.org/10.1109/robot.2009.5152665openalex-snapshot
Global vector field computation for feedback motion planning
inferred← citeshttps://doi.org/10.1109/sai.2014.6918204openalex-snapshot
Data structures and algorithms for topological analysis
inferred← citeshttps://doi.org/10.1145/1128888.1128914openalex-snapshot
Generalized penetration depth computation
inferred← citeshttps://doi.org/10.1145/1401132.1401193openalex-snapshot
Motion planning and autonomy for virtual humans
inferred← citeshttps://doi.org/10.1145/1599470.1599478openalex-snapshot
Visibility transition planning for dynamic camera control
inferred← citeshttps://doi.org/10.1145/1778765.1778817openalex-snapshot
Star-contours for efficient hierarchical self-collision detection
inferred← citeshttps://doi.org/10.1145/2462356.2462386openalex-snapshot
On soft predicates in subdivision motion planning
inferred← citeshttps://doi.org/10.1145/3687950openalex-snapshot
Bijective Volumetric Mapping via Star Decomposition
inferred← citeshttps://doi.org/10.11606/d.3.2008.tde-30052008-132218openalex-snapshot
Análise de técnicas para amostragem e seleção de vértices no planejamento probabilístico de mapa de rotas.
inferred← citeshttps://doi.org/10.11606/t.55.2022.tde-23052022-194647openalex-snapshot
Espaços de configurações no problema de planificação de movimento simultâneo livre de colisões
inferred← citeshttps://doi.org/10.1177/0278364908099216openalex-snapshot
Efficient Cell Labelling and Path Non-existence Computation using C-obstacle Query
inferred← citeshttps://doi.org/10.15607/rss.2008.iv.013openalex-snapshot
Hybrid Motion Planning Using Minkowski Sums
inferred← citeshttps://doi.org/10.2312/spbg/spbg07/073-080openalex-snapshot
Approximate Star-Shaped Decomposition of Point Set Data
inferred← citeshttps://doi.org/10.31274/etd-180810-216openalex-snapshot
Practical motion planning for aerial-like virtual agents in Meta!Blast: A full and complex three dimensional virtual environment
inferred← citeshttps://doi.org/10.7282/t35x2d2kopenalex-snapshot
Compact representations for efficient robot motion planning with formal guarantees
inferred← citeshttps://doi.org/10.7551/mitpress/8344.003.0017openalex-snapshot
Hybrid Motion Planning Using Minkowski Sums
showing the first 38 of 39 · page through all 39
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.