一个2/sup 1///sub 2/-D算法，用于运行在二维硬件上的最短路径搜索

EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications Pub Date : 1990-07-03 DOI:10.1109/IROS.1990.262439

L. Carrioli, M. Diani

{"title":"一个2/sup 1///sub 2/-D算法，用于运行在二维硬件上的最短路径搜索","authors":"L. Carrioli, M. Diani","doi":"10.1109/IROS.1990.262439","DOIUrl":null,"url":null,"abstract":"Presents an algorithm for individuating the shortest path in a 3D space in which the obstacles are described by means of range data. Such an algorithm runs on 2D hardware which is normally used for image processing tasks avoiding the development of expensive 3D hardware. This is possible because the procedure is split in two different 2D processes. Main advantages of the technique are: no pre-processing of the data coming from the sensors is needed, the algorithm works directly on them; and the computation complexity is linear with the length of the path.<<ETX>>","PeriodicalId":409624,"journal":{"name":"EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A 2/sup 1///sub 2/-D algorithm for the shortest path search running on 2-D hardware\",\"authors\":\"L. Carrioli, M. Diani\",\"doi\":\"10.1109/IROS.1990.262439\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presents an algorithm for individuating the shortest path in a 3D space in which the obstacles are described by means of range data. Such an algorithm runs on 2D hardware which is normally used for image processing tasks avoiding the development of expensive 3D hardware. This is possible because the procedure is split in two different 2D processes. Main advantages of the technique are: no pre-processing of the data coming from the sensors is needed, the algorithm works directly on them; and the computation complexity is linear with the length of the path.<<ETX>>\",\"PeriodicalId\":409624,\"journal\":{\"name\":\"EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IROS.1990.262439\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.1990.262439","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种用距离数据描述障碍物的三维空间中最短路径的个性化算法。这种算法运行在通常用于图像处理任务的2D硬件上，避免了昂贵的3D硬件的开发。这是可能的，因为该过程分为两个不同的二维过程。该技术的主要优点是:不需要对来自传感器的数据进行预处理，算法直接对其进行处理;计算复杂度与路径长度成线性关系。

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

查看原文本刊更多论文

A 2/sup 1///sub 2/-D algorithm for the shortest path search running on 2-D hardware

Presents an algorithm for individuating the shortest path in a 3D space in which the obstacles are described by means of range data. Such an algorithm runs on 2D hardware which is normally used for image processing tasks avoiding the development of expensive 3D hardware. This is possible because the procedure is split in two different 2D processes. Main advantages of the technique are: no pre-processing of the data coming from the sensors is needed, the algorithm works directly on them; and the computation complexity is linear with the length of the path.<>

求助全文

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

来源期刊

EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications

自引率

0.00%

发文量