Abstract
This paper addresses a pursuit-evasion problem between two identical Differential Drive Robots (DDRs). The pursuer wants to capture the evader in minimal time, while the evader wants to delay capture as much as possible. The game takes place in a Euclidean plane without obstacles. In this work, the motion primitives and time-optimal motion strategies for both players are presented. Based on the initial positions of the players, it is possible to solve the decision problem of determining the winner of the game. Simulations of the pursuit-evasion game showing the time-optimal motion primitives of the players are provided for both cases, when the pursuer wins and when the evader escapes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
