Title:
DEVICE FOR PREPARING SCHEDULE BASED ON GEOGRAPHICAL INFORMATION
Document Type and Number:
Japanese Patent JP3860867
Kind Code:
B2
Abstract:
PROBLEM TO BE SOLVED: To achieve the maximum result through the shortest moving path within a prescribed time when a visitor visits a prescribed area by correcting a visitor condition based on the evaluation of a schedule evaluating means for a schedule based on the shortest path specified by a neural network.
SOLUTION: A schedule evaluating means 7 inputs the distance of the shortest path between each object to visited from a map 9 and a neural network 6, a time required for each object from an object condition data base 4, and the waiting time, moving speed, and movable distance of a visitor from a visitor condition data base 5 or a user input, and evaluates a situation when the visitor acts along the shortest path prepared by the neural network 6. A user corrects a schedule based on the shortest distance by a schedule correcting means 8. Finally, a schedule 10 adapted to the condition of the visitor for achieving the maximum result in an area being the destination of visit is outputted.
Inventors:
Koichi Goto
Application Number:
JP28417196A
Publication Date:
December 20, 2006
Filing Date:
October 25, 1996
Export Citation:
Assignee:
Nomura Research Institute, Ltd.
International Classes:
G06F15/18; B65G61/00; G06F19/00; G06N3/00; G06Q10/00; G06Q10/04; G06Q10/06; G06Q10/10; G06Q30/02; G06Q50/00; G06Q50/30; G06T1/00; G06T11/60; (IPC1-7): G06F17/60; G06F15/18; G06T1/00
Domestic Patent References:
| JP6273181A | ||||
| JP2304587A |
Other References:
Mobile Media Magazine,株式会社シーメディア,1996年 4月26日,第15巻,p.29-40(特にp.35参照)
日経CG,日経BP社,1992年12月 1日,第75号,p.127-132
事務管理,株式会社日刊工業新聞社,1991年 1月 1日,第30巻,第1号,p.15-19
日経CG,日経BP社,1992年12月 1日,第75号,p.127-132
事務管理,株式会社日刊工業新聞社,1991年 1月 1日,第30巻,第1号,p.15-19
Attorney, Agent or Firm:
Kazuo Sato
Masamitsu Sato
Yoneyama Katsumi
Masashi Kurose
Masamitsu Sato
Yoneyama Katsumi
Masashi Kurose