Probabilistic Planning in the Graphplan Framework-Reference-Cited by-同舟云学术

Probabilistic Planning in the Graphplan Framework

Published:2000 Issue: Volume: Page:319-332
ISSN:0302-9743
Container-title:Recent Advances in AI Planning
language:
Short-container-title:

Author:

Blum Avrim L.,Langford John C.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10720246_25

Reference19 articles.

1. Anderson, C.R., Smith, D.E., Weld, D.S.: Conditional effects in Graphplan. unpublished manuscript (1997)

2. Boutilier, C., Brafman, R.I., Geib, C.: Structured reachability analysis for Markov Decision Processes. In: Proceedings of the Fourteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI 1998), pp. 24–32 (1998)

3. Boutilier, C., Dearden, R., Goldszmidt, M.: Exploiting structure in policy construction. In: IJCAI 1995, Montreal, pp. 1104–1111 (1995)

4. Blum, A., Furst, M.: Fast planning through planning graph analysis. Artificial Intelligence 90, 281–300 (1997)

5. Bylander, T.: Linear programming heuristic for optimal planning. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence (1997)

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

1. Spacecraft self-service management connotation;High-Reliability Autonomous Management Systems for Spacecraft;2023

2. Learning to Solve Sequential Planning Problems Without Rewards;Lecture Notes in Networks and Systems;2022-10-13

3. Transition Graph Analysis of Sliding Tile Puzzle Heuristics;Recent Advances in Soft Computing and Cybernetics;2021

4. Relational affordances for multiple-object manipulation;Autonomous Robots;2017-05-03

5. Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes;Acta Informatica;2016-02-01