For the shortest path, all the "internal" grid nodes are not needed. There are algorithms for finding the true shortest path in a 2d area of polygons:įirst remove the underlying grid. The kink-path seems to be the shortest possible one on the grid. The kink is there, because at the corner, there is not grid points. Ragzouken wrote:you can see the top path sadly has a kink in it, but it's quite a lot better than what I was doing before. Here's what I'm currently looking at - ideally I'd want to turn that path into an approximation of the actual shortest path if there were no grid. I thought you might have useful input since you seem to know a bit about pathfinding problems!
My current thought is look at sets of three consecutive points and see if the ends have line of sight to each other, but I'm not sure this would give great results every time and I probably need a strategy to subdivide straight paths (e.g in the image below you can see it wouldn't work for the top three points because they don't have line of sight). Not sure the best way to achieve this, if there even is a good way to solve it. One way of looking at it is that I want to allow any kind of movement between nodes that isn't blocked by a wall, rather than only allowing the eight compass directions. I'm wondering if you can provide any input to a problem I'm trying to solve - I want to try and smooth the path afterwards. IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,įITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.Hey, thanks again for this it's really nice to have a simple and fast pathing thing to drop in.
Unwalkable nodes software#
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR The above copyright notice and this permission notice shall be included inĪll copies or substantial portions of the Software. To use, copy, modify, merge, publish, distribute, sublicense, and/or sellĬopies of the Software, and to permit persons to whom the Software isįurnished to do so, subject to the following conditions: In the Software without restriction, including without limitation the rights Of this software and associated documentation files (the "Software"), to deal
Unwalkable nodes free#
Permission is hereby granted, free of charge, to any person obtaining a copy You can also create a sub-class of BaseGrid to create your own way of Grid class to best support your situation. To change back to loop function jpParam. (For example: width 64, length 32 and height 24):
The usage and the demo has been made very similar to PathFinding.js for ease of usage. (Please refer to C5 on Unit圓D, if you have any dependency issue with C5.) Nuget Package Pre-compiled C5.dll for Unity is included in EpPathFinding3D.cs\PathFinder\Unit圜5 folder.
(If you have a problem when compiling, please refer to Unity Forum) Then within the script file, you want to use the EpPathFinding3D.cs, just add using EpPathFinding3D.cs namespace at the top of the file, and use it as the guide below. Unity Integration GuideĬopy EpPathFinding3D.cs\PathFinder folder into your Unity Project's Assets folder. Then I also extended 2D jump point search algorithm EpPathFinding.cs into 3D for cube based 3D environment. It comes along with a demo to show how the agorithm execute as similar to Xueqiao Xu's Online Demo. Previous project, EpPathFinding.cs, was started after I was inspired by PathFinding.js by Xueqiao Xu and the article by D. EpPathFinding3D.cs A 3D jump point search algorithm for cube based games in C# Introduction
0 kommentar(er)
