Factor-graph Approach for Multi-robot Pursuit-Evasion
Factor-graph Approach for Multi-robot Pursuit-Evasion
Messiah Abolfazli Esfahani*, Ayse Bener*, and Sajad Saeedi
* Toronto Metropolitan University, Toronto, Canada
Accepted for Publication In Robotics and Autonomous Systems (RAS) journal
The growing use of multi-robots in various fields highlights their increasing importance. These robots can tackle a range of challenges, including the pursuit-evasion problem. When dealing with multi-robot systems for the pursuit-evasion problem, precise estimation, planning, and tracking are essential. Our approach offers a factor graph-based solution to this problem, focusing on scenarios with one evader and multiple pursuers. Through a series of experiments, both simulated and with real hardware, we demonstrate the effectiveness of our algorithm. It enables accurate estimation and tracking of the evader, allowing pursuers to efficiently capture them in the shortest time and distance compared to standard methods.
In the following we show the different scenarios and the performance of the purposed approach.
That could be categorized as follows:
Fixed Pursuers
Moving Pursuers
Number of Pursuers
Number of Evaders
In this scenario pursuers are fixed and only tracking is being performed. The frequency of measurement coming from pursuers is 1/30.
In this demo 4 robots are chasing the evader. The frequency of the measurement 1/30.
Scalability on the number of pursuers
Real World Experiments
Catching the Evader
Chasing the Evader
If you have any questions, feel free to reach out to us at the following email us at:
{mabolfazli, ayse.bener, s.saeedi}@torontomu.ca
TBD