IEICE TRANSACTIONS on Fundamentals
A Cooperative Algorithm for Autonomous Distributed Vehicle Systems with Finite Buffer Capacity
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.11 pp.3036-3044
- Publication Date
- 2005/11/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietfec/e88-a.11.3036
- 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
Toshiyuki MIYAMOTO, Norihiro TSUJIMOTO, Sadatoshi KUMAGAI, "A Cooperative Algorithm for Autonomous Distributed Vehicle Systems with Finite Buffer Capacity" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 11, pp. 3036-3044, November 2005, doi: 10.1093/ietfec/e88-a.11.3036.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.11.3036/_p
Copy
@ARTICLE{e88-a_11_3036,
author={Toshiyuki MIYAMOTO, Norihiro TSUJIMOTO, Sadatoshi KUMAGAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Cooperative Algorithm for Autonomous Distributed Vehicle Systems with Finite Buffer Capacity},
year={2005},
volume={E88-A},
number={11},
pages={3036-3044},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e88-a.11.3036},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - A Cooperative Algorithm for Autonomous Distributed Vehicle Systems with Finite Buffer Capacity
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3036
EP - 3044
AU - Toshiyuki MIYAMOTO
AU - Norihiro TSUJIMOTO
AU - Sadatoshi KUMAGAI
PY - 2005
DO - 10.1093/ietfec/e88-a.11.3036
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2005
AB - 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.
ER -
English
