pith. sign in

arxiv: 1810.08438 · v1 · pith:P6EJQAMOnew · submitted 2018-10-19 · 💻 cs.AI · cs.RO

Coordinated exploration for labyrinthine environments with application to the Pursuit-Evasion problem

classification 💻 cs.AI cs.RO
keywords robotsalgorithmapproachcooperationexplorationpresentedproblemteam
0
0 comments X
read the original abstract

This paper introduces a multirobot cooperation approach to solve the "pursuit evasion" problem for mobile robots that have omnidirectional vision sensors. The main characteristic of this approach is to implement a real cooperation between robots based on knowledge sharing and makes them work as a team. A complete algorithm for computing a motion strategy of robots is also presented. This algorithm is based on searching critical points in the environment. Finally, the deliberation protocol which distributes the exploration task among the team and takes the best possible outcome from the robots resources is presented.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.