No article text was recorded for this version.
uniform cost assumption (weighted region pathfinding)
Version 2 of 228 papers33 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Two-Point L1 Shortest Path Queries in the Plane
- Blog: Optimal Pathfinding on Weighted Grid Maps
- Blog: Planning Routes Across Economic Terrains: Maximizing Utility, Following Heuristics
- Blog: Bringing Multi-agent Path Finding Closer to Reality
- Blog: Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot
- Blog: Generalizable Motion Planning via Operator Learning
- Blog: Efficient Multi Agent Path Finding with Turn Actions
- Blog: The Grid-Based Path Planning Competition: 2014 Entries and Results
- Blog: Path-Adaptive A* for Incremental Heuristic Search in Unknown Terrain
- Blog: Fast and exact geodesic computation using Edge-based Windows Grouping
- Blog: How Does It Feel? Self-Supervised Costmap Learning for Off-Road Vehicle Traversability
- Blog: Goal Recognition Design with Non-Observable Actions
- Blog: Subgoal Graphs for Optimal Pathfinding in Eight-Neighbor Grids
- Blog: Learning Where You Are Going and from Whence You Came: h- and g-Cost Learning in Real-Time Heuristic Search
- Blog: Path Planning using Neural A* Search
- Blog: Comparison of Different Grid Abstractions for Pathfinding on Maps
- Blog: Study of Path Planning Algorithm Based on Fuzzy Logic
- Blog: RimJump: Edge-based Shortest Path Planning for a 2D Map
- Blog: Searching with Advice: Robot Fence-Jumping
- Blog: The Grid-Based Path Planning Competition
- Blog: Any‐Angle Path Planning
- Blog: Path Planning on Grids: The Effect of Vertex Placement on Path Length
- Blog: Routing Directions: Keeping it Fast and Simple
- Blog: Retrospective-Based Deep Q-Learning Method for Autonomous Pathfinding in Three-Dimensional Curved Surface Terrain
- Blog: Collective Graph Exploration Parameterized by Vertex Cover
- Blog: Research on the Game of Crossing Desert based on Dijkstra algorithm and dynamic programming algorithm
- Blog: Online Graph Pruning for Pathfinding On Grid Maps
- Blog: Theta*: Any-Angle Path Planning on Grids
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_uniform_cost_assumption_weighted_region__b3974b32,
title = {uniform cost assumption (weighted region pathfinding)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/uniform-cost-assumption-weighted-region-pathfinding/rdr_b3974b32bfa44a0db994c85e4d70a201},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_uniform_cost_assumption_weighted_region__b3974b32_v2,
title = {uniform cost assumption (weighted region pathfinding)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/uniform-cost-assumption-weighted-region-pathfinding/rdr_b3974b32bfa44a0db994c85e4d70a201/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}