Logic-algebraic method based and constraints programming driven approach to AGVs scheduling Online publication date: Sun, 08-Feb-2009
by Grzegorz Bocewicz, Irena Bach, Zbigniew A. Banaszak
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 3, No. 1, 2009
Abstract: The subject matter of the study is the automated guided vehicle (AGV) operation synchronisation mechanisms in flexible manufacturing systems. The processes examination has to guarantee the collision-free and deadlock-free AGVs flow. 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. The inference engine applied in the LAM is then easily implemented in a kind of constraint logic programming language. Proposed approach provides the framework allowing one to take into account both distinct, and imprecise data, in a unified way.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook