AI4 Search in Complex AI Environments
Échec de l'ajout au panier.
Échec de l'ajout à la liste d'envies.
Échec de la suppression de la liste d’envies.
Échec du suivi du balado
Ne plus suivre le balado a échoué
-
Narrateur(s):
-
Auteur(s):
À propos de cet audio
This chapter expands upon search algorithms by addressing more complex, real-world environments that relax simplifying assumptions. It introduces local search and optimization problems, where the focus is on finding a good final state rather than the path, and discusses techniques like hill climbing and simulated annealing. The text then progresses to search with nondeterministic actions, where agents need to formulate conditional plans due to unpredictable outcomes, utilizing AND-OR search trees. Finally, the chapter explores search in partially observable and unknown environments, introducing the concept of belief states and the challenges of online search agents that learn about the environment as they interact with it, including methods like LRTA* for efficient exploration and adaptation.