Other affiliations: Eastern Mediterranean University, University of Texas at Arlington, South China University of Technology
Bio: Stjepan Bogdan is an academic researcher from University of Zagreb. The author has contributed to research in topics: Control theory & Fuzzy control system. The author has an hindex of 23, co-authored 208 publications receiving 2325 citations. Previous affiliations of Stjepan Bogdan include Eastern Mediterranean University & University of Texas at Arlington.
Papers published on a yearly basis
12 Dec 2005
TL;DR: The book addresses the heuristic nature of fuzzy controller design and methods to overcome the resulting problems and explains original concepts and methods such as phase-plane-based initial presetting, sensitivity model-based self-organization, and PLC-based implementation.
Abstract: The book presents clear, practical, easy-to-use methods for designing and implementing fuzzy control systems It addresses the heuristic nature of fuzzy controller design and methods to overcome the resulting problems It examines the design of hybrid, adaptive, and self-learning fuzzy control structures It explains original concepts and methods such as phase-plane-based initial presetting, sensitivity model-based self-organization, and PLC-based implementation It provides easy-to-follow worked examples in MATLAB The final chapter explores industrial applications with emphasis on techniques for fuzzy controller implementation and different implementation platforms for various applications
TL;DR: The proposed dynamic routing method for supervisory control of multiple automated guided vehicles that are traveling within a layout of a given warehouse has been successfully implemented in the industrial environment in a form of a multiple AGV control system.
Abstract: This paper presents a dynamic routing method for supervisory control of multiple automated guided vehicles (AGVs) that are traveling within a layout of a given warehouse. In dynamic routing a calculated path particularly depends on the number of currently active AGVs' missions and their priorities. In order to solve the shortest path problem dynamically, the proposed routing method uses time windows in a vector form. For each mission requested by the supervisor, predefined candidate paths are checked if they are feasible. The feasibility of a particular path is evaluated by insertion of appropriate time windows and by performing the windows overlapping tests. The use of time windows makes the algorithm apt for other scheduling and routing problems. Presented simulation results demonstrate efficiency of the proposed dynamic routing. The proposed method has been successfully implemented in the industrial environment in a form of a multiple AGV control system.
TL;DR: An algorithm for decentralized control of multiple automated guided vehicles performing transportation tasks within industrial and warehousing environments by running on each vehicle in the system, which provides vehicles with capabilities for autonomous path planning and motion co-ordination.
Abstract: In this paper, we present an algorithm for decentralized control of multiple automated guided vehicles performing transportation tasks within industrial and warehousing environments. By running on each vehicle in the system, the algorithm provides vehicles with capabilities for autonomous path planning and motion co-ordination. The path planning part of the algorithm implements a free-ranging motion scheme by determining the shortest feasible paths considering nonholonomic vehicle constraints. The motion co-ordination part of the algorithm ensures safe vehicle motions by reliable detection and resolution of different conflict situations with other vehicles in the shared workspace. Conflict resolution is based on a vehicle priority scheme and results in temporary stopping or removal of the lower priority vehicles taking part in the conflict. Removal action is always performed within the vehicle’s private zone , i.e., the preallocated local region of the workspace surrounding the vehicle. By encoding information on the vehicle size and its kinematic constraints, the introduced private zone mechanism provides the necessary physical space required for successful execution of every removal action. We also analyze the stability of the presented algorithm and discuss its deadlock-free and livelock-free properties. Algorithm performance has been validated by simulation using ten vehicles and experimentally on two different setups—a laboratory setup comprising five Pioneer 3DX vehicles and by two state-of-the-art autonomous forklifts in industrial-like operating conditions.
01 Jan 2009
TL;DR: An on-line maximally permissive control policy for deadlock avoidance (MAXWIP) is devised, which can be efficiently implemented by incorporating the ''outer-loop'' control decisions via certain dispatching control inputs.
Abstract: The problem of deadlock in a large class of reentrant flowline systems is analysed based on a Petri net model. The relation between deadlock and circular waits is established by rigorously defining the situation of circular blocking. Deadlock analysis is then performed in terms of circular waits and their associated structures, the so-called critical siphons and critical subsystems. A dynamical system representation obtained by coupling the Petri net marking transition equation with the matrix rule-based controller equations is adopted. The task of computing the Petri net structures of deadlock analysis is largely simplified (operations involved are of polynomial complexity) by using the matrices of this system description. An on-line maximally permissive control policy for deadlock avoidance (MAXWIP) is then devised. This can be efficiently implemented by incorporating the ''outer-loop'' control decisions via certain dispatching control inputs. The result is a dispatching control with deadlock avoidance, which is a generalized kanban scheme.
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …
TL;DR: This survey classifies routing problems from the perspective of information quality and evolution and presents a comprehensive review of applications and solution methods for dynamic vehicle routing problems.
Abstract: A number of technological advances have led to a renewed interest on dynamic vehicle routing problems. This survey classifies routing problems from the perspective of information quality and evolution. After presenting a general description of dynamic routing, we introduce the notion of degree of dynamism, and present a comprehensive review of applications and solution methods for dynamic vehicle routing problems.
TL;DR: It is shown that firms could effectively reduce their carbon emissions without significantly increasing their costs by making only operational adjustments and by collaborating with other members of their supply chain.
Abstract: Using relatively simple and widely used models, we illustrate how carbon emission concerns could be integrated into operational decision-making with regard to procurement, production, and inventory management. We show how, by associating carbon emission parameters with various decision variables, traditional models can be modified to support decision-making that accounts for both cost and carbon footprint. We examine how the values of these parameters as well as the parameters of regulatory emission control policies affect cost and emissions. We use the models to study the extent to which carbon reduction requirements can be addressed by operational adjustments, as an alternative (or a supplement) to costly investments in carbon-reducing technologies. We also use the models to investigate the impact of collaboration among firms within the same supply chain on their costs and carbon emissions and study the incentives firms might have in seeking such cooperation. We provide a series of insights that highlight the impact of operational decisions on carbon emissions and the importance of operational models in evaluating the impact of different regulatory policies and in assessing the benefits of investments in more carbon efficient technologies. Note to Practitioners-Firms worldwide, responding to the threat of government legislation or to concerns raised by their own consumers or shareholders, are undertaking initiatives to reduce their carbon footprint. It is the conventional thinking that such initiatives will require either capital investments or a switch to more expensive sources of energy or input material. In this paper, we show that firms could effectively reduce their carbon emissions without significantly increasing their costs by making only operational adjustments and by collaborating with other members of their supply chain. We describe optimization models that can be used by firms to support operational decision making and supply chain collaboration, while taking into account carbon emissions. We analyze the effect of different emission regulations, including strict emission caps, taxes on emissions, cap-and-offset, and cap-and-trade, on supply chain management decisions. In particular, we show that the presence of emission regulation can significantly increase the value of supply chain collaboration.
01 Jan 1989
TL;DR: A critical review of influential closed-loop supply chain research that takes a business economics perspective can be found in this article, where the authors offer a critical review and analysis of influential CLSC research.
Abstract: Research in closed-loop supply chains (CLSCs) has grown rapidly over the last 10 years. The authors offer a critical review of influential CLSC research that takes a business economics perspective. Much of the research was inspired by practice-driven thoughtpieces, and this helped to keep research focused on relevant issues. However, CLSC research has several assumptions, such as perfect substitution between new and remanufactured products that risk becoming institutionalized. There is a strong need to carefully examine current industrial practice so that research remains focused on relevant problems. Deeper understanding of consumer perceptions of remanufactured products, product diffusion, and valuation of returned products are needed for the field to continue to add insights into developing sustainable economies.
TL;DR: This survey surveys different technologies and methodologies for indoor and outdoor localization with an emphasis on indoor methodologies and concepts and discusses different localization-based applications, where the location information is critical to estimate.
Abstract: The availability of location information has become a key factor in today's communications systems allowing location based services. In outdoor scenarios, the mobile terminal position is obtained with high accuracy thanks to the global positioning system (GPS) or to the standalone cellular systems. However, the main problem of GPS and cellular systems resides in the indoor environment and in scenarios with deep shadowing effects where the satellite or cellular signals are broken. In this paper, we survey different technologies and methodologies for indoor and outdoor localization with an emphasis on indoor methodologies and concepts. Additionally, we discuss in this review different localization-based applications, where the location information is critical to estimate. Finally, a comprehensive discussion of the challenges in terms of accuracy, cost, complexity, security, scalability, etc. is given. The aim of this survey is to provide a comprehensive overview of existing efforts as well as auspicious and anticipated dimensions for future work in indoor localization techniques and applications.