This paper addresses combinatorial problems that arise in multirobot battery exchange systems. The multirobot battery exchange system addressed herein is characterized by two types of robots: task robots that provide services at requested locations and delivery robots that deliver charged batteries to task robots when required. Combinatorial problems arising in these systems involve multiple aspects of resource scheduling and path planning that make them more complex than well-known combinatorial problems studied in operations research. We present several heuristic algorithms for solving these combinatorial problems. Our algorithms are inspired by techniques used in artificial intelligence and the design of approximation algorithms. We demonstrate the performance of our algorithms in simulation and analyze how they scale with increasing size of the multirobot system. Note to Practitioners —This paper studies combinatorial problems arising in multirobot systems that intend to sustain themselves using mechanisms for battery exchange. The ideas developed in this paper are broadly applicable to resource delivery and scheduling, closed-loop product supply management, and pickup and delivery problems for transportation. Many of the problems studied in this paper are generalizations of the traveling salesman problem. Simpler variants of these have been studied in operations research with the aim of finding optimal solutions—albeit in exponential time. However, in this paper, we present heuristic algorithms for solving battery exchange problems based on techniques developed in artificial intelligence and the design of approximation algorithms. Our algorithms have polynomial execution times and, therefore, scale very well with increasing size of the system. More expressive variants of battery exchange problems, with a broader class of constraints, must be addressed in the future. In addition, future research should also emphasize decentralized algorithms in order to encourage parallelism and exploit the computing power available on each individual robot.
Read full abstract