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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 Jg. 2; S. 533 - 540
Hauptverfasser:	Wan, Haifeng, Zhang, Yingpeng, Luo, Shengzhou, Liu, Ruijie, Ye, Wensheng
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Washington, DC, USA IEEE Computer Society 15.09.2009 IEEE
Schriftenreihe:	ACM Conferences
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!