Dynamic graph-based search in unknown environments

DOI10.1016/J.JDA.2011.06.004zbMATH Open1238.68108OpenAlexW2038591545MaRDI QIDQ414464FDOQ414464

Authors: Paul S. Haynes, Lyuba Alboul, Jacques Penders 

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

Recommendations

• Piecemeal graph exploration by a mobile robot.
• scientific article; zbMATH DE number 1303571
• Frontier-graph exploration for multi-robot systems in an unknown indoor environment
• scientific article; zbMATH DE number 1559557
• Mapping in unknown graph-like worlds

zbMATH Keywords

graph theorydynamic searchmulti-robot localisationteam robotics

Mathematics Subject Classification ID

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

Cites Work

• Graph theoretic methods in multiagent networks
• Approximation algorithms for NP-complete problems on planar graphs
• A Theorem on Planar Graphs
• Bridges and Hamiltonian circuits in planar graphs
• Robotic swarm dispersion using wireless intensity signals
• An algorithm for finding a short closed spanning walk in a graph

Cited In (4)

• A Multi-Stage Model of Searching for Two Mobile Objects on a Graph
• A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
• Frontier-graph exploration for multi-robot systems in an unknown indoor environment
• A frame architecture for a certain class of graph search problems

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

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