等级制度
路径(计算)
运动规划
计算机科学
风险分析(工程)
运筹学
工程类
政治学
人工智能
业务
计算机网络
机器人
法学
作者
Lin Li,Dianxi Shi,Songchang Jin,Xing Zhou,Yahui Li,Bin Bai
出处
期刊:IEEE robotics and automation letters
日期:2025-01-17
卷期号:10 (4): 3358-3365
被引量:1
标识
DOI:10.1109/lra.2025.3531765
摘要
The local extremum is a crucial factor that affects the efficiency of online coverage path planning (CPP). Most online CPP methods generate coverage motions point by point in unknown environments. However, these solutions ignore efficient global coverage and probably result in local extremum. This letter presents a hierarchy coverage path planning approach (HCPP) with proactive extremum prevention. HCPP incrementally generates coverage tasks and produces coverage motions in a global-to-local planning manner. Global planning generates a sequence of traversals of all coverage tasks, and local planning provides a route from one task to the next. By maintaining the connectivity of the uncovered area from both a global and local perspective, HCPP avoids the local extremums caused by separate areas. The effectiveness of HCPP was confirmed by multiple simulations and physical experiments in a laboratory setting on an Akerman robot. Experimental results indicate that HCPP reduces coverage times by preventing the local extremum while achieving complete coverage.
科研通智能强力驱动
Strongly Powered by AbleSci AI