Automated vehicles' work planning in flexible manufacturing systems

The problem of rules setting in coordination of automated vehicles access to shared system resources (sections of their transportation paths) which assure a deadlock free and starvation free flow of the executed processes belongs to NP-hard problems. Assuming that there are local (controlling access to shared resources) rules of priority dispatching, the problem deals with setting conditions sufficient for a pair (initial state, set of priority dispatching rules). The assumed knowledge base way of specifying a transportation subsystem leads to solving a logic-algebraic method decision problem. In this regard, the working knowledge representation synthesis method constitutes a significant contribution to the development of programming methods aimed at distributed control procedures design.