[1]刘井海,张 磊*,李红兵,等.楼梯清洁机器人休息平台路径规划研究[J].江西师范大学学报(自然科学版),2022,(01):67-74.[doi:10.16357/j.cnki.issn1000-5862.2022.01.09]
 LIU Jinghai,ZHANG Lei*,LI Hongbing,et al.The Study on Path Planning of Stair Cleaning Robot Rest Platform[J].Journal of Jiangxi Normal University:Natural Science Edition,2022,(01):67-74.[doi:10.16357/j.cnki.issn1000-5862.2022.01.09]
点击复制

楼梯清洁机器人休息平台路径规划研究()
分享到:

《江西师范大学学报》(自然科学版)[ISSN:1006-6977/CN:61-1281/TN]

卷:
期数:
2022年01期
页码:
67-74
栏目:
信息科学与技术
出版日期:
2022-01-25

文章信息/Info

Title:
The Study on Path Planning of Stair Cleaning Robot Rest Platform
文章编号:
1000-5862(2022)01-0067-08
作者:
刘井海1张 磊1*李红兵2姚兴田1苏 雷1
1.南通大学机械工程学院,江苏 南通 226019; 2.上海交通大学仪器科学与工程系,上海 200240
Author(s):
LIU Jinghai1ZHANG Lei1*LI Hongbing2YAO Xingtian1SU Lei1
1.School of Mechanical Engineering,Nantong University,Nantong Jiangsu 226019,China; 2.Department of Instrument Science and Engineering,Shanghai Jiao Tong University,Shanghai 200240,China
关键词:
楼梯清洁机器人 路径规划 犁田算法 全区域覆盖 平台过渡
Keywords:
stair cleaning robot path planning ploughing algorithm full area coverage platform transition
分类号:
TP 242
DOI:
10.16357/j.cnki.issn1000-5862.2022.01.09
文献标志码:
A
摘要:
楼梯清洁机器人的工作不仅是楼梯清扫,而且还要完成休息平台的遍历.犁田算法可使楼梯清洁机器人以最短路径覆盖楼梯休息平台,但机器人长方形的壳体不利于转身运动,需要与障碍物留出更多的安全距离,导致清扫覆盖率下降.针对这一问题,该文提出了一种基于犁田算法的改进路径规划,使机器人按“N”字形行走:当机器人遇到障碍物时,旋转一个角度θ,直至机器人再次遇到障碍物时反向旋转θ角.仿真结果表明:改进路径规划可以提高覆盖率、降低机器人的工作时间和耗能.
Abstract:
The task of stair cleaning robot is not only to clean the stairs,but also to complete the traversal of the rest platform.Ploughing algorithm can make the stair cleaning robot cover the stair rest platform with the shortest path,but the rectangular shell of the robot is not beneficial for rotational motion,thus it needs more safe distance,which leads to the decline of coverage.To solve this problem,the improved path planning based on ploughing algorithm is proposed.The scheme makes the robot walk in "N" shape.When the robot encounters an obstacle,the robot will rotate an angle θ and will reverse rotation angle θ until it encounters another obstacle.The simulation results show that the improved path planning can improve the coverage,reduce the working time and energy consumption of the robot.

参考文献/References:

[1] KAKUDOU T,WATANABE K,NAGAI I.Study on mobile mechanism for a stair cleaning robot-design of translational locomotion mechanism [EB/OL].[2021-09-13].https://ieeexplore.ieee.org/document/6106112.
[2] 贺廉云.楼道清洁机器人的设计 [J].农业装备与车辆工程,2012,50(8):71-73.
[3] LIU Chaochung,KANG Yuping,YU Sunnien.Hardware and software integration for domestic stairs cleaning robot [EB/OL].[2021-09-13].https://ieeexplore.ieee.org/document/6060748.
[4] MOROZOVSKY N,BEWLEY T.Stair climbing via successive perching [J].IEEE,ASME Transactions on Mechatronics,2015,20(6):2973-2982.
[5] 姚兴田,马永林,张磊,等.升降伸缩式楼道清洁机器人结构及控制系统设计 [J].机械设计与制造,2014,278(4):262-264.
[6] PALMIERI L,RUDENKIO A,ARRAS K O.A fast random walk approach to find diverse paths for robot navigation [J].IEEE Robotics and Automation Letters,2017,2(1):269-276.
[7] BALCH T.The case for randomized search [EB/OL].[2021-06-19].https://www.researchgate.net/publication/247161744_The_case_for_randomized_search.
[8] LIU Yu,ZHU Shiqiang.Sensory navigation of autonomous cleaning robots [EB/OL].[2021-09-13].https://ieeexplore.ieee.org/document/1343620.
[9] 马翔.局部自主式智能吸尘机器人的开发与设计 [D].杭州:浙江大学,2001.
[10] ZHANG Lei,YANG Yuan,GU Yugang,et al.A new compact stair-cleaning robot [J].Journal of Mechanisms and Robotics,Transactions of the ASME,2016,8(4):45-55.
[11] 李开生,张慧慧,费仁元,等.具有遍历特性的移动机器人规划方法的研究 [J].机器人,2001(11):486-487.
[12] FUKUDA T,KUBOTA N.Intelligent robotic systems:adaptation,learning and evolution [J].Artificial Life and Robotics,1999,3(1):32-38.
[13] 王晶晶.多传感器信息融合技术在机器人导航中的应用研究 [J].电声技术,2019,43(11):23-24.
[14] 李成进,王芳.智能移动机器人导航控制技术综述 [J].导航定位与授时,2016,3(5):22-26.
[15] 李浩,陈炜,张增峰,等.移动机器人的动力学分析与仿真 [J].天津理工大学学报,2016,32(3):19-22.
[16] 胡光桃,张元,王强.移动机器人传感器与导航控制 [J].制造业自动化,2020,42(6):66-70.
[17] 简毅,高斌,张月.一种室内扫地机器人全遍历路径规划方法研究 [J].传感器与微系统,2018,37(1):32-34.
[18] LUO Chaomin,YANG Shuxing,STACEY D,et al.A solution to vicinity problem of obstacle in complete coverage path planning [EB/OL].[2021-09-13].https://ieeexplore.ieee.org/document/1013426.
[19] 罗胜.吸尘机器人的现状及其智能系统的若干关键技术 [J].传感器与微系统,2007,26(11):5-9.
[20] 甘文洋,朱大奇.基于行为策略的AUV全覆盖信度函数路径规划算法 [J].系统仿真学报,2018,30(5):1857-1868.

相似文献/References:

[1]苏 雷,张 磊*,邵建根,等.楼梯清洁机器人的爬楼规划研究[J].江西师范大学学报(自然科学版),2023,(01):77.
 SU Lei,ZHANG Lei*,SHAO Jiangen,et al.The Stair Climbing Planning of Stair Cleaning Robot[J].Journal of Jiangxi Normal University:Natural Science Edition,2023,(01):77.

备注/Memo

备注/Memo:
收稿日期:2021-09-18
基金项目:国家自然科学基金(51505280)和上海市自然科学基金(18ZR1421300)资助项目.
通信作者:张 磊(1973—),男,江苏南通人,副教授,主要从事机电一体化、移动机器人路径规划研究.E-mail:zhangleint@ntu.edu.cn
更新日期/Last Update: 2022-01-25