3 accepted papers
Multi-agent path finding is a computationally challenging problem that is relevant to many areas in robotics. Experience-based planning methods have been shown to significantly reduce the planning time of this problem, but the type of problem in which experience can be used has so far been limited t…
Scores of papers show, given some robots, how to improve the useful work they perform. Continuing this line, we consider the efficiency of robot experiments by examining the feasibility of conducting several experiments simultaneously, interleaving execution and sharing resources between them. This…
This paper is about the closely-related problems of localization and aggregation for extremely simple robots, for which the only available action is to move in a given direction as far as the geometry of the environment allows. Such problems may arise, for example, in biomedical applications, wherei…