The M2M Pathfinding Algorithm Based on the Idea of Granular Computing

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, constructing the M2...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 Vol. 2; pp. 533 - 540
Main Authors:	Wan, Haifeng, Zhang, Yingpeng, Luo, Shengzhou, Liu, Ruijie, Ye, Wensheng
Format:	Conference Proceeding
Language:	English
Published:	Washington, DC, USA IEEE Computer Society 15.09.2009 IEEE
Series:	ACM Conferences
Subjects:	Computing methodologies > Artificial intelligence > Search methodologies Computing methodologies > Artificial intelligence > Search methodologies > Discrete space search Computing methodologies > Artificial intelligence > Search methodologies > Game tree search Conferences Costs Data structures Heuristic algorithms Intelligent agent Iterative algorithms Mathematics of computing > Discrete mathematics > Graph theory > Paths and connectivity problems Multiagent systems Navigation Power system modeling Real time systems Theory of computation > Design and analysis of algorithms > Approximation algorithms analysis > Routing and network design problems
ISBN:	0769538010, 9780769538013
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!