IEICE TRANSACTIONS on Fundamentals
An Initial Assignment Method for Tasks Assignment and Routing Problem of Autonomous Distributed AGVs
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.11 pp.2465-2471
- Publication Date
- 2007/11/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e90-a.11.2465
- Type of Manuscript
- Special Section PAPER (Special Section on Concurrent/Hybrid Systems: Theory and Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yusuke MORIHIRO, Toshiyuki MIYAMOTO, Sadatoshi KUMAGAI, "An Initial Assignment Method for Tasks Assignment and Routing Problem of Autonomous Distributed AGVs" in IEICE TRANSACTIONS on Fundamentals,
vol. E90-A, no. 11, pp. 2465-2471, November 2007, doi: 10.1093/ietfec/e90-a.11.2465.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.11.2465/_p
Copy
@ARTICLE{e90-a_11_2465,
author={Yusuke MORIHIRO, Toshiyuki MIYAMOTO, Sadatoshi KUMAGAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Initial Assignment Method for Tasks Assignment and Routing Problem of Autonomous Distributed AGVs},
year={2007},
volume={E90-A},
number={11},
pages={2465-2471},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e90-a.11.2465},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - An Initial Assignment Method for Tasks Assignment and Routing Problem of Autonomous Distributed AGVs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2465
EP - 2471
AU - Yusuke MORIHIRO
AU - Toshiyuki MIYAMOTO
AU - Sadatoshi KUMAGAI
PY - 2007
DO - 10.1093/ietfec/e90-a.11.2465
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2007
AB - 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.
ER -
English
