Dijkstra's algorithm in AGV

被引：0

作者：

Li, Duanling ^{[1
]}

Niu, Kun ^{[1
]}

机构：

[1] Beijing Univ Posts & Telecommun, Sch Automat, Beijing 100876, Peoples R China

来源：

PROCEEDINGS OF THE 2014 9TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA) | 2014年

关键词：

AGV; OpenCV; The optimal path planning; Polygon fitting; Dijkstra's algorithm;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The path planning is a very important part of AGV control. Firstly, The OpenCV is called to fitting the contour of obstacles with polygon and to optimize the result. Then a model of AGV work space is built by the method of network topology. So the problem of AGV path planning can be transformed into the problem of searching for the shortest path of the network topology. In the process of searching, Try and error method and Dijkstra's algorithm are respectively used to get the optimal or approximate optimal path, and finally gets a complete plan by comparing the result of two algorithms.

引用

页码：1867 / 1871

页数：5

共 50 条

[21] Recent Application of Dijkstra's Algorithm in the Process of Production Planning
Behun, Marcel
Knezo, Dusan
Cehlar, Michal
Knapcikova, Lucia
Behunova, Annamaria
APPLIED SCIENCES-BASEL, 2022, 12 (14):
[22] Determination of least polluted route using Dijkstra’s algorithm
B. Deep
International Journal of Environmental Science and Technology, 2023, 20 : 13289 - 13298
[23] Accelerating Dijkstra's Algorithm Using Multiresolution Priority Queues
Ros-Giralt, Jordi
Commike, Alan
Cullen, Peter
Lethin, Richard
2018 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC), 2018,
[24] The Improved Dijkstra's Shortest Path Algorithm and Its Application
Wang Shu-Xi
2012 INTERNATIONAL WORKSHOP ON INFORMATION AND ELECTRONICS ENGINEERING, 2012, 29 : 1186 - 1190
[25] Investigation into Applicability and Efficiency of SQLite for Implementation of Dijkstra's Algorithm
Yurchak, Iryna
Dudas, Volodymyr
2017 14TH INTERNATIONAL CONFERENCE: THE EXPERIENCE OF DESIGNING AND APPLICATION OF CAD SYSTEMS IN MICROELECTRONICS (CADSM), 2017, : 282 - 284
[26] Micro crack detection with Dijkstra’s shortest path algorithm
Christina Gunkel
Alexander Stepper
Arne C. Müller
Christine H. Müller
Machine Vision and Applications, 2012, 23 : 589 - 601
[27] A dynamic multi source Dijkstra's algorithm for vehicle routing
Eklund, PW
Kirkby, S
Pollitt, S
ANZIIS 96 - 1996 AUSTRALIAN NEW ZEALAND CONFERENCE ON INTELLIGENT INFORMATION SYSTEMS, PROCEEDINGS, 1996, : 329 - 333
[28] Project scheduling in AND-OR graphs: A generalization of Dijkstra's algorithm
Adelson-Velsky, GM
Levner, E
MATHEMATICS OF OPERATIONS RESEARCH, 2002, 27 (03) : 504 - 517
[29] Determination of least polluted route using Dijkstra's algorithm
Deep, B.
INTERNATIONAL JOURNAL OF ENVIRONMENTAL SCIENCE AND TECHNOLOGY, 2023, 20 (12) : 13289 - 13298
[30] 基于改进的Dijkstra算法AGV路径规划研究
施剑烽
杨勇生
科技视界, 2016, (20) : 111 - 112

← 1 2 3 4 5 →