Pursuit-evasion / Clearing

  1. Multi-robot pursuit-evasion

    This algorithm addresses a distributed, visibility-based pursuit-evasion problem in which one or more searchers must coordinate to guarantee detection of any and all evaders in an unknown planar environment while using only local information. The motivation is to develop algorithms to enable teams of robots to perform bomb or intruder detection and other related security tasks. It is a distributed clearing algorithm for a team of d-searchers with limited range sensors.

    Research Topics: 

Subscribe to Pursuit-evasion / Clearing