Robot Path Planning Based On The Travelling Salesman Problem

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...

Full description

Bibliographic Details
Main Authors: G.Q. Wang, J. Wang, M. Li, H.J. Li, Y. Yuan
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
id doaj-3aef42ecd1c34598aff1811c97a6ee93
record_format Article
spelling doaj-3aef42ecd1c34598aff1811c97a6ee932021-02-20T21:01:45ZengAIDIC Servizi S.r.l.Chemical Engineering Transactions2283-92162015-12-014610.3303/CET1546052Robot Path Planning Based On The Travelling Salesman ProblemG.Q. WangJ. WangM. LiH.J. LiY. YuanAgainst 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 path problem, and add angle increasing function in the cost matrix to determine priorities. Finally the paper uses the discrete particle swarm algorithm to do the simulation, which achieves good experiment effect.https://www.cetjournal.it/index.php/cet/article/view/4221
collection DOAJ
language English
format Article
sources DOAJ
author G.Q. Wang
J. Wang
M. Li
H.J. Li
Y. Yuan
spellingShingle G.Q. Wang
J. Wang
M. Li
H.J. Li
Y. Yuan
Robot Path Planning Based On The Travelling Salesman Problem
Chemical Engineering Transactions
author_facet G.Q. Wang
J. Wang
M. Li
H.J. Li
Y. Yuan
author_sort G.Q. Wang
title Robot Path Planning Based On The Travelling Salesman Problem
title_short Robot Path Planning Based On The Travelling Salesman Problem
title_full Robot Path Planning Based On The Travelling Salesman Problem
title_fullStr Robot Path Planning Based On The Travelling Salesman Problem
title_full_unstemmed Robot Path Planning Based On The Travelling Salesman Problem
title_sort robot path planning based on the travelling salesman problem
publisher AIDIC Servizi S.r.l.
series Chemical Engineering Transactions
issn 2283-9216
publishDate 2015-12-01
description 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 path problem, and add angle increasing function in the cost matrix to determine priorities. Finally the paper uses the discrete particle swarm algorithm to do the simulation, which achieves good experiment effect.
url https://www.cetjournal.it/index.php/cet/article/view/4221
work_keys_str_mv AT gqwang robotpathplanningbasedonthetravellingsalesmanproblem
AT jwang robotpathplanningbasedonthetravellingsalesmanproblem
AT mli robotpathplanningbasedonthetravellingsalesmanproblem
AT hjli robotpathplanningbasedonthetravellingsalesmanproblem
AT yyuan robotpathplanningbasedonthetravellingsalesmanproblem
_version_ 1724259509796339712

Similar Items