On the public citation graph
Motion planning in the presence of movable obstacles
0 signed · 116 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.1007/bf01840370openalex-snapshot
Motion planning with inertial constraints
inferredcites →https://doi.org/10.1007/bf02187683openalex-snapshot
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
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.1109/sfcs.1985.36openalex-snapshot
Motion planning in the presence of moving obstacles
inferredcites →https://doi.org/10.1109/sfcs.1987.1openalex-snapshot
A new algebraic method for robot motion planning and real geometry
inferredcites →https://doi.org/10.1109/sfcs.1987.42openalex-snapshot
New lower bound techniques for robot motion planning problems
inferredcites →https://doi.org/10.1109/sfcs.1988.21947openalex-snapshot
On the complexity of kinodynamic planning
inferredcites →https://doi.org/10.1137/0217010openalex-snapshot
An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
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/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/73393.73426openalex-snapshot
Coordinated motion planning for two independent robots
inferredcites →https://doi.org/10.1177/027836498300200204openalex-snapshot
A Torque-Sensitive Tactile Array for Robotics
inferredcites →https://doi.org/10.1177/027836498300200304openalex-snapshot
On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers
inferredcites →https://doi.org/10.1177/027836498400300304openalex-snapshot
Decoupling of a Two-Axis Robotic Manipulator Using Nonlinear State Feedback: A Case Study
inferredcites →https://doi.org/10.1177/027836498400300405openalex-snapshot
On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem"
inferredcites →https://doi.org/10.1177/027836498600500304openalex-snapshot
Toward Efficient Trajectory Planning: The Path-Velocity Decomposition
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/eng2.12321openalex-snapshot
Autonomous dishwasher loading from cluttered trays using pre‐trained deep neural networks
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_3openalex-snapshot
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
inferred← citeshttps://doi.org/10.1007/3-540-45422-5_17openalex-snapshot
Finding Optimal Solutions to Atomix
inferred← citeshttps://doi.org/10.1007/978-3-030-35699-6_19openalex-snapshot
Towards S-NAMO: Socially-Aware Navigation Among Movable Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-030-44051-0_45openalex-snapshot
Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups
inferred← citeshttps://doi.org/10.1007/978-3-030-66723-8_31openalex-snapshot
On Rearrangement of Items Stored in Stacks
inferred← citeshttps://doi.org/10.1007/978-3-030-95459-8_18openalex-snapshot
Taming Combinatorial Challenges in Clutter Removal
inferred← citeshttps://doi.org/10.1007/978-3-319-16595-0_37openalex-snapshot
Decidability of Robot Manipulation Planning: Three Disks in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-319-25524-8_14openalex-snapshot
Multi-agent Path Planning in Known Dynamic Environments
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_16openalex-snapshot
Push-Pull Block Puzzles are Hard
inferred← citeshttps://doi.org/10.1007/978-3-540-77457-0_3openalex-snapshot
Motion Planning for Robotic Manipulation of Deformable Linear Objects
inferred← citeshttps://doi.org/10.1007/978-3-642-00312-7_37openalex-snapshot
Path Planning among Movable Obstacles: A Probabilistically Complete Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-45346-5_5openalex-snapshot
Reconfiguring Massive Particle Swarms with Limited, Global Control
inferred← citeshttps://doi.org/10.1007/s003710050184openalex-snapshot
Non-linear dynamical system approach to behavior modeling
inferred← citeshttps://doi.org/10.1007/s00453-003-1079-5openalex-snapshot
Movement Planning in the Presence of Flows
inferred← citeshttps://doi.org/10.1007/s10514-013-9372-xopenalex-snapshot
Object search by manipulation
inferred← citeshttps://doi.org/10.1007/s10514-020-09957-2openalex-snapshot
Decidability in robot manipulation planning
inferred← citeshttps://doi.org/10.1007/s10846-016-0344-1openalex-snapshot
Planning Robot Navigation among Movable Obstacles (NAMO) through a Recursive Approach
inferred← citeshttps://doi.org/10.1007/s10846-021-01458-3openalex-snapshot
The State of Lifelong Learning in Service Robots:
inferred← citeshttps://doi.org/10.1007/s11047-017-9666-6openalex-snapshot
Particle computation: complexity, algorithms, and logic
inferred← citeshttps://doi.org/10.1007/s11370-022-00444-4openalex-snapshot
High dimensional object rearrangement for a robot manipulation in highly dense configurations
inferred← citeshttps://doi.org/10.1007/s12369-019-00574-3openalex-snapshot
A Preliminary Study of Interactive Navigation Framework with Situation-Adaptive Multimodal Inducement: Pass-By Scenario
inferred← citeshttps://doi.org/10.1016/j.jterra.2024.101034openalex-snapshot
Interaction-aware control for robotic vegetation override in off-road environments
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00080-3openalex-snapshot
Sokoban: improving the search with relevance cuts
inferred← citeshttps://doi.org/10.1017/9781316135167.033openalex-snapshot
Combinatorial Games: Selected Bibliography With A Succinct Gourmet Introduction
inferred← citeshttps://doi.org/10.1109/34.295902openalex-snapshot
Collision detection of a moving polygon in the presence of polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1109/70.611297openalex-snapshot
A method of progressive constraints for manipulation planning
inferred← citeshttps://doi.org/10.1109/access.2022.3233765openalex-snapshot
Navigation Among Movable Obstacles via Multi-Object Pushing Into Storage Zones
inferred← citeshttps://doi.org/10.1109/etfa.1992.683311openalex-snapshot
Linear-Time Motion Planning for Two Square, Movable Obstacles in a Grid Environment
inferred← citeshttps://doi.org/10.1109/icra.2013.6631116openalex-snapshot
Planning with movable obstacles in continuous environments with uncertain dynamics
inferred← citeshttps://doi.org/10.1109/icra.2014.6907856openalex-snapshot
Particle computation: Designing worlds to control robot swarms with only global signals
inferred← citeshttps://doi.org/10.1109/icra.2015.7139621openalex-snapshot
Kinodynamic randomized rearrangement planning via dynamic transitions between statically stable states
inferred← citeshttps://doi.org/10.1109/icra.2018.8462863openalex-snapshot
Rearrangement with Nonprehensile Manipulation Using Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/icra.2019.8793616openalex-snapshot
Efficient Obstacle Rearrangement for Object Manipulation Tasks in Cluttered Environments
inferred← citeshttps://doi.org/10.1109/icra.2019.8793946openalex-snapshot
Large-Scale Multi-Object Rearrangement
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9196652openalex-snapshot
Fast and resilient manipulation planning for target retrieval in clutter
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9196689openalex-snapshot
Non-Prehensile Manipulation in Clutter with Human-In-The-Loop
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9197451openalex-snapshot
Planning with Selective Physics-based Simulation for Manipulation Among Movable Objects
inferred← citeshttps://doi.org/10.1109/icra46639.2022.9811642openalex-snapshot
Reactive Informative Planning for Mobile Manipulation Tasks under Sensing and Environmental Uncertainty
inferred← citeshttps://doi.org/10.1109/icra46639.2022.9811934openalex-snapshot
Efficient and High-quality Prehensile Rearrangement in Cluttered and Confined Spaces
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9560799openalex-snapshot
Environment Reconfiguration Planning for Autonomous Robotic Manipulation to overcome Mobility Constraints
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561221openalex-snapshot
Manipulation Planning Among Movable Obstacles Using Physics-Based Adaptive Motion Primitives
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561282openalex-snapshot
An integrated approach for determining objects to be relocated and their goal positions inside clutter for object retrieval
inferred← citeshttps://doi.org/10.1109/icra48891.2023.10161006openalex-snapshot
Planning for Complex Non-prehensile Manipulation Among Movable Objects by Interleaving Multi-Agent Pathfinding and Physics-Based Simulation
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/iros.2012.6386013openalex-snapshot
Multi-robot multi-object rearrangement in assignment space
inferred← citeshttps://doi.org/10.1109/iros.2014.6942917openalex-snapshot
CHARM: A platform for algorithmic robotics education & research
inferred← citeshttps://doi.org/10.1109/iros45743.2020.9341144openalex-snapshot
Computing High-Quality Clutter Removal Solutions for Multiple Robots
inferred← citeshttps://doi.org/10.1109/iros45743.2020.9341337openalex-snapshot
Affordance-Based Mobile Robot Navigation Among Movable Obstacles
inferred← citeshttps://doi.org/10.1109/iros45743.2020.9341532openalex-snapshot
Multi-Object Rearrangement with Monte Carlo Tree Search: A Case Study on Planar Nonprehensile Sorting
inferred← citeshttps://doi.org/10.1109/iros47612.2022.9981599openalex-snapshot
Rearrangement-Based Manipulation via Kinodynamic Planning and Dynamic Planning Horizons
inferred← citeshttps://doi.org/10.1109/iros47612.2022.9981679openalex-snapshot
To ask for help or not to ask: A predictive approach to human-in-the-loop motion planning for robot manipulation tasks
inferred← citeshttps://doi.org/10.1109/lra.2018.2800116openalex-snapshot
Efficient, High-Quality Stack Rearrangement
inferred← citeshttps://doi.org/10.1109/lra.2020.2980984openalex-snapshot
Monte-Carlo Tree Search for Efficient Visually Guided Rearrangement Planning
inferred← citeshttps://doi.org/10.1109/lra.2023.3327655openalex-snapshot
Scaling Infeasibility Proofs via Concurrent, Codimension-One, Locally-Updated Coxeter Triangulation
inferred← citeshttps://doi.org/10.1109/robot.1991.131618openalex-snapshot
Practical path planning among movable obstacles
inferred← citeshttps://doi.org/10.1109/robot.1994.351193openalex-snapshot
Path planning through variational dynamic programming
inferred← citeshttps://doi.org/10.1109/robot.2001.933237openalex-snapshot
Scalable dynamical systems for multi-agent steering and simulation
inferred← citeshttps://doi.org/10.1109/robot.2009.5152191openalex-snapshot
‘Teleportation’-Based Motion Planner for Design Error Analysis
inferred← citeshttps://doi.org/10.1109/tase.2021.3055144openalex-snapshot
Fast, High-Quality Two-Arm Rearrangement in Synchronous, Monotone Tabletop Setups
inferred← citeshttps://doi.org/10.1109/tro.2014.2337571openalex-snapshot
Coordinated Navigation of Multiple Independent Disk-Shaped Robots
inferred← citeshttps://doi.org/10.1109/tro.2020.3047472openalex-snapshot
Fast and Resilient Manipulation Planning for Object Retrieval in Cluttered and Confined Environments
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.1137/s0097539798346652openalex-snapshot
On Frictional Mechanical Systems and Their Computational Power
inferred← citeshttps://doi.org/10.1145/3632947openalex-snapshot
Haisor : Human-aware Indoor Scene Optimization via Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.1163/016918611x579420openalex-snapshot
Realization of a Multiple Object Rearrangement Task with Two Multi-Task Functional Robots
inferred← citeshttps://doi.org/10.1177/0278364904045471openalex-snapshot
Manipulation Planning with Probabilistic Roadmaps
inferred← citeshttps://doi.org/10.1177/0278364918780999openalex-snapshot
Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps
inferred← citeshttps://doi.org/10.1177/0278364918802962openalex-snapshot
Sampling-based methods for factored task and motion planning
inferred← citeshttps://doi.org/10.1177/02783649211059844openalex-snapshot
Rubik Tables and object rearrangement
inferred← citeshttps://doi.org/10.1177/02783649231153901openalex-snapshot
Rearrangement on lattices with pick-n-swaps: Optimality structures and efficient algorithms
inferred← citeshttps://doi.org/10.1177/02783649231154674openalex-snapshot
A sampling and learning framework to prove motion planning infeasibility
inferred← citeshttps://doi.org/10.1177/02783649231178565openalex-snapshot
Minimizing running buffers for tabletop object rearrangement: Complexity, fast algorithms, and applications
inferred← citeshttps://doi.org/10.15607/rss.2012.viii.008openalex-snapshot
Physics-Based Grasp Planning Through Clutter
inferred← citeshttps://doi.org/10.15607/rss.2013.ix.017openalex-snapshot
Minimum Constraint Displacement Motion Planning
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.2017.xiii.039openalex-snapshot
Sample-Based Methods for Factored Task and Motion Planning
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.15607/rss.2021.xvii.014openalex-snapshot
Rearrangement on Lattices with Swaps: Optimality Structures and Efficient Algorithms
inferred← citeshttps://doi.org/10.15607/rss.2021.xvii.033openalex-snapshot
On Minimizing the Number of Running Buffers for Tabletop Rearrangement
inferred← citeshttps://doi.org/10.17760/d20409212openalex-snapshot
Contact-based interactions between a robot and its environment
inferred← citeshttps://doi.org/10.17760/d20412868openalex-snapshot
Robotic pick-and-place of partially visible and novel objects
inferred← citeshttps://doi.org/10.2197/ipsjjip.28.929openalex-snapshot
PSPACE-completeness of Pulling Blocks to Reach a Goal
inferred← citeshttps://doi.org/10.26076/c3cd-0448openalex-snapshot
On the Complexity of Collecting Items With a Maximal Sliding Agent
inferred← citeshttps://doi.org/10.48550/arxiv.1901.03557openalex-snapshot
Learning Manipulation States and Actions for Efficient Non-prehensile Rearrangement Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1905.13530openalex-snapshot
Taming Combinatorial Challenges in Optimal Clutter Removal Tasks
inferred← citeshttps://doi.org/10.48550/arxiv.1906.08494openalex-snapshot
Object Placement on Cluttered Surfaces: A Nested Local Search Approach
inferred← citeshttps://doi.org/10.48550/arxiv.2003.08151openalex-snapshot
The State of Lifelong Learning in Service Robots: Current Bottlenecks in Object Perception and Manipulation
inferred← citeshttps://doi.org/10.48550/arxiv.2009.05524openalex-snapshot
Physically Embedded Planning Problems: New Challenges for Reinforcement Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2010.14733openalex-snapshot
Joint Path and Push Planning Among Movable Obstacles
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0007021openalex-snapshot
PushPush and Push-1 are NP-hard in 2D
inferred← citeshttps://doi.org/10.70675/2fb25917z088dz4401z8fa8z9672b7fba3bcopenalex-snapshot
Planning of visual servoing tasks for robotics
inferred← citeshttps://doi.org/10.70675/a43e642azfd4cz4155z99e9zacd0e4b6121bopenalex-snapshot
Architecture robotique pour la navigation parmi les obstacles amovibles pour un robot mobile
inferred← citeshttps://doi.org/10.70675/b0531016z752dz4f7azae2fzd3709ecfddd9openalex-snapshot
Planification de tâches de manipulation pour robots parallèles à câbles
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.