移動体システムのトランザクションモデルと評価

• Item type: National Convention(1)
• 公開日: 1996-03-06
• タイトル: 移動体システムのトランザクションモデルと評価
• タイトル / 言語: en
• タイトル: Transactional Model and Evalution of Vehicle System
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_5794
• 資源タイプ: conference paper
• 著者所属: 東京電機大学
• 著者所属: 東京電機大学
• 著者所属(英): en
• 著者所属(英): Tokyo Denki University
• 著者所属(英): en
• 著者所属(英): Tokyo Denki University
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: There are various kinds of systems where something is moving, e. g. motor cars in roads, packets in network, automated guided vehicles in factories, and workflows in offices. A vehicle system is a model obtained by abstracting these systems, which is composed of vehicles moving in the space. The space is considered to be composed of units named space objects. Each object denotes some parts of paths. The objects are further partitioned into smaller objects. An object denoting a path is represented by a sequence of objects, each of which denotes a put of the path. Each higher-level object denotes more abstract and broader area than the lower-level ones. Takizawa and Hmada discuss a broad path decision where each vehicle v first finds a broader path composed of higher-level objects to the destination, and then the path is so detailed as to include lower-level objects as v is approaching to the destination. Since each object o can admit a limited number of vehicles, some vehicle cannot pass o or it takes longer time if o is congested. There are two approaches to resolving conflict among requests on o from multiple vehicles, i. e. scheduling and dynamic resolution. In the scheduling method, the vehicle movement is decided what time and what objects each vehicle v would pass before v departs. In vehicle systems including large number and various kinds of vehicles in a complex space, it consumes much computation to make up the schedule. In the resolution method, each vehicle v tries to pass o any time v would like to pass o. In this paper, we adopt the resolution scheme where v locks o before passing o. If the lock request is accepted, v can pass o. We discuss three schemes for releasing objects with respect to when vehicles release objects, i. e. open, semi-open, and close ones. In addition, we discuss how to relate the releasing schemes with the types of vehicles. In section 2, we present a system model. In section 3, we present synchronization schemes by which the vehicles lock and release objects. In section 4, we present the evaluation of the synchronization schemes.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00349328
• 書誌情報: 全国大会講演論文集; 巻 第52回, 号 データベース, p. 239-240, 発行日 1996-03-06
• 出版者 / 言語: ja
• 出版者: 情報処理学会