On a simple depth-first search strategy for exploring unknown graphs

DOI10.1007/3-540-63307-3_73MaRDI QIDQ5096951zbMATH OpenOpenAlexFDO

Authors Stephen S. Kwek

Publication date 19 August 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63307-3_73

zbMATH Keywords

mobile robotpath planningunknown environment

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Recommendations

• Exploring an unknown graph
• Algorithms – ESA 2005
• scientific article; zbMATH DE number 1303571
• Online graph exploration: New results on old and new algorithms
• Exploring Unknown Environments

Cites work

• Dynamic path planning for a mobile automaton with limited information on the environment
• scientific article; zbMATH DE number 1256766 (Why is no real title available?)
• scientific article; zbMATH DE number 1559557 (Why is no real title available?)
• scientific article; zbMATH DE number 871902 (Why is no real title available?)
• Navigating in Unfamiliar Geometric Terrain
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
• Piecemeal graph exploration by a mobile robot.
• Real-time heuristic search
• Shortest paths without a map

Cited in

(9)

• Online graph exploration: New results on old and new algorithms
• Chaotic traversal (CHAT): very large graphs traversal using chaotic dynamics
• Undirected Graph Exploration with ⊝(log log n) Pebbles
• Exploring Unknown Undirected Graphs
• Brief announcement: Energy constrained depth first search
• scientific article; zbMATH DE number 5263405 (Why is no real title available?)
• Algorithms – ESA 2005
• Depth-First Search in Directed Planar Graphs, Revisited
• Performance bounds for planning in unknown terrain

This page was built for publication: On a simple depth-first search strategy for exploring unknown graphs

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