Cantitate/Preț
Produs

Constraint-Based Agents: An Architecture for Constraint-Based Modeling and Local-Search-Based Reasoning for Planning and Scheduling in Open and Dynamic Worlds: Lecture Notes in Computer Science, cartea 2062

Autor Alexander Nareyek
en Limba Engleză Paperback – 30 mai 2001
Autonomous agents have become a vibrant research and development topic in recent years attracting activity and attention from various areas. The basic agent concept incorporates proactive autonomous units with goal-directed-behaviour and communication capabilities. The book focuses on autonomous agents that can act in a goal directed manner under real time constraints and incomplete knowledge, being situated in a dynamic environment where resources may be restricted. To satisfy such complex requirements, the author improves, combines, and applies results from areas like planning, constraint programming, and local search. The formal framework developed is evaluated by application to the field of computer games, which fit the problem context very well since most of them are played in real time and provide a highly interactive environment where environmental situations are changing rapidly.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31697 lei

Preț vechi: 39622 lei
-20% Nou

Puncte Express: 475

Preț estimativ în valută:
6067 6524$ 5058£

Carte tipărită la comandă

Livrare economică 19 decembrie 24 - 02 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540422587
ISBN-10: 3540422587
Pagini: 200
Ilustrații: XIV, 186 p.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.48 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Using Global Constraints for Local Search.- Structural Constraint Satisfaction.- The Planning Model.- Application.- Conclusion.- Future Work.- Internet Links.- The “Send More Money” Problem.- Choice Randomization.- Ensuring the Satisfaction of Structural Constraints.

Caracteristici

Includes supplementary material: sn.pub/extras