On the Shortest and Conflict-Free Path Planning of Multi-AGV System Based on Dijkstra Algorithm and the Dynamic Time-Window Method

Tian Jian Chen; Yuan Sun; Wei Dai; Wen Tao; Shuai Liu

doi:10.4028/www.scientific.net/AMR.645.267

Paper Titles

The Shape of Fruit Recognition Using Matching Round
p.251

Research on Methods of Improving Platinum Resistance Sensor’s Temperature Measurement Precision
p.255

The Application of Alterable Parameter Genetic Algorithm and Neural Network in Artillery Locating Radar Detecting Small Signal
p.259

Harmonic Impact on the Energy Meter
p.263

On the Shortest and Conflict-Free Path Planning of Multi-AGV System Based on Dijkstra Algorithm and the Dynamic Time-Window Method
p.267

The Calibration & Monitor System of Battery Operation Parameters Simulation Generator Based on LabVIEW
p.272

Construction of the Mine Safety Knowledge Management Information Platform
p.276

Due-Date Assignment on a Single Machine Scheduling Problem with Nonlinear Deterioration Function
p.280

Study of Location Algorithm for Wireless Sensor Networks Based on Newton Iteration
p.285

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 645On the Shortest and Conflict-Free Path Planning of...

On the Shortest and Conflict-Free Path Planning of Multi-AGV System Based on Dijkstra Algorithm and the Dynamic Time-Window Method

Abstract:

This paper presents a dynamic routing method for shortest path planning and conflict prevention of AGV system, and then illustrates the principle and implementation of this method. It gives a way to schedule a shortest and conflict-free route by utilizing Dijkstra algorithm and the Dynamic Time-Window Method, and comes to the conclusion by experiments that the combination of these algorithms will solve the routing problem of small-sized multi-AGV system to a large extent.

You might also be interested in these eBooks

Intelligent System, Applied Materials and Control Technology

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 645)

Pages:

267-271

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.645.267

Citation:

Cite this paper

Online since:

January 2013

Authors:

Tian Jian Chen, Yuan Sun, Wei Dai, Wen Tao, Shuai Liu

Keywords:

AGV, Dijkstra Algorithm, Dynamic Time-Window Method, Path Planning

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Q. Sun: The Research on Path Planning of AGV System. (MS., Zhejiang University, China 2012).

Google Scholar

[2] S. Mazaand, and P. Castagna: Conflict-free AGV Routing in Bi-Directional Network. 8th IEEE Conference on Emerging Technologies and Factory Automation. Vol. 2 (2001), p.761.

DOI: 10.1109/etfa.2001.997777

Google Scholar

[3] W.M. Yan, W.M. Wu: Data Structure(in C). (Tsinghua University Press, China 1996).

Google Scholar

[4] Smolic-Rocak N., Bogdan, S., Kovacic Z., and Petrovic T.: Time Windows Based Dynamic Routing in Multi-AGV Systems. IEEE Transactions on Automation Science and Engineering. Vol. 7, No. 1 (2010), p.151.

DOI: 10.1109/tase.2009.2016350

Google Scholar

[5] Y. Wang: Technical Analysis of AGV System. China Science and Technology Information. No. 4 (2011).

Google Scholar