The subject matter of the study are the automated guided vehicle (AGV) operation synchronization mechanisms in flexible manufacturing systems, where transport processes can be modeled as a system of cyclic concurrent ...
详细信息
ISBN:
(纸本)9783540785811
The subject matter of the study are the automated guided vehicle (AGV) operation synchronization mechanisms in flexible manufacturing systems, where transport processes can be modeled as a system of cyclic concurrent processes sharing common resources, i.e., some preset travelling route intervals. In this paper the problem of determination of the local rules coordinating access of the vehicles to the shared travel route intervals, ensuring the deadlock-free execution of the repetitive processes was reduced to determination of the sufficient conditions. In that context the problem considered can be seen as a problem of multi-agent coordination, and defined as the constraint satisfaction problem (CSP) subject to precise and imprecise operation times, and then solved with use of the logicprogramming techniques.
Constraint programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in the area of integrated production planning. In that contex...
详细信息
Constraint programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in the area of integrated production planning. In that context, CP can be considered as an appropriate framework for development of decision making software supporting scheduling of multi-robot in a multi-product job shop. The paper deals with multi-resource problem in which more than one shared renewable and non-renewable resource type may be required by manufacturing operation and the availability of each type is time-windows limited. The problem belongs to a class of NP-complete ones. The aim of the paper is to present a knowledge based and CLP-driven approach to multi-robot task allocation providing a prompt service to a set of routine queries stated both in straight and reverse way. Provided examples illustrate both cases while taking into account an accurate as well as an uncertain specification of robots and workers operation time.
The subject matter of the study are the automated guided vehicle (AGV) operation synchronisation mechanisms in flexible manufacturing systems. Since each AGV can be treated as an autonomous object capable to undertake...
详细信息
ISBN:
(纸本)9783540728290
The subject matter of the study are the automated guided vehicle (AGV) operation synchronisation mechanisms in flexible manufacturing systems. Since each AGV can be treated as an autonomous object capable to undertake decisions regarding its routing, entering path sectors, etc., hence a class of transportation systems considered can be seen as a class of multi-agent ones. In many practical cases transport operations are repetitive. The processes examination has to guarantee the collision-free and deadlock free AGVs flow. In this paper the problem of determination of the rules coordinating access of the vehicles to the shared travel route intervals, ensuring the collision-free and deadlock-free execution of the repetitive processes was reduced to determination of the sufficient conditions of the form of a pair (initial state, a set of priority rules). In particular the problem of searching for a pair is defined in the form of the constraint satisfaction problem (CSP) and is solved with use of the logicprogramming techniques.
The subject matter of the study are the automated guided vehicle (AGV) operation synchronisation mechanisms in flexible manufacturing systems, enabling determination of the travel schedules via some preset travelling ...
详细信息
The subject matter of the study are the automated guided vehicle (AGV) operation synchronisation mechanisms in flexible manufacturing systems, enabling determination of the travel schedules via some preset travelling route intervals. In many practical cases transport operations are repetitive. For this type of systems the transport processes can be modelled as a system of cyclic concurrent processes sharing common resources with mutual exclusion. The processes examination has to guarantee the collision-free and deadlock free AGVs flow. In this paper the problem of determination of the rules coordinating access of the vehicles to the shared travel route intervals, ensuring the collision-free and deadlock-free execution of the repetitive processes was reduced to determination of the sufficient conditions. In particular the problem of searching for a pair is defined in the form of the constraint satisfaction problem (CSP) and is solved with use of the logicprogramming techniques.
暂无评论