{"title":"一车或两车导航的并行算法","authors":"E. Gurewitz, G. Fox, Y. Wong","doi":"10.1109/IROS.1990.262368","DOIUrl":null,"url":null,"abstract":"A two vehicle navigator on a discrete space is analyzed. The concept of linking time maps as source to optimal path planning is discussed. The rules for constructing these maps are given in a cellular automata mode. The implementation of these rules on a parallel computer is presented.<<ETX>>","PeriodicalId":409624,"journal":{"name":"EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Parallel algorithms for one or two-vehicle navigation\",\"authors\":\"E. Gurewitz, G. Fox, Y. Wong\",\"doi\":\"10.1109/IROS.1990.262368\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A two vehicle navigator on a discrete space is analyzed. The concept of linking time maps as source to optimal path planning is discussed. The rules for constructing these maps are given in a cellular automata mode. The implementation of these rules on a parallel computer is presented.<<ETX>>\",\"PeriodicalId\":409624,\"journal\":{\"name\":\"EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"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.262368\",\"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.262368","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Parallel algorithms for one or two-vehicle navigation
A two vehicle navigator on a discrete space is analyzed. The concept of linking time maps as source to optimal path planning is discussed. The rules for constructing these maps are given in a cellular automata mode. The implementation of these rules on a parallel computer is presented.<>