The M2M pathfinding algorithm based on the idea of granular computing
文献类型：会议论文
| 作者 | Haifeng Wan; Yingpeng Zhang; Shengzhou Luo; Ruijie Liu; Wensheng Ye |
| 出版日期 | 2009 |
| 会议名称 | 2009 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT 2009 |
| 英文摘要 | Macro-to-micro (M2M) model is an implementation model that inherits the GrC idea and extends it to some additional highly desirable characteristics. In this paper we introduce an effective pathfinding algorithm based on the M2M model. This algorithm takes O(n) time to preprocess, constructingthe M2M data structure. Such hierarchical structure occupies O(n) bit memory space and can be updated in O(1) expected time to handle changes. Although the resulting path is not always the shortest one, it can make a trade-off between accuracy and time cost by adjusting a parameter - range value to satisfy various applications. At last, we will discuss the advantages of the M2M pathfinding algorithm (M2M-PF) and demonstrate theacademic and applied prospect of M2M model. |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/2439]  |
| 专题 | 深圳先进技术研究院_集成所 |
| 作者单位 | 2009 |
| 推荐引用方式 GB/T 7714 | Haifeng Wan,Yingpeng Zhang,Shengzhou Luo,et al. The M2M pathfinding algorithm based on the idea of granular computing[C]. 见:2009 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT 2009. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。