Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width

@article{Palacios2009CompilingUA,
  title={Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width},
  author={H{\'e}ctor Palacios and Hector Geffner},
  journal={J. Artif. Intell. Res.},
  year={2009},
  volume={35},
  pages={623-675}
}
Conformant planning is the problem of finding a sequence of actions for achieving a goal in the presence of uncertainty in the initial state or action effects. The problem has been approached as a path-finding problem in belief space where good belief representations and heuristics are critical for scaling up. In this work, a different formulation is introduced for conformant problems with deterministic actions where they are automatically converted into classical ones and solved by an off-the… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 90 CITATIONS, ESTIMATED 30% COVERAGE

FILTER CITATIONS BY YEAR

2010
2019

CITATION STATISTICS

  • 22 Highly Influenced Citations

  • Averaged 6 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 24 REFERENCES

Similar Papers

Loading similar papers…