Manhattan Distance Based Voronoi Partitioning for Efficient Multi-robot Coverage
Author:
Publisher
Springer Singapore
Link
http://link.springer.com/content/pdf/10.1007/978-981-13-9419-5_7
Reference18 articles.
1. Dasgupta P, Muoz-Melndez A, Guruprasad KR (2012) Multi-robot terrain coverage and task allocation for autonomous detection of landmines. Proc SPIE 8359
2. Choset H (2001) Coverage for robotics—a survey of recent results. Ann Math Artif Intell 31(1–4):113–126
3. Galceran E, Carreras Marc (2013) A survey on coverage path planning for robotics. Robot Auton Syst 61:1258–1276
4. Agmon N, Hazon N, Kaminka (2009) The giving tree: constructing trees for efficient offline and online multi-robot coverage. In: Annals of math and artificial intelligence
5. Michel D, McIsaac K (2012) New path planning scheme for complete coverage of mapped areas by single and multiple robots. In: IEEE international conference on mechatronics and automation, pp 1233–1240
Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Robust Online Multi-Robot Simultaneous Exploration and Coverage Path Planning;IEEE Access;2024
2. Grouping and Angle Partitioning-Based Coverage Path Planning for Swarm Robots Using Only Local Communication;Lecture Notes in Computer Science;2024
3. Cooperative Online Workspace Allocation in the Presence of Obstacles for Multi-robot Simultaneous Exploration and Coverage Path Planning Problem;International Journal of Control, Automation and Systems;2023-07
4. 2D-VPC: An Efficient Coverage Algorithm for Multiple Autonomous Vehicles;International Journal of Control, Automation and Systems;2021-05-01
5. Multi-robot informative path planning in unknown environments through continuous region partitioning;International Journal of Advanced Robotic Systems;2020-11-01
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3