Presentation 2003/1/22
A Study on Coordination Scheduling Algorithm for Theme Park Problem with Multiagent
Hidenori KAWAMURA, Koichi KURUMATANI, Azuma OHUCHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we propose "theme park problem" as one of test bet problem with huge agents' scheduling problem. Especially, we develop typical Mass-User support with coordination scheduling algorithm, and investigate the possibility of mass-user support based on multiagent computer simulations.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Multiagent / Mass-User support / Scheduling Problem
Paper # AI2002-27
Date of Issue

Conference Information
Committee AI
Conference Date 2003/1/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Study on Coordination Scheduling Algorithm for Theme Park Problem with Multiagent
Sub Title (in English)
Keyword(1) Multiagent
Keyword(2) Mass-User support
Keyword(3) Scheduling Problem
1st Author's Name Hidenori KAWAMURA
1st Author's Affiliation Hokkaido University()
2nd Author's Name Koichi KURUMATANI
2nd Author's Affiliation National Institute of Advanced Industrial Science and Technology
3rd Author's Name Azuma OHUCHI
3rd Author's Affiliation Hokkaido University
Date 2003/1/22
Paper # AI2002-27
Volume (vol) vol.102
Number (no) 613
Page pp.pp.-
#Pages 6
Date of Issue