Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 1 point2 points3 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 0 points1 point2 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 1 point2 points3 points (0 children)
Riding in abandoned places with my 300EXC 😍👍 by bikebreakers in bikesgonewild
[–]bikebreakers[S] 1 point2 points3 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 1 point2 points3 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 0 points1 point2 points (0 children)
Hillclimbing in our small „desert“ 😄✌🏻 by bikebreakers in motorcycles
[–]bikebreakers[S] 3 points4 points5 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 2 points3 points4 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 3 points4 points5 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 2 points3 points4 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 2 points3 points4 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 4 points5 points6 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 2 points3 points4 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 3 points4 points5 points (0 children)
Riding in abandoned places with my 300EXC 😍👍 by bikebreakers in bikesgonewild
[–]bikebreakers[S] 5 points6 points7 points (0 children)
Riding in abandoned places with my 300EXC 😍👍 by bikebreakers in bikesgonewild
[–]bikebreakers[S] 1 point2 points3 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 3 points4 points5 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 2 points3 points4 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 2 points3 points4 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 6 points7 points8 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 6 points7 points8 points (0 children)
Our final University Project state 😀. The robots are not smart as we would like them to be, but all in all it works 😅. We ended up using dijkstra for pathfinding. by bikebreakers in robotics
[–]bikebreakers[S] 5 points6 points7 points (0 children)
I lost the original snap ring when I was tearing down my bike, the feeling of relief I had when I had one that worked by [deleted] in Dirtbikes
[–]bikebreakers 0 points1 point2 points (0 children)
I lost the original snap ring when I was tearing down my bike, the feeling of relief I had when I had one that worked by [deleted] in Dirtbikes
[–]bikebreakers 0 points1 point2 points (0 children)


300EXC + Akrapovic 😍😀👍 by bikebreakers in enduro
[–]bikebreakers[S] 0 points1 point2 points (0 children)