Abstract
In this paper, we study Ball Collecting with Limited Energy, which is a problem of scheduling robots with limited energy confined to a line to catch moving balls that eventually cross the line. For this problem, we show the NP-completeness of the general case and some algorithmic results for some cases with a small number of robots.
Original language | English |
---|---|
Pages (from-to) | 325-327 |
Number of pages | 3 |
Journal | IEICE Transactions on Information and Systems |
Volume | E107.D |
Issue number | 3 |
DOIs | |
Publication status | Published - Mar 2024 |
All Science Journal Classification (ASJC) codes
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence