Article

Planning with a language for extended goals

Authors:

Paolo TraversoAuthors Info & Claims

Eighteenth national conference on Artificial intelligence

Pages 447 - 454

Published: 28 July 2002 Publication History

Abstract

Planning for extended goals in non-deterministic domains is one of the most significant and challenging planning problems. In spite of the recent results in this field, no work has proposed a language designed specifically for planning. As a consequence, it is still impossible to specify and plan for several classes of goals that are typical of real world applications, like for instance "try to achieve a goal whenever possible", or "if you fail to achieve a goal, recover by trying to achieve something else".We propose a new goal language that allows for capturing the intended meaning of these goals. We give a semantics to this language that is radically different from the usual semantics for extended goals, e.g., the semantics for LTL or CTL. Finally, we implement an algorithm for planning for extended goals expressed in this language, and experiment with it on a parametric domain.

References

[1]

Aiello, L. C.; Cesta, A.; Giunchiglia, E.; Pistore, M.; and Traverso, P. 2001. Planning and verification techniques for the high level programming and monitoring of autonomous robotic devices. In Proceedings of the ESA Workshop on On Board Autonoy. ESA Press.

[2]

Bacchus. F., and Kabanza, F. 2000. Using temporal logic to express search control knowledge for planning. Artificial Intelligence 116(1-2):123-191.

Digital Library

[3]

Bacchus, F.; Boutilier, C.; and Grove, A. 1996. Rewarding Behaviors. In Proc. of AAAI'96. AAAI-Press.

Digital Library

[4]

Bertoli, P.; Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2001. MBP: a Model Based Planner. In Proc. of IJCAI'01 workshop on Planning under Uncertainty and Incomplete Information.

[5]

Bertoli, P.; Cimatti, A.; Pistore, M.; and Traverso., P. 2002. Plan validation for extended goals under partial observability (preliminary report). In Proc. of the AIPS'02 Workshop on Planning via Model Checking.

[6]

Burch, J. R.; Clarke, E. M.; McMillan, K. L.; Dill, D. L.; and Hwang, L. J. 1992. Symbolic Model Checking: 10²⁰ States and Beyond. Information and Computation 98(2):142-170.

Digital Library

[7]

de Giacomo, G., and Vardi, M. 1999. Automata-theoretic approach to planning with temporally extended goals. In Proc. of ECP'99.

Digital Library

[8]

Emerson, E. A. 1990. Temporal and modal logic. In van Leeuwen, J., ed., Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics. Elsevier.

Digital Library

[9]

Jensen, R. M,; Veloso, M. M.; and Bowling, M. H. 2001. OBDD-based optimistic and strong cyclic adversarial planning. In Proc. of ECP'01.

[10]

Kabanza, F.; Barbeau, M.; and St-Denis, R. 1997. Planning control rules for reactive agents. Artificial Intelligence 95(1):67-113.

Digital Library

[11]

Pistore, M., and Traverso, P. 2001. Planning as Model Checking for Extended Goals in Non-deterministic Domains. In Proc. of IJCAI'01. AAAI Press.

Digital Library

[12]

Pistore, M.; Bettin, R.; and Traverso, P. 2001. Symbolic techniques for planning with extended goals in nondeterministic domains. In Proc. of ECP'01.

[13]

Spalazzi, L., and Traverso, P. 2000. A Dynamic Logic for Acting, Sensing and Planning. Journal of Logic and Computation 10(6):787-821.

[14]

Stephan, W., and Biundo, S. 1993. A New Logical Framework for Deductive Planning. In Proc. of IJCAI'93.

[15]

Vardi, M. Y. 1995. An automata-theoretic approach to fair realizability and synthesis. In Proc. of CAV'95.

Digital Library

Cited By

Islam RZang HGoyal ALamb AKawaguchi KLi XLaroche RBengio YCombes RKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Discrete factorial representations as an abstraction for goal conditioned RLProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3600551(3885-3899)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3600551
Camacho ATriantafillou EMuise CBaier JMcIlraith SSingh SMarkovitch S(2017)Non-deterministic planning with temporally extended goalsProceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3298023.3298108(3716-3724)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3298023.3298108
Chrpa LLipovetzky NSardina S(2017)Handling non-local dead-ends in agent planning programsProceedings of the 26th International Joint Conference on Artificial Intelligence10.5555/3171642.3171781(971-978)Online publication date: 19-Aug-2017
https://dl.acm.org/doi/10.5555/3171642.3171781
Show More Cited By

