Reducing Multiple Object Motion Planning to Graph Searching
From MaRDI portal
Publication:3728030
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
Cited in
(22)- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Efficient coordinated motion.
- A survey of motion planning and related geometric algorithms
- Feasibility of motion planning on acyclic and strongly connected directed graphs
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- 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
- A search algorithm for motion planning with six degrees of freedom
- Graphbots: mobility in discrete spaces
- scientific article; zbMATH DE number 177464 (Why is no real title available?)
- 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
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)
