Solving Fully-Observable Non-deterministic Planning Problems via Translation into a General Game-Reference-Cited by-同舟云学术

Solving Fully-Observable Non-deterministic Planning Problems via Translation into a General Game

Published:2009 Issue: Volume: Page:1-8
ISSN:0302-9743
Container-title:KI 2009: Advances in Artificial Intelligence
language:
Short-container-title:

Author:

Kissmann Peter,Edelkamp Stefan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-04617-9_1

Reference17 articles.

1. Bakera, M., Edelkamp, S., Kissmann, P., Renner, C.D.: Solving μ-calculus parity games by symbolic planning. In: MoChArt 2008. LNCS (LNAI), vol. 5348, pp. 15–33. Springer, Heidelberg (2009)

2. Bercher, P., Mattmüller, R.: A planning graph heuristic for forward-chaining adversarial planning. In: ECAI, pp. 921–922 (2008)

3. Bertoli, P., Cimatti, A., Pistore, M., Roveri, M., Traverso, P.: MBP: A model based planner. In: IJCAI Workshop on Planning under Uncertainty and Incomplete Information, pp. 93–97 (2001)

4. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 35(8), 677–691 (1986)

5. Bryce, D., Buffet, O.: 6th International Planning Competition: Uncertainty Part (2008)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis;Journal of Artificial Intelligence Research;2018-03-20

2. Synthesizing Controllers: On the Correspondence Between LTL Synthesis and Non-deterministic Planning;Advances in Artificial Intelligence;2018

3. Fast strong planning for fully observable nondeterministic planning problems;Annals of Mathematics and Artificial Intelligence;2016-07-09

4. Synthesis of Cost-Optimal Strong Plans in Non-Deterministic Domains;International Journal on Artificial Intelligence Tools;2015-12

5. Optimizing Liner Shipping Fleet Repositioning Plans;Operations Research/Computer Science Interfaces Series;2015