衝突回避を伴う協調的周期カバレッジ
Cooperative Periodic Coverage With Collision Avoidance
複数の移動エージェントが関心点を周期的に訪問してカバレッジ作業を行う問題に対し、経路計画・カバレッジ時間最適化・衝突回避スケジューリングの3段階で解く手法を提案し、移動インダクタを備えた誘導加熱調理器で実機検証した。
著者: José Manuel Palacios-Gasós, Eduardo Montijano, Carlos Sagüés, Sergio Llorente
分類: cs.RO, cs.SY, eess.SY
原文アブストラクト
In this paper we propose a periodic solution to the problem of persistently covering a finite set of interest points with a group of autonomous mobile agents. These agents visit periodically the points and spend some time carrying out the coverage task, which we call coverage time. Since this periodic persistent coverage problem is NP-hard, we split it into three subproblems to counteract its complexity. In the first place, we plan individual closed paths for the agents to cover all the points. Second, we formulate a quadratically constrained linear program to find the optimal coverage times and actions that satisfy the coverage objective. Finally, we join together the individual plans of the agents in a periodic team plan by obtaining a schedule that guarantees collision avoidance. To this end, we solve a mixed integer linear program that minimizes the time in which two or more agents move at the same time. Eventually, we apply the proposed solution to an induction hob with mobile inductors for a domestic heating application and show its performance with experiments on a real prototype.
