scholarly journals A multi-agent system with blockchain for container stacking and dispatching

Author(s):  
Lawrence Henesey ◽  
Lizneva Yulia ◽  
Anwar Mahwish

Port Logistical Supply chains play a very important role in society. Their complex and adaptive behaviours promote the suggested applications of combining a multiagent system with blockchain for solving complex problems. Several technologies have been proven positively to work in logistics, however the concept of combining converging technologies such as blockchain with deep reinforcement multi agent is viewed as a novel approach to solving the complexity that is associated with many facets of logistics. A simulator was developed and tested for the problem of container stacking. The simulation results indicate a more robust approach to currently used tools and methods.

2015 ◽  
Vol 7 (3) ◽  
pp. 18-44 ◽  
Author(s):  
Soumia Bendakir ◽  
Nacereddine Zarour ◽  
Pierre Jean Charrel

Requirements change management (RCM) is actually an inevitable task that might be considered in system development's life cycle, since user requirements are continuously evolving (some are added, others are modified or deleted). A large majority of studies have examined the issue of change, while most of them focused on the design and source code, requirements were often forgotten, even though, the cost of fixing the defect and introduced error due to the requirements is less higher compared to the cost of error in design and implementation. For this purpose, this work focuses on change issues in the requirements engineering (RE) context, which contains the complete initial specification. Properties such as adaptability, perception, and cooperation of the multi-agent system (MAS) allow managing changing requirements in a controlled manner. The main objective of this work is to develop an agent-oriented approach which will be effective in the requirements management to be adapted to changes in their environments.


Author(s):  
NAJLA AHMAD ◽  
ARVIN AGAH

In a multi-agent system, an agent may utilize its idle time to assist other agents in the system. Intent recognition is proposed to accomplish this with minimal communication. An agent performing recognition observes the tasks other agents are performing and, unlike the much studied field of plan recognition, the overall intent of an agent is recognized instead of a specific plan. The observing agent may use capabilities that it has not observed. A conceptual framework is proposed for intent recognition systems. An implementation of the conceptual framework is tested and evaluated. We hypothesize that using intent recognition in a multi-agent system increases utility (where utility is domain specific) and decreases the amount of communication. We test our hypotheses using the domain of Cow Herding, where agents attempt to herd cow agents into team corrals. A set of metrics, including task time and number of communications, is used to compare the performance of plan recognition and intent recognition. In our results, we find that intent recognition agents communicate fewer times than plan recognition agents. In addition, unlike plan recognition, when agents use the novel approach of intent recognition, they select unobserved actions to perform. Intent recognition agents were also able to outperform plan recognition agents by consistently scoring more points in the Cow Herding domain. This research shows that under certain conditions, an intent recognition system is more efficient than a plan recognition system. The advantage of intent recognition over plan recognition becomes more apparent in complex domains.


2014 ◽  
Vol 971-973 ◽  
pp. 1655-1658
Author(s):  
Ning Qiang ◽  
Feng Ju Kang

A new fitness function is introduced in order to maximize the number of task served by the multi-agent system (MAS) with limited resource, while the tasks information remains unknown until the system found them one by one. The new fitness function not only considers to maximize the profit of the system which can be seen as to maximize the remaining resource of the system in the case of the MAS with limited resource, but also takes the balance of remaining resource in to account and it can makes a compromise between them. This paper uses an improved discrete particle swarm optimization to optimize the coalition of MAS. In order to improve the performance of the algorithm we redefine the particle velocity and position update formula. The simulation results show the effectiveness and superiority of the proposed fitness function and optimization algorithm.


Author(s):  
Prathapchandran Kannimuthu

In this paper, an authenticated and trusted AODV (ATAODV) routing protocol is proposed to identify and eliminate the black attack and form the trusted route in MANET-based military environments. The aim is to provide two-level security by mapping the multi-agent system (MAS). The first level focuses on providing authentication by identifying blackhole soldiers/devices, and the second level focuses on forming a trusted path between the origin and the endpoint communication. The authentication is achieved by aggregated trust (AT), which is calculated based on the reputation, closeness, and energy by aggregated trust design agent (ATDA). Then, forming a trusted route between the source and the destination is achieved by combining route aggregated trust (RAT), which is calculated based on AT and hop count (HC). The trusted route is formed by a routing agent (RA). The simulation results demonstrate that the ATAODV routing protocol is performing well and shows improved results compared with the existing routing protocols.


Sign in / Sign up

Export Citation Format

Share Document