| タイトル | Dynamic Controllability and Dispatchability Relationships |
| 本文（外部サイト） | http://hdl.handle.net/2060/20140008604 |
| 著者（英） | Morris, Paul Henry |
| 著者所属（英） | NASA Ames Research Center |
| 発行日 | 2014-05-19 |
| 言語 | eng |
| 内容記述 | An important issue for temporal planners is the ability to handle temporal uncertainty. Recent papers have addressed the question of how to tell whether a temporal network is Dynamically Controllable, i.e., whether the temporal requirements are feasible in the light of uncertain durations of some processes. We present a fast algorithm for Dynamic Controllability. We also note a correspondence between the reduction steps in the algorithm and the operations involved in converting the projections to dispatchable form. This has implications for the complexity for sparse networks. |
| NASA分類 | Computer Systems; Mathematical and Computer Sciences (General) |
| レポートNO | ARC-E-DAA-TN13382 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/69831 |
