境界を越える：古典的な検索理論からアゲンテAIの時代へ

この論文では、人工知能が基礎的な問題解決エンティティから、現代のアゲンテシステムへの変遷について述べています。基本的な探索アルゴリズムとしてのA*、Breadth-First Search (BFS)、および従来のIDSと最新のLargest Language Model（LLM）ベースの探索エージェントとの統合を通じて、古典的な状態空間理論が自律型知能に役立つための基本的なフレームワークであるように証明します。このブログでは、反応性の高い生産モデルから積極的で適応性のある代理体へのシフトを分析し、動的計画、反省と多次論議の推理などを示します。

Abstract This paper is all about the evolution of Artificial Intelligence from foundational problem-solving agents to modern agentic systems. By synthesizing basic search algorithms like A*, Breadth-First Search (BFS), and Iterative Deepening with recent milestones in Large Language Model (LLM)-based search agents, we demonstrate how classical state-space theory provides the essential framework for autonomous intelligence. In this blog, we will analyze the shift from reactive generative models to proactive agents capable of dynamic planning, reflection, and multi-turn reasoning. 1. Introduction: The Agentic Evolution 2. Foundational Frameworks: State Space and Representations Modern agents navigate environments of immense complexity, yet they rely on the same representational structures taught in foundational search theory: 3. Scaling Search: From Algorithms to Agents The search strategies analyzed in the classroom—such as Uninformed Search (BFS, DFS) and Informed Search (A*)—are the basics of modern Deep Search Agents. 3.1. Test-Time Scaling and Tree Search Classical algorithms like Iterative Deepening Search (IDS) save memory while exploring deep trees. Modern "Deep Research" systems use a similar philosophy through Test-Time Scaling. By allocating more computation during inference, these agents use techniques like Monte Carlo Tree Search (MCTS) and Self-Consistency to explore multiple reasoning paths before committing to an answer. 3.2. Heuristics and Reward Functions In informed search, the Heuristic Function estimates the cost from the current state to the goal. In the world of agentic AI, this is mirrored by Multi-objective Reward Functions. Agents use Reinforcement Learning (RL) to "calculate" the relevance and cost of information retrieval, effectively treating web navigation as an f(n) = g(n) + h(n) optimization problem. 4. Architectural Paradigms Research identifies several core architectures that enable agency: 5. Challenges in the Real World Despite their potential, agentic systems face significant hurdles that go beyond classroom simulations: 6. Conclusion The evolution from Uninformed Search to Autonomous Agentic AI represents one of the most significant changes in computer science. By grounding modern LLM-based search agents in the formal definitions of state spaces, transition models, and heuristics, we can build systems that are not just smarter at talking, but smarter at acting. As the market for these agents is projected to exceed $50 billion by 2030, the synthesis of theory and practice remains the most vital for AI researchers. Summary & Connection: The Transition to Agentic Search Manual Reading vs. NotebookLM Exploration *Heuristics as Reward Models: * NotebookLM helped me realize that the Action Cost Functions we studied in route-finding problems are the direct ancestors of the Reinforcement Learning rewards used to train agents like OpenAI’s Deep Research. The Frontier of Iterative Deepening: It clarified that modern "Reflection-Driven Sequential Search" is essentially a high-level, dynamic implementation of Iterative Deepening Search (IDS), where the agent repeatedly applies reasoning with increasing complexity until it satisfies a "Goal Test". Test-Time Scaling vs. Complexity: I found it fascinating that while we learn that traditional search is limited by exponential space complexity (O(b^d)), modern agents use Test-Time Scaling to prioritize "computational latency" as the primary cost, trading time for accuracy in a way that parallels the Weighted A* strategies from our lecture. @raqeeb_26