Real-time support for mobile robotics

Coordinated behavior of mobile robots is an important emerging application area. Different coordinated behaviors can be achieved by assigning sets of control tasks, or strategies, to robots in a team. These control tasks must be scheduled either locally on the robot or distributed across the team. An application may have many control strategies to dynamically choose from, although some may not be feasible, given limited resource and time availability. Thus, dynamic feasibility checking becomes important as the coordination between robots and the tasks that need to be performed evolves with time. This paper presents an online algorithm for finding a feasible strategy given a functionally equivalent set of strategies for achieving an application's goals. We present two heuristics for feasibility checking. Both consider communication cost and utilization bound to make allocation (of tasks to execution sites) and scheduling decisions. Extensive experimental results show the effectiveness of the approaches, especially in resource-tight environments. We also demonstrate the application of our approach to real-world scenarios involving teams of robots and show how feasibility analysis also allows the prediction of the scalability of the solution to large robot teams