{"title":"实现移动机器人的室内导航","authors":"N. Ko, S. Noh, Yongseon Moon","doi":"10.1109/ICCAS.2013.6703892","DOIUrl":null,"url":null,"abstract":"This paper describes an implementation of autonomous navigation of a mobile robot indoors. The implementation includes map building, path planning, localization, local path planning and obstacle avoidance, and path tracking. ICP(Iterative closest point) is employed to build grid based map using scanned range data. Dijkstra algorithm plans path from an initial location to a goal position. Particle filter estimates the robot position and orientation using the scanned range data. Elastic force is used for local path planning and obstacle avoidance towards a goal position. The algorithms are combined for autonomous navigation in a work area of 100m×40m, which comprises rooms, corridors, obstacles like passers-by, and many furniture and exhibition area. The robot ran at the maximum speed of 1.0 m/sec, and passed all the way points and reached to goal location through the path of the length 165m in 255 seconds, with the average speed of 0.65m/sec.","PeriodicalId":415263,"journal":{"name":"2013 13th International Conference on Control, Automation and Systems (ICCAS 2013)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Implementing indoor navigation of a mobile robot\",\"authors\":\"N. Ko, S. Noh, Yongseon Moon\",\"doi\":\"10.1109/ICCAS.2013.6703892\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes an implementation of autonomous navigation of a mobile robot indoors. The implementation includes map building, path planning, localization, local path planning and obstacle avoidance, and path tracking. ICP(Iterative closest point) is employed to build grid based map using scanned range data. Dijkstra algorithm plans path from an initial location to a goal position. Particle filter estimates the robot position and orientation using the scanned range data. Elastic force is used for local path planning and obstacle avoidance towards a goal position. The algorithms are combined for autonomous navigation in a work area of 100m×40m, which comprises rooms, corridors, obstacles like passers-by, and many furniture and exhibition area. The robot ran at the maximum speed of 1.0 m/sec, and passed all the way points and reached to goal location through the path of the length 165m in 255 seconds, with the average speed of 0.65m/sec.\",\"PeriodicalId\":415263,\"journal\":{\"name\":\"2013 13th International Conference on Control, Automation and Systems (ICCAS 2013)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 13th International Conference on Control, Automation and Systems (ICCAS 2013)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCAS.2013.6703892\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 13th International Conference on Control, Automation and Systems (ICCAS 2013)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCAS.2013.6703892","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper describes an implementation of autonomous navigation of a mobile robot indoors. The implementation includes map building, path planning, localization, local path planning and obstacle avoidance, and path tracking. ICP(Iterative closest point) is employed to build grid based map using scanned range data. Dijkstra algorithm plans path from an initial location to a goal position. Particle filter estimates the robot position and orientation using the scanned range data. Elastic force is used for local path planning and obstacle avoidance towards a goal position. The algorithms are combined for autonomous navigation in a work area of 100m×40m, which comprises rooms, corridors, obstacles like passers-by, and many furniture and exhibition area. The robot ran at the maximum speed of 1.0 m/sec, and passed all the way points and reached to goal location through the path of the length 165m in 255 seconds, with the average speed of 0.65m/sec.