Feasibility of motion planning on acyclic and strongly connected directed graphs
From MaRDI portal
Publication:708329
DOI10.1016/J.DAM.2010.02.001zbMATH Open1230.05192OpenAlexW2100548703MaRDI QIDQ708329FDOQ708329
Authors: Zhilin Wu, Stéphane Grumbach 
Publication date: 11 October 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.02.001
Recommendations
Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Artificial intelligence for robotics (68T40)
Cites Work
- Introduction to algorithms
- Graph puzzles, homotopy, and the alternating group
- Planning Algorithms
- Title not available (Why is that?)
- Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard
- Optimal pebble motion on a tree
- Title not available (Why is that?)
- A linear time algorithm for the feasibility of pebble motion on trees
Cited In (11)
- Constrained motion planning and multi-agent path finding on directed graphs
- Minimum 2-vertex strongly biconnected spanning directed subgraph problem
- On Complete S-Reachable Graphs
- Introduction to reconfiguration
- Backtracking problem in the traversal of an unknown directed graph by a finite robot
- On \(m\)RJ reachability in trees
- Graphbots: mobility in discrete spaces
- The computational complexity of multi-agent pathfinding on directed graphs
- Feasibility of Motion Planning on Directed Graphs
- A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles
- On reachability in graphs with obstacles
This page was built for publication: Feasibility of motion planning on acyclic and strongly connected directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708329)
