path-finding_开发者

Polygon based pathfinding

I have implemented a basic grid based A* pathfindinder in Java. I would like to make a navigational mesh/polygon based pathfinder, but the problem I have is this:[详细]

2023-04-08 20:33 分类：问答

moving an object from point to point in a linear path

I\'m trying to move a sprite across the screen in a straight line, towards on the location where\'ve I touched the screen, what i did was upon the update() in each loop , it checks to see if the curre[详细]

2023-04-05 15:37 分类：问答

A* pathfinding guaranteed to find shortest path?

Is the A* path finding algorithm guaranteed to find the shortest path 100% or the time, if implemented correctly?[详细]

2023-04-04 07:37 分类：问答

Pathfinding (routing, trip planning, ...) algorithms on graphs with time restrictions

I have a database of bus/train/... stops and the arrival/departure times on each date and so on. I\'m looking for a way to do a search for the fastest(shortest/cheapest/least transitions) trip between[详细]

2023-04-01 08:00 分类：问答

The D*-Lite algorithm

I\'m trying to implement the D*-Lite pathfinding algorithm, as described in the 2002 article by Koenig and Likhachev, for Boost::Graph. I think I\'ve gotten a decent grasp on the basic ideas and theor[详细]

2023-03-27 20:44 分类：问答

Are there any usable path-finding libraries for python? [closed]

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.[详细]

2023-03-24 01:36 分类：问答

quick pathfinding algorithm for lot of objects

i have lots of moving objects(maximum of 1000 objects) that each one needs to do pathfinding to maybe maximum 100 fixed locations(one object to one location at a time). What is the quickest pathfindin[详细]

2023-03-23 18:25 分类：问答

Path finding in a highly dynamic world

I am working on a simple soccer simulation, I am using potential fields for collision avoidance more specifically following technique,[详细]

2023-03-22 05:52 分类：问答

Optimize graph for path finding and getting nodes at specific coordinates

I\'m building a graph class represented as a dict. The graph class is used to perform path finding on a large 2D grid matrix. The nodes are stored as keys and the neighbour nodes are stored as values.[详细]

2023-03-21 00:10 分类：问答

How can I reliably move a character between an array of points?

I currently have an array of points (x,y) from the result of an A* pathfinding function. This array is set up so that the first index is the point closest to the character and the next one is the next[详细]

2023-03-20 05:39 分类：问答