| Project/Area Number |
08680472
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
社会システム工学
|
|---|
| Research Institution | OSAKA INSTITUTE OF TECHNOLOGY |
|---|
Principal Investigator |
ICHIMORI Tetsuo OSAKA INSTITUTE OF TECHNOLOGY,FACULTY OF INFORMATION SCIENCE,PROFESSOR, 情報科学部, 教授 (20151483)
|
|---|
| Project Period (FY) |
1996 – 1997
|
| Project Status |
Completed (Fiscal Year 1997)
|
| Budget Amount *help |
¥1,400,000 (Direct Cost: ¥1,400,000)
Fiscal Year 1997: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 1996: ¥600,000 (Direct Cost: ¥600,000)
|
|---|
| Keywords | SEARCH / SEARCHING EFFORT / ALGORITHM / COMPLEXITY / TWO-RESOURCE / MULTI-RESOURCE |
|---|
| Research Abstract |
The study was motivated by the fact that it is helpful to find and save victims of accidents efficiently. Since finding victims of accidents is equivalent to finding faults in large scaled systems, our study is also helpful to many applicatons. In the study, we considered the allocation of multiple searching efforts, or resources. For this multi-resource allocation problem, we are developing an algorithm while we developed an efficient algorithm for two-resource allocation. The paper treating two resources was published and has appeared in the Journal of the Operations Research Society of Japan in December 1997. And one applicaton of the study was reported in the Third ISSAT International Conference on Reliability and Quality in Design held in March 1997 at Anaheim California, U.S.A.
Though the pulished papers has mainly discussed the allocation problem of two resouces, it is desired to continue this study and to publish other articles treating mutiple resources.
|
