By Topic

Automated guided vehicle path planning without obstacles expansion

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

5 Author(s)
Louchene, A. ; Inst. d''Electron., Batna Univ., Algeria ; Bouguechal, N.E. ; Dahmani, A. ; Yahiaoui, S.
more authors

In this paper a new method of global path planning for an autonomous automated guided vehicle is presented. The strategy of the developed method is based on two parts: partition of free working space according to obstacles models, and calculation of a set of points within the free working space according to the dimensions of the mobile robot. This set of points constitutes the eventual passage points for the AGV during its navigation between starting and goal points. Once starting and goal points are given, a visibility graph is constructed and an optimal path is searched. The new approach in this method is that the mobile robot is not punctual and the obstacles are not expanded. The validity and the efficiency of the developed algorithm are confirmed by the results obtained by simulation

Published in:

Control Applications, 1998. Proceedings of the 1998 IEEE International Conference on  (Volume:2 )

Date of Conference:

1-4 Sep 1998