Graph-based planning using local information for unknown outdoor environments

Authors:
Jinhan Lee;Roozbeh Mottaghi;Charles Pippin;Tucker Balch
Affiliations:
Center for Robotics and Intelligence Machines, Georgia Institute of Technology, Atlanta, GA;Center for Robotics and Intelligence Machines, Georgia Institute of Technology, Atlanta, GA;Center for Robotics and Intelligence Machines, Georgia Institute of Technology, Atlanta, GA;Center for Robotics and Intelligence Machines, Georgia Institute of Technology, Atlanta, GA
Venue:
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Year:
2009

Citing 5
Cited 0

Robot Motion Planning

Robot Motion Planning
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Generalized Adaptive A*

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Graph decomposition for efficient multi-robot path planning

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Fast replanning for navigation in unknown terrain

IEEE Transactions on Robotics

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the common applications for outdoor robots is to follow a path in large scale unknown environments. This task is challenging due to the intensive memory requirements to represent the map, uncertainties in the location estimate of the robot and unknown terrain type and obstacles on the way to the goal. We develop a novel graph-based path planner that is based on only local perceptual information to plan a path in such environments. In order to extend the capabilities of the graph representation, we introduce Exploration Bias, which is a node attribute that can implicitly encode obstacle features at immediate surrounding of a node in the graph, the uncertainty of the planner about a node location and also the frequency of visiting a location. Through simulation experiments, we demonstrate that the resulting path cost and distance that the robot traverses to reach the goal location is not significantly different from those of the previous approaches.