New Approach to Optimize Cooperation Mobile Robots for Ideal Coverage with an Architecture Designed with Multi-Agent Systems

2017 ◽  
Vol 19 (4) ◽  
pp. 49-65
Author(s):  
Mami Mohammed Amine ◽  
Khelfi Mohamed Fayçal ◽  
Zineb Laouici ◽  
Benyettou Noria
Keyword(s):  
Mobile Robots ◽  
Mobile Robotics ◽  
Optimal Solutions ◽  
Multi Agent Systems ◽  
Robot System ◽  
New Approach ◽  
Agent Systems ◽  
The Past ◽  
Multi Agent ◽  
Uniform Manner

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.

New Approach to Optimize Cooperation Mobile Robots for Ideal Coverage with an Architecture Designed with Multi-Agent Systems

2020 ◽  
pp. 1080-1096
Author(s):  
Mami Mohammed Amine ◽  
Khelfi Mohamed Fayçal ◽  
Zineb Laouici ◽  
Benyettou Noria
Keyword(s):  
Mobile Robots ◽  
Heuristic Algorithm ◽  
Mobile Robotics ◽  
Optimal Solutions ◽  
Multi Agent Systems ◽  
Robot System ◽  
New Approach ◽  
Agent Systems ◽  
Multi Agent ◽  
Uniform Manner

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.

A new approach to distributed control for multi-agent systems based on approximate upper and lower bounds

2017 ◽  
Vol 15 (6) ◽  
pp. 2507-2515 ◽  
Author(s):  
Fangfang Zhang ◽  
Huanshui Zhang ◽  
Cheng Tan ◽  
Wei Wang ◽  
Jinfeng Gao
Keyword(s):  
Distributed Control ◽  
Lower Bounds ◽  
Upper And Lower Bounds ◽  
Multi Agent Systems ◽  
New Approach ◽  
Agent Systems ◽  
Multi Agent

Protocol-Based Multi-Agent Systems: Examining the Effect of Diversity, Dynamism, and Cooperation in Heuristic Optimization Approaches

2010 ◽  
Author(s):  
Lindsay Hanna ◽  
Jonathan Cagan
Keyword(s):  
Search Strategies ◽  
Heuristic Optimization ◽  
Multi Agent Systems ◽  
Review Of The Literature ◽  
High Quality ◽  
New Approach ◽  
Agent Systems ◽  
Engineering Problems ◽  
Multi Agent ◽  
Immense Potential

Many heuristic optimization approaches have been developed to combat the ever-increasing complexity of engineering problems. In general, these approaches can be classified based on the diversity of the search strategies used, the amount of change to those search strategies during the optimization process, and the level of cooperation between the strategies. A review of the literature indicates that approaches which are simultaneously very diverse, highly dynamic, and cooperative are rare but have immense potential for finding high quality final solutions. In this work, a taxonomy of heuristic optimization approaches is introduced and used to motivate a new approach, entitled Protocol-based Multi-Agent Systems. This approach is found to produce final solutions of much higher quality when its implementation includes the use of multiple search protocols, the adaptation of those protocols during the optimization, and the cooperation between the protocols than when these characteristics are absent.

Protocol-Based Multi-Agent Systems: Examining the Effect of Diversity, Dynamism, and Cooperation in Heuristic Optimization Approaches

2011 ◽  
Vol 133 (2) ◽  
Author(s):  
Lindsay Hanna Landry ◽  
Jonathan Cagan
Keyword(s):  
Search Strategies ◽  
Heuristic Optimization ◽  
Multi Agent Systems ◽  
Review Of The Literature ◽  
High Quality ◽  
New Approach ◽  
Agent Systems ◽  
Engineering Problems ◽  
Multi Agent ◽  
Immense Potential

Many heuristic optimization approaches have been developed to combat the ever-increasing complexity of engineering problems. In general, these approaches can be classified based on the diversity of the search strategies used, the amount of change in these search strategies during the optimization process, and the level of cooperation between these strategies. A review of the literature indicates that approaches that are simultaneously very diverse, highly dynamic, and cooperative are rare but have immense potential for finding high quality final solutions. In this work, a taxonomy of heuristic optimization approaches is introduced and used to motivate a new approach called protocol-based multi-agent systems. This approach is found to produce final solutions of much higher quality when its implementation includes the use of multiple search protocols, the adaptation of these protocols during the optimization, and the cooperation between these protocols than when these characteristics are absent.

scholarly journals Reaching a Consensus in Multi-Agent Systems: A Time Invariant Nonlinear Rule

2013 ◽  
Vol 4 (5) ◽  
pp. 130-133 ◽  
Author(s):  
Mansoor Saburov
Keyword(s):  
Nonlinear Model ◽  
Discrete Time ◽  
Linear Case ◽  
Multi Agent Systems ◽  
Nonlinear Case ◽  
Local Interactions ◽  
Agent Systems ◽  
The Past ◽  
Multi Agent ◽  
Time Invariant

Multi-Agent Systems (MAS) have attracted more and more interest in recent years. Most researches in the study of discrete-time MAS, presented in the past few years, have considered linear cooperative rules. However, local interactions between agents are more likely to be governed by nonlinear rules. In this paper, we investigate the consensus of discrete-time MAS with time invariant nonlinear cooperative rules. Based on our presented nonlinear model, we show a consensus in the discrete-time MAS. Our model generalizes a classical time invariant De Groot model. It seems that, unlike a linear case, a consensus can be easily achieved a nonlinear case.

scholarly journals Rational verification: game-theoretic verification of multi-agent systems

2021 ◽  
Author(s):  
Alessandro Abate ◽  
Julian Gutierrez ◽  
Lewis Hammond ◽  
Paul Harrenstein ◽  
Marta Kwiatkowska ◽  
...  
Keyword(s):  
Computer Science ◽  
Temporal Logic ◽  
State Of The Art ◽  
Multi Agent System ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
The Past ◽  
Multi Agent ◽  
Game Theoretic ◽  
Temporal Logic Formula

AbstractWe provide a survey of the state of the art of rational verification: the problem of checking whether a given temporal logic formula ϕ is satisfied in some or all game-theoretic equilibria of a multi-agent system – that is, whether the system will exhibit the behavior ϕ represents under the assumption that agents within the system act rationally in pursuit of their preferences. After motivating and introducing the overall framework of rational verification, we discuss key results obtained in the past few years as well as relevant related work in logic, AI, and computer science.

Towards a New Approach for Controlling the Reorganization Process of Multi-Agent Systems

2014 ◽  
Vol 6 (2) ◽  
pp. 73-91
Author(s):  
Kalache Ayyoub ◽  
Farid Mokhati ◽  
Mourad Badri
Keyword(s):  
Control Process ◽  
Software Tool ◽  
Multi Agent Systems ◽  
Concrete Case ◽  
New Approach ◽  
Agent Systems ◽  
Novel Approach ◽  
Multi Agent ◽  
Computational Systems

Reorganization in Multi-Agent Systems plays a crucial role in the dynamic adaptation of the structure and the behaviour of organizations. In order to ensure consistency of the resulting organization, the reorganization process has to be controlled. This paper proposes a novel approach for controlling the reorganization process of Multi-Agent Systems, which are specified and implemented using the Framework OMACS (Organizational Model for Adaptive Computational Systems). The proposed control process is accomplished using the Framework MOP (Monitoring Oriented Programming) for supporting the verification of some reorganizational properties. The proposed approach, supported by a software tool that we developed, is illustrated using a concrete case study.

Sign in / Sign up

Export Citation Format

Share Document