A* search algorithm
PulseAugur coverage of A* search algorithm — every cluster mentioning A* search algorithm across labs, papers, and developer communities, ranked by signal.
2 day(s) with sentiment data
-
New framework PIE-APT enables abductive planning over temporal knowledge graphs
Researchers have introduced PIE-APT, a novel framework for abductive planning over Temporal Dynamic Knowledge Graphs (TDKGs). This system operates within open-world environments and addresses challenges like decidabilit…
-
New reinforcement learning agent tackles symbolic equation solving
Researchers have developed a reinforcement learning agent capable of solving symbolic equations, including complex nonlinear equations and a specific class of restricted-open equations that require a change of variables…
-
Physics-Informed Neural Network Enhances UAV Path Planning
A research paper introduces a novel Physics-Informed Neural Network (PINN) approach for Unmanned Aerial Vehicle (UAV) path planning in dynamic environments. This method embeds UAV dynamics and wind disturbances directly…
-
Sokoban AI Solver uses A* search for optimal puzzle solutions
A developer has created an AI solver for the classic Sokoban puzzle game, which involves pushing boxes onto designated goals. The solver, implemented in JavaScript and C++, utilizes an A* search algorithm with optimizat…
-
LLM-Advisor improves path planning with GPT-5.5 on MultiTerraPath benchmark
Researchers have developed LLM-Advisor, a framework that uses large language models to improve path planning efficiency in complex terrains. This system leverages semantic terrain context to propose alternative routes t…
-
New WNM-3D model enhances 3D scene conditioning for navigation
Researchers have introduced WNM-3D, a novel World Navigation Model that incorporates 3D scene conditioning for closed-loop vision-language navigation (VLN). This model addresses limitations in current VLN systems by exp…
-
AI Research: Instructional Sequencing Complexity Analyzed
A new research paper explores the complexities of instructional sequencing when prerequisite dependencies exist between concepts. The study proves that stochasticity, or the probability of success in learning a concept,…
-
DesignArena raises $7.9M for AI taste feedback tool · 2 sources tracked
Intelligence, the company behind the AI feedback tool DesignArena, has secured $7.9 million in seed funding. The platform allows users to rank AI-generated outputs, providing valuable human feedback for AI model develop…
-
New routing system prioritizes safety and amenities for older pedestrians
Researchers have developed a new pedestrian routing system designed specifically for older adults, moving beyond simple distance or time optimization. This system incorporates factors like barriers, safety thresholds, a…
-
New Key-Interval A* algorithm drastically speeds up grid pathfinding
Researchers have developed Key-Interval A* (KIA*), a novel algorithm designed to significantly accelerate grid pathfinding. This method employs lightweight preprocessing to create a condensed representation of free spac…
-
New Conflict-Based Lazy Search algorithm speeds up multi-manipulator planning
Researchers have developed a new planning algorithm called Conflict-Based Lazy Search (CBLS) designed to improve the efficiency of multi-manipulator tasks. CBLS builds upon the existing Conflict-Based Search (CBS) algor…
-
New system Pharos enhances UAV safety in urban airspace
Researchers have developed Pharos, a novel multi-UAV airspace management system designed for complex urban environments. This system aims to enhance safety by preventing collisions and mitigating human fear, positioning…
-
LLM-aided A* search optimizes pathfinding in complex networks
Researchers have developed a novel approach to optimize pathfinding in complex network graphs by integrating Large Language Models (LLMs) with the A* search algorithm. This LLM-aided A* method generates intermediate way…
-
New method analyzes graph structures to benchmark shortest-path algorithms
Researchers have developed a new method for benchmarking shortest-path algorithms by analyzing graph structures. This approach embeds graphs into a feature space and clusters them to identify regions of similar structur…
-
New Robot Navigation System Uses Bayesian Optimization for Enhanced Planning
Researchers have developed a new map-free framework for autonomous robot navigation that combines reactive planning with nonlinear Model Predictive Control (MPC). This system uses a LiDAR-based Gaussian occupancy repres…
-
AI research tackles admissible heuristics for optimal planning
Two new research papers introduce novel methods for learning admissible heuristics in AI planning and combinatorial search. One paper proposes a framework that learns cost partitions using deep learning and graph algori…
-
New research evaluates baseline methods for external memory search in AI
Researchers have evaluated simple baseline methods for A* search algorithms that utilize external memory like SSDs. The study specifically addresses the lack of systematic investigation into straightforward Immediate Du…
-
LLM-Evolved Pattern Generators Achieve Admissible Heuristics for Planning
Researchers have developed a novel method for learning domain-dependent heuristics that ensure admissibility for optimal classical planning. This approach utilizes an LLM-driven evolutionary program-synthesis framework …
-
New Linear Program Method Enhances Process Conformance Checking Speed
Researchers have developed a new method for process conformance checking by reformulating it as a totally unimodular linear program (LP). This LP approach offers significant speedups for longer process traces with devia…
-
AI pilot combines path planning with deep reinforcement learning
A developer has created a hybrid AI system for aerial combat simulation, combining classical pathfinding algorithms with deep reinforcement learning. This approach uses a path planner for routine navigation and switches…