Kód: 06824850
The TM-LPSAT planner can construct plans in domains §containing atomic actions and durative actions; §events and processes; discrete, real-valued, and §interval-valued fluents; reusable resources,§both numeric and interval-valued; ... celý popis
Angličtina
Nákupem získáte 167 bodů
Anotace knihy
The TM-LPSAT planner can construct plans in domains §containing atomic actions and durative actions; §events and processes; discrete, real-valued, and §interval-valued fluents; reusable resources,§both numeric and interval-valued; and continuous §linear change to quantities. It works in three tages.§In the first stage, a representation of the domain §and problem in an extended version of PDDL+ is§compiled into a system of Boolean combinations of §propositional atoms and linear constraints over§numeric variables. In the second stage, a SAT-based §arithmetic constraint solver, such as LPSAT or§MathSAT, is used to find a solution to the system of §constraints. In the third stage, a correct plan is§extracted from this solution. We discuss the §structure of the planner and show how planning with§time and metric quantities is compiled into a system §of constraints.
Parametry knihy
Zařazení knihy Knihy v angličtině Computing & information technology Information technology: general issues
1668 Kč
Angličtina
Osobní odběr Praha, Brno a 46633 dalších
Copyright ©2008-26 nejlevnejsi-knihy.cz Všechna práva vyhrazenaSoukromíCookies
Vrácení do měsíce
571 999 099 (8-15.30h)Nákupní košík ( prázdný )