{"title":"一种高效的微鼠标中心优先路由定理算法","authors":"Yifeng Chen, Hengkai Zhao, W. Wan, Xiaoqing Yu","doi":"10.1109/ICALIP.2008.4590229","DOIUrl":null,"url":null,"abstract":"A high efficiency algorithm is developed for micro-mouse routing in maze. In the algorithm, a center-first-theorem is applied to find out several short roads in maze, then the shortest road can be find out among those roads by comparing with each other. Therefore, the algorithm is able to escape from the complex work of recording whole routing information of the maze. Methods to realizing coordinate recording, center-first routing and optimum path sorting are put forward. In practice, it is proved that this algorithm can reduces error execution and improves efficiency.","PeriodicalId":175885,"journal":{"name":"2008 International Conference on Audio, Language and Image Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A high efficiency Center-First-Routing-Theorem algorithm of micro-mouse\",\"authors\":\"Yifeng Chen, Hengkai Zhao, W. Wan, Xiaoqing Yu\",\"doi\":\"10.1109/ICALIP.2008.4590229\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A high efficiency algorithm is developed for micro-mouse routing in maze. In the algorithm, a center-first-theorem is applied to find out several short roads in maze, then the shortest road can be find out among those roads by comparing with each other. Therefore, the algorithm is able to escape from the complex work of recording whole routing information of the maze. Methods to realizing coordinate recording, center-first routing and optimum path sorting are put forward. In practice, it is proved that this algorithm can reduces error execution and improves efficiency.\",\"PeriodicalId\":175885,\"journal\":{\"name\":\"2008 International Conference on Audio, Language and Image Processing\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Audio, Language and Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICALIP.2008.4590229\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Audio, Language and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICALIP.2008.4590229","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A high efficiency Center-First-Routing-Theorem algorithm of micro-mouse
A high efficiency algorithm is developed for micro-mouse routing in maze. In the algorithm, a center-first-theorem is applied to find out several short roads in maze, then the shortest road can be find out among those roads by comparing with each other. Therefore, the algorithm is able to escape from the complex work of recording whole routing information of the maze. Methods to realizing coordinate recording, center-first routing and optimum path sorting are put forward. In practice, it is proved that this algorithm can reduces error execution and improves efficiency.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
