电池(电)
移动机器人
机器人
在线算法
计算机科学
实时计算
障碍物
竞争分析
运动规划
任务(项目管理)
路径(计算)
电池容量
模拟
工程类
算法
上下界
人工智能
功率(物理)
数学
计算机网络
物理
系统工程
法学
数学分析
量子力学
政治学
作者
Iddo Shnaps,Elon Rimon
标识
DOI:10.1109/tase.2016.2515165
摘要
This paper is concerned with online coverage of unknown planar environments by a mobile robot of size D operating with a limited energy capacity battery. The battery capacity is represented by the path length L that the robot can travel under a full battery charge. Starting at S, the robot has to cover a planar environment containing unknown obstacles, and return to S upon task completion. During task execution, the robot may return to S at any time to recharge its battery. This paper first describes a battery powered offline coverage methodology, then introduces the battery powered coverage (BPC) algorithm that performs online battery powered coverage using position and local obstacle detection sensors. The performance of the BPC algorithm is measured by its competitiveness, determined by measuring the mobile robot's total online path length, l, relative to the optimal offline solution lopt. This paper establishes that the BPC algorithm has a competitive performance of l ≤ ( L/ D) lopt. This paper additionally establishes a universal lower bound of l ≥ log( L/ 4 D) lopt over all online battery powered coverage algorithms. Execution example illustrates the usefulness of the BPC algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI