%0 Journal Article %1 citeulike:10379156 %A Bacchus, Fahiem %A Kabanza, Froduald %D 1998 %I Springer Netherlands %J Annals of Mathematics and Artificial Intelligence %K artificial, automatic, control, intelligence, planning, schedule, system %N 1 %P 5--27 %R 10.1023/A:1018985923441 %T Planning for temporally extended goals %U http://dx.doi.org/10.1023/A:1018985923441 %V 22 %X In planning, goals have traditionally been viewed as specifying a set of desirable final states. Any plan that transforms the current state to one of these desirable states is viewed to be correct. Goals of this form are limited in what they can specify, and they also do not allow us to constrain the manner in which the plan achieves its objectives. We propose viewing goals as specifying desirable sequences of states, and a plan to be correct if its execution yields one of these desirable sequences. We present a logical language, a temporal logic, for specifying goals with this semantics. Our language is rich and allows the representation of a range of temporally extended goals, including classical goals, goals with temporal deadlines, quantified goals (with both universal and existential quantification), safety goals, and maintenance goals. Our formalism is simple and yet extends previous approaches in this area. We also present a planning algorithm that can generate correct plans for these goals. This algorithm has been implemented, and we provide some examples of the formalism at work. The end result is a planning system which can generate plans that satisfy a novel and useful set of conditions.

@article{citeulike:10379156, abstract = {{In planning, goals have traditionally been viewed as specifying a set of desirable final states. Any plan that transforms the current state to one of these desirable states is viewed to be correct. Goals of this form are limited in what they can specify, and they also do not allow us to constrain the manner in which the plan achieves its objectives. We propose viewing goals as specifying desirable sequences of states, and a plan to be correct if its execution yields one of these desirable sequences. We present a logical language, a temporal logic, for specifying goals with this semantics. Our language is rich and allows the representation of a range of temporally extended goals, including classical goals, goals with temporal deadlines, quantified goals (with both universal and existential quantification), safety goals, and maintenance goals. Our formalism is simple and yet extends previous approaches in this area. We also present a planning algorithm that can generate correct plans for these goals. This algorithm has been implemented, and we provide some examples of the formalism at work. The end result is a planning system which can generate plans that satisfy a novel and useful set of conditions.}}, added-at = {2012-03-02T03:39:18.000+0100}, author = {Bacchus, Fahiem and Kabanza, Froduald}, biburl = {https://www.bibsonomy.org/bibtex/203bb55040aff666ece4629d6ca20238e/baby9992006}, citeulike-article-id = {10379156}, citeulike-linkout-0 = {http://dx.doi.org/10.1023/A:1018985923441}, citeulike-linkout-1 = {http://www.springerlink.com/content/rl3u728q97l55350}, day = 1, doi = {10.1023/A:1018985923441}, interhash = {649931f6d6f37a976b1680ba047359d0}, intrahash = {03bb55040aff666ece4629d6ca20238e}, issn = {10122443}, journal = {Annals of Mathematics and Artificial Intelligence}, keywords = {artificial, automatic, control, intelligence, planning, schedule, system}, month = feb, number = 1, pages = {5--27}, posted-at = {2012-02-23 08:16:40}, priority = {2}, publisher = {Springer Netherlands}, timestamp = {2012-03-02T03:39:21.000+0100}, title = {{Planning for temporally extended goals}}, url = {http://dx.doi.org/10.1023/A:1018985923441}, volume = 22, year = 1998 }