Skip to the content

ICAPS

International Conference on Automated Planning and Scheduling

Search for:

Home
Proceedings
Recordings
Conferences
Competitions
Awards
ICAPS Inc.
Calls for Contributions

Facebook
Twitter
YouTube
Email

Categories

recording

Computing Applicability Conditions for Plans with Loops

Post date June 20, 2010

Watch on videolectures.net

Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
Computing Applicability Conditions for Plans with Loops

← Iterative Learning of Weighted Rule Sets for Greedy Search → Influence-based Policy Abstraction for Weakly-coupled DEC-POMDPs

Facebook
Twitter
YouTube
Email

© 2026 ICAPS Inc. (hosted by Gabriele Röger)

To the top ↑ Up ↑