Feasibility of Motion Planning on Directed Graphs

From MaRDI portal

Revision as of 05:18, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3630228

Jump to:navigation, search

DOI10.1007/978-3-642-02017-9_45zbMath1241.68120OpenAlexW2113497096MaRDI QIDQ3630228

Stéphane Grumbach, Zhilin Wu

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

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

Related Items (2)

On Complete S-Reachable Graphs ⋮ On reachability in graphs with obstacles

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3630228&oldid=17070505"