Multi-Agent Robot System and Events Executing Using GPS Cloud

2016 ◽  
Vol 1 (2) ◽  
Author(s):  
Abdellah Redjaimia
Keyword(s):  
2013 ◽  
Vol 01 (01) ◽  
pp. 121-142 ◽  
Author(s):  
Jinwen Hu ◽  
Jun Xu ◽  
Lihua Xie

Great potentials of robotic networks have been found in numerous applications such as environmental monitoring, battlefield surveillance, target search and rescue, oil and gas exploration, etc. A networked multi-robot system allows cooperative actions among robots and can achieve much beyond the summed capabilities of each individual robot. However, it also poses new research and technical challenges including novel methods for multi-agent data fusion, topology control and cooperative path planning, etc. In this paper, we review recent developments in cooperative control of robotic networks with focus on search and exploration. We shall first present a general formulation of the search and exploration problem, and then divide the overall search strategy into different modules based on their functions. Methods and algorithms are illustrated and compared following the classification of the modules. Moreover, a 3D simulator developed in our laboratory is introduced and its application is demonstrated by experiments. Finally, challenges and future research in this area are provided.


2017 ◽  
Vol 19 (4) ◽  
pp. 49-65
Author(s):  
Mami Mohammed Amine ◽  
Khelfi Mohamed Fayçal ◽  
Zineb Laouici ◽  
Benyettou Noria

Mobile Robotics have taken an ever increasing role in everyday life in the past few years. The main objective often reflected in research is to try to have an optimal cooperation between the different robots to achieve a given objective. This cooperation allows one to have optimal solutions for sharing and resolving conflicts. This article proposes a solution to solve the problem of the coverage in environment with obstacles and the cooperation between several mobile robots. The authors developed a heuristic algorithm to optimize the coverage in a multi-robot system, while maintaining the connection between the robots. The proposed algorithm is based on the propagation of the robots as a function of the expansion of a wave in a uniform manner. The authors also integrate a self-reorientation approach to failure if a robot becomes out of race. Finally, this approach is modelled with the ADMs.


Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5014
Author(s):  
Karlo Griparić

The effectiveness of collaboration in distributed networks, such as sensor networks and multi-agent systems, relies on nodes’ ability to exchange information. The availability of various communication protocols with different technical properties opens the possibility to guarantee connectivity during a system’s operation in any condition. A communication network can be represented by a graph on which connectivity can be expressed by a well-known algebraic connectivity value or Fiedler value. It is one of the most important tools used in many applications where connectivity preservation is required. In this paper, a trust-based consensus algorithm for algebraic connectivity estimation has been implemented. To guarantee the accomplishment of the global objective and the system’s performance, our contributions include: (i) a novel decentralized framework for combining multiple communication channels in a resulting channel and (ii) a decentralized algebraic connectivity control law that dynamically changes the number of agents in the system during operation. The proposed algebraic connectivity control strategy has been evaluated in simulations and in a real multi-robot system using two channels with different properties and initial topologies.


Sign in / Sign up

Export Citation Format

Share Document