Routing Autonomous Vehicles in the Improving Initial Task Assignment and Avoiding Deadlock Method

Yusuke MORIHIRO  Toshiyuki MIYAMOTO  Sadatoshi KUMAGAI 

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences  Vol.E91-A  No.11  pp.3229-3236
Publication Date: 2008/11/01
Online ISSN: 1745-1337
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Concurrent/Real-time and Hybrid Systems: Theory and Applications)
Category: 
Keyword: 
PDPTWvehicle routingautonomous distributed systemsintelligent manufacturing systemsmulti agent

Full Text: PDF(455.7KB)


Summary: 
This paper discusses an on-line Tasks Assignment and Routing Problem (TARP) for Autonomous Transportation Systems (ATSs) in manufacturing systems. The TARP is a constrained version of the Pickup and Delivery Problem with Time Windows (PDPTW). In our former study, a cooperative algorithm, called the triple loop method, with autonomous distributed agents has been proposed. The Improving initial Task Assignment and Avoiding Deadlock method (ITAAD) is a faster algorithm than the triple loop method. In this paper, we propose a new vehicle routing method for the ITAAD. Results of computational experiments show effectiveness of the proposed routing method.