Scribd
Upload
24 views21 pages

AI Seminar Group 8

Uploaded by

Debdeep sanyal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
24 views21 pages

AI Seminar Group 8

Uploaded by

Debdeep sanyal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 21

Jadavpur University

Department of Computer Science


& Engineering

Artificial Intelligence

Submitted By:
SAYAN MONDAL (002410504005)
SUBHAM MONDAL (002410504016)
ABHISHEK CHATTARAJ (002410504027)
Submitted to:Prof. Dr. Kamal Sarkar
Date:03.04.2025
Title: Online
Search Agents in
Artificial
Intelligence
.
Introduction to Search in AI

● Search is fundamental in AI for problem-solving.


● Two main types: Offline search & Online search.
What are Online Search Agents?

● Agents that make decisions while exploring.

● Operate in unknown environments.

● Learn from experience in real-time.


Characteristics of Online Search
Agents

● Lack of prior knowledge.


● Decision-making in real-time.
● Continuous interaction with the environment.
● Adaptive learning.
Differences Between Offline and
Online Search
Online Search

Knowledge: Acquired in real-time

Decision Process: Dynamic & adaptive

Flexibility: High

Offline Search

Knowledge: Predefined

Decision Process: Pre-planned

Flexibility: Low
Applications of Online Search
Agents

● Robotics
● Web search engines
● Game playing
● Autonomous navigation
Online Search Algorithms

● Depth-first search (DFS)


● Breadth-first search (BFS)
● A* search
● Learning Real-Time A* (LRTA*)
Depth-First Search in Online
Context

● Explores one branch fully before backtracking.


● Suitable for pathfinding in unknown terrain.
Breadth-First Search in Online
Context

● Explores all neighbors before moving deeper.


● Useful in web crawling and network analysis.
A Search for Online Agents*

● Uses heuristics to find the shortest path.


● Applied in GPS and AI-driven navigation.
Learning Real-Time A (LRTA)**

● Improves decision-making by learning heuristics.


● Used in real-time game AI and robotics.
Online Search in Robotics

● Self-driving cars (e.g., Tesla, Waymo).


● Drones navigating unknown terrain.
Online Search in Web Crawling

● Google’s search engine algorithms.


● Dynamic page indexing.
Online Search in Game AI

● NPC pathfinding in open-world games.


● Adaptive opponent strategies.
Challenges in Online Search

● High computational cost.


● Handling dynamic environments.
● Limited memory and learning capabilities.
Solutions to Online Search
Challenges

● Heuristic improvements.
● Machine learning integration.
● Efficient data storage and retrieval.
Future Trends in Online Search

● AI-driven optimization techniques.


● Deep learning for real-time decision-making.
● Enhanced reinforcement learning approaches.
Case Study: Google’s Search
Algorithms

● PageRank and AI-driven indexing.


● Personalized search experience.
Summary

● Online search agents operate in dynamic environments.


● Used in robotics, web search, and games.
● Future trends involve deep learning and optimization.
THANK YOU

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy