Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
A Cooperative Algorithm for Autonomous Distributed Vehicle Systems with Finite Buffer Capacity Toshiyuki MIYAMOTO Norihiro TSUJIMOTO Sadatoshi KUMAGAI Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E88-A No.11 pp.3036-3044 Publication Date: 2005/11/01 Online ISSN: DOI: 10.1093/ietfec/e88-a.11.3036 Print ISSN: 0916-8508 Type of Manuscript: Special Section PAPER (Special Section on Concurrent/Hybrid Systems: Theory and Applications) Category: Keyword: PDPTW, vehicle routing, autonomous distributed systems, intelligent manufacturing systems, multi agent, Full Text: PDF(270.2KB)>>
Summary: Recently, there are so many researches on Autonomous Distributed Manufacturing Systems (ADMSs), where cooperation among agents is used to solve problems, such as the scheduling problem and the vehicle routing problem. We target ADMSs where an ADMS consists of two sub-systems: a Production System (PS) and an Autonomous Transportation System (ATS). This paper discusses an on-line Tasks Assignment and Routing Problem (TARP) for ATSs under conditions of given production schedule and finite buffer capacity. The TARP results in a constrained version of the Pickup and Delivery Problem with Time Windows (PDPTW), and this paper gives a mathematical formulation of the problem. This paper, also, proposes a cooperative algorithm to obtain suboptimal solutions in which no deadlocks and buffer overflows occur. By computational experiments, we will examine the effectiveness of the proposed algorithm. Computational experiments show that the proposed algorithm is able to obtain efficient and deadlock-free routes even though the buffer capacity is less. | ||||||||||
| ||||||||||
