A Multi-Agent Route Exploration Problem
Massachusetts Institute of Technology Cambridge United States
Pagination or Media Count:
We investigate a route exploration problem with N agents dropped randomly on the interval 0,b and discuss the impact of using multiple agents to perform this task. We consider both a discrete and a continuous description of the path to explore. Independently, we study an exploration problem with probabilistic agents having limited autonomy. In both problems , multi-agent scenarios are discussed with an emphasis on the number of agents necessary to obtain good performance.