Index Terms

Planning with a language for extended goals

Recommendations

Planning for temporally extended goals

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,...
Planning for temporally extended goals
AAAI'96: Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2

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 as they do not allow us ...
Search control in planning for temporally extended goals
ICAPS'05: Proceedings of the Fifteenth International Conference on International Conference on Automated Planning and Scheduling

Current techniques for reasoning about search control knowledge in AI planning, such as those used in TLPlan, TALPlanner, or SHOP2, assume that search control knowledge is conditioned upon and interpreted with respect to a fixed set of goal states. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

Eighteenth national conference on Artificial intelligence

July 2002

1068 pages

ISBN:0262511290

Sponsors

NSF: National Science Foundation
Alberta Informatics Circle of Research Excellence (iCORE)
SIGAI: ACM Special Interest Group on Artificial Intelligence
Naval Research Laboratory: Naval Research Laboratory
AAAI: American Association for Artificial Intelligence
NASA Ames Research Center: NASA Ames Research Center
DARPA: Defense Advanced Research Projects Agency

Publisher

American Association for Artificial Intelligence

United States

Publication History

Published: 28 July 2002

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Islam RZang HGoyal ALamb AKawaguchi KLi XLaroche RBengio YCombes RKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Discrete factorial representations as an abstraction for goal conditioned RLProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3600551(3885-3899)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3600551
Camacho ATriantafillou EMuise CBaier JMcIlraith SSingh SMarkovitch S(2017)Non-deterministic planning with temporally extended goalsProceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3298023.3298108(3716-3724)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3298023.3298108
Chrpa LLipovetzky NSardina S(2017)Handling non-local dead-ends in agent planning programsProceedings of the 26th International Joint Conference on Artificial Intelligence10.5555/3171642.3171781(971-978)Online publication date: 19-Aug-2017
https://dl.acm.org/doi/10.5555/3171642.3171781
Lemos ADaniel FBenatallah B(2015)Web Service CompositionACM Computing Surveys10.1145/283127048:3(1-41)Online publication date: 9-Dec-2015
https://dl.acm.org/doi/10.1145/2831270
Bucchiarone AMezzina CPistore MGnesi SCollet PSchmid K(2013)CAptLangProceedings of the 7th International Workshop on Variability Modelling of Software-Intensive Systems10.1145/2430502.2430519(1-5)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2430502.2430519
Bucchiarone AMarconi AMezzina CPistore MRaik H(2013)On-the-Fly Adaptation of Dynamic Service-Based SystemsProceedings of the 11th International Conference on Service-Oriented Computing - Volume 827410.1007/978-3-642-45005-1_11(146-161)Online publication date: 2-Dec-2013
https://dl.acm.org/doi/10.1007/978-3-642-45005-1_11
Huang WWen ZJiang YPeng H(2009)Structured plans and observation reduction for plans with contextsProceedings of the 21st International Joint Conference on Artificial Intelligence10.5555/1661445.1661722(1721-1727)Online publication date: 11-Jul-2009
https://dl.acm.org/doi/10.5555/1661445.1661722
Shaparau DPistore MTraverso P(2008)Fusing procedural and declarative planning goals for nondeterministic domainsProceedings of the 23rd national conference on Artificial intelligence - Volume 210.5555/1620163.1620225(983-990)Online publication date: 13-Jul-2008
https://dl.acm.org/doi/10.5555/1620163.1620225
Agarwal VChafle GMittal SSrivastava BShyamasundar R(2008)Understanding approaches for web service composition and executionProceedings of the 1st Bangalore Annual Compute Conference10.1145/1341771.1341773(1-8)Online publication date: 18-Jan-2008
https://dl.acm.org/doi/10.1145/1341771.1341773
Pietro IPagliarecci FSpalazzi LMarconi APistore M(2008)Semantic Web Service Selection at the Process-LevelProceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 0110.1109/WIIAT.2008.237(605-611)Online publication date: 9-Dec-2008
https://dl.acm.org/doi/10.1109/WIIAT.2008.237
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

Media

Figures

Other

Tables

View Table of Contents