Abstract
Getting lost in a huge shopping complex is one of the phenomenon that suffering the peoples. Most of the shopping complex now does not provide clear instructions. They just provide a plan for each level. A static two dimension plan can't give a clear instruction for each location in the shopping complex. The purpose of this project is to solve the problem by generating the shortest path to guide the customers to their destination. A-Star algorithm (A*) is implemented in this project to generate the shortest path with a given destination. A* is a searching algorithm which can find the shortest path with its functions. This application shows the path to the destination chosen by customer in a view of three dimensions. The shortest path is generated by A* algorithm. As a conclusion, this application give advantage to the user to find their path to a particular destination easily.
Website : http://ir.fsksm.utm.my/1109/
No comments:
Post a Comment