A solution to vicinity problem of obstacles in complete coverage path planning-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A solution to vicinity problem of obstacles in complete coverage path planning

Published: Issue: Volume: Page:
ISSN:
Container-title:Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)
language:
Short-container-title:

Author:

Chaomin Luo ,Yang S.X.,Stacey D.A.,Jofriet J.C.

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx5/7916/21826/01013426.pdf?arnumber=1013426

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Improved Wall-Climbing Robot Complete Coverage Path Planning Method for Wind Turbine Blade;2024 9th International Conference on Automation, Control and Robotics Engineering (CACRE);2024-07-18

2. Complete coverage planning with clustering method for autonomous mobile robots;Concurrency and Computation: Practice and Experience;2023-06-06

3. Optimal Morphologies of n-Omino-Based Reconfigurable Robot for Area Coverage Task Using Metaheuristic Optimization;Mathematics;2023-02-13

4. Chaotic Motion Planning for Mobile Robots: Progress, Challenges, and Opportunities;IEEE Access;2023

5. Unmanned Aircraft System Applications in Damage Detection and Service Life Prediction for Bridges: A Review;Remote Sensing;2022-08-26

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP