Design of Admissible Schedules for AGV Systems with Constraints: A Logic-Algebraic Approach

  • Authors:
  • Grzegorz Bocewicz;Robert Wójcik;Zbigniew Banaszak

  • Affiliations:
  • Deptartament of Computer Science and Management, Technical University of Koszalin, 75-453 Koszalin, Poland;Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, 50-372 Wrocław, Poland;Deptartament of Computer Science and Management, Technical University of Koszalin, 75-453 Koszalin, Poland

  • Venue:
  • KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.