Requests network model for deadlock detection and avoidance in automated manufacturing systems. (English) Zbl 1060.90588
Summary: A modern competitive environment requires rapid and effective responses to varying production demands with shorter life cycles. A feasible solution to cope with such unpredictable situations is to introduce an automated manufacturing system characterized by high flexibility, autonomy and cooperation. Much research has been done on negotiation-based scheduling and control under the distributed control architecture due to its operational flexibility and scalability. Despite many advantages, the probability of the system stalling at a deadlock state is high. Specifically, it is difficult to detect impending part flow deadlocks within the system. A system request network model is defined here to analyse various deadlock situations. Request cycles are then identified by a virtual part flow control mechanism. No request cycle in the system request network represents ‘no system deadlock’. For any request cycle, a deadlock analysis is performed. If any request cycle exists that represents either a part flow deadlock or an impending part flow deadlock, then the system will be deadlocked. The proposed model can analyse all types of impending part flow deadlocks. Furthermore, it is more efficient through the reduction of search space, is applicable to various configurations and is less restrictive in dynamic shop floor control.
MSC:
| 90B30 | Production models |
References:
| [1] | DOI: 10.1007/BF01438223 · doi:10.1007/BF01438223 |
| [2] | DOI: 10.1109/70.63273 · doi:10.1109/70.63273 |
| [3] | DOI: 10.1006/jpdc.1995.1150 · doi:10.1006/jpdc.1995.1150 |
| [4] | DOI: 10.1109/70.388784 · doi:10.1109/70.388784 |
| [5] | DOI: 10.1016/0278-6125(96)89569-0 · doi:10.1016/0278-6125(96)89569-0 |
| [6] | DOI: 10.1109/70.585898 · doi:10.1109/70.585898 |
| [7] | DOI: 10.1080/00207540110034904 · doi:10.1080/00207540110034904 |
| [8] | DOI: 10.1023/A:1014482419706 · doi:10.1023/A:1014482419706 |
| [9] | DOI: 10.1109/70.282544 · doi:10.1109/70.282544 |
| [10] | DOI: 10.1080/09511920050195968 · doi:10.1080/09511920050195968 |
| [11] | DOI: 10.1080/002075497195119 · Zbl 0943.90579 · doi:10.1080/002075497195119 |
| [12] | DOI: 10.1080/00207549408957073 · Zbl 0902.90082 · doi:10.1080/00207549408957073 |
| [13] | DOI: 10.1080/00207540050117378 · doi:10.1080/00207540050117378 |
| [14] | DOI: 10.1109/70.720355 · doi:10.1109/70.720355 |
| [15] | DOI: 10.1016/0278-6125(93)90320-S · doi:10.1016/0278-6125(93)90320-S |
| [16] | DOI: 10.1016/S0005-1098(98)00048-X · Zbl 0966.90028 · doi:10.1016/S0005-1098(98)00048-X |
| [17] | DOI: 10.1023/A:1012260622596 · doi:10.1023/A:1012260622596 |
| [18] | DOI: 10.1109/70.544768 · doi:10.1109/70.544768 |
| [19] | DOI: 10.1109/70.63257 · doi:10.1109/70.63257 |
| [20] | DOI: 10.1109/5326.760564 · doi:10.1109/5326.760564 |
| [21] | DOI: 10.1109/70.964666 · doi:10.1109/70.964666 |
| [22] | DOI: 10.1109/70.105378 · doi:10.1109/70.105378 |
| [23] | Xing K, Proceedings of the 2001 IEEE International Conference on Robotics and Automation pp pp. 3565–3570– (2001) |
| [24] | DOI: 10.1109/70.864237 · doi:10.1109/70.864237 |
| [25] | DOI: 10.1002/rob.4620120303 · doi:10.1002/rob.4620120303 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
