Computer Science – Artificial Intelligence
Scientific paper
2011-03-17
World of Computer Science and Information Technology Journal (WCSIT), ISSN: 2221-0741, Vol. 1, No. 2, 17-25, 2011
Computer Science
Artificial Intelligence
9 pages
Scientific paper
this paper presents an enhancement of the medial axis algorithm to be used for finding the optimal shortest path for developed cognitive map. The cognitive map has been developed, based on the architectural blueprint maps. The idea for using the medial-axis is to find main path central pixels; each center pixel represents the center distance between two side boarder pixels. The need for these pixels in the algorithm comes from the need of building a network of nodes for the path, where each node represents a turning in the real world (left, right, critical left, critical right...). The algorithm also ignores from finding the center pixels paths that are too small for intelligent robot navigation. The Idea of this algorithm is to find the possible shortest path between start and end points. The goal of this research is to extract a simple, robust representation of the shape of the cognitive map together with the optimal shortest path between start and end points. The intelligent robot will use this algorithm in order to decrease the time that is needed for sweeping the targeted building.
Al-Ghazi Suhaib I.
Farhan Hazim A.
Owaied Hussein H.
No associations
LandOfFree
Finding Shortest Path for Developed Cognitive Map Using Medial Axis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Finding Shortest Path for Developed Cognitive Map Using Medial Axis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding Shortest Path for Developed Cognitive Map Using Medial Axis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-248265