{"title":"基于元胞自动机的无碰撞机器人路径规划","authors":"P. Tzionas, P. Tsalides, A. Thanailakis","doi":"10.1109/ASPDAC.1995.486409","DOIUrl":null,"url":null,"abstract":"This paper presents a new parallel algorithm for collision-free path planning of a diamond-shaped robot among arbitrarily-shaped obstacles and its implementation in VLSI. The proposed algorithm is based on the computational geometry concept known as the \"Voronoi diagram\", which is constructed through the time evolution of Cellular Automata, after an initial phase during which the boundaries of obstacles are identified and coded with respect to their orientation.","PeriodicalId":119232,"journal":{"name":"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Cellular automata-based collision-free robot path planning\",\"authors\":\"P. Tzionas, P. Tsalides, A. Thanailakis\",\"doi\":\"10.1109/ASPDAC.1995.486409\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new parallel algorithm for collision-free path planning of a diamond-shaped robot among arbitrarily-shaped obstacles and its implementation in VLSI. The proposed algorithm is based on the computational geometry concept known as the \\\"Voronoi diagram\\\", which is constructed through the time evolution of Cellular Automata, after an initial phase during which the boundaries of obstacles are identified and coded with respect to their orientation.\",\"PeriodicalId\":119232,\"journal\":{\"name\":\"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-08-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASPDAC.1995.486409\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASPDAC.1995.486409","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper presents a new parallel algorithm for collision-free path planning of a diamond-shaped robot among arbitrarily-shaped obstacles and its implementation in VLSI. The proposed algorithm is based on the computational geometry concept known as the "Voronoi diagram", which is constructed through the time evolution of Cellular Automata, after an initial phase during which the boundaries of obstacles are identified and coded with respect to their orientation.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
