Efficient strategies for robot navigation in unknown environment

DOI10.1007/3-540-58201-0_104zbMath1422.68223OpenAlexW1862997116MaRDI QIDQ4632462

Aohan Mei, Yoshihide Igarashi

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_104

zbMATH Keywords

robot navigationgreedy heuristiccompetitive strategyside lengthshort path length

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Related Items (3)

On-line parallel heuristics, processor scheduling and robot searching under the competitive framework ⋮ Walking streets faster ⋮ Going home through an unknown street

Cites Work

• Shortest paths without a map
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
• Algorithmic and complexity issues of robot motion in an uncertain environment
• Navigating in Unfamiliar Geometric Terrain

This page was built for publication: Efficient strategies for robot navigation in unknown environment