Cooperative exploration and protection of a workspace assisted by information networks
From MaRDI portal
Publication:2248545
DOI10.1007/s10472-013-9383-5zbMath1291.93210MaRDI QIDQ2248545
Publication date: 26 June 2014
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-013-9383-5
90B18: Communication networks in operations research
93C85: Automated systems (robots, etc.) in control theory
68T40: Artificial intelligence for robotics
Cites Work
- Unnamed Item
- On minimizing width in linear layouts
- An annotated bibliography on guaranteed graph searching
- Nondeterministic graph searching: from pathwidth to treewidth
- Graph searching and a min-max theorem for tree-width
- The complexity of searching a graph
- Graph Searching in a Crime Wave
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Recontamination does not help to search a graph
- Planning Algorithms