Summary. We consider the problem of multi-robot exploration and coverage in unknown non-convex environments. The contributions of the work include (1) the presentation of a distributed algorithm that computes the generalized Voronoi tessellation of non-convex environments (using a discrete representation) in real-time for use in feedback control laws; and (2) the extension of this method to entropy-based metrics that allow for cooperative coverage control in unknown non-convex environments. Simulation results demonstrate the application of the control methodology for cooperative exploration and coverage in an office environment
This work deals with decentralized control of multiple nonholonomic mobile sensors for optimal cover...
A distributed cooperative coverage algorithm DC R is presented which is derived from an earlier comp...
We study distributed boundary coverage of known environments using a team of minia-ture robots. Dist...
International audienceIn this paper we study the problem of optimal placement for a team of mobile r...
This paper introduces StaCo: Stackelberg-based Coverage approach for nonconvex environments. This ap...
In this paper, we study a distributed control algorithm for the problem of unknown area coverage by ...
Robotic coverage of an initially unknown or partially known environment is a problem that is encount...
This thesis addresses a specic problem of distributed robotics -- namely, the problem of using a tea...
Many tasks, such as search and rescue, exploration and mapping, security and surveil- lance are suit...
In this paper we propose a new path planning algorithm for coverage tasks in unknown environments th...
Abstract: In this paper a method for coverage control for a convex region D ⊂ R2 in a dynamic enviro...
This paper presents a coverage based control algorithm to coordinate a group of autonomous robots. M...
This paper presents a theoretical framework for the design and analysis of gradient descent-based al...
Complete coverage of an unknown environment is a valuable skill for a variety of robot tasks such as...
An area coverage control law in cooperation with reinforcement learning techniques is proposed for d...
This work deals with decentralized control of multiple nonholonomic mobile sensors for optimal cover...
A distributed cooperative coverage algorithm DC R is presented which is derived from an earlier comp...
We study distributed boundary coverage of known environments using a team of minia-ture robots. Dist...
International audienceIn this paper we study the problem of optimal placement for a team of mobile r...
This paper introduces StaCo: Stackelberg-based Coverage approach for nonconvex environments. This ap...
In this paper, we study a distributed control algorithm for the problem of unknown area coverage by ...
Robotic coverage of an initially unknown or partially known environment is a problem that is encount...
This thesis addresses a specic problem of distributed robotics -- namely, the problem of using a tea...
Many tasks, such as search and rescue, exploration and mapping, security and surveil- lance are suit...
In this paper we propose a new path planning algorithm for coverage tasks in unknown environments th...
Abstract: In this paper a method for coverage control for a convex region D ⊂ R2 in a dynamic enviro...
This paper presents a coverage based control algorithm to coordinate a group of autonomous robots. M...
This paper presents a theoretical framework for the design and analysis of gradient descent-based al...
Complete coverage of an unknown environment is a valuable skill for a variety of robot tasks such as...
An area coverage control law in cooperation with reinforcement learning techniques is proposed for d...
This work deals with decentralized control of multiple nonholonomic mobile sensors for optimal cover...
A distributed cooperative coverage algorithm DC R is presented which is derived from an earlier comp...
We study distributed boundary coverage of known environments using a team of minia-ture robots. Dist...