Cellular automata-based collision-free robot path planning

P. Tzionas, P. Tsalides, A. Thanailakis
{"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}
引用次数: 1

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于元胞自动机的无碰撞机器人路径规划
提出了一种新的菱形机器人在任意形状障碍物中无碰撞路径规划的并行算法及其在超大规模集成电路中的实现。提出的算法基于被称为“Voronoi图”的计算几何概念,该概念是通过元胞自动机的时间进化构建的,在初始阶段,障碍物的边界被识别并根据其方向进行编码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Extending pitchmatching algorithms to layouts with multiple grid constraints Routing space estimation and safe assignment for macro cell placement Formal verification of pipelined and superscalar processors Test pattern embedding in sequential circuits through cellular automata Automatic verification of memory systems which service their requests out of order
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1