Declarative Approach to AGVS Modeling and Cyclic Scheduling

Abstract:

The paper presents constraint satisfaction problem driven approach to analytical solution of the cyclic scheduling problem in the Flexible Manufacturing System (FMS) producing multi-type parts where for material handling are used the Automated Guide Vehicles Systems (AGVS). Finding the conditions guaranteeing the AGVs deadlock-free and collision-free movement policy is the aim of our researches. The AGVs co-sharing the common parts of the transportation route while executing repetitive processes, i.e. being assigned to AGVs passing along machines in a cyclic way, can be modeled in terms of Cyclic Concurrent Process Systems (CCPS). Schedulability analysis for a given CCPS answers the question whether a cyclic schedule exists or not. The paper suggests approach for schedulability analysis of multimodal processes representing real manufacturing employing the declarative modeling.

• Periodical: Applied Mechanics and Materials (Volume 421)
• Pages: 573-578
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.421.573
• Online since: September 2013
• Authors: Grzegorz Bocewicz, Muszyński Wojciech, Zbigniew Banaszak
• Keywords: Decision Support System (DSS), DEVS, Discrete Event Simulation, Environmental Science

References

[1] G. Alpan, M.A. Jafari: Dynamic analysis of timed Petri nets: a case of two processes and a shared resource. IEEE Trans. on Robotics and Automation, Vol. 13, No. 3 (1997) 338-346.

DOI: 10.1109/70.585897

[2] M., Beaverstock, A. Greenwood, E. Lavery, W. Nordgren: Applied Simulation, Modeling and Analysis usinf Flexsim, Flexsim Software Products, Inc. Orem, USA (2011).

[3] G. Bocewicz, Z. Banaszak, R. Wójcik: Design of admissible schedules for AGV systems with constraints: a logic-algebraic approach. Lecture Notes in Artificial Intelligence 4496, Springer-Verlag (2007) 578–587.

DOI: 10.1007/978-3-540-72830-6_60

[4] G. Bocewicz, R. Wójcik, Z. Banaszak: A reference model of AGVs cyclic scheduling problems: declarative approach. In: Information Systems Architecture and Technology – System Analysis Approach to the Design, Control and Decision Support,  Świątek J., et al. (Eds. ), Wrocław (2011).

[5] M.A. Lawley, S.A. Reveliotis, P.M. Ferreira: A correct and scalable deadlock avoidance policy for flexible manufacturing systems. IEEE Trans. on Robotics and Automation, Vol. 14, No. 5 (1998) 796-809.

DOI: 10.1109/70.720355

[6] E. Levner, V. Kats, D. Alcaide, L. Pablo, T.C.E. Cheng: Complexity of cyclic scheduling problems: A state-of-the-art survey. Computers and Industrial Engineering, Vol. 59,  Issue 2, (2010) 352-361.

DOI: 10.1016/j.cie.2010.03.013

[7] M. L. Pinedo: Planning and scheduling in manufacturing and services. Springer-Verlag, New York (2005).

[8] M. Polak, P. Majdzik, Z. Banaszak, R. Wójcik: The performance evaluation tool for automated prototyping of concurrent cyclic processes. Fundamenta Informaticae. ISO Press, 60(1-4), (2004) 269–289.

[9] P. Sitek, J. Wikarek, A Declarative Framework for Constrained Search Problems. New Frontiers in Applied Articial Intelligence, Nguyen, NT., et al. (Eds. ), Lecture Notes in Artificial Intelligence LNAI, Vol. 5027, Springer-Verlag, 2008, 728-737.

DOI: 10.1007/978-3-540-69052-8_76

[10] R. Wójcik: Constraint programming approach to designing conflict-free schedules for repetitive manufacturing processes. Digital enterprise technology. Perspectives and future challenges. Ed. by Pedro F. Cunha, Paul G. Maropoulos. New York, Springer, (2007).

DOI: 10.1007/978-0-387-49864-5_31

[11] T. Von Kampmeyer: Cyclic scheduling problems, Ph.D. Dissertation, Fachbereich Mathematik/ Informatik, Universität Osnabrück, (2006).