This project will focus on the multi-agent search problem, where multiple autonomous robots (agents) are tasked with spreading over a given region to be explored, to locate given targets of interest trying to evade detection. The number of targets is unknown, and their initial position is not known as well. There might be obstacles in the domain, and their location might or might not be known. Throughout this work, we will assume that robots can communicate their observations (presence/absence of targets) during search, via local or global communications, so they can update their representation of the domain and likely location(s) of targets (more details about this representation in the next Section). Our goal is to allow robots to plan efficient search paths to cover the domain and localise the targets as quickly as possible, while relying on local sensing and on distributed intelligence rather than on centralised planning, which would represent a vulnerable bottleneck and would not scale well to large agent teams.
Qualifications
MNCJobz.com will not be responsible for any payment made to a third-party. All Terms of Use are applicable.