| 書目名稱 | Utilizing Problem Structure in Planning | | 副標(biāo)題 | A Local Search Appro | | 編輯 | J?rg Hoffmann | | 視頻video | http://file.papertrans.cn/945/944704/944704.mp4 | | 叢書名稱 | Lecture Notes in Computer Science | | 圖書封面 |  | | 描述 | .Planning is a crucial skill for any autonomous agent, be it a physically embedded agent, such as a robot, or a purely simulated software agent. For this reason, planning, as a central research area of artificial intelligence from its beginnings, has gained even more attention and importance recently...After giving a general introduction to AI planning, the book describes and carefully evaluates the algorithmic techniques used in fast-forward planning systems (FF), demonstrating their excellent performance in many wellknown benchmark domains. In advance, an original and detailed investigation identifies the main patterns of structure which cause the performance of FF, categorizing planning domains in a taxonomy of different classes with respect to their aptitude for being solved by heuristic approaches, such as FF. As shown, the majority of the planning benchmark domains lie in classes which are easy to solve.. | | 出版日期 | Book 2003 | | 關(guān)鍵詞 | algorithms; artificial intelligence; autonomous agents; domain-independant planning; heuristics; intellig | | 版次 | 1 | | doi | https://doi.org/10.1007/b93903 | | isbn_softcover | 978-3-540-20259-2 | | isbn_ebook | 978-3-540-39607-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 | | issn_series | 0302-9743 | | copyright | Springer-Verlag Berlin Heidelberg 2003 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-6 20:21
發(fā)表于 2025-3-21 16:11:34
