<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Artificial Intelligence |</title><link>https://caiyf03.github.io/tags/artificial-intelligence/</link><atom:link href="https://caiyf03.github.io/tags/artificial-intelligence/index.xml" rel="self" type="application/rss+xml"/><description>Artificial Intelligence</description><generator>HugoBlox Kit (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Fri, 26 Jan 2024 00:00:00 +0000</lastBuildDate><image><url>https://caiyf03.github.io/media/icon_hu_702a800cd775dbac.png</url><title>Artificial Intelligence</title><link>https://caiyf03.github.io/tags/artificial-intelligence/</link></image><item><title>HeartAI: Heart Rate Game AI</title><link>https://caiyf03.github.io/projects/heartai/</link><pubDate>Fri, 26 Jan 2024 00:00:00 +0000</pubDate><guid>https://caiyf03.github.io/projects/heartai/</guid><description>&lt;h2 id="team"&gt;Team&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;YiFan Cai (leader)&lt;/li&gt;
&lt;li&gt;JunXian Guo&lt;/li&gt;
&lt;li&gt;ZhiHang Wang&lt;/li&gt;
&lt;li&gt;etc&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id="overview"&gt;Overview&lt;/h2&gt;
&lt;p&gt;This project develops an AI agent for the Hearts card game, a multi-player, imperfect-information environment requiring strategic reasoning and long-term planning. The goal is to compare classical search-based and learning-based decision-making methods under realistic game constraints.&lt;/p&gt;
&lt;h2 id="key-features"&gt;Key Features&lt;/h2&gt;
&lt;p&gt;-Supports multiple AI paradigms within a unified game engine&lt;/p&gt;
&lt;p&gt;-Adaptive MCTS for improved runtime–performance trade-offs&lt;/p&gt;
&lt;p&gt;-State abstraction enabling Q-learning in large, discrete action spaces&lt;/p&gt;
&lt;p&gt;-Simulation and visualization tools for strategy comparison and analysis&lt;/p&gt;
&lt;h2 id="methods"&gt;Methods&lt;/h2&gt;
&lt;p&gt;We implemented and evaluated greedy, Monte Carlo Tree Search (MCTS), and Q-learning agents. MCTS handles uncertainty through randomized rollouts and includes an adaptive variant that reduces computation when the agent is ahead. To enable learning in a large state space, the Q-learning agent uses state abstraction and reward shaping, learning strategic behavior through repeated self-play.&lt;/p&gt;
&lt;h2 id="results"&gt;Results&lt;/h2&gt;
&lt;p&gt;Experiments over simulated games show that MCTS achieves the strongest performance at the cost of higher computation, while the Q-learning agent outperforms greedy and random baselines with improved adaptability. The results highlight trade-offs between decision quality, efficiency, and learning capability in imperfect-information games.&lt;/p&gt;</description></item><item><title>Building an Intelligent Pac-Man Agent</title><link>https://caiyf03.github.io/projects/pacman/</link><pubDate>Sun, 01 Oct 2023 00:00:00 +0000</pubDate><guid>https://caiyf03.github.io/projects/pacman/</guid><description>&lt;h2 id="overview"&gt;Overview&lt;/h2&gt;
&lt;p&gt;This project series incrementally develops a &lt;strong&gt;fully autonomous Pac-Man agent&lt;/strong&gt;, transforming it from a weak, rule-driven system into an intelligent decision-making agent capable of planning, reasoning under uncertainty, and learning from interaction.&lt;/p&gt;
&lt;p&gt;The projects are organized as a coherent progression, each introducing a more advanced AI paradigm.&lt;/p&gt;
&lt;h2 id="logic--classical-planning"&gt;Logic &amp;amp; Classical Planning&lt;/h2&gt;
&lt;p&gt;In the initial stage, Pac-Man operates under &lt;strong&gt;logic-based representations and classical planning&lt;/strong&gt;:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Explicit modeling of world states, actions, constraints, and goals&lt;/li&gt;
&lt;li&gt;Automatic generation of feasible action sequences&lt;/li&gt;
&lt;li&gt;Deterministic planning in fully observable environments&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;This stage establishes the foundation for symbolic reasoning and goal-directed behavior.&lt;/p&gt;
&lt;h2 id="bayesian-networks"&gt;Bayesian Networks&lt;/h2&gt;
&lt;p&gt;To handle uncertainty, &lt;strong&gt;Bayesian networks&lt;/strong&gt; are introduced:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Probabilistic modeling of hidden variables&lt;/li&gt;
&lt;li&gt;Inference under noisy or incomplete observations&lt;/li&gt;
&lt;li&gt;Decision-making based on belief states rather than exact knowledge&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;This enables Pac-Man to reason probabilistically instead of relying on fixed rules.&lt;/p&gt;
&lt;h2 id="ghostbusters-tracking-under-uncertainty"&gt;Ghostbusters: Tracking Under Uncertainty&lt;/h2&gt;
&lt;p&gt;In the &lt;strong&gt;Ghostbusters&lt;/strong&gt; setting, Pac-Man faces invisible ghosts and noisy sensors:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Bayesian filtering for belief state updates&lt;/li&gt;
&lt;li&gt;Particle filtering for continuous ghost localization&lt;/li&gt;
&lt;li&gt;Sequential decision-making in partially observable, dynamic environments&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;This stage bridges probabilistic inference and adversarial game dynamics.&lt;/p&gt;
&lt;h2 id="reinforcement-learning"&gt;Reinforcement Learning&lt;/h2&gt;
&lt;p&gt;Finally, the agent transitions to &lt;strong&gt;reinforcement learning&lt;/strong&gt;, removing the need for handcrafted models:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Learning policies directly from environment interaction&lt;/li&gt;
&lt;li&gt;Optimizing long-term rewards instead of immediate objectives&lt;/li&gt;
&lt;li&gt;Adapting behavior through trial and error&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;At this stage, Pac-Man becomes a self-improving agent capable of autonomous strategy learning.&lt;/p&gt;</description></item></channel></rss>