Please use this identifier to cite or link to this item:
http://dspace.dtu.ac.in:8080/jspui/handle/repository/16354
Title: | AN OPTIMIZED PATH PLANNING ALGORITHM BASED ON SOFT COMPUTING |
Authors: | MISHRA, SAURABH KUMAR |
Keywords: | ANT COLONY OPTIMIZATION PANORAMIC AREA STEEP PROBABILITY STEEP ANGLE STEEP ROAD |
Issue Date: | Jun-2018 |
Series/Report no.: | TD-4246; |
Abstract: | The existing guidance systems for panoramic areas facing various traversal problem during the path selection,whenever any path select by the Ant it is select only by seeing the lowest path cost. As we know very well that in particular panoramic spot,there are two type of roads, plane roads and other are steep roads,these steep roads some time are not suitable for children ortheageandalsoconsumehugeenergybytouristvehicle. Theexistingguidancesystemsfor panoramic areas facing various traversal problem during the path selection. Traditional path planning algorithm focus on shortest path but they did not focus on tourist demand,it means formermethodologybasedonbeststrategyinsteadofoptimal. Ourproposedmethodologyfor path selection of tourist vehicle based on two parameter: link steep probability which is based on steep angle and steep cost of link. If Ant want to go from node i to node j then first of all it will compare all value of steep probability and steep cost,the value which is very less as compare to other values then this min value link will be selected by ant and Pheromone rate on this link will be more as compare to others links. This modification in previous methodology will surely increase the performance of our algorithm ,hence this algorithm has given better optimal route for tourist with less time, cost and energy consumption as well as tourist requirements. |
URI: | http://dspace.dtu.ac.in:8080/jspui/handle/repository/16354 |
Appears in Collections: | M.E./M.Tech. Information Technology |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
saurabh mtech thesis.pdf | 2.03 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.