CS Events

The speed at which robots begin to enter various application domains is now
largely dependent on the availability of robust and efficient algorithms that
are capable of solving the complex planning problems inherent to the given
domain. This talk will present a line of research that makes progress towards
solving some of the complex planning problems found in target tracking
applications where a robot or team of robots seeks to locate and follow a group
of moving targets. First, I will describe an algorithm for computing the
optimal searcher motion strategy when there exists just a single searcher.
Second, I will discuss the multiple searcher scenario and present a
deterministic and sampling-based algorithm that coordinates the motion of the
searchers. The overall theme is that the design and implementation of robust
and efficient planners is imperative for robots to manage the complex tasks we
envision for them.