Feasibility of Motion Planning on Directed Graphs

DOI10.1007/978-3-642-02017-9_45MaRDI QIDQ3630228zbMATH OpenOpenAlexFDO

Authors Zhilin Wu, Stéphane Grumbach

Publication date 3 June 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02017-9_45

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Recommendations

• Feasibility of motion planning on acyclic and strongly connected directed graphs
• Graphbots: mobility in discrete spaces
• Motion planning among time dependent obstacles
• Reducing Multiple Object Motion Planning to Graph Searching
• On the Piano Movers' problem: IV. Various decomposable two-dimensional motion-planning problems

Cited in

(9)

• Backtracking problem in the traversal of an unknown directed graph by a finite robot
• Graph planning with expected finite horizon
• On reachability in graphs with obstacles
• Reducing Multiple Object Motion Planning to Graph Searching
• On Complete S-Reachable Graphs
• The computational complexity of multi-agent pathfinding on directed graphs
• Constrained motion planning and multi-agent path finding on directed graphs
• Multi-agent pathfinding on strongly connected digraphs: feasibility and solution algorithms
• Feasibility of motion planning on acyclic and strongly connected directed graphs

This page was built for publication: Feasibility of Motion Planning on Directed Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630228)