- freely available
Searching Dynamic Agents with a Team of Mobile Robots
AbstractThis paper presents a new algorithm that allows a team of robots to cooperatively search for a set of moving targets. An estimation of the areas of the environment that are more likely to hold a target agent is obtained using a grid-based Bayesian filter. The robot sensor readings and the maximum speed of the moving targets are used in order to update the grid. This representation is used in a search algorithm that commands the robots to those areas that are more likely to present target agents. This algorithm splits the environment in a tree of connected regions using dynamic programming. This tree is used in order to decide the destination for each robot in a coordinated manner. The algorithm has been successfully tested in known and unknown environments showing the validity of the approach.
Share & Cite This Article
Juliá, M.; Gil, A.; Reinoso, O. Searching Dynamic Agents with a Team of Mobile Robots. Sensors 2012, 12, 8815-8831.View more citation formats
Juliá M, Gil A, Reinoso O. Searching Dynamic Agents with a Team of Mobile Robots. Sensors. 2012; 12(7):8815-8831.Chicago/Turabian Style
Juliá, Miguel; Gil, Arturo; Reinoso, Oscar. 2012. "Searching Dynamic Agents with a Team of Mobile Robots." Sensors 12, no. 7: 8815-8831.
Notes: Multiple requests from the same IP address are counted as one view.