DocumentCode :
1595945
Title :
Efficiently Eliminate Temporal Conflicts in Operation Plan
Author :
Tang, Luo-hao ; Zhu, Cheng ; Zhang, Wei-Ming ; Liu, Zhong
Author_Institution :
Sci. & Technol. on Inf. Syst. Eng. Lab., Nat. Univ. of Defense Technol., Changsha, China
fYear :
2012
Firstpage :
817
Lastpage :
820
Abstract :
Time is critical to military operations and it is of great importance to guarantee temporal consistence of the operational plans. However, there always exist lots of temporal conflicts in a plan. To manage these temporal conflicts manually is irritated, especially when the size of a plan is large and many kinds of complex temporal constraints are involved. This paper presents a method to check and restore the temporal consistency of plan automatically. The STN is used to represent and reason temporal constraints and a conflict resolution method based on constraint relaxation is presented. We prove that the proposed method can eliminate all of temporal conflicts in polynomial time. Results of the experiment demonstrate the efficiency of the proposed method.
Keywords :
computational complexity; inference mechanisms; military computing; planning (artificial intelligence); STN; complex temporal constraints; conflict resolution method; constraint relaxation; military operations; operation plan; polynomial time; simple temporal network; temporal conflict detection; temporal conflict elimination; temporal conflict resolution; temporal consistence; Algorithm design and analysis; Bridges; Complexity theory; Computational efficiency; Detection algorithms; Planning; Polynomials; Operation planning; STN; temporal conflict detection and resolution;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent System Design and Engineering Application (ISDEA), 2012 Second International Conference on
Conference_Location :
Sanya, Hainan
Print_ISBN :
978-1-4577-2120-5
Type :
conf
DOI :
10.1109/ISdea.2012.628
Filename :
6173331
Link To Document :
بازگشت