• Corpus ID: 36517483

Distributed Coverage Control by Robot Networks in Unknown Environments Using a Modified EM Algorithm

  title={Distributed Coverage Control by Robot Networks in Unknown Environments Using a Modified EM Algorithm},
  author={Mohammadhosein Hasanbeig and Lacra Pavel},
  journal={World Academy of Science, Engineering and Technology, International Journal of Computer, Electrical, Automation, Control and Information Engineering},
  • Mohammadhosein HasanbeigL. Pavel
  • Published 2 May 2017
  • Computer Science
  • World Academy of Science, Engineering and Technology, International Journal of Computer, Electrical, Automation, Control and Information Engineering
In this paper, we study a distributed control algorithm for the problem of unknown area coverage by a network of robots. The coverage objective is to locate a set of targets in the area and to minimize the robots’ energy consumption. The robots have no prior knowledge about the location and also about the number of the targets in the area. One efficient approach that can be used to relax the robots’ lack of knowledge is to incorporate an auxiliary learning algorithm into the control scheme. A… 

Figures from this paper

Probabilistic Coverage in Wireless Sensor Networks: a Game Theoretical Approach

A new distributed game theory-based algorithm to maximize the area coverage while minimizing the number of activated sensors is proposed, where each sensor only has access to the activities it has played and the utility values it has received.

A New Game Theory-Based Algorithm for Target Coverage in Directional Sensor Networks

This paper addresses the problem of maximizing network lifetime with adjustable ranges (MNLAR) and proposes a new game theory-based algorithm in which sensor nodes try to adjust their working direction and sensing range in a distributed manner to achieve the desired coverage.

From Game-theoretic Multi-agent Log Linear Learning to Reinforcement Learning

A variant of log-linear learning that provides asymptotic guarantees while relaxing the structural assumptions to include synchronous updates and limitations in information available to the players is introduced.

Statistical Coverage Control of Mobile Sensor Networks

A new family of provably correct reactive coverage control algorithms for both continuous- and discrete-time sensor dynamics is proposed and its integration with a Voronoi-based collision avoidance strategy for disk-shaped sensor bodies and its extension to differential drive sensor dynamics are presented.

Sensing Radius Adjustment in Wireless Sensor Networks: A Game Theoretical Approach

This paper forms the target coverage problem with adjustable sensing range as a repeated multiplayer game in which a utility function is formulated to consider the tradeoff between energy consumption and coverage quality and presents a distributed payoff based learning algorithm.



Game theory control solution for sensor coverage problem in unknown environment

This paper studies the coverage problem in an unknown environment by a Mobile Sensor Network, where each agent in the MSN has sensing, communication, computation and moving capabilities to complete sensing tasks and proposes a proposed algorithm based on game theory control.

Multirobot communication network topology via centralized pairwise games

This paper models the network topology formation as a pairwise game where it forms or severs pairwise links based on the improvement the resulting network offers the robot pairs relative to the current network.

Dynamic Sensor Planning and Control for Optimally Tracking Targets

This paper provides a theoretical framework for tackling the sensor planning problem, and a practical computational strategy inspired by work on particle filtering for implementing the approach, and shows how modeled system dynamics and configuration space obstacles can be handled.

Deployment algorithms for a power‐constrained mobile sensor network

This paper presents distributed coverage algorithms for mobile sensor networks in which agents have limited power to move. Rather than making use of a constrained optimization technique, our approach

Distributed welfare games with applications to sensor coverage

This work considers the situation where the global planner does not have the authority to assign players to resources; rather, players are self-interested and derives sufficient conditions on the distribution rule that ensures the existence of a pure Nash equilibrium in any single-selection distributed welfare game.

Coverage control for mobile sensing networks

This paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies which are adaptive, distributed, asynchronous, and verifiably correct.

Robustness of stochastic stability in game theoretic learning

In the first case, a continuity result is derived that bounds the effects of small uncertainties in the game parameters and in the second case, it is shown that game play tracks drifting stochastically stable states under sufficiently slow time variations.

Active sensor fusion for collision avoidance

  • Terence Chek Hion HengY. KunoY. Shirai
  • Computer Science
    Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robot and Systems. Innovative Robotics for Real-World Applications. IROS '97
  • 1997
The result is an active sensor fusion system for the collision avoiding behaviour of mobile robots that can be incorporated into other purposive behaviours (e.g. object seeking, path finding etc.).

On a decentralized active sensing strategy using mobile sensor platforms in a network

This paper proposes a gradient-search-based decentralized algorithm that demonstrates the benefits of distributed sensing and examines the task of tracking multiple targets, and addresses it via a simple extension to the algorithm.

A Modified Q-Learning Algorithm for Potential Games

Abstract This paper presents a modified Q-learning algorithm and provides conditions for convergence to a pure Nash equilibrium in potential games. In general Q-learning schemes, convergence to a