Mobile Robots Path Planning With Heuristic Search
- Authors
-
-
Radu Robotin
Technical University of Cluj-Napoca, Department of Automation, Cluj-Napoca, Romania
-
Gheorghe Lazea
Technical University of Cluj-Napoca, Department of Automation, Cluj-Napoca, Romania
-
Petru Dobra
Technical University of Cluj-Napoca, Department of Automation, Cluj-Napoca, Romania
-
- Abstract
- Mobile robots often operate in domains that are incompletely known. This article adresses 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 discuss a series of tests performed with various implementations of graph search algorithms (A,D, focused D) as path planners for a mobile robot, focusing on the inherent strengths and pitfalls specific to each implementation.
- References
- Downloads
- Published
- 2010-12-21
- Issue
- Vol. 12 No. 4 (2010)
- Section
- Articles