MULTI-AGENT SIMULATION MODELING OF MILK INTAKE PROCESS

2021 ◽  
Vol 13 (4) ◽  
pp. 4-8
Author(s):  
Yu. Gridnev ◽  
E. Nazoykin ◽  
I. Blagoveschenskiy ◽  
D. Stukalenko ◽  
E. Kuzero
Keyword(s):  
Simulation Modeling ◽  
Food Production ◽  
Digital Tools ◽  
Simulation Methods ◽  
Multi Agent System ◽  
Simulation Environment ◽  
Intake Process ◽  
Real Process ◽  
Agent Simulation ◽  
Multi Agent

The article is devoted to the creation of a multi-agent simulation model of the production process of receiving and storing milk; the description of the main parameters and the results obtained during the work with experiments with the model, as well as the description of the implementation of the multi-agent system using the Anylogic simulation environment are given. The introduction of multi-agent simulation methods allows to use digital tools to create a virtual copy of a real process with the ability to predict and identify food production facilities. The usage of simulation modeling is necessary for conducting experiments aimed at improving production processes through virtual testing.

scholarly journals Centroidal Area-Constrained Partitioning for Robotic Networks

2013 ◽  
Author(s):  
Rushabh Patel ◽  
Paolo Frasca ◽  
Francesco Bullo
Keyword(s):  
Density Function ◽  
Mobile Networks ◽  
Continuous Time ◽  
Practical Implementation ◽  
Simulation Methods ◽  
Multi Agent System ◽  
Agent System ◽  
Robotic Networks ◽  
Multi Agent ◽  
Generalized Voronoi Diagrams

We consider the problem of optimal coverage with area-constraints in a mobile multi-agent system. For a planar environment with an associated density function, this problem is equivalent to dividing the environment into optimal subregions such that each agent is responsible for the coverage of its own region. In this paper, we design a continuous-time distributed policy which allows a team of agents to achieve a convex area-constrained partition of a convex workspace. Our work is related to the classic Lloyd algorithm, and makes use of generalized Voronoi diagrams. We also discuss practical implementation for real mobile networks. Simulation methods are presented and discussed.

scholarly journals Multi-Agent Simulation Environment for Logistics Warehouse Design Based on Self-Contained Agents

2020 ◽  
Vol 10 (21) ◽  
pp. 7552
Author(s):  
Takumi Kato ◽  
Ryota Kamoshida
Keyword(s):  
Material Handling ◽  
Model Development ◽  
Simulation Environment ◽  
Industrial Systems ◽  
Development Costs ◽  
Agent Simulation ◽  
Multi Agent ◽  
The Cost ◽  
System Configurations ◽  
Crucial Part

We propose a multi-agent simulation environment for logistics warehouses. Simulation is a crucial part of designing industrial systems, such as logistics warehouses. A warehouse is a multi-agent system (MAS) that consists of various autonomous subsystems with robots, material-handling equipment, and human workers. It is generally difficult to analyze the performance of a MAS thus, it is important to model a warehouse and conduct simulations to design and evaluate the possible system configurations. However, the cost of modeling warehouses and modifying the models is high because there are various components and interactions compared to conventional multi-agent simulations. We proposed a self-contained agent architecture and message architecture of a multi-agent simulation environment for logistics warehouses to reduce the simulation-model development and modification costs. We quantitatively evaluated our environment in terms of development costs by comparing such costs of our environment and a widely used multi-agent simulation environment.

scholarly journals Centroidal Area-Constrained Partitioning for Robotic Networks

2014 ◽  
Vol 136 (3) ◽  
Author(s):  
Rushabh Patel ◽  
Paolo Frasca ◽  
Francesco Bullo
Keyword(s):  
Density Function ◽  
Mobile Networks ◽  
Continuous Time ◽  
Practical Implementation ◽  
Simulation Methods ◽  
Multi Agent System ◽  
Agent System ◽  
Robotic Networks ◽  
Multi Agent ◽  
Generalized Voronoi Diagrams

We consider the problem of optimal coverage with area-constraints in a mobile multi-agent system. For a planar environment with an associated density function, this problem is equivalent to dividing the environment into optimal subregions such that each agent is responsible for the coverage of its own region. In this paper, we design a continuous-time distributed policy which allows a team of agents to achieve a convex area-constrained partition of a convex workspace. Our work is related to the classic Lloyd algorithm, and makes use of generalized Voronoi diagrams. We also discuss practical implementation for real mobile networks. Simulation methods are presented and discussed.

scholarly journals Multi-agent simulation modeling of online Internet discussions

2018 ◽  
Vol 2018 (2) ◽  
pp. 17-29 ◽  
Author(s):  
Eduard Babkin ◽  
Tatiana Babkina ◽  
Boris Ulitin
Keyword(s):  
Simulation Modeling ◽  
Agent Simulation ◽  
Multi Agent
Sign in / Sign up

Export Citation Format

Share Document