<feed xmlns="http://www.w3.org/2005/Atom"> <id>https://chaxist.github.io/</id><title>Chaxist</title><subtitle>Personal blog site of Chaxist.</subtitle> <updated>2026-03-29T17:09:58+08:00</updated> <author> <name>jst</name> <uri>https://chaxist.github.io/</uri> </author><link rel="self" type="application/atom+xml" href="https://chaxist.github.io/feed.xml"/><link rel="alternate" type="text/html" hreflang="en" href="https://chaxist.github.io/"/> <generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator> <rights> © 2026 jst </rights> <icon>/assets/img/favicons/favicon.ico</icon> <logo>/assets/img/favicons/favicon-96x96.png</logo> <entry><title>低内存占用Astar算法-基于栅格地图</title><link href="https://chaxist.github.io/posts/low-memory-astar/" rel="alternate" type="text/html" title="低内存占用Astar算法-基于栅格地图" /><published>2026-03-28T18:00:00+08:00</published> <updated>2026-03-29T17:09:30+08:00</updated> <id>https://chaxist.github.io/posts/low-memory-astar/</id> <content type="text/html" src="https://chaxist.github.io/posts/low-memory-astar/" /> <author> <name>jst</name> </author> <category term="planning" /> <summary>低内存占用Astar算法-基于栅格地图 在机器人导航（例如基于 ROS 的 30m×30m，分辨率 0.05m 的局部代价地图）或者游戏寻路开发中，A(A-Star) 算法是最常用的寻路算法。然而，在标准的面向对象实现中，A 算法的内存占用和频繁的动态内存分配往往会成为性能瓶颈。 先来算一笔账：在一个 600×600（总计 360,000 个栅格）的地图上，一个标准的 Node 节点通常这样定义： struct Node { uint16_t g; // 2B (起点到当前节点的代价) uint16_t h; // 2B (启发式预估代价) uint16_t x, y; // 4B (坐标) Node *parent; // 8B (64位机器上的指针) NodeState s...</summary> </entry> <entry><title>ROS2 DWB 局部规划器深度优化：零动态内存分配的 BFS 算法</title><link href="https://chaxist.github.io/posts/dwb-bfs/" rel="alternate" type="text/html" title="ROS2 DWB 局部规划器深度优化：零动态内存分配的 BFS 算法" /><published>2026-03-28T18:00:00+08:00</published> <updated>2026-03-28T18:00:00+08:00</updated> <id>https://chaxist.github.io/posts/dwb-bfs/</id> <content type="text/html" src="https://chaxist.github.io/posts/dwb-bfs/" /> <author> <name>jst</name> </author> <category term="ROS" /> <summary>ROS2 DWB 局部规划器深度优化：零动态内存分配的 BFS 算法</summary> </entry> <entry><title>Linux 动态库卸载：dlclose 无法卸载 ROS 插件</title><link href="https://chaxist.github.io/posts/dl_close/" rel="alternate" type="text/html" title="Linux 动态库卸载：dlclose 无法卸载 ROS 插件" /><published>2026-03-28T18:00:00+08:00</published> <updated>2026-03-28T18:00:00+08:00</updated> <id>https://chaxist.github.io/posts/dl_close/</id> <content type="text/html" src="https://chaxist.github.io/posts/dl_close/" /> <author> <name>jst</name> </author> <category term="Linux" /> <summary>Linux 动态库卸载：dlclose 无法卸载 ROS 插件</summary> </entry> <entry><title>记一次纯手搓 A* (A-Star) 算法的踩坑复盘</title><link href="https://chaxist.github.io/posts/astar/" rel="alternate" type="text/html" title="记一次纯手搓 A* (A-Star) 算法的踩坑复盘" /><published>2026-03-28T18:00:00+08:00</published> <updated>2026-03-28T18:00:00+08:00</updated> <id>https://chaxist.github.io/posts/astar/</id> <content type="text/html" src="https://chaxist.github.io/posts/astar/" /> <author> <name>jst</name> </author> <category term="planning" /> <summary>A*算法</summary> </entry> <entry><title>极致瘦身：Linux C/C++ 动态库裁剪优化的五步指南</title><link href="https://chaxist.github.io/posts/Linux-library/" rel="alternate" type="text/html" title="极致瘦身：Linux C/C++ 动态库裁剪优化的五步指南" /><published>2026-03-28T18:00:00+08:00</published> <updated>2026-03-28T18:00:00+08:00</updated> <id>https://chaxist.github.io/posts/Linux-library/</id> <content type="text/html" src="https://chaxist.github.io/posts/Linux-library/" /> <author> <name>jst</name> </author> <category term="Linux" /> <summary>极致瘦身：Linux C/C++ 动态库裁剪优化的五步指南</summary> </entry> </feed>
