A new algorithm for generation of dispatchable networks with temporal constraints

In most real-world planning domains, it is important to have flexible executive time against uncertainty and disturbance of environment. Execution time can be propagated from dispatchable Simple Temporal Network (STN), which is obtained from filtering the distance graph of STN. To minimise the execution latency, computation of dispatchable STN should be improved. In the previous works, all-pairs shortest paths (APSP) algorithm is used to compute distance graph of STN, so the redundant constraints should be processed in the following filtering process. In this paper, an improved algorithm named Dispatchabile Partial Path (DPP) algorithm, which uses the P³C algorithm to replace APSP and compute the shortest distance of vertices, is presented. To ensure the correctness of dispatchable STN, triangulation uses vertices ordering sorted by execute time. The filtering process is also simplified by time-sorting vertices. Experimental evidence confirms that the DPP algorithm outperforms previous algorithms based on APSP.