<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Malik Muhammad Sanaullah</title>
    <description>The latest articles on DEV Community by Malik Muhammad Sanaullah (@maliksani88).</description>
    <link>https://dev.to/maliksani88</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F3824411%2F7ad5ae94-3fe3-4785-970e-4fcec6c34ac7.jpg</url>
      <title>DEV Community: Malik Muhammad Sanaullah</title>
      <link>https://dev.to/maliksani88</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/maliksani88"/>
    <language>en</language>
    <item>
      <title>The Rise of Agentic AI (Capgemini Research Institute)</title>
      <dc:creator>Malik Muhammad Sanaullah</dc:creator>
      <pubDate>Sat, 14 Mar 2026 18:53:46 +0000</pubDate>
      <link>https://dev.to/maliksani88/the-rise-of-agentic-ai-capgemini-research-institute-1i7m</link>
      <guid>https://dev.to/maliksani88/the-rise-of-agentic-ai-capgemini-research-institute-1i7m</guid>
      <description>&lt;p&gt;Introduction&lt;br&gt;
In this post I explore two recent AI research papers directly connected to our course topics — Agentic AI systems and the A* search algorithm.&lt;/p&gt;

&lt;p&gt;Paper 1: The Rise of Agentic AI (2025)&lt;br&gt;
This paper reviews how modern AI agents are defined, what frameworks exist for building them, and the key challenges they face. The most interesting finding is that agentic AI systems must handle partial observability, dynamic environments, and multi-agent coordination — exactly the dimensions we studied in class for environment classification.&lt;/p&gt;

&lt;p&gt;Connection to Course:&lt;br&gt;
In our AI course we classify environments using 7 dimensions. This paper directly maps to that — agentic AI is designed specifically for environments that are dynamic, stochastic, and partially observable, which matches our GB flood rescue robot scenario perfectly.&lt;/p&gt;

&lt;p&gt;Paper 2: A Algorithm Based on Adaptive Weights (2025)*&lt;br&gt;
This paper improves the classic A* search algorithm by dynamically adjusting the heuristic weight based on the current state of the environment. Instead of a fixed f(n) = g(n) + h(n), it uses f(n) = g(n) + w(n)×h(n) where w(n) changes during search.&lt;br&gt;
Connection to Course&lt;/p&gt;

&lt;p&gt;We studied A* in class as the best search algorithm for weighted environments. This paper shows how A* can be made even better by adapting its heuristic weight — directly relevant to our rescue robot which operates in a constantly changing flood environment.&lt;/p&gt;

&lt;p&gt;Personal Insight&lt;br&gt;
Reading these papers manually first helped me understand the big picture. Using NotebookLM afterwards helped me clarify the technical details I missed, especially the mathematical formulations. The combination of both approaches gave me a much deeper understanding than either alone.&lt;/p&gt;

</description>
      <category>ai</category>
      <category>programming</category>
      <category>productivity</category>
      <category>beginners</category>
    </item>
  </channel>
</rss>
