Mobile robots navigation based on graph search techniques

Authors:
Radu Robotin;Petru Dobra;Gheorghe Lazea
Affiliations:
Department of Automation, Faculty of Automation and Computer Science, Technical University of Cluj-Napoca, Cluj-Napoca, Romania;Department of Automation, Faculty of Automation and Computer Science, Technical University of Cluj-Napoca, Cluj-Napoca, Romania;Department of Automation, Faculty of Automation and Computer Science, Technical University of Cluj-Napoca, Cluj-Napoca, Romania
Venue:
ECCE'10/ECCIE'10/ECME'10/ECC'10 Proceedings of the European conference of chemical engineering, and European conference of civil engineering, and European conference of mechanical engineering, and European conference on Control
Year:
2010

Citing 5
Cited 0

Planning as heuristic search

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
AI Techniques for Game Programming

AI Techniques for Game Programming
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Planning Algorithms

Planning Algorithms
Anytime heuristic search

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mobile robots often operate in domains that are incompletely known. This article addresses the goal-directed navigation problem in unknown terrain where a mobile robot has to move from its current configuration to given goal configuration. We will present tests performed with various implementations of graph search algorithms (A*, D*, focused D*) as path planners for a mobile robot, focusing on the inherent strong points and drawbacks of each implementation.