Reducing Multiple Object Motion Planning to Graph Searching
DOI10.1137/0215055zbMATH Open0596.05043OpenAlexW2006121663MaRDI QIDQ3728030FDOQ3728030
Authors: John Hopcroft, Gordon Wilfong 
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6455
Recommendations
- Multiple object semilinear motion planning
- Motion planning in Cartesian product graphs
- scientific article; zbMATH DE number 1684391
- Exploiting subgraph structure in multi-robot path planning
- Multitasking collision-free optimal motion planning algorithms in Euclidean spaces
- Feasibility of Motion Planning on Directed Graphs
- On reducing complexity in LTL-based motion planning
computational complexityalgorithmpolynomial spaceroboticsgraph searching problemmotion planning problem
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Cited In (22)
- Efficient coordinated motion.
- A survey of motion planning and related geometric algorithms
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Feasibility of motion planning on acyclic and strongly connected directed graphs
- Motion planning in Cartesian product graphs
- Multiple object semilinear motion planning
- Computing coordinated motion plans for robot swarms: the CG:SHOP challenge 2021
- Reconfiguring shortest paths in graphs
- Multi-robot motion planning of \(k\)-colored discs is PSPACE-hard
- Graphbots: mobility in discrete spaces
- A search algorithm for motion planning with six degrees of freedom
- Title not available (Why is that?)
- Motion planning among time dependent obstacles
- Randomized query processing in robot path planning
- Feasibility of Motion Planning on Directed Graphs
- On multiple moving objects
- The complexity of planar compliant motion planning under uncertainty
- Moving coins
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- On reachability in graphs with obstacles
- Use of mathematical morphology in real‐time path planning
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
This page was built for publication: Reducing Multiple Object Motion Planning to Graph Searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3728030)
