<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[M Aqsam Qureshi AI Blog]]></title><description><![CDATA[M Aqsam Qureshi AI Blog]]></description><link>https://m-aqsam-ai.hashnode.dev</link><generator>RSS for Node</generator><lastBuildDate>Fri, 09 Oct 2026 04:12:07 GMT</lastBuildDate><atom:link href="https://m-aqsam-ai.hashnode.dev/rss.xml" rel="self" type="application/rss+xml"/><language><![CDATA[en]]></language><ttl>60</ttl><item><title><![CDATA[From Classroom to Research: How 2025 Papers Are Revolutionizing A* Search and Agentic AI]]></title><description><![CDATA[Introduction
Hi! I'm [M Aqsam] , a student at FAST University. This blog post is for my Artificial Intelligence course assignment, where I'm reviewing two research papers from 2025.

PAPER 1: A* Algor]]></description><link>https://m-aqsam-ai.hashnode.dev/from-classroom-to-research-how-2025-papers-are-revolutionizing-a-search-and-agentic-ai</link><guid isPermaLink="true">https://m-aqsam-ai.hashnode.dev/from-classroom-to-research-how-2025-papers-are-revolutionizing-a-search-and-agentic-ai</guid><dc:creator><![CDATA[maqsamqureshi]]></dc:creator><pubDate>Sat, 14 Mar 2026 10:03:52 GMT</pubDate><content:encoded><![CDATA[<h2>Introduction</h2>
<p>Hi! I'm <strong>[M Aqsam]</strong> , a student at FAST University. This blog post is for my Artificial Intelligence course assignment, where I'm reviewing two research papers from 2025.</p>
<hr />
<h2>PAPER 1: A* Algorithm with Adaptive Weights</h2>
<h3>What is the Goal of This Paper?</h3>
<p>The traditional A* algorithm that we studied in class has three main problems:</p>
<table>
<thead>
<tr>
<th>Problem</th>
<th>Explanation</th>
</tr>
</thead>
<tbody><tr>
<td>Too Many Search Nodes</td>
<td>Wastes time and battery power</td>
</tr>
<tr>
<td>Excessive Turning Points</td>
<td>Robots cannot follow zig-zag paths</td>
</tr>
<tr>
<td>Local Optima Traps</td>
<td>Gets stuck in suboptimal routes</td>
</tr>
</tbody></table>
<p><strong>Goal of this paper:</strong> Solve these problems so robots can navigate efficiently.</p>
<h3>Four Improvements</h3>
<table>
<thead>
<tr>
<th>Improvement</th>
<th>What It Does</th>
</tr>
</thead>
<tbody><tr>
<td>1. Diagonal-Free Search</td>
<td>Near obstacles, avoid diagonal moves for safety</td>
</tr>
<tr>
<td>2. Adaptive Weights</td>
<td>Weight changes based on how many obstacles are nearby</td>
</tr>
<tr>
<td>3. Heuristic Reward Values</td>
<td>Helps escape local optima (like Simulated Annealing)</td>
</tr>
<tr>
<td>4. B-Spline Smoothing</td>
<td>Makes paths smooth so robots can follow easily</td>
</tr>
</tbody></table>
<h3>Results</h3>
<table>
<thead>
<tr>
<th>Metric</th>
<th>Improvement</th>
</tr>
</thead>
<tbody><tr>
<td>Search Nodes</td>
<td><strong>76.4% LESS</strong></td>
</tr>
<tr>
<td>Turn Angle</td>
<td><strong>71.7% LESS</strong></td>
</tr>
<tr>
<td>Computation Time</td>
<td><strong>10% FASTER</strong></td>
</tr>
</tbody></table>
<hr />
<h2>PAPER 2: The Rise of Agentic AI</h2>
<h3>What is the Goal of This Paper?</h3>
<p><strong>Agentic AI</strong> = AI that can think and act independently.</p>
<table>
<thead>
<tr>
<th>Traditional AI</th>
<th>Agentic AI</th>
</tr>
</thead>
<tbody><tr>
<td>Responds to commands</td>
<td>Takes initiative</td>
</tr>
<tr>
<td>Waits for input</td>
<td>Perceives environment</td>
</tr>
<tr>
<td>Handles single task</td>
<td>Handles multiple goals</td>
</tr>
<tr>
<td>No memory</td>
<td>Learns from experience</td>
</tr>
</tbody></table>
<h3>Five Patterns of Agentic AI</h3>
<ol>
<li><p><strong>Tool Use</strong> - AI can use calculators, APIs, search engines</p>
</li>
<li><p><strong>Reflection</strong> - AI learns from its mistakes</p>
</li>
<li><p><strong>Re Act</strong> - Reason and Act in cycles (think then do)</p>
</li>
<li><p><strong>Planning</strong> - Break complex goals into smaller steps</p>
</li>
<li><p><strong>Multi-Agent</strong> - Multiple AI systems work together</p>
</li>
</ol>
<h3>📋 Seven Types of Agents</h3>
<table>
<thead>
<tr>
<th>Type</th>
<th>Real World Example</th>
</tr>
</thead>
<tbody><tr>
<td>Simple Reflex</td>
<td>Room thermostat</td>
</tr>
<tr>
<td>Model-Based</td>
<td>Self-driving car</td>
</tr>
<tr>
<td>Goal-Based</td>
<td>Rescue robot</td>
</tr>
<tr>
<td>Utility-Based</td>
<td>Stock trading bot</td>
</tr>
<tr>
<td>Learning Agent</td>
<td>Netflix recommendation system</td>
</tr>
<tr>
<td>Hierarchical</td>
<td>Factory automation robot</td>
</tr>
<tr>
<td>Multi-Agent</td>
<td>Swarm of drones</td>
</tr>
</tbody></table>
<h2>COURSE CONNECTION</h2>
<h3>Connection to Part A: Rescue Robot Scenario</h3>
<table>
<thead>
<tr>
<th>Our Rescue Robot</th>
<th>Paper Confirms</th>
</tr>
</thead>
<tbody><tr>
<td>Partially observable environment</td>
<td>✓ Agentic AI works in such environments</td>
</tr>
<tr>
<td>Dynamic environment</td>
<td>✓ Yes</td>
</tr>
<tr>
<td>Stochastic environment</td>
<td>✓ Yes</td>
</tr>
<tr>
<td>Multi-agent environment</td>
<td>✓ Yes</td>
</tr>
</tbody></table>
<p><strong>Why we chose Utility-Based Agent?</strong> Paper 2 confirms that utility-based agents work best in complex environments like our flood scenario!</p>
<h3>Connection to Part B: Search Algorithms</h3>
<table>
<thead>
<tr>
<th>Our Observation in Part B</th>
<th>Paper 1's Solution</th>
</tr>
</thead>
<tbody><tr>
<td>"A* searches too many nodes"</td>
<td>76.4% reduction ✓</td>
</tr>
<tr>
<td>"Paths have too many sharp turns"</td>
<td>71.7% reduction ✓</td>
</tr>
<tr>
<td>"Different terrains need different costs"</td>
<td>Adaptive weights based on obstacle density ✓</td>
</tr>
</tbody></table>
<h3>Connection to Part C: Simulated Annealing</h3>
<p><strong>Remember this formula from Part C?</strong></p>
<p>P(accept) = e^(-ΔE / T)</p>
<p><strong>Paper 1 uses the SAME concept!</strong> When the algorithm gets stuck in a local optimum, it temporarily accepts "worse" paths to explore better options - exactly like Simulated Annealing!</p>
<h3>Connection to CSPs (Constraint Satisfaction Problems)</h3>
<p>Paper 1's Grey Wolf Optimizer treats weight adjustment as an <strong>optimization problem</strong> - exactly like we formulated survivor prioritization in Part C!</p>
<hr />
<h2>PERSONAL INSIGHT: Manual Reading vs NotebookLM</h2>
<h3>Phase 1: Manual Reading (Confusion)</h3>
<p>When I first read these papers by myself:</p>
<ul>
<li><p>The mathematics of Grey Wolf Optimizer was difficult to understand</p>
</li>
<li><p>Technical terms like "Re Act" and "Reflection" were confusing</p>
</li>
<li><p>I felt overwhelmed by the complexity</p>
</li>
</ul>
<p><strong>Honest feeling:</strong> "Will I ever be able to understand research papers?"</p>
<h3>Phase 2: NotebookLM(Clarity)</h3>
<p>I uploaded both papers to <strong>Google NotebookLM</strong> (<a href="http://notebooklm.google.com">notebooklm.google.com</a>) and asked:</p>
<ul>
<li><p>"Explain Grey Wolf Optimizer in simple terms with an example"</p>
</li>
<li><p>"Create a table comparing all 7 agent types"</p>
</li>
<li><p>"Summarize the five operational patterns in simple words"</p>
</li>
<li><p>"Show me the results in a bullet list"</p>
</li>
</ul>
<p><strong>What NotebookLM gave me:</strong></p>
<ul>
<li><p>Simple explanations with everyday examples</p>
</li>
<li><p>Clean tables and easy comparisons</p>
</li>
<li><p>Clear summaries of complex sections</p>
</li>
<li><p>Citations back to the original paper</p>
</li>
</ul>
<p><strong>Example:</strong> NotebookLM explained Grey Wolf Optimizer as:</p>
<blockquote>
<p>"Imagine a pack of wolves hunting. The alpha wolf leads, beta and delta help, and omega follows. They search (explore), surround (exploit), and attack (converge). GWO mimics this behavior."</p>
</blockquote>
<p>So easy to understand!</p>
<h3>Phase 3: Back to the Paper (Understanding)</h3>
<p>With NotebookLM's explanations, I read the papers again. Everything became clear!</p>
<p><strong>Key Realization:</strong></p>
<ul>
<li><p>NotebookLM helped me understand <strong>30% of the paper</strong></p>
</li>
<li><p>I understood the remaining <strong>70%</strong> by reading myself</p>
</li>
<li><p>AI didn't replace learning - it <strong>accelerated</strong> learning</p>
</li>
</ul>
<h3>What I Found Most Interesting</h3>
<p><strong>From Paper 1:</strong> Grey Wolf Optimizer is inspired by wolf hunting behavior! Nature + algorithms = beautiful combination.</p>
<p><strong>From Paper 2:</strong> Self-improving AI agents that get better without human intervention - science fiction is becoming reality!</p>
<p><strong>Both Papers:</strong> They take what we learned in class and show how real research improves it. This makes me feel confident about my choice of field!</p>
<hr />
<h2>🎥 VIDEO WALKTHROUGH</h2>
<p>I made video explaining these papers. Watch here:</p>
<p><strong>[</strong><a href="https://youtu.be/794eacYVp_U">https://youtu.be/794eacYVp_U</a><strong>]</strong></p>
<hr />
<h2>📊 COMPARISON TABLE: Traditional vs Improved A*</h2>
<table>
<thead>
<tr>
<th>Aspect</th>
<th>Traditional A*</th>
<th>Improved A*</th>
</tr>
</thead>
<tbody><tr>
<td>Heuristic Weight</td>
<td>Fixed</td>
<td>Adaptive (Grey Wolf Optimizer)</td>
</tr>
<tr>
<td>Movement</td>
<td>8-direction</td>
<td>5-direction near obstacles</td>
</tr>
<tr>
<td>Local Optima</td>
<td>Gets stuck</td>
<td>Reward values for escape</td>
</tr>
<tr>
<td>Path Smoothness</td>
<td>Sharp turns</td>
<td>B-spline curves</td>
</tr>
<tr>
<td>Search Nodes</td>
<td>High</td>
<td><strong>76.4% less</strong></td>
</tr>
<tr>
<td>Turn Angle</td>
<td>High</td>
<td><strong>71.7% less</strong></td>
</tr>
</tbody></table>
<hr />
<h2>🎯 Why This Matters for AI Students</h2>
<p>We often think that what we learn in class is the final truth. These papers prove:</p>
<ol>
<li><p><strong>Algorithms constantly improve</strong> - A* was created in 1968, still improving in 2025!</p>
</li>
<li><p><strong>Research builds on fundamentals</strong> - What we study is the foundation</p>
</li>
<li><p><strong>Interdisciplinary thinking works</strong> - Wolf hunting behavior inspired an algorithm!</p>
</li>
<li><p><strong>Course material is essential</strong> - Without basics, you cannot understand research</p>
</li>
</ol>
<hr />
<h2>📝 Conclusion</h2>
<p>Both papers showed me the <strong>depth</strong> of AI:</p>
<p><strong>Paper 1</strong> showed that even classic algorithms like A* have room for <strong>76% improvement</strong> when you think creatively.</p>
<p><strong>Paper 2</strong> showed that agentic AI - which sounds like science fiction - is already here with clear patterns, types, and frameworks.</p>
<p><strong>Course connection</strong> proved that what we are learning isn't outdated theory - it's the foundation for cutting-edge research.</p>
<hr />
<h2>👋 About Me</h2>
<p><strong>Name:</strong> [M Aqsam]</p>
<p><strong>University:</strong> FAST University</p>
<p><strong>Course:</strong> Artificial Intelligence</p>
<p><strong>Follow me:</strong></p>
<ul>
<li><p>Hashnode: <a href="https://hashnode.com/@aqsamqureshi">https://hashnode.com/@aqsamqureshi</a></p>
</li>
<li><p><a href="http://Dev.to">Dev.to</a>: <a href="https://dev.to/muaqqu">https://dev.to/muaqqu</a></p>
</li>
</ul>
<hr />
<p><em>Tagging @Raqeeb_26 (</em><a href="http://Dev.to"><em>Dev.to</em></a><em>) and @raqeebr (Hashnode) as per assignment requirement.</em></p>
]]></content:encoded></item></channel></rss>