Improving Memory for Solving Dynamic Distributed Factory Coordination Problem

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Daneshpayeh Roohallah; Mohammadpour Majid

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: New Researches in the Smart City Year:2023 | Volume:1 | Issue:4 Page(s): 26-44

Download Full-Text

Persian Verion

View:

Download:

Cites:

Information Journal Paper

Title

Improving Memory for Solving Dynamic Distributed Factory Coordination Problem

Author(s)

Daneshpayeh Roohallah | Mohammadpour Majid | Issue Writer Certificate

Keywords

density estimation memory

R-wasps

factory coordination

dynamic problem

Abstract

Many real-world problems involve the coordination of multiple agents in dynamic environments. Machines in a factory may need to coordinate the scheduling and execution of jobs to ensure smooth operation as customer demands shift. In the domain of factory operations, adaptive, self-organizing agent-based approaches have been shown to provide very robust solutions. However, these adaptive approaches may require non-trivial amounts of time to respond to large environmental shifts. Techniques exist that have been shown to help many different approaches perform better when problems are dynamic. One common technique is the use of information from the past to improve current performance. In many dynamic problems, the current state of the environment is often similar to previously seen states. Using information from the past may help to make the system more adaptive to large changes in the environment and to perform better over time. One way to maintain and exploit information from the past is the use of memory, where solutions are stored periodically and can be retrieved and reﬁned when the environment changes. This paper introduces several density-estimation memory systems that are inspired by estimation of distribution for solving one of the hard dynamic problems (factory coordination). In this proposed method, instead of storing only single points in memory, we propose to store clusters of points in each memory entry and to create a model of the points in each cluster. In this proposed method we will be able to store many more points, the computation overhead required for the memory will remain low. The experimental results show the efficiency of the proposed algorithm in comparison with other methods.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans