Reducing Multiple Object Motion Planning to Graph Searching

DOI10.1137/0215055zbMath0596.05043OpenAlexW2006121663MaRDI QIDQ3728030

Gordon Wilfong, John E. Hopcrofts

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

zbMATH Keywords

algorithmcomputational complexityroboticspolynomial spacegraph searching problemmotion planning problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Related Items (13)

Use of mathematical morphology in real‐time path planning ⋮ A search algorithm for motion planning with six degrees of freedom ⋮ On multiple moving objects ⋮ Constructing roadmaps of semi-algebraic sets. I: Completeness ⋮ A survey of motion planning and related geometric algorithms ⋮ Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021 ⋮ The complexity of planar compliant motion planning under uncertainty ⋮ Moving coins ⋮ On reachability in graphs with obstacles ⋮ Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch ⋮ Unnamed Item ⋮ Randomized query processing in robot path planning ⋮ Efficient coordinated motion.

This page was built for publication: Reducing Multiple Object Motion Planning to Graph Searching