Share Your Research, Maximize Your Social Impacts
Map Abstraction with Adjustable Time Bounds
Journal: Advances in Computer Science : an International Journal(ACSIJ) (Vol.3, No. 2)Publication Date: 2014-03-31
Authors : Sourodeep Bhattacharjee; Scott D. Goodwin;
Page : 37-42
Keywords : Pathfinding; path-planning; map abstraction; hierarchical;
Source : Download
Find it from : Google Scholar
Abstract
The paper presented here addresses the problem of path planning in real time strategy games. We have proposed a new algorithm titled Map Abstraction with Adjustable Time Bounds. This algorithm uses an abstract map containing non-uniformly sized triangular ...
Other Latest Articles
- Middle East User Navigation in Online Social Networks and Interactions in E-Commerce, an Analogy
- Designing An Efficient Target Tracking Protocol Based on a Clustering Algorithm and Recovery Mechanism in Wireless Sensor Networks (WSNs)
- Weighted Twin Support Vector Machine with Universum
- Analysis and Improvement of the Lightweight Mutual Authentication Protocol under EPC C-1 G-2 Standard
- Multi-Objective Genetic Algorithms for computing Fast Fourier Transform for evolving Smart Sensors devices using Field Programmable gate arrays
Last modified: 2014-04-05 20:56:46