L. Becchetti, V. Bonifaci, M. Dirnberger, A. Karrenbauer, K. Mehlhorn, G. Varma
{"title":"polycephalum可以计算最短路径","authors":"L. Becchetti, V. Bonifaci, M. Dirnberger, A. Karrenbauer, K. Mehlhorn, G. Varma","doi":"10.4108/EAI.3-12-2015.2262470","DOIUrl":null,"url":null,"abstract":"We demonstrate that a simple model of P. polycephalum can be used to compute shortest paths between two points in a graph. Reminiscent of how the real organism behaves in a maze when presented with two distinct food sources s and t, the algorithm gradually identifies the shortest s-t path by retreating from everywhere else in the graph.","PeriodicalId":415083,"journal":{"name":"International Conference on Bio-inspired Information and Communications Technologies","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"P. polycephalum Can Compute Shortest Paths\",\"authors\":\"L. Becchetti, V. Bonifaci, M. Dirnberger, A. Karrenbauer, K. Mehlhorn, G. Varma\",\"doi\":\"10.4108/EAI.3-12-2015.2262470\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We demonstrate that a simple model of P. polycephalum can be used to compute shortest paths between two points in a graph. Reminiscent of how the real organism behaves in a maze when presented with two distinct food sources s and t, the algorithm gradually identifies the shortest s-t path by retreating from everywhere else in the graph.\",\"PeriodicalId\":415083,\"journal\":{\"name\":\"International Conference on Bio-inspired Information and Communications Technologies\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Bio-inspired Information and Communications Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4108/EAI.3-12-2015.2262470\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Bio-inspired Information and Communications Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/EAI.3-12-2015.2262470","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We demonstrate that a simple model of P. polycephalum can be used to compute shortest paths between two points in a graph. Reminiscent of how the real organism behaves in a maze when presented with two distinct food sources s and t, the algorithm gradually identifies the shortest s-t path by retreating from everywhere else in the graph.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
