arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2304.08246cs.ROcs.AI
收藏

面向覆盖式移动操作任务的基座放置优化

Base Placement Optimization for Coverage Mobile Manipulation Tasks

Institute of CVTE Research(视源股份研究院);South China University of Technology(华南理工大学)

Huiwen Zhang, Kai Mi, Zhijun Zhang

AI总结:

本文提出一种基于类鳞片圆盘工作空间表示与可达性地图的基座放置优化方法,将覆盖、可操作性和时间成本建模为多目标优化问题并用进化方法求解,在真实马桶清洁任务中显著提升了覆盖率与效率。

摘要:

基座放置优化(BPO)是移动操作的一项基础能力,已有数十年的研究历史。然而,由于若干原因,该问题至今仍极具挑战性。首先,与人类相比,当前机器人的灵活性极差,因此对基座放置(BP)的精度要求更高。其次,基座放置与任务约束相互耦合:最优基座放置取决于任务约束,而基座放置又会反过来影响任务约束。更为棘手的是,某些任务约束是柔性的、非确定性的。第三,除了完成任务之外,还需要考虑其他性能指标,例如最优能耗和最短执行时间,这使得基座放置优化问题变得更加复杂。本文采用一种工作空间的类鳞片圆盘(SLD)表示来解耦任务约束与基座放置。为了评估可达性并在SLD上返回最优工作位姿,离线构建了可达性地图(RM)。为了同时优化覆盖率、可操作性和时间成本等目标,本文将基座放置优化形式化为一个多目标优化问题(MOOP)。其中,时间最优目标被建模为旅行商问题(TSP),这更符合实际情况。采用进化方法求解该多目标优化问题。此外,为确保解的有效性和最优性,对候选基座放置执行碰撞检测,并根据具体给定任务对基座放置优化得到的解进行进一步微调。最后,将所提方法用于解决一个真实的马桶覆盖清洁任务。实验表明,优化后的基座放置能够显著提高任务的覆盖率和效率。

英文摘要:

Base placement optimization (BPO) is a fundamental capability for mobile manipulation and has been researched for decades. However, it is still very challenging for some reasons. First, compared with humans, current robots are extremely inflexible, and therefore have higher requirements on the accuracy of base placements (BPs). Second, the BP and task constraints are coupled with each other. The optimal BP depends on the task constraints, and in BP will affect task constraints in turn. More tricky is that some task constraints are flexible and non-deterministic. Third, except for fulfilling tasks, some other performance metrics such as optimal energy consumption and minimal execution time need to be considered, which makes the BPO problem even more complicated. In this paper, a Scale-like disc (SLD) representation of the workspace is used to decouple task constraints and BPs. To evaluate reachability and return optimal working pose over SLDs, a reachability map (RM) is constructed offline. In order to optimize the objectives of coverage, manipulability, and time cost simultaneously, this paper formulates the BPO as a multi-objective optimization problem (MOOP). Among them, the time optimal objective is modeled as a traveling salesman problem (TSP), which is more in line with the actual situation. The evolutionary method is used to solve the MOOP. Besides, to ensure the validity and optimality of the solution, collision detection is performed on the candidate BPs, and solutions from BPO are further fine-tuned according to the specific given task. Finally, the proposed method is used to solve a real-world toilet coverage cleaning task. Experiments show that the optimized BPs can significantly improve the coverage and efficiency of the task.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