Paper Link: https://ieeexplore.ieee.org/document/8844270

DOI: 10.1109/JSYST.2019.2939250

Imagine you have a cleaning bot with limited power. How does the robot know where to go to clean up your floor efficiently? Now imagine you have multiple robots, and you are trying to measure the distribution of salinity over the Great Lakes. How can that be done?

These are the problems our algorithm is trying to solve.

Below is a demo of our proposed algorithm (Left) vs. traditional local greedy search method (right) over a rainfall dataset. Each new point represents a newly explored location by the mobile agent, and getting from point A to B requires energy costs based on distance (assuming agent’s speed is fixed over time).

For more detailed information, please contact me directly.