Feasibility of motion planning on acyclic and strongly connected directed graphs

DOI10.1016/j.dam.2010.02.001zbMath1230.05192OpenAlexW2100548703MaRDI QIDQ708329

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

zbMATH Keywords

motion planningfeasibilityacyclic directed graphsstrongly connected directed graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Artificial intelligence for robotics (68T40)

Related Items (5)

Minimum 2-vertex strongly biconnected spanning directed subgraph problem ⋮ On Complete S-Reachable Graphs ⋮ ON mRJ REACHABILITY IN TREES ⋮ On reachability in graphs with obstacles ⋮ Introduction to reconfiguration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph puzzles, homotopy, and the alternating group
• Optimal pebble motion on a tree
• Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard
• A linear time algorithm for the feasibility of pebble motion on trees
• Planning Algorithms

This page was built for publication: Feasibility of motion planning on acyclic and strongly connected directed graphs