A Fast Algorithm on Minimum-Time Scheduling of an Autonomous Ground Vehicle Using a Traveling Salesman Framework

[1]  Yu Lin,et al.  Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing - tabu search algorithm to solve the symmetrical traveling salesman problem , 2016, Appl. Soft Comput..

[2]  Swaroop Darbha,et al.  Today's Traveling Salesman Problem , 2010, IEEE Robotics & Automation Magazine.

[3]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[4]  Daniel J. Rosenkrantz,et al.  An analysis of several heuristics for the traveling salesman problem , 2013, Fundamental Problems in Computing.

[5]  Yong Xia,et al.  Solving TSP by dismantling cross paths , 2014, 2014 International Conference on Orange Technologies.

[6]  M. Marchese,et al.  An ant colony optimization method for generalized TSP problem , 2008 .

[7]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[8]  Manish Kumar,et al.  A Market-based Solution to the Multiple Traveling Salesmen Problem , 2013, J. Intell. Robotic Syst..

[9]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[10]  Jorge J. Moré,et al.  The NEOS Server , 1998 .

[11]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[12]  Han Hoogeveen,et al.  Analysis of Christofides' heuristic: Some paths are more difficult than cycles , 1991, Oper. Res. Lett..

[13]  Yael Edan,et al.  Near-minimum-time task planning for fruit-picking robots , 1991, IEEE Trans. Robotics Autom..

[14]  M. M. Sysło,et al.  Computational experiments with some approximation algorithms for the travelling salesman problem , 1983 .

[15]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[16]  Okan K. Ersoy,et al.  Multi-offspring genetic algorithm and its application to the traveling salesman problem , 2016, Appl. Soft Comput..

[17]  Jukka Perttunen.  On the Significance of the Initial Solution in Travelling Salesman Heuristics , 1994 .

[18]  Jan Karel Lenstra,et al.  Some Simple Applications of the Travelling Salesman Problem , 1975 .

[19]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[20]  Elizabeth D. Dolan,et al.  NEOS Server 4.0 Administrative Guide , 2001, ArXiv.

[21]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[22]  Vadim Yatsenko.  Fast Exact Method for Solving the Travelling Salesman Problem , 2007, ArXiv.

[23]  Kaarthik Sundar,et al.  Algorithms for Routing an Unmanned Aerial Vehicle in the Presence of Refueling Depots , 2013, IEEE Transactions on Automation Science and Engineering.

[24]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[25]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[26]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[27]  David L. Applegate,et al.  The traveling salesman problem , 2006 .

[28]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[29]  Yifan Chen,et al.  Robot Path Planning for Dimensional Measurement in Automotive Manufacturing , 2005 .

[30]  Shigenobu Kobayashi,et al.  A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem , 2013, INFORMS J. Comput..