Dynamic graph-based search in unknown environments

DOI10.1016/j.jda.2011.06.004zbMath1238.68108OpenAlexW2038591545MaRDI QIDQ414464

Jacques Penders, Paul S. Haynes, Lyuba Alboul

Publication date: 11 May 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.06.004

zbMATH Keywords

graph theorydynamic searchmulti-robot localisationteam robotics

Mathematics Subject Classification ID

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

Cites Work

• Bridges and Hamiltonian circuits in planar graphs
• A Theorem on Planar Graphs
• An algorithm for finding a short closed spanning walk in a graph
• Approximation algorithms for NP-complete problems on planar graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Dynamic graph-based search in unknown environments