A Novel Supervisory Control Algorithm to Avoid Deadlock in a Manufacturing System Based on Petri Net in Presence of Resource Failure
It is well established that resource failure, including robots and machines, in a manufacturing system can result in deadlocks. This issue not only hampers the system's performance but can also inflict significant damage on the manufacturing process. In this paper, we present a new algorithm developed through modeling of a manufacturing system using Petri net that ensures the liveness of the net in the event of such a failure. To detect possible failures, we first design a recovery subnet that is integrated into the resource. Next, we analyze the effects of failures on each state of the network to identify forbidden states. Finally, we propose an algorithm that optimally adds control places and establishes new constant vectors within the network, enabling effective management of remaining resources across different parts of the net. The proposed algorithm has been implemented in a system featuring three manufacturing lines, demonstrating its error-free operation while ensuring key properties such as boundedness, liveness, and performance continuity within the net.
Code (0)
등록된 구현이 없습니다.
Tasks
ManagementSimilar Papers 제목 키워드 기반
Adaptive Deadlock Avoidance for Decentralized Multi-agent Systems via CBF-inspired Risk Measurement
Decentralized safe control plays an important role in multi-agent systems given the scalability and robustness without reliance on a central authority. However, without an explicit global coordinator, the decentralized c…
A Combination of Theta*, ORCA and Push and Rotate for Multi-agent Navigation
We study the problem of multi-agent navigation in static environments when no centralized controller is present. Each agent is controlled individually and relies on three algorithmic components to achieve its goal while …
Collision AvoidanceSecure Recovery Procedure for Manufacturing Systems using Synchronizing Automata and Supervisory Control Theory
Manufacturing systems may be subject to external attacks and failures, so it is important to deal with the recovery of the system after these situations. This paper deals with the problem of recovering a manufacturing sy…
Standby-Based Deadlock Avoidance Method for Multi-Agent Pickup and Delivery Tasks
The multi-agent pickup and delivery (MAPD) problem, in which multiple agents iteratively carry materials without collisions, has received significant attention. However, many conventional MAPD algorithms assume a specifi…
Cooperative-ORCA*: Real-Time Proactive Deadlock Avoidance for Continuous-Space Multi-Agent Navigation
Multi-Agent Path Finding (MAPF) is a problem that requires computing collision-free paths for a set of agents from their start locations to designated goal locations. The problem has broad applications in domains where t…