LARN:老年人和残疾人室内导航

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}
引用次数: 11

摘要

自动导航系统具有广泛的应用,通常在许多机器人系统中实现。这里感兴趣的领域是为老年人和身体有障碍的人设计的自动动力轮椅,它使他们不必一直驾驶轮椅就能在家里导航。这样的系统极大地减少了用户必须投入的持续体力劳动。这是通过将房屋的平面图映射到许多正方形网格中来实现的,每个网格都有一个唯一的地址。位置感知和记忆导航(LARN)算法基于Dijkstra的最短路径算法,计算到房屋内一组预定义位置的最短路径。有了足够的硬件来测量轮椅的方向和经过的距离,LARN可以动态计算到任何预定义位置的最短路径。实现LARN的最大优点是该系统不需要无线设备即可运行。本文讨论了局域网算法在MATLAB上的实现。采用MATLAB 2008和2010在Intel i3和i5处理器上对该算法进行了仿真和测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信