Some Heuristics for the Navigation of a Robot

1 March 1985

journal article
research article
Published by SAGE Publications in The International Journal of Robotics Research

Vol. 4 (1) , 59-66
https://doi.org/10.1177/027836498500400105

Abstract

A mobile robot is required to navigate around barriers in an unexplored environment. Some heuristic strategies to aid such navigation are discussed here. Being heuristic, these methods can be neither exhaustively tested nor proved effec tive in all cases. However, examples are given to demonstrate their usefulness in obstacle avoidance. In a simple case of sufficient generality, the heuristics are shown to be effective.

Keywords

This publication has 5 references indexed in Scilit:

Solving the find-path problem by good representation of free space
IEEE Transactions on Systems, Man, and Cybernetics, 1983
Spatial Planning: A Configuration Space Approach
IEEE Transactions on Computers, 1983
Turtle Geometry
Published by MIT Press ,1981
An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM, 1979
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
IEEE Transactions on Systems Science and Cybernetics, 1968