Activity

From 05/19/2013 to 06/17/2013

06/17/2013

11:14 AM Feature #2362: Implement GraphRRT* and compare with other anytime algorithms
> M. Čáp, P. Novák, J. Vokřínek, and M. Pěchouček, “Multi-agent RRT*: sampling-based cooperative pathfinding,” in Aut... Čáp Michal
11:10 AM Feature #2362 (Resolved): Implement GraphRRT* and compare with other anytime algorithms
Implement GraphRRT* as described in
M. Čáp, P. Novák, J. Vokřínek, and M. Pěchouček, “Multi-agent RRT*: sampling-...
Čáp Michal
11:06 AM Feature #2361 (Resolved): Efficient collision checking
In path-planning algorithms we frequently check intersection between a given line and a set of polygons. Currently, w... Čáp Michal
10:55 AM Feature #2360 (Closed): Eficient nearest neighbor search using KD-tree
In RRT* (and possibly other algorithms in future) we perform frequently search for a
* nearest point from a given se...
Čáp Michal
 

Also available in: Atom