By Topic

Autonomous mobile robot global motion planning and geometric beacon collection using traversability vectors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Janet, J.A. ; Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA ; Luo, R.C. ; Kay, M.G.

Approaches in global motion planning (GMP) and geometric beacon collection (for self-localization) using traversability vectors have been developed and implemented in both computer simulation and actual experiments on mobile robots. Both approaches are based on the same simple, modular, and multifunctional traversability vector (t-vector). Through implementation it has been found that t-vectors reduce the computational requirements to detect path obstructions, Euclidean optimal via-points, and geometric beacons, as well as to identify which features are visible to sensors. Environments can be static or dynamic and polygons are permitted to overlap (i.e., intersect or be nested). While the t-vector model does require that polygons be convex, it is a much simpler matter to decompose concave polygons into convex polygon sets than it is to require that polygons not overlap, which is required for many other GMP models. T-vectors also reduce the data size and complexity of standard V-graphs and variations thereof. This paper presents the t-vector model so that the reader can apply it to mobile robot GMP and self-localization

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:13 ,  Issue: 1 )