{"title":"智能交通系统在线与离线导航的比较研究","authors":"K. Kinugawa, H. Noborio","doi":"10.1109/ROMAN.2000.892476","DOIUrl":null,"url":null,"abstract":"In this paper, we compare off-line and online path-planning algorithms and seek for a possibility to design an efficient path-planning algorithm for multiple mobile robots. In general, an off-line path-planning algorithm always selects the shortest path for a robot, but it is time consuming because of combination search. On the other hand, an online path-planning algorithm quickly picks up a reasonable path but does not always find any path for a complex swarm of encountered robots. In this research, we compare two different path-planning algorithms with each other, and describe a possibility to develop their fusion path-planning algorithm for multiple mobile robots.","PeriodicalId":337709,"journal":{"name":"Proceedings 9th IEEE International Workshop on Robot and Human Interactive Communication. IEEE RO-MAN 2000 (Cat. No.00TH8499)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A comparative study between on-line and off-line navigations on intelligent transportation system\",\"authors\":\"K. Kinugawa, H. Noborio\",\"doi\":\"10.1109/ROMAN.2000.892476\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we compare off-line and online path-planning algorithms and seek for a possibility to design an efficient path-planning algorithm for multiple mobile robots. In general, an off-line path-planning algorithm always selects the shortest path for a robot, but it is time consuming because of combination search. On the other hand, an online path-planning algorithm quickly picks up a reasonable path but does not always find any path for a complex swarm of encountered robots. In this research, we compare two different path-planning algorithms with each other, and describe a possibility to develop their fusion path-planning algorithm for multiple mobile robots.\",\"PeriodicalId\":337709,\"journal\":{\"name\":\"Proceedings 9th IEEE International Workshop on Robot and Human Interactive Communication. IEEE RO-MAN 2000 (Cat. No.00TH8499)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 9th IEEE International Workshop on Robot and Human Interactive Communication. IEEE RO-MAN 2000 (Cat. No.00TH8499)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROMAN.2000.892476\",\"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 9th IEEE International Workshop on Robot and Human Interactive Communication. IEEE RO-MAN 2000 (Cat. No.00TH8499)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROMAN.2000.892476","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A comparative study between on-line and off-line navigations on intelligent transportation system
In this paper, we compare off-line and online path-planning algorithms and seek for a possibility to design an efficient path-planning algorithm for multiple mobile robots. In general, an off-line path-planning algorithm always selects the shortest path for a robot, but it is time consuming because of combination search. On the other hand, an online path-planning algorithm quickly picks up a reasonable path but does not always find any path for a complex swarm of encountered robots. In this research, we compare two different path-planning algorithms with each other, and describe a possibility to develop their fusion path-planning algorithm for multiple mobile robots.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
