On the public citation graph

Hybrid Motion Planning Using Minkowski Sums

0 signed · 64 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/10991541_25openalex-snapshot
A Machine Learning Approach for Feature-Sensitive Motion Planning
inferredcites →https://doi.org/10.1007/978-1-4613-8997-2_20openalex-snapshot
Spatial Planning: A Configuration Space Approach
inferredcites →https://doi.org/10.1007/978-3-540-45058-0_15openalex-snapshot
Hybrid Motion Planning: Coordinating Two Discs Moving among Polygonal Obstacles in the Plane
inferredcites →https://doi.org/10.1007/978-3-540-68405-3_18openalex-snapshot
RESAMPL: A Region-Sensitive Adaptive Motion Planner
inferredcites →https://doi.org/10.1007/978-3-540-68405-3_4openalex-snapshot
Incremental Map Generation (IMG)
inferredcites →https://doi.org/10.1007/bf02187878openalex-snapshot
Computing convolutions by reciprocal search
inferredcites →https://doi.org/10.1016/0097-8493(92)90077-9openalex-snapshot
Solid-interpolating deformations: Construction and animation of PIPs
inferredcites →https://doi.org/10.1016/0097-8493(93)90023-3openalex-snapshot
A unified computational framework for Minkowski operations
inferredcites →https://doi.org/10.1016/j.cad.2007.05.017openalex-snapshot
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
inferredcites →https://doi.org/10.1016/j.gmod.2005.11.003openalex-snapshot
Accurate Minkowski sum approximation of polyhedral models
inferredcites →https://doi.org/10.1016/j.gmod.2007.01.001openalex-snapshot
Minkowski sum boundary surfaces of 3D-objects
inferredcites →https://doi.org/10.1016/j.jsc.2003.08.007openalex-snapshot
From the zonotope construction to the Minkowski addition of convex polytopes
inferredcites →https://doi.org/10.1016/s0898-1221(98)90095-5openalex-snapshot
Computational geometry: Algorithms and applications
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/70.864240openalex-snapshot
Choosing good distance metrics and local planners for probabilistic roadmap methods
inferredcites →https://doi.org/10.1109/iros.2004.1389627openalex-snapshot
Workspace importance sampling for probabilistic roadmap planning
inferredcites →https://doi.org/10.1109/iros.2007.4399064openalex-snapshot
A hybrid approach for complete motion planning
inferredcites →https://doi.org/10.1109/pg.2007.47openalex-snapshot
Radiometric Compensation through Inverse Light Transport
inferredcites →https://doi.org/10.1109/pg.2007.49openalex-snapshot
Point-Based Minkowski Sum Boundary
inferredcites →https://doi.org/10.1109/robot.1996.503582openalex-snapshot
A randomized roadmap method for path and manipulation planning
inferredcites →https://doi.org/10.1109/robot.1998.677043openalex-snapshot
Choosing good distance metrics and local planners for probabilistic roadmap methods
inferredcites →https://doi.org/10.1109/robot.1999.772447openalex-snapshot
The Gaussian sampling strategy for probabilistic roadmap planners
inferredcites →https://doi.org/10.1109/robot.2000.844730openalex-snapshot
RRT-connect: An efficient approach to single-query path planning
inferredcites →https://doi.org/10.1109/robot.2000.844795openalex-snapshot
A framework for using the workspace medial axis in PRM planners
inferredcites →https://doi.org/10.1109/robot.2004.1307191openalex-snapshot
Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners
inferredcites →https://doi.org/10.1109/robot.2005.1570712openalex-snapshot
Hybrid PRM Sampling with a Cost-Sensitive Adaptive Strategy
inferredcites →https://doi.org/10.1109/tc.1983.1676196openalex-snapshot
Spatial Planning: A Configuration Space Approach
inferredcites →https://doi.org/10.1137/0406019openalex-snapshot
Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
inferredcites →https://doi.org/10.1137/1.9781611972863.1openalex-snapshot
Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
inferredcites →https://doi.org/10.1177/02783640122067354openalex-snapshot
Planning Paths for Elastic Objects under Manipulation Constraints
inferredcites →https://doi.org/10.1177/0278364905060132openalex-snapshot
Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners
inferredcites →https://doi.org/10.1201/9781439863886-18openalex-snapshot
On Finding Narrow Passages with Probabilistic Roadmap Planners
inferredcites →https://doi.org/10.1201/9781439863886-19openalex-snapshot
OBPRM: An Obstacle-Based PRM for 3D Workspaces
inferredcites →https://doi.org/10.1201/9781439864135-48openalex-snapshot
Notes on Visibility Roadmaps and Path Planning
inferredcites →https://doi.org/10.15607/rss.2005.i.004openalex-snapshot
Star-shaped Roadmaps - A Deterministic Sampling Approach for Complete Motion Planning
inferredcites →https://doi.org/10.15607/rss.2005.i.015openalex-snapshot
Toward Optimal Configuration Space Sampling

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-642-00312-7_25openalex-snapshot
A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_42openalex-snapshot
Motion Planning via Manifold Samples
inferred← citeshttps://doi.org/10.1007/978-3-642-36279-8_19openalex-snapshot
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages
inferred← citeshttps://doi.org/10.1016/j.cad.2011.06.022openalex-snapshot
Voxelized Minkowski sum computation on the GPU with robust culling
inferred← citeshttps://doi.org/10.1016/j.cad.2013.08.021openalex-snapshot
A sweep and translate algorithm for computing voxelized 3D Minkowski sums on the GPU
inferred← citeshttps://doi.org/10.1016/j.cad.2021.103133openalex-snapshot
Closed-form Minkowski sums of convex bodies with smooth positively curved boundaries
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.1109/cdc57313.2025.11312188openalex-snapshot
Control Barrier Functions via Minkowski Operations for Safe Navigation among Polytopic Sets
inferred← citeshttps://doi.org/10.1109/icmcr69541.2026.11533928openalex-snapshot
Safe Navigation using Neural Radiance Fields via Reachable Sets
inferred← citeshttps://doi.org/10.1109/icra.2011.5979992openalex-snapshot
Dynamic Minkowski sum of convex shapes
inferred← citeshttps://doi.org/10.1109/iros.2011.6094436openalex-snapshot
Finding critical changes in dynamic configuration spaces
inferred← citeshttps://doi.org/10.1109/iros.2011.6094448openalex-snapshot
Computing unions of Inevitable Collision States and increasing safety to unexpected obstacles
inferred← citeshttps://doi.org/10.1109/iros.2013.6697185openalex-snapshot
Multi-robot caravanning
inferred← citeshttps://doi.org/10.1109/iros.2014.6943082openalex-snapshot
Sampling based motion planning with reachable volumes: Application to manipulators and closed chain systems
inferred← citeshttps://doi.org/10.1109/robot.2010.5509369openalex-snapshot
Probabilistic collision state checker for crowded environments
inferred← citeshttps://doi.org/10.1109/tase.2014.2331983openalex-snapshot
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages
inferred← citeshttps://doi.org/10.1109/tpami.2013.67openalex-snapshot
Minimum Near-Convex Shape Decomposition
inferred← citeshttps://doi.org/10.1109/tro.2022.3187818openalex-snapshot
Efficient Path Planning in Narrow Passages for Robots With Ellipsoidal Components
inferred← citeshttps://doi.org/10.1109/tro.2024.3390052openalex-snapshot
PRIMP: PRobabilistically-Informed Motion Primitives for Efficient Affordance Learning From Demonstration
inferred← citeshttps://doi.org/10.1115/detc2014-35561openalex-snapshot
Collision Prediction: Conservative Advancement Among Obstacles With Unknown Motion
inferred← citeshttps://doi.org/10.1145/1839778.1839783openalex-snapshot
A GPU-based voxelization approach to 3D Minkowski sum computation
inferred← citeshttps://doi.org/10.1177/0278364918779555openalex-snapshot
Sampling-based motion planning with reachable volumes for high-degree-of-freedom manipulators
inferred← citeshttps://doi.org/10.13021/mars/4954openalex-snapshot
Path Planning in Similar Environments
inferred← citeshttps://doi.org/10.15607/rss.2009.v.012openalex-snapshot
Planning motion in environments with similar obstacles
inferred← citeshttps://doi.org/10.31274/td-20240329-368openalex-snapshot
GPU-accelerated geometric algorithms for computational modeling and simulation
inferred← citeshttps://doi.org/10.32657/10356/50691openalex-snapshot
Shape based hand gesture recognition
inferred← citeshttps://doi.org/10.48550/arxiv.1909.05516openalex-snapshot
Inverse Graphical Method for Global Optimization and Application to Design Centering Problem
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.