Robot Path Planning Based On The Travelling Salesman Problem
Against the background of "Robot Travelling China" competition, this paper introduces the idea of TSP to seek optimal motion path. Applying the knowledge of graph theory to analyze and transform the map of competition. In the paper, we introduce the Dijkstra algorithm to solve the shortest...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIDIC Servizi S.r.l.
2015-12-01
|
| Series: | Chemical Engineering Transactions |
| Online Access: | https://www.cetjournal.it/index.php/cet/article/view/4221 |