Research on Travel Path Planning Based on Group Related Mapping

Li Na Tan

doi:10.4028/www.scientific.net/AMM.644-650.5836

Paper Titles

Application of Electronic Simulation Technology in Electrical Engineering Practice Teaching
p.5821

Research on the Interest Rate Risk Management of Commercial Bank Based on F-W Duration Convexity Model
p.5825

Study on Modeling for Choice of the Best Tourism Based on Analytic Hierarchy Process
p.5828

Study on Modeling and Improving on the Production and Service Operations Management of Enterprise
p.5832

Research on Travel Path Planning Based on Group Related Mapping
p.5836

Personal Credit Evaluation System Based on Decision Tree
p.5840

Evaluation Criterion of Hybrid Assembly Production Sequencing Management
p.5844

Dynamic Mechanism of Effect Factors for Railway Passenger Volume
p.5848

The Application of Analytic Hierarchy Process in Delimiting Congestion Charging Area
p.5853

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 644-650Research on Travel Path Planning Based on Group...

Research on Travel Path Planning Based on Group Related Mapping

Abstract:

This paper analyzed travel path planning problem. Firstly, it reviewed some references about path planning method and found that those methods were not suit for travel path planning. Secondly, it proposed group related mapping method to solve travel path planning problem. This method had two steps, arranging trips when conflicts were overlooked and rearranging the trips when conflicts were eliminated. Thirdly, to explain the arrangement clearly, it took schedule of ten days travel along the Big Long River as an example. The result showed that the arrangement of all the accessible trips could be worked out during the whole rafting season.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 644-650)

Pages:

5836-5839

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.644-650.5836

Citation:

Cite this paper

Online since:

September 2014

Authors:

Li Na Tan*

Keywords:

Group Related Mapping, Search Algorithm, Travel Path Planning

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Chopra A. An Empirical approach to path planning in unstructured outdoor environments. Toronto, Ontario, Canada: York University, (2009).

Google Scholar

[2] Darrell W, Doug H, Adele H. A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover Lecture Notes in Computer Science, 2011, 6238: 566~575.

DOI: 10.1007/978-3-642-15844-5_57

Google Scholar

[3] Snyder L V, Daskin M S. A random-key genetic algorithm for the generalized traveling salesman problem. Operations Research, 2006, 173: 38~53.

DOI: 10.1016/j.ejor.2004.09.057

Google Scholar

[4] Yang J H, Shi X H, Maurizio M, Liang Y CH. An ant colony method for generalized TSP problem. Progress in Natural Science, 2008, 18: 1417~1422.

DOI: 10.1016/j.pnsc.2008.03.028

Google Scholar

[5] Dorigo M, Maniezzo V, Colorni A. Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 1996, 26(1): 29~41.

DOI: 10.1109/3477.484436

Google Scholar

[6] Dorigo M, Gambardella L M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1997, 1(1): 53~66.

DOI: 10.1109/4235.585892

Google Scholar

[7] Miao H, Tian Y C. Dynamic robot path planning using an enhanced simulated annealing approach. Applied Mathematics and Computation, 2013, 222: 420-437.

DOI: 10.1016/j.amc.2013.07.022

Google Scholar

[8] Karimi J, Pourtakdoust S H. Optimal maneuver-based motion planning over terrain and threats using a dynamic hybrid PSO algorithm[J]. Aerospace Science and Technology, 2013, 26(1): 60-71.

DOI: 10.1016/j.ast.2012.02.014

Google Scholar

[9] Masehian E, Sedighizadeh D. Multi-objective PSO-and NPSO-based algorithms for robot path planning. Advances in electrical and computer engineering, 2010, 10(4): 69-76.

DOI: 10.4316/aece.2010.04011

Google Scholar