Titlebook: Constraint-Based Agents; An Architecture for Alexander Nareyek Book 2001 Springer-Verlag Berlin Heidelberg 2001 AI planning.Autonomous age

带来

minimal

充气女

Subdue

躺下残杀

洞察力

Using Global Constraints for Local Search,Our agents need to adapt their behavior in real time to new situations. Conventional refinement-based constraint programming techniques are not suitable for these requirements. Thus, as discussed in Sect. 1.4.3, our agents will be based on local search. This chapter presents a technique to combine local search with constraint programming.

小官

Compass

轻快走过

Choice Randomization,A lot of decisions that are made during an agent’s behavior computation include randomized choices (e.g., see Chap. 2 and 5). This chapter argues in favor of a “fair” random choice and points out that the computation of an alternative’s utility should be focused instead of empirically tuning choice parameters of less informed selection methods.

scoliosis