Zbigniew Antoni Banaszak
Koszalin University of Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Zbigniew Antoni Banaszak.
international conference on robotics and automation | 1990
Zbigniew Antoni Banaszak; Bruce H. Krogh
The concurrent flow of multiple jobs through a FMS can lead to deadlock conditions due to competition for limited resources in the system. The authors develop a Petri net (PN) model of concurrent job flow and dynamic resource allocation in an FMS and define deadlock in terms of transition enabling in the PN model. The problem of deadlock avoidance is addressed by introducing the notion of a restriction policy, which is a feedback policy for excluding some enabled transitions from the current resource allocation alternatives. The authors then present their deadlock avoidance algorithm (DAA) and prove that restricted deadlock can never occur for any resource allocation policy implemented under the DAA restriction policy. The DAA can be implemented easily in real time and is much less restrictive for FMS applications than existing algorithms for deadlock avoidance in computer systems. Application of the DAA is illustrated for three FMS examples: allocation of finite buffer space in a multicell machining facility, collision avoidance in a multirobot assembly cell, and coordination of multiple AGVs on a shop floor. >
agent and multi agent systems technologies and applications | 2007
Grzegorz Bocewicz; Robert Wójcik; Zbigniew Antoni Banaszak
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 logic programming techniques.
IFAC Proceedings Volumes | 2005
Zbigniew Antoni Banaszak; M.B. Zaremba; W. Muszyński
Abstract Constraint programming (CP) is an emergent software technology for declarative description and effective solution of large combinatorial problems, which has proven to be useful, especially in such areas as integrated production planning. In that context, the CP can be considered as a well-suited framework for the development of decision-making software supporting small and medium size enterprises (SME) in the course of Production Process Planning (PPP). The aim of the paper is to present the CP modelling framework as well as to illustrate its application to decision making in the case of a new production order evaluation. The paper emphasises benefits derived from CP-based Decision Support Systems and focuses on constraint satisfaction driven decision making rather than on optimal solution searching.
Engineering Applications of Artificial Intelligence | 2014
Grzegorz Bocewicz; Izabela Ewa Nielsen; Zbigniew Antoni Banaszak
The paper describes a Multimodal Transportation Network (MTN) in which several unimodal networks (Automated Guided Vehicles (AGVs), hoists, lifts, etc.) interact with each other via common shared workstations as to provide a variety of demand-responsive material handling operations. The material handling transport modes provide movement of work pieces between workstations along their manufacturing routes in the MTN. The main contribution of this work is the solution to a constraint satisfaction problem aimed at AGVs fleet match-up scheduling while taking into consideration assumed itineraries of concurrently manufactured product types. In other words, assuming a given topology of the MTN and schedules of operation sequences modeling concurrently manufactured product types, the main objective is to provide a declarative framework aimed at determining conditions allowing one to adjust the AGVs fleet schedule due to the timetable of operations executed in an assumed multi-product manufacturing environment.
Computers in Industry | 2000
Zbigniew Antoni Banaszak; X.Q. Tang; S.C. Wang; Marek B. Zaremba
Abstract An integrated modeling approach that considers the overall production schedule is needed in order to effectively manage different material flows in a flexible manufacturing system (FMS), where large amounts of data intervene in the dynamic control and decision making process. This study focuses on the development of an integrated FMS control model that includes essential features, such as routing of simultaneously processed work orders and batch dispatching, as well as dynamic vehicle path determination and conflict-free routing. A logistics-oriented modeling methodology for FMS distributed control design is proposed that provides the capability for rapid development and evaluation of the control policy.
Annual Reviews in Control | 2014
Grzegorz Bocewicz; Izabela Ewa Nielsen; Zbigniew Antoni Banaszak
Abstract The paper considers the problem of Automated Guided Vehicles (AGVs) fleet scheduling subject to the right match-up of local cyclic acting AGV schedules to given workpiece machining schedules. The main contribution of this work is the solution to a constraint satisfaction problem aimed at AGVs fleet match-up scheduling while taking into consideration assumed itineraries of concurrently manufactured product types. In other words, assuming a given layout of FMS’s material handling and production routes of simultaneously manufactured work orders as well as cyclic schedules of concurrently manufactured product types, the goal is to provide a declarative model enabling multimodal processes, i.e. employing AGVs, hoists, lifts, etc. demand-responsible scheduling of transportation/handling services. An algebra-like driven approach to cyclic scheduling based on step-by-step composition of multimodal transportation network sub-structures is proposed. Results of computational experiments assessing scalability of the method provided are presented as well.
international conference industrial engineering other applications applied intelligent systems | 2008
Irena Bach; Grzegorz Bocewicz; Zbigniew Antoni Banaszak
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, CPcan be considered as an appropriate framework for development of decision making software supporting small and medium sized enterprises (SMEs) in the course of projects portfolio prototyping. The paper deals with problem considered multiresource problem in which more than one resource type may be required by every activity in the project 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 CPbased projects portfolio prototyping framework providing a prompt service to a set of routine queries stated both in straight and reverse way, e.g., concerning the projects portfolio makespan implied by a given resources allocation, and the feasible resources allocation guaranteeing an assumed projects portfolio makespan. The way the responses to the routine queries can be guaranteed while may be available in an on-line mode is illustrated in the example enclosed.
systems man and cybernetics | 1998
Marek B. Zaremba; Krzysztof J. Jedrzejek; Zbigniew Antoni Banaszak
This paper addresses the problem of designing the steady-state behavior of a set of repetitive processes competing for access to common resources. Its objective is to develop algebraic formulae that express system behavior as a function of the characteristics of the component processes and synchronization protocols involved. Based on a matrix representation proposed, conditions are developed that guarantee that the system will achieve a steady state. A composition operator-a tool for synthesizing a chain of repetitive processes-is defined, and its application to the design of repetitive systems with required parameters is considered. It is also shown that the composition operator supplemented with an appropriate synchronization protocol makes it possible to prevent starvation occurrence. Finally, extension of the results to other selected topologies is discussed.
Journal of Intelligent Manufacturing | 2006
Zbigniew Antoni Banaszak; Marek B. Zaremba
The paper addresses the issue of decision-making support for small and medium-size enterprises operating within a virtual project-driven enterprise environment. The problem considered here can be defined in terms of finding a feasible schedule that satisfies the constraints imposed by the work-order duration, the price, and the time-constrained resource availability. The problem belongs to the class of multi-mode case problems of project scheduling, where finding a feasible solution is NP-hard. A heuristic method for process planning and scheduling is proposed. The method is based on a critical path approach and the branch and bound search scheme. It has been implemented in a web-enabled interactive software package, and is illustrated using the example of a virtual construction enterprise.
agent and multi agent systems technologies and applications | 2008
Grzegorz Bocewicz; Robert Wójcik; Zbigniew Antoni Banaszak
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 logic programming techniques.