logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Utilizing Problem Structure In Planning A Local Search Approach 1st Edition Jrg Hoffmann Auth

  • SKU: BELL-4200454
Utilizing Problem Structure In Planning A Local Search Approach 1st Edition Jrg Hoffmann Auth
$ 31.00 $ 45.00 (-31%)

4.7

36 reviews

Utilizing Problem Structure In Planning A Local Search Approach 1st Edition Jrg Hoffmann Auth instant download after payment.

Publisher: Springer-Verlag Berlin Heidelberg
File Extension: PDF
File size: 3.07 MB
Pages: 254
Author: Jörg Hoffmann (auth.)
ISBN: 9783540202592, 9783540396079, 3540202595, 3540396071
Language: English
Year: 2003
Edition: 1

Product desciption

Utilizing Problem Structure In Planning A Local Search Approach 1st Edition Jrg Hoffmann Auth by Jörg Hoffmann (auth.) 9783540202592, 9783540396079, 3540202595, 3540396071 instant download after payment.

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.

Related Products