2013/10/23 by Jerome Lang, Lang, Jerome, Bruno Zanuttini +1
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.AI #cs.LO
paper · pdf · doi:10.48550/arxiv.1310.6429
10 pages, Contributed talk at TARK 2013 (arXiv:1310.6382) http://www.tark.org
arxiv created 2013/10/23 · arxiv updated 2013/10/28
Knowledge-based programs (KBPs) are high-level protocols describing the course of action an agent should perform as a function of its knowledge. The use of KBPs for expressing action policies in AI planning has been surprisingly overlooked. Given that to each KBP corresponds an equivalent plan and vice versa, KBPs are typically more succinct than standard plans, but imply more on-line computation time. Here we make this argument formal, and prove that there exists an exponential succinctness gap between knowledge-based programs and standard plans. Then we address the complexity of plan existence. Some results trivially follow from results already known from the literature on planning under incomplete knowledge, but many were unknown so far.