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

DOI10.1007/3-540-63307-3_73OpenAlexW1491456385MaRDI QIDQ5096951

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

path planningmobile robotunknown 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)

Related Items (3)

Online graph exploration: New results on old and new algorithms ⋮ Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics ⋮ Performance bounds for planning in unknown terrain

Cites Work

• Shortest paths without a map
• 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
• Navigating in Unfamiliar Geometric Terrain
• Dynamic path planning for a mobile automaton with limited information on the environment
• Unnamed Item
• Unnamed Item
• Unnamed Item

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