Optimized Graph Search Using MultiLevel Graph Clustering多层次图聚类优化图搜索.pptVIP

下载本文档

1
0
约2.81千字
约 8页
2017-03-08 发布于上海
举报
版权申诉

Optimized Graph Search Using MultiLevel Graph Clustering多层次图聚类优化图搜索.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Optimized Graph Search Using MultiLevel Graph Clustering多层次图聚类优化图搜索

Department of Information Technology Indian Institute of Information Technology and Management Gwalior ICIS ’09 – Nov 24-26, ‘09 Department of Information Technology Indian Institute of Information Technology and Management Gwalior ICIS ’09 – Nov 24-26, ‘09 Department of Information Technology Indian Institute of Information Technology and Management Gwalior Robotic Path Planning using Multi Neuron Heuristic Search Rahul Kala, Department of Information Technology Indian Institute of Information Technology and Management Gwalior http://students.iiitm.ac.in/~ipg_200545/ rahulkalaiiitm@yahoo.co.in, rkala@students.iiitm.ac.in Kala, Rahul, Shukla, Anupam Tiwari, Ritu (2009), Robotic Path Planning using Multi Neuron Heuristic Search, Proceedings of the ACM 2009 International Conference on Computer Sciences and Convergence Information Technology, ICCIT 2009, pp 1318-1323, Seoul, Korea The Problem Inputs Robotic Map Location of Obstacles Static and Dynamic Output Path P such that no collision occurs Constraints Time Constraints Dimensionality of Map Static and Dynamic Environment MNHS Algorithm In all we take α neurons. We have a list of heuristic costs each corresponding to node seen but waiting to be processed. We divide the cost range into α ranges equally among them. Each of these neurons is given a particular range. Each neuron selects the minimum most element of the cost range allotted to it and starts searching. At one step of each neuron processes its element by searching and expanding the element. This process is repeated. Path Planning with MNHS “I believe this is this way takes me shortest to the destination…. Lets give it a try” “But in the process I may get struck… Lets walk a few steps on bad paths as well” Add all possible moves in an open list. Make the a range of moves best to worst as per open list status Add all executed moves in the closed list Expansion of Nodes I (i-1,j+2) J (i+1,j+2) P (i-2,j+1) B (i-1,j+1) C (i,j+1) D (i+1,j+1) K (i