Graphbots: mobility in discrete spaces

DOI10.1007/3-540-60084-1_108MaRDI QIDQ4645214zbMATH OpenOpenAlexFDO

Authors Samir Khuller, Ehud Rivlin, Azriel Rosenfeld

Publication date 10 January 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60084-1_108

zbMATH Keywords

chordal graphlocal displacementshortest pathtarget location

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Recommendations

• Reducing Multiple Object Motion Planning to Graph Searching
• scientific article; zbMATH DE number 4108220
• A new approach to optimal planning of robot motion on a tree with obstacles
• Feasibility of motion planning on acyclic and strongly connected directed graphs
• On the Piano Movers' problem: IV. Various decomposable two-dimensional motion-planning problems

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Incidence matrices and interval graphs

Cited in

(12)

• Polygon-constrained motion planning problems
• Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments
• A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles
• Motion planning in Cartesian product graphs
• Mobile robots navigation based on graph search techniques
• Exploiting subgraph structure in multi-robot path planning
• Feasibility of Motion Planning on Directed Graphs
• scientific article; zbMATH DE number 177464 (Why is no real title available?)
• Social network coordination and graph routing
• A disjunctive programming approach for motion planning of mobile router networks
• Motions of a connected subgraph representing a swarm of robots inside a graph of work stations
• Feasibility of motion planning on acyclic and strongly connected directed graphs

This page was built for publication: Graphbots: mobility in discrete spaces

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