On the public citation graph

Minimum Constraint Displacement Motion Planning

https://doi.org/10.15607/rss.2013.ix.017

0 signed · 50 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.1006/jagm.1999.1048openalex-snapshot

Fully Dynamic Algorithms for Maintaining Shortest Paths Trees

inferredcites →https://doi.org/10.1007/10991541_6openalex-snapshot

Multi-Step Motion Planning for Free-Climbing Robots

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/978-3-642-00312-7openalex-snapshot

Algorithmic Foundation of Robotics VIII

inferredcites →https://doi.org/10.1007/978-3-642-36279-8_1openalex-snapshot

The Minimum Constraint Removal Problem with Three Robotics Applications

inferredcites →https://doi.org/10.1007/bf01530890openalex-snapshot

Motion planning in the presence of movable obstacles

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/cdc.2013.6760374openalex-snapshot

Incremental sampling-based algorithm for minimum-violation motion planning

inferredcites →https://doi.org/10.1109/ichr.2004.1442130openalex-snapshot

Navigation among movable obstacles: real-time reasoning in complex environments

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/isatp.1999.782972openalex-snapshot

Placing a robot manipulator amid obstacles for optimized execution

inferredcites →https://doi.org/10.1109/robot.2001.932865openalex-snapshot

Disconnection proofs for motion planning

inferredcites →https://doi.org/10.1109/sfcs.1979.10openalex-snapshot

Complexity of the mover's problem and generalizations

inferredcites →https://doi.org/10.1142/s0219843605000545openalex-snapshot

NAVIGATION AMONG MOVABLE OBSTACLES: REAL-TIME REASONING IN COMPLEX ENVIRONMENTS

inferredcites →https://doi.org/10.1145/73393.73422openalex-snapshot

Motion planning in the presence of movable obstacles

inferredcites →https://doi.org/10.1177/0278364913507795openalex-snapshot

The minimum constraint removal problem with three robotics applications

inferredcites →https://doi.org/10.15607/rss.2010.vi.034openalex-snapshot

Incremental Sampling-based Algorithms for Optimal Motion Planning

inferredcites →https://doi.org/10.15607/rss.2011.vii.009openalex-snapshot

A Framework for Push-Grasping in Clutter

inferredcites →https://doi.org/10.1609/icaps.v20i1.13421openalex-snapshot

Coming Up With Good Excuses: What to do When no Plan Can be Found

inferredcites →https://doi.org/10.7551/mitpress/9123.003.0038openalex-snapshot

Incremental Sampling-based Algorithms for Optimal 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-031-22216-0_11openalex-snapshot

Minimum Displacement Motion Planning for Movable Obstacles

inferred← citeshttps://doi.org/10.1007/978-3-031-44851-5_3openalex-snapshot

Revisiting the Minimum Constraint Removal Problem in Mobile Robotics

inferred← citeshttps://doi.org/10.1007/978-3-642-41610-1_176-1openalex-snapshot

Task and Motion Planning

inferred← citeshttps://doi.org/10.1007/978-4-431-55879-8_24openalex-snapshot

Decentralized Multi-agent Path Selection Using Minimal Information

inferred← citeshttps://doi.org/10.1007/s10514-023-10148-yopenalex-snapshot

Multi-robot geometric task-and-motion planning for collaborative manipulation tasks

inferred← citeshttps://doi.org/10.1007/s12065-019-00331-5openalex-snapshot

A polynomial time algorithm for big data in a special case of minimum constraint removal problem

inferred← citeshttps://doi.org/10.1016/j.asoc.2016.02.047openalex-snapshot

Solving minimum constraint removal (MCR) problem using a social-force-model-based ant colony algorithm

inferred← citeshttps://doi.org/10.1016/j.robot.2025.105251openalex-snapshot

Locally optimal solutions to constraint displacement problems via path-obstacle overlaps

inferred← citeshttps://doi.org/10.1016/j.sysconle.2021.104895openalex-snapshot

Extent-compatible control barrier functions

inferred← citeshttps://doi.org/10.1109/case49997.2022.9926661openalex-snapshot

A MIP-Based Approach for Multi-Robot Geometric Task-and-Motion Planning

inferred← citeshttps://doi.org/10.1109/humanoids.2014.7041499openalex-snapshot

Rearranging similar objects with a manipulator using pebble graphs

inferred← citeshttps://doi.org/10.1109/icra.2016.7487581openalex-snapshot

Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner

inferred← citeshttps://doi.org/10.1109/icra48891.2023.10161372openalex-snapshot

Computational Tradeoff in Minimum Obstacle Displacement Planning for Robot Navigation

inferred← citeshttps://doi.org/10.1109/irc.2018.00021openalex-snapshot

Multi-robot Scheduling and Path-Planning for Non-overlapping Operator Attention

inferred← citeshttps://doi.org/10.1109/iros40897.2019.8967548openalex-snapshot

Object Rearrangement with Nested Nonprehensile Manipulation Actions

inferred← citeshttps://doi.org/10.1109/iros45743.2020.9340922openalex-snapshot

Safe and Effective Picking Paths in Clutter given Discrete Distributions of Object Poses

inferred← citeshttps://doi.org/10.1109/iros51168.2021.9635906openalex-snapshot

Automata-based Optimal Planning with Relaxed Specifications

inferred← citeshttps://doi.org/10.1109/ojcsys.2023.3316090openalex-snapshot

Constrained Environment Optimization for Prioritized Multi-Agent Navigation

inferred← citeshttps://doi.org/10.1109/tro.2022.3191596openalex-snapshot

Sampling-Based Planning for Retrieving Near-Cylindrical Objects in Cluttered Scenes Using Hierarchical Graphs

inferred← citeshttps://doi.org/10.1109/tro.2025.3588449openalex-snapshot

Co-Optimizing Reconfigurable Environments and Policies for Decentralized Multiagent Navigation

inferred← citeshttps://doi.org/10.1109/urai.2018.8442210openalex-snapshot

Automated task planning using object arrangement optimization

inferred← citeshttps://doi.org/10.1142/s1793830922500550openalex-snapshot

Minimum constraint removal problem for line segments is NP-hard

inferred← citeshttps://doi.org/10.15607/rss.2015.xi.045openalex-snapshot

Dealing with Difficult Instances of Object Rearrangement

inferred← citeshttps://doi.org/10.15607/rss.2016.xii.002openalex-snapshot

Incremental Task and Motion Planning: A Constraint-Based Approach

inferred← citeshttps://doi.org/10.15607/rss.2017.xiii.051openalex-snapshot

High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods

inferred← citeshttps://doi.org/10.1609/socs.v6i1.18380openalex-snapshot

Computational Tradeoffs of Search Methods for Minimum Constraint Removal Paths

inferred← citeshttps://doi.org/10.29007/6jsvopenalex-snapshot

What if the World Were Different? Gradient-Based Exploration for New Optimal Policies

inferred← citeshttps://doi.org/10.3390/app16062842openalex-snapshot

Energy-Efficient Motion Planning for Repetitive Industrial Tasks: An Adaptive Obstacle Modeling Approach

inferred← citeshttps://doi.org/10.3390/robotics10020057openalex-snapshot

Scheduling and Path-Planning for Operator Oversight of Multiple Robots

inferred← citeshttps://doi.org/10.48550/arxiv.1404.6573openalex-snapshot

Similar Part Rearrangement With Pebble Graphs

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.