基于分割的网格图优化

2017 International Artificial Intelligence and Data Processing Symposium (IDAP) Pub Date : 2017-09-01 DOI:10.1109/IDAP.2017.8090173

Erhan Bülbül Ösym, Türkiye Ankara, Aydın Çetin

{"title":"基于分割的网格图优化","authors":"Erhan Bülbül Ösym, Türkiye Ankara, Aydın Çetin","doi":"10.1109/IDAP.2017.8090173","DOIUrl":null,"url":null,"abstract":"This work examines the effects of reducing the number of nodes and edges in a grid-graph, which consists of heterogeneous node blocks. An optimization method that reduces the count of nodes and edges is presented. Approaches that make traversing the graph easier by using this method are explained with examples. Efficiency of the method is observed using different pathfinding algorithms.","PeriodicalId":111721,"journal":{"name":"2017 International Artificial Intelligence and Data Processing Symposium (IDAP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimization of Grid-Graphs using Segmentation\",\"authors\":\"Erhan Bülbül Ösym, Türkiye Ankara, Aydın Çetin\",\"doi\":\"10.1109/IDAP.2017.8090173\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work examines the effects of reducing the number of nodes and edges in a grid-graph, which consists of heterogeneous node blocks. An optimization method that reduces the count of nodes and edges is presented. Approaches that make traversing the graph easier by using this method are explained with examples. Efficiency of the method is observed using different pathfinding algorithms.\",\"PeriodicalId\":111721,\"journal\":{\"name\":\"2017 International Artificial Intelligence and Data Processing Symposium (IDAP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Artificial Intelligence and Data Processing Symposium (IDAP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IDAP.2017.8090173\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Artificial Intelligence and Data Processing Symposium (IDAP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IDAP.2017.8090173","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

这项工作考察了减少网格图中节点和边的数量的影响，网格图由异构节点块组成。提出了一种减少节点数和边数的优化方法。通过实例说明了使用这种方法更容易遍历图的方法。通过不同的寻路算法，观察了该方法的效率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Optimization of Grid-Graphs using Segmentation

This work examines the effects of reducing the number of nodes and edges in a grid-graph, which consists of heterogeneous node blocks. An optimization method that reduces the count of nodes and edges is presented. Approaches that make traversing the graph easier by using this method are explained with examples. Efficiency of the method is observed using different pathfinding algorithms.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2017 International Artificial Intelligence and Data Processing Symposium (IDAP)

自引率

0.00%

发文量