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. |
|
An Initial Assignment Method for Tasks Assignment and Routing Problem of Autonomous Distributed AGVs Yusuke MORIHIRO Toshiyuki MIYAMOTO Sadatoshi KUMAGAI Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E90-A No.11 pp.2465-2471 Publication Date: 2007/11/01 Online ISSN: 1745-1337 DOI: 10.1093/ietfec/e90-a.11.2465 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(307KB)>>
Summary: This paper discusses an on-line Tasks Assignment and Routing Problem (TARP) for Autonomous Transportation Systems (ATSs) in manufacturing systems. The TARP results in a constrained version of the Pickup and Delivery Problem with Time Windows (PDPTW). As an approach to this problem, a cooperative algorithm with autonomous distributed agents has been proposed. The algorithm is able to plan deadlock-free routes even though the buffer capacity is less, but includes reformability at the point that computation time of that case increases drastically. This paper proposes an initial task assignment method to reduce computation time on planning routes. Results of computational experiments show effectiveness of the proposed method. | ||||||||||
| ||||||||||
