R. K. Megalingam, A. P. Rajendran, Deepak Dileepkumar, Abhiram Thejus Soloman
{"title":"LARN:老年人和残疾人室内导航","authors":"R. K. Megalingam, A. P. Rajendran, Deepak Dileepkumar, Abhiram Thejus Soloman","doi":"10.1109/GHTC.2013.6713705","DOIUrl":null,"url":null,"abstract":"Automatic navigation systems have a wide range of applications and are usually implemented in many robotic systems. The area of interest here is an automated powered wheelchair for the elderly and physically challenged individuals, which empower them to navigate inside their homes without having to continuously steer the wheelchair. Such a system dramatically reduces the amount of continuous physical effort the user has to apply. This is achieved by mapping the floor plan of a house into number of square grids, with each grid having a unique address. The Location Aware and Remembering Navigation (LARN) algorithm, which is based on the Dijkstra's shortest path algorithm, calculates the shortest path to a set of predefined locations inside the house. With sufficient hardware to measure the orientation of the wheelchair and distance traversed, LARN can dynamically calculate the shortest path to any of the predefined locations. The greatest advantage of implementing LARN is the fact that the system would require no wireless devices to function. This paper discusses the implementation of the LAN algorithm on MATLAB. Simulation and testing of the algorithm is done in MATLAB 2008 and 2010 in both Intel i3 and i5 processors.","PeriodicalId":168082,"journal":{"name":"2013 IEEE Global Humanitarian Technology Conference (GHTC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"LARN: Indoor navigation for elderly and physically challenged\",\"authors\":\"R. K. Megalingam, A. P. Rajendran, Deepak Dileepkumar, Abhiram Thejus Soloman\",\"doi\":\"10.1109/GHTC.2013.6713705\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Automatic navigation systems have a wide range of applications and are usually implemented in many robotic systems. The area of interest here is an automated powered wheelchair for the elderly and physically challenged individuals, which empower them to navigate inside their homes without having to continuously steer the wheelchair. Such a system dramatically reduces the amount of continuous physical effort the user has to apply. This is achieved by mapping the floor plan of a house into number of square grids, with each grid having a unique address. The Location Aware and Remembering Navigation (LARN) algorithm, which is based on the Dijkstra's shortest path algorithm, calculates the shortest path to a set of predefined locations inside the house. With sufficient hardware to measure the orientation of the wheelchair and distance traversed, LARN can dynamically calculate the shortest path to any of the predefined locations. The greatest advantage of implementing LARN is the fact that the system would require no wireless devices to function. This paper discusses the implementation of the LAN algorithm on MATLAB. Simulation and testing of the algorithm is done in MATLAB 2008 and 2010 in both Intel i3 and i5 processors.\",\"PeriodicalId\":168082,\"journal\":{\"name\":\"2013 IEEE Global Humanitarian Technology Conference (GHTC)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE Global Humanitarian Technology Conference (GHTC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GHTC.2013.6713705\",\"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 IEEE Global Humanitarian Technology Conference (GHTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GHTC.2013.6713705","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
LARN: Indoor navigation for elderly and physically challenged
Automatic navigation systems have a wide range of applications and are usually implemented in many robotic systems. The area of interest here is an automated powered wheelchair for the elderly and physically challenged individuals, which empower them to navigate inside their homes without having to continuously steer the wheelchair. Such a system dramatically reduces the amount of continuous physical effort the user has to apply. This is achieved by mapping the floor plan of a house into number of square grids, with each grid having a unique address. The Location Aware and Remembering Navigation (LARN) algorithm, which is based on the Dijkstra's shortest path algorithm, calculates the shortest path to a set of predefined locations inside the house. With sufficient hardware to measure the orientation of the wheelchair and distance traversed, LARN can dynamically calculate the shortest path to any of the predefined locations. The greatest advantage of implementing LARN is the fact that the system would require no wireless devices to function. This paper discusses the implementation of the LAN algorithm on MATLAB. Simulation and testing of the algorithm is done in MATLAB 2008 and 2010 in both Intel i3 and i5 processors.