A-B连接搜索问题的启发式修正区域填充算法

2017 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS) Pub Date : 2017-10-01 DOI:10.1109/TELSKS.2017.8246309

V. Vuckovic, Boban Arizanovic

{"title":"A-B连接搜索问题的启发式修正区域填充算法","authors":"V. Vuckovic, Boban Arizanovic","doi":"10.1109/TELSKS.2017.8246309","DOIUrl":null,"url":null,"abstract":"This paper presents optimized connection searching method based on region filling algorithms. The proposed method is optimized using the heuristic and is intended for maze-solving. In specific cases, the proposed algorithm performs better than variants which do not use heuristic and it depends on the maze structure and position of the starting and ending pixel.","PeriodicalId":206778,"journal":{"name":"2017 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Heuristic-modified region filling algorithms for A-B connection searching problem\",\"authors\":\"V. Vuckovic, Boban Arizanovic\",\"doi\":\"10.1109/TELSKS.2017.8246309\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents optimized connection searching method based on region filling algorithms. The proposed method is optimized using the heuristic and is intended for maze-solving. In specific cases, the proposed algorithm performs better than variants which do not use heuristic and it depends on the maze structure and position of the starting and ending pixel.\",\"PeriodicalId\":206778,\"journal\":{\"name\":\"2017 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TELSKS.2017.8246309\",\"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 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TELSKS.2017.8246309","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

提出了一种基于区域填充算法的优化连接搜索方法。该方法采用启发式算法进行优化，适用于迷宫求解。在特定情况下，该算法比不使用启发式算法的算法性能更好，它取决于迷宫结构和开始和结束像素的位置。

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

查看原文本刊更多论文

Heuristic-modified region filling algorithms for A-B connection searching problem

This paper presents optimized connection searching method based on region filling algorithms. The proposed method is optimized using the heuristic and is intended for maze-solving. In specific cases, the proposed algorithm performs better than variants which do not use heuristic and it depends on the maze structure and position of the starting and ending pixel.

求助全文

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

来源期刊

2017 13th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS)

自引率

0.00%

发文量