A* ALGORITHM BASICS FOR PATH FINDING A* , widely used known form of best-first search & path planning algorithm nowadays in mobile robots,games. this is the function for A*, f(n) = g(n) + h(n) g ( n ) is the cost of the path from the start node to n , and h ( n ) is a heuristic function that estimates the cost of the cheapest path from n to the goal This will find cheapest f(n) value in neighbor nodes to archive goal node. check below image A to B path finding with g(n),h(n),f(n) value In the final level check below image Now we will check the Algorithm // A* Search Algorithm 1. Initialize the open list 2. Initialize the closed list put the starting node on the open list (you can leave its f at zero) 3. ...
libga.a(garandom.o): relocation R_X86_64_32 against `.rodata' can not be used when making a shared object; recompile with -fPIC:ARGOS simulator
for this go to galib-master.zip folder dir if u dont have galib-master.zip then just download galib-master.zip file below link https://github.com/Robinroy-peter/swarmRobots then open terminal inside first of all type below commands to remove galib previous compile sudo make uninstall sudo make clean then open makevars file inside the galib-master.zip , add -fPIC with CXXFLAGS = -g -Wall -fPIC like that then copile it again with below commands make sudo make install Then go to argos-example folder try to compile it follow below video guide if u need more information