Presentation	2007/3/7 Comparison of Traversal Strategies in Theme Parks YASUSHI YANAGITA, KEIJI SUZUKI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	The theme park problem is one of exercises to research on the Mass- User support of applying social problem and it is suggested as the problem that simplified on a large scale dynamic scheduling. In this paper, it is suggested the theme park models which used the general idea of the complicated networks such as small-world networks and scale-free networks to come true the complicated environment such as the real problems. It is compared with the effectiveness and efficiency of the models and the strategies to introduce the multi-agents which is applied the traversal strategies that can support the various situation to coordinate the institutions using instantly. In addition, It is shown that possibility of the Mass- User support by the traversal strategies for large-scale personal schedule adjustment in the suggestion model.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)
Paper #	AI2006-32
Date of Issue

Conference Information
Committee	AI
Conference Date	2007/3/7(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)	Comparison of Traversal Strategies in Theme Parks
Sub Title (in English)
Keyword(1)
1st Author's Name	YASUSHI YANAGITA
1st Author's Affiliation	Future University-Hakodate()
2nd Author's Name	KEIJI SUZUKI
2nd Author's Affiliation	Future University-Hakodate:CREST, JST
Date	2007/3/7
Paper #	AI2006-32
Volume (vol)	vol.106
Number (no)	585
Page	pp.pp.-
#Pages	8
Date of Issue